Applications of generalized matrix searching to geometric algorithms
Discrete Applied Mathematics - Computational combinatiorics
Optimal transmission ranges for mobile communication in linear multihop packet radio networks
Wireless Networks - Special issue on performance evaluation methods for wireless networks
Power consumption in packet radio networks
Theoretical Computer Science
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
The minimum broadcast range assignment problem on linear multi-hop wireless networks
Theoretical Computer Science
Weighted broadcast in linear radio networks
Information Processing Letters
Homogeneous 2-hop broadcast in 2D
Computational Geometry: Theory and Applications
Homogeneous 2-hops broadcast in 2d
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Hi-index | 5.23 |
Given a set S of n radio-stations located on a d-dimensional space, a source node s (∈ S) and an integer h (1 ≤ h ≤ n - 1), the h-hop broadcast range assignment problem deals with assigning ranges to the members in S so that s can communicate with all other members in S in at most h-hops, and the total power consumption is minimum. The problem is known to be NP-hard for d ≥ 2. We propose an O(n2) time algorithm for the one dimensional version (d = 1) of the problem. This is an improvement over the existing result on this problem by a factor of h [A.E.F Clementi et al. The minimum broadcast range assignment problem on linear multi-hop wireless networks, Theoret. Comput. Sci. 299 (2003) 751-761].