Back to Search
Start Over
Weighted Broadcast in Linear Radio Networks.
- Source :
- Algorithmic Aspects in Information & Management; 2006, p343-353, 11p
- Publication Year :
- 2006
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISBNs :
- 9783540351573
- Database :
- Supplemental Index
- Journal :
- Algorithmic Aspects in Information & Management
- Publication Type :
- Book
- Accession number :
- 32890787
- Full Text :
- https://doi.org/10.1007/11775096_32