Abstract
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(n 2) 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].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aggarwal, A., Klawe, M.: Applications of generalized matrix searching to geometric algorithms. Discrete Applied Mathematics 27, 3–23 (1990)
Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, P., Vocca, P.: On the Complexity of Computing Minimum Energy Broadcast Subgraph. In: 18th Annual Symp. on Theoretical Aspects of Computer Science (STACK 2001). LNCS, vol. 1770, pp. 651–660 (2000)
Clementi, A.E.F., Ferreira, A., Penna, P., Perennes, S., Silvestri, R.: The minimum range assignment problem on linear radio networks. Algorithmica 35, 95–110 (2003)
Zagalj, M., Hubaux, J.P., Enz, C.: Minimum-Energy broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues. MOBICOM, 172–182 (2002)
Clementi, A.E.F., Di Ianni, M., Silvestry, R.: The Minimum Broadcast Range Assignment Problem on Linear Multi-Hop wireless Networks. Theoretical Computer Science (TCS) 299, 751–761 (2003)
Gaibisso, C., Proietti, G., Tan, R.: Efficient Management of Transient Station Failures in Linear Radio Communication Networks with Bases. In: Proc. 2nd Internatonal Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE), pp. 37–54. Carleton Scientific (2001)
Kirousis, L., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science 243, 289–305 (2000)
Mathar, R., Mattfeldt, J.: Optimal transmission ranges for mobile communication in linear multihop packet radio networks. Wireless Networks 2, 329–342 (1996)
Piret, P.: On the connectivity of radio networks. IEEE Trans. on Information Theory 37, 1490–1492 (1991)
Pahlavan, K., Levesque, A.: Wireless Information Networks. John Wiley, New York (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Das, G.K., Das, S., Nandy, S.C. (2004). Efficient Algorithm for Energy Efficient Broadcasting in Linear Radio Networks. In: Bougé, L., Prasanna, V.K. (eds) High Performance Computing - HiPC 2004. HiPC 2004. Lecture Notes in Computer Science, vol 3296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30474-6_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-30474-6_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24129-4
Online ISBN: 978-3-540-30474-6
eBook Packages: Computer ScienceComputer Science (R0)