Upper bounds on the service carrying capacity of a multihop, wireless, SSMA-based ad hoc network are considered herein. The network has a single radio band for transmission and reception. Each node can transmit to, or receive from, multiple nodes simultaneously. We formulate the scheduling of transmissions and control of transmit powers as a joint, mixed-integer, nonlinear optimization problem that yields maximum return at minimum power subject to SINR constraints. We present an efficient tabu search-based heuristic algorithm to solve the optimization problem and rigorously assess the quality of the results. Through analysis and simulation, we establish upper bounds on the VoIP call carrying capacity of the network as function of various parameters. We discuss the pros and cons of using SSMA as a spectrum sharing technique in wireless ad hoc networks. © 2010 ICST Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering.
CITATION STYLE
Du, S., Daigle, J. N., & Alidaee, B. (2010). Upper bounding service capacity in multihop wireless SSMA-based ad hoc networks. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (Vol. 28 LNICST, pp. 94–109). https://doi.org/10.1007/978-3-642-11723-7_7
Mendeley helps you to discover research relevant for your work.