Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Maximizing throughput in wireless networks via gossiping
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Proceedings of the 12th annual international conference on Mobile computing and networking
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Broadcast capacity in multihop wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Efficient interference-aware TDMA link scheduling for static wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Multicast capacity for large scale wireless ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
The multicast capacity of large multihop wireless networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
The capacity of wireless networks
IEEE Transactions on Information Theory
Hi-index | 0.01 |
Given many known results on wireless network capacity, practical and optimal capacity utilization remains an open question. The existing link scheduling schemes in the literature are not applicable in large wireless networks because of their global operations for topology collection and transmission synchronization. As network size increases, global operations become infeasible to implement. We propose in this paper a localized link scheduling solution for achieving order optimal network capacity. Our method eliminates the global operations and improves significantly the practicality of scheduling implementation. As the cost, localized scheduling reduces the network capacity utilization. However, we prove that the reduction can be bounded by a constant factor. From the scaling order point of view, we hence provide a practical scheduling approach to optimize the network utilization.