Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
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
Distributed link scheduling with constant overhead
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The capacity of wireless networks
IEEE Transactions on Information Theory
POCOSIM: a power control and scheduling scheme in multi-rate wireless mesh networks
UIC'10 Proceedings of the 7th international conference on Ubiquitous intelligence and computing
| Hi-index | 0.00 |
In wireless networks, how to select transmit power that maximizes throughput is a challenging problem. On one hand, transmissions at a high power level could increase interference to others; on the other hand, transmissions at a low power level are prone to being interfered by others. Prior works consider this problem as a search for a fixed optimal power setting that maximizes communication spatial reuse. In this paper, we pursue a novel approach that combines power selection with a random medium access mechanism. For each transmission, a node randomly selects a transmit power from all available power levels to access the medium. In this way, all combinations of network power settings could be selected with some probability. Using a recently developed Markov chain model, we derive a distributed scheme that determines the access probabilities of each power setting, according to the arrival rate of traffic and the service rate achieved by the scheme. We show that this scheme always converges to the optimal solution. Moreover, we also show that the random scheme can attain the maximal throughput region that can be obtained by any time-sharing between power settings, and which is consequently larger than the region any fixed power setting can achieve.