Maximizing capacity with power control under physical interference model in simplex mode

Authors:
Peng-Jun Wan;Chao Ma;Shaojie Tang;Boliu Xu
Affiliations:
Illinois Institute of Technology, Chicago, IL;Illinois Institute of Technology, Chicago, IL;Illinois Institute of Technology, Chicago, IL;Illinois Institute of Technology, Chicago, IL
Venue:
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Year:
2011

Citing 8
Cited 6

Complexity in geometric SINR

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
A constant approximation algorithm for link scheduling in arbitrary networks under physical interference model

Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Improved Algorithms for Latency Minimization in Wireless Networks

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Wireless Communication Is in APX

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Maximum Independent Set of Links under Physical Interference Model

WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Shortest Link Scheduling with Power Control under Physical Interference Model

MSN '10 Proceedings of the 2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks
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

Minimum latency aggregation scheduling for arbitrary tree topologies under the SINR model

ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Approximation algorithms for wireless link scheduling with flexible data rates

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Constant-approximation for optimal data aggregation with physical interference

Journal of Global Optimization
Maximum independent set of links with a monotone and sublinear power assignment

WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
Maximum independent set of links with power control

WASA'13 Proceedings of the 8th international conference on Wireless Algorithms, Systems, and Applications
Latency-minimizing data aggregation in wireless sensor networks under physical interference model

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the join selection and power assignment of a largest set of given links which can communicate successfully at the same time under the physical interference model in the simplex mode. For the special setting in which all nodes have unlimited maximum transmission power, Kesselheim [8] developed an constant approximation algorithm. For the general setting in which all nodes have bounded maximum transmission power, the existence of constant approximation algorithm remains open. In this paper, we resolve this open problem by developing a constant-approximation algorithm for the general setting in which all nodes have bounded maximum transmission power.