Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Maximum weighted independent set of links under physical interference model
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Maximizing capacity with power control under physical interference model in simplex mode
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Secondary spectrum auctions for symmetric and submodular bidders
Proceedings of the 13th ACM Conference on Electronic Commerce
DISC'12 Proceedings of the 26th international conference on Distributed Computing
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
| Hi-index | 0.01 |
This paper addresses the following optimization problem in a plane multihop wireless networks under the physical interference model: From a given a set of communication links whose senders transmit at a fixed uniform power level, select a maximum set of independent links. This problem is known to be NP-hard. The existing approximation algorithms which were claimed to have constant approximation bounds are either valid only in the absence of background noise or simply incorrect in the presence of background noise. In this paper, we develop a new approximation algorithm with constant approximation bound regardless of the value of the background noise. In addition, our approximation bound valid in general is significantly smaller than all the known bounds which are only valid under certain special assumptions.