Upper bounding service capacity in multi-hop wireless SSMA-based ad hoc networks

• Published in: Ad hoc networks Vol. 9; no. 2; pp. 120 - 130
• Main Authors: Du, Shirong, Daigle, John N., Alidaee, Bahram
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.03.2011
• Subjects: Carrying capacity; Computer simulation; IP (Internet Protocol); Joint optimization problem; Networks; Optimality; Optimization; Scheduling; Tabu search algorithm; TDMA/SSMA; Transmission scheduling and power control; Upper bounds; VoIP call carrying capacity; Wireless ad hoc networks; Wireless communication; TDMA/SSMA; Wireless ad hoc networks; Optimality; Joint optimization problem; VoIP call carrying capacity; Transmission scheduling and power control; Tabu search algorithm
• ISSN: 1570-8705; 1570-8713
• DOI: 10.1016/j.adhoc.2010.07.006

Upper bounds on the service carrying capacity of a multi-hop, 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.