Applications of generalized matrix searching to geometric algorithms
Discrete Applied Mathematics - Computational combinatiorics
Wireless information networks
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
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
The minimum broadcast range assignment problem on linear multi-hop wireless networks
Theoretical Computer Science
Weighted broadcast in linear radio networks
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Hi-index | 0.00 |
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 ≤ |S| – 1), the h-hop broadcast range assignment problem deals with finding the range assignments for 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 results on this problem by a factor of h [5].