Wireless information networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
Minimum-energy broadcasting in static ad hoc wireless networks
Wireless Networks
The minimum broadcast range assignment problem on linear multi-hop wireless networks
Theoretical Computer Science
Maximum Lifetime Broadcasting in Wireless Networks
IEEE Transactions on Computers
Range assignment for energy efficient broadcasting in linear radio networks
Theoretical Computer Science
| Hi-index | 0.00 |
Given a set S of n pre-placed radio-stations and a source station s*, we consider two variations of minimum cost homogeneous range assignment problem for the 2-hops broadcast from s* to all the members in S, where the range assigned to a radio-station is either zero or a fixed value r. Thus, the cost of range assignment is proportional to the number of radio-stations having range r. The variations we study are (i) find the value of r and identify the radio-stations with range r such that the total cost is minimum, and (ii) given a real number r, check whether homogeneous 2-hops broadcast from s* to the members in S is possible with range r, and if so, then identify the smallest subset of S whom range r is to be assigned such that 2-hops broadcast from s* is possible. The first problem is solved in O(n3) time and space. But, the second one seems to be hard. We present a 3-factor approximation algorithm for this problem, which runs in O(n2) time. An O(n2) time heuristic algorithm for the second problem is also presented. Most of the times, it produces optimum result for randomly placed radio-stations.