Multiple communication im multihop radio networks
SIAM Journal on Computing
Journal of Computer and System Sciences
Wireless information networks
Routing in communications networks
Optimal transmission ranges for mobile communication in linear multihop packet radio networks
Wireless Networks - Special issue on performance evaluation methods for wireless networks
Dynamic channel allocation for linear macrocellular topology
Proceedings of the 1999 ACM symposium on Applied computing
Power consumption in packet radio networks
Theoretical Computer Science
Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
The Impact of Knowledge on Broadcasting Time in Radio Networks
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
New Results for Energy-Efficient Broadcasting in Wireless Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees
PE-WASUN '04 Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Energy efficient communication in ad hoc networks from user's and designer's perspective
ACM SIGMOBILE Mobile Computing and Communications Review
Assign ranges in general ad-hoc networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Fast distributed algorithm for convergecast in ad hoc geometric radio networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Range assignment for energy efficient broadcasting in linear radio networks
Theoretical Computer Science
Bounded-hops power assignment in ad hoc wireless networks
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Sharing the cost of multicast transmissions in wireless networks
Theoretical Computer Science
Weighted broadcast in linear radio networks
Information Processing Letters
3-Dimensional minimum energy broadcasting problem
Ad Hoc Networks
Homogeneous 2-hop broadcast in 2D
Computational Geometry: Theory and Applications
Bounded-hops power assignment in ad hoc wireless networks
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
The minimum-energy broadcast problem in symmetric wireless ad hoc networks
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
3-D minimum energy broadcasting
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Weighted broadcast in linear radio networks
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Improved algorithm for minimum cost range assignment problem for linear radio networks
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Homogeneous 2-hops broadcast in 2d
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Assign ranges in general ad-hoc networks
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Efficient algorithm for energy efficient broadcasting in linear radio networks
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
| Hi-index | 5.23 |
Given a set N of radio stations located on an Euclidean space, a source station s and an integer h (1 ≤ h ≤ |N| - 1), the minimum bounded-hop broadcast range assignment problem consists in finding a range assignment for N of minimum total power consumption that allows broadcast operations from s to every station in N in at most h hops. The problem is known to be NP-hard on d-dimensional spaces for any d ≥ 2 (18th Annual Symp. on Theoretical Aspects of Computer Science (STACS'01), Lecture Notes in Computer Science, Vol. 1770, 2000, pp. 651-660.) and some efficient approximation algorithms have been given in Clementi et al. and Wann et al. (18th Annual Symp. on Theoretical Aspects of Computer Science (STACS'01), Lecture Notes in Computer Science, Vol. 1770, 2000, pp. 651-660, IEEE INFOCOM'01, 2001). In this paper, we address the case in which the stations are arbitrarily located along a line (i.e., the linear case). We provide the first polynomial-time algorithm that returns an optimal solution for any instance of the linear case. The algorithm works in O(h|N|2) time.