Minimum-energy broadcasting in wireless networks in the d-dimensional Euclidean space: (the α ≤d case)

Authors:
Andrzej Lingas;Mia Persson;Martin Wahlen
Affiliations:
Department of Computer Science, Lund University, Lund, Sweden;Department of Computer Science, Lund University, Lund, Sweden;Department of Computer Science, Lund University, Lund, Sweden
Venue:
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Year:
2006

Citing 12
Cited 0

Almost optimal set covers in finite VC-dimension: (preliminary version)

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Packet-radio routing

Routing in communications networks
Power consumption in packet radio networks

Theoretical Computer Science
Constructing minimum-energy broadcast trees in wireless ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
New Results for Energy-Efficient Broadcasting in Wireless Networks

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Improved approximation results for the minimum energy broadcasting problem

Proceedings of the 2004 joint workshop on Foundations of mobile computing
Tighter Bounds for the Minimum Energy Broadcasting Problem

WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Improved approximation algorithms for geometric set cover

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
On the geometrical characteristics of three-dimensional wireless ad hoc networks and their applications

EURASIP Journal on Wireless Communications and Networking
An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of minimizing the total energy assigned to nodes of wireless network so that broadcasting from the source node to all other nodes is possible. This problem has been extensively studied especially under the assumption that the nodes correspond to points in the Euclidean two- or three-dimensional space and the broadcast range of a node is proportional to at most the α root of the energy assigned to the node where α is not less than the dimension d of the space. In this paper, we study the case α≤d, providing several tight upper and lower bounds on approximation factors of known heuristics for minimum energy broadcasting in the d-dimensional Euclidean space.