Book ChapterDOI
Efficient algorithm for energy efficient broadcasting in linear radio networks
Gautam K. Das,Sandip Das,Subhas C. Nandy +2 more
- pp 420-429
Reads0
Chats0
TLDR
In this paper, an O(n2) time algorithm was proposed for the one-dimensional broadcast range assignment problem, which is an improvement over the existing results on this problem by a factor of h [5].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(n2) 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]read more
Citations
More filters
Journal ArticleDOI
Homogeneous 2-hop broadcast in 2D
TL;DR: Two variations of the minimum cost homogeneous range assignment problem for 2-hop broadcast from a given source are considered and a 2-factor approximation algorithm is proposed that runs in O(n^2) time and O( n) space.
Book ChapterDOI
Recognition of minimum width color-spanning corridor and minimum area color-spanning rectangle
TL;DR: Given a set of n colored points with a total of m colors in 2D, the problem of identifying the smallest color-spanning object is studied and two different shapes are considered: corridor, and rectangle of arbitrary orientation.
Journal Article
Homogeneous 2-Hops Broadcast in 2D
TL;DR: A 3-factor approximation algorithm is presented for the minimum cost homogeneous range assignment problem for the 2-hops broadcast from s* to all the members in S and it produces optimum result for randomly placed radio-stations.
Book ChapterDOI
Weighted broadcast in linear radio networks
Gautam K. Das,Subhas C. Nandy +1 more
TL;DR: An easy to implement algorithm for the unbounded version of accumulation problem is presented for the non-homogeneous version of the range assignment problem and it works when the radio-stations are placed on a straight line.
Book ChapterDOI
Homogeneous 2-hops broadcast in 2d
TL;DR: In this paper, two variations of minimum cost homogeneous range assignment problem for the 2-hops broadcast from s* to all the members in S, where the range assigned to a radio-station is either zero or a fixed value r, were studied.
References
More filters
Book
Wireless Information Networks
Kaveh Pahlavan,Allen H. Levesque +1 more
TL;DR: In this paper, the authors present an overview of the evolution of radio propagation in wireless networks, and present a survey of the current state-of-the-art in this area.
Proceedings ArticleDOI
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
TL;DR: A new heuristic is described, Embedded Wireless Multicast Advantage, that compares well with other proposals and is explained how it can be distributed, and a formal proof that the problem of power-optimal broadcast is NP-complete is provided.
Journal ArticleDOI
Power consumption in packet radio networks
TL;DR: For points in three dimensions it is shown that the problem of deciding whether a complete range assignment of a given cost exists, is NP-hard and an O(n 2 ) time approximation algorithm is given which provides a completerange assignment with cost within a factor of two of the minimum.
Journal ArticleDOI
On the connectivity of radio networks
TL;DR: It is conjectured that the critical ranges of the two-dimensional problems are also different, and the author presents results to substantiate this conjecture.
Journal ArticleDOI
The minimum range assignment problem on linear radio networks
TL;DR: This paper presents the first polynomial-time, approximation algorithm for the MIN ASSIGNMENT problem, which guarantees a 2-approximation ratio and runs in O(hn 3 ) time and proves that, for fixed h and for ``well spaced'' instances, the problem admits a polynometric-time approximation scheme.