Sciweavers

Share
GLOBECOM
2008
IEEE

Topology-Transparent Distributed Scheduling in Multi-Hop Wireless Networks

8 years 10 months ago
Topology-Transparent Distributed Scheduling in Multi-Hop Wireless Networks
— Transmission scheduling is a key design problem in wireless multi-hop networks and many scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time-division multipleaccess (TDMA) frame length. Most of scheduling algorithms are graph-based, dependent on the exact network topology information and cannot adapt to the dynamic wireless environment. Some topology-independent TDMA scheduling algorithms have been proposed, and do not need accurate topology information. Our proposed algorithm follows a similar approach but with a different design strategy. Instead of minimizing the TDMA frame length, we maximize the minimum expected throughput, and we consider multicasting and broadcasting. The simulation result shows that the performance of our algorithm is better than the conventional TDMA and other existing algorithms in most cases. Keywords — Distributed scheduling, multi-hop wireless networks, TDMA, topology-transparent
Qiong Sun, Victor O. K. Li, Ka-Cheong Leung
Added 29 May 2010
Updated 29 May 2010
Type Conference
Year 2008
Where GLOBECOM
Authors Qiong Sun, Victor O. K. Li, Ka-Cheong Leung
Comments (0)
books