Weighted broadcast in linear radio networks

Authors:
Gautam K. Das;Subhas C. Nandy
Affiliations:
Indian Statistical Institute, Kolkata, India;Indian Statistical Institute, Kolkata, India
Venue:
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Year:
2006

Citing 10
Cited 0

Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Combinatorica
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
Introduction to Algorithms

Introduction to Algorithms
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
Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Maximum Lifetime Broadcasting in Wireless Networks

IEEE Transactions on Computers
Efficient algorithm for energy efficient broadcasting in linear radio networks

HiPC'04 Proceedings of the 11th international conference on High Performance Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The non-homogeneous version of the range assignment problem in Ad-Hoc wireless network is studied in the context of information broadcast and accumulation. Efficient algorithms are presented for the unbounded and bounded-hop broadcast problems for a set of radio-stations when they are placed on a straight line. This improves time complexity of the existing results for the same two problems by a factor of n, where n is the number of radio-stations [2]. An easy to implement algorithm for the unbounded version of accumulation problem is also presented for the non-homogeneous version of the range assignment problem. Its worst case running time complexity is O(n2). The same algorithm works when the radio-stations are placed in Rd.