A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Approximation algorithms
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Tabu Search
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Wireless Information Networks (Wiley Series in Telecommunications and Signal Processing)
Wireless Information Networks (Wiley Series in Telecommunications and Signal Processing)
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
| Hi-index | 0.00 |
This paper concerns about energy-efficient broadcasts in mobile ad hoc networks, yet in a model where each station moves on the plane with uniform rectilinear motion. Such restriction is imposed to discern which issues arise from the introduction of movement in the wireless ad hoc networks.Given a transmission range assignment for a set of n stations S, we provide an polynomial O(n 2)-time algorithm to decide whether a broadcast operation from a source station could be performed or not. Additionally, we study the problem of computing a transmission range assignment for S that minimizes the energy required in a broadcast operation. An O(n 3log驴n)-time algorithm for this problem is presented, under the assumption that all stations have equally sized transmission ranges. However, we prove that the general version of such problem is NP-hard and not approximable within a (1驴o(1))ln驴n factor (unless NP驴DTIME(n O(log驴log驴n))). We then propose a polynomial time approximation algorithm for a restricted version of that problem.