Scheduling partition for order optimal capacity in large-scale wireless networks

The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wireless networks. Existing results have been obtained based on the implicit assumption of negligible overhead in acquiring the network topology and synchronizing the link transmissions. In large networks, however, global topology collection and global link synchronization are infeasible with both the centralized and the distributed link scheduling schemes. This gap between the well-known capacity results and the impractical assumption on link scheduling potentially undermines our understanding of the achievable network capacity. Therefore, the following question remains open: can localized scheduling algorithms achieve the same order of capacity as their global counterpart? In this paper, we propose the scheduling partition methodology by decomposing a large network into many small autonomous scheduling zones, ...

• Type: Conference
• Year: 2009
• Where: MOBICOM
• Authors: Yi Xu, Wenye Wang
• Keywords: Communications, Link Scheduling, Localized Scheduling Algorithm, MOBICOM 2009, Scheduling Algorithm