Title :
Adaptive Topology-Transparent Distributed Scheduling in Wireless Networks
Author :
Sun, Qiong ; Li, Victor O K ; Leung, Ka-Cheong
Author_Institution :
Dept. of Electr. & Electron. Eng., Univ. of Hong Kong, Hong Kong, China
Abstract :
Transmission scheduling is a key design problem in wireless multi-hop networks. Many transmission scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time division multiple access (TDMA) frame length. Most of the scheduling algorithms are topology-dependent. They are generally graph-based and depend on the exact network topology information. Thus, they cannot adapt well to the dynamic wireless environment. In contrast, topology-transparent TDMA scheduling algorithms do not need detailed topology information. However, these algorithms offer very low minimum throughput. The objective of this work is to propose an adaptive topology-transparent scheduling algorithm to offer better throughput performance. With our algorithm, each node finds a transmission schedule so as to reduce the transmission conflicts and adapt better to the changing network environment. The simulation results show that the performance of our algorithm is better than the existing topology-transparent algorithms.
Keywords :
graph theory; radio networks; scheduling; telecommunication network topology; time division multiple access; adaptive topology-transparent distributed scheduling; graph method; spatial reuse; time division multiple access frame length; topology-transparent TDMA scheduling algorithms; transmission scheduling algorithms; wireless multihop networks; Adaptive scheduling; Communications Society; Multicast algorithms; Network topology; Peer to peer computing; Scheduling algorithm; Spread spectrum communication; Throughput; Time division multiple access; Wireless networks;
Conference_Titel :
Communications (ICC), 2010 IEEE International Conference on
Conference_Location :
Cape Town
Print_ISBN :
978-1-4244-6402-9
DOI :
10.1109/ICC.2010.5502450