Title :
A reuse-greedy algorithm for STDMA multihop networks with advanced antennas & rate control
Author :
Sanchez G, Marvin ; Zander, Jens ; Hagerman, Bo
Author_Institution :
Dept of Commun. Syst., R. Inst of Technol., Kista
Abstract :
The introduction of multiple discrete transmission rates has been proposed as a promising way to increase the performance of multihop wireless networks. In this paper we will propose a novel, low complexity algorithm for rate selection and scheduling in a Spatial Time Division Multiple Access (STDMA). The throughput performance is evaluated in a network where nodes are equipped with advanced antennas. The results are compared with the (near) optimum performance found by solving a corresponding nonlinear optimization problem. Results show that our proposed algorithm exhibits a throughput performance that significantly exceeds the performance of fixed rate schemes. Further, our evaluation shows that the proposed algorithm achieves a performance that is close (within about 10%) to the performance obtained by the optimization method.
Keywords :
antennas; computational complexity; greedy algorithms; nonlinear programming; radio networks; scheduling; telecommunication congestion control; time division multiple access; STDMA multihop wireless network; advanced antenna; complexity algorithm; multiple discrete transmission rate control; network throughput performance evaluation; nonlinear optimization problem; reuse-greedy algorithm; scheduling algorithm; spatial time division multiple access; Communication system control; Control systems; Interference; Optimal scheduling; Optimization methods; Scheduling algorithm; Signal to noise ratio; Spread spectrum communication; Throughput; Wireless networks;
Conference_Titel :
Wireless Pervasive Computing, 2008. ISWPC 2008. 3rd International Symposium on
Conference_Location :
Santorini
Print_ISBN :
978-1-4244-1652-3
Electronic_ISBN :
978-1-4244-1653-0
DOI :
10.1109/ISWPC.2008.4556274