Weighted broadcast in linear radio networks

Authors:
Gautam K. Das;Subhas C. Nandy
Affiliations:
Indian Statistical Institute, Kolkata 700 108, India;Indian Statistical Institute, Kolkata 700 108, India
Venue:
Information Processing Letters
Year:
2008

Citing 6
Cited 0

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
Maximum Lifetime Broadcasting in Wireless Networks

IEEE Transactions on Computers
Range assignment for energy efficient broadcasting in linear radio networks

Theoretical Computer Science
An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.89

Visualization

Abstract

The weighted version of the broadcast range assignment problem in ad hoc wireless network is studied. Efficient algorithms are presented for the unbounded and bounded-hop broadcast problems for the linear radio network, where radio stations are placed on a straight line. For the unbounded case of the problem, the proposed algorithm runs in O(n^2) time and using O(n) space, where n is the number of radio stations in the network. For the h-hop broadcast problem, the time and space complexities of our algorithm are O(hn^2logn) and O(hn), respectively. This improves time complexity of the existing results for the same two problems by a factor of n and n^2logn, respectively [C. Ambuhl, A.E.F. Clementi, M.D. Ianni, G. Rossi, A. Monti, R. Silvestri, The range assignment problem in non-homogeneous static ad hoc networks, in: Proc. 18th Int. Parallel and Distributed Precessing Symposium, 2004].