On the complexity of bandwidth allocation in radio networks
Theoretical Computer Science
Request Satisfaction Problem in Synchronous Radio Networks
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
On complexity of wireless gathering problems on unit-disk graphs
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
An approximation algorithm for the wireless gathering problem
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Gathering algorithms on paths under interference constraints
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Optimally fast data gathering in sensor networks
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
In this paper, we address the problem of gathering information in a central node of a radio network, where interference constraints are present.We take into account the fact that, when a node transmits, it produces interference in an area bigger than the area in which its message can actually be received. The network is modeled by a graph; a node is able to transmit one unit of information to the set of vertices at distance at most dT in the graph, but when doing so it generates interference that does not allow nodes at distance up to dI (dI = dT ) to listen to other transmissions. Time is synchronous and divided into time-steps in each of which a round (set of non-interfering radio transmissions) is performed. We give a general lower bound on the number of rounds required to gather on any graph, and present an algorithm working on any graph, with an approximation factor of 4. We also show that the problemof finding an optimal strategy for gathering (one that uses a minimum number of time-steps) does not admit a Fully Polynomial Time Approximation Scheme if dI \ge dT , unless P=NP, and in the case dI = dT the problem is NP-hard.