Wireless network stability in the SINR model

Authors:
Eyjólfur Ingi Ásgeirsson;Magnús M. Halldórsson;Pradipta Mitra
Affiliations:
ICE-TCS, Reykjavik University, Reykjavik, Iceland;ICE-TCS, Reykjavik University, Reykjavik, Iceland;ICE-TCS, Reykjavik University, Reykjavik, Iceland
Venue:
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Year:
2012

Citing 11
Cited 0

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
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
A measurement study of interference modeling and scheduling in low-power wireless networks

Proceedings of the 6th ACM conference on Embedded network sensor systems
Concentration of Measure for the Analysis of Randomized Algorithms

Concentration of Measure for the Analysis of Randomized Algorithms
Wireless Communication Is in APX

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Longest-queue-first scheduling under SINR interference model

Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Distributed contention resolution in wireless networks

DISC'10 Proceedings of the 24th international conference on Distributed computing
Nearly optimal bounds for distributed wireless scheduling in the SINR model

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Wireless capacity with oblivious power in general metrics

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A constant-factor approximation for wireless capacity maximization with power control in the SINR model

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the stability of wireless networks under stochastic arrival processes of packets, and design efficient, distributed algorithms that achieve stability in the SINR (Signal to Interference and Noise Ratio) interference model. Specifically, we make the following contributions. We give a distributed algorithm that achieves $\Omega(\frac{1}{\log^2 n})$-efficiency on all networks (where n is the number of links in the network), for all length monotone, sub-linear power assignments. For the power control version of the problem, we give a distributed algorithm with $\Omega(\frac{1}{\log n(\log n + \log \log \Delta)})$-efficiency (where Δ is the length diversity of the link set).