Upper bounding service capacity in multi-hop wireless SSMA-based ad hoc networks |
| |
| Authors: | Shirong Du John N Daigle Bahram Alidaee |
| |
| Affiliation: | 1. Center for Wireless Communications, Electrical Engineering Department, University of Mississippi, MS 38677, United States;2. Marketing Department, School of Business Administration, University of Mississippi, MS 38677, United States;1. Department of Information Technology, Uppsala University, Box 337, SE-75105 Uppsala, Sweden;2. Department of Computer Science, University of Basel, Bernoullistrasse 16, CH – 4056 Basel, Switzerland;1. Dept. of Electrical Engineering, Arizona State University, Goldwater Center, MC 5706, Tempe AZ 85287-5706, United States;2. Dept. of Computer Science and Engineering, Arizona State University, Box 878809, Tempe, AZ 85287-8809, United States;1. Graduate School of Information Science and Technology, Osaka University, 1-3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan;2. College of Information Science and Engineering, Ritsumeikan University, Nojihigashi, Kusatsu, Shiga 525-8577, Japan |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
