Interference-free energy efficient scheduling in wireless ad hoc networks

Authors:
Liron Levin;Michael Segal;Hanan Shpungin
Affiliations:
Department of Communication Systems Engineering, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel;Department of Communication Systems Engineering, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel;Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada N2L 3G1
Venue:
Ad Hoc Networks
Year:
2013

Citing 24
Cited 0

Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities

SIAM Journal on Discrete Mathematics
Wireless information networks

Wireless information networks
Power consumption in packet radio networks

Theoretical Computer Science
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to algorithms

Introduction to algorithms
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues

Proceedings of the 8th annual international conference on Mobile computing and networking
Energy-efficient broadcast and multicast trees in wireless networks

Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks

Mobile Networks and Applications
Energy Optimal Routing in Radio Networks Using Geometric Data Structures

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
"Balls into Bins" - A Simple and Tight Analysis

RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Minimizing broadcast latency and redundancy in ad hoc networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Does topology control reduce interference?

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks

ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Asymptotic critical total power for k-connectivity of wireless networks

IEEE/ACM Transactions on Networking (TON)
Minimizing broadcast latency and redundancy in ad hoc networks

IEEE/ACM Transactions on Networking (TON)
Hop Constrained Energy-Efficient Broadcasting: Insights from Massively Dense Ad Hoc Networks

IEEE Transactions on Mobile Computing
The investigation of delay-constrained multicasting with minimum-energy consumption in static ad hoc wireless networks

International Journal of Ad Hoc and Ubiquitous Computing
Sleeping schedule-aware minimum latency broadcast in wireless ad hoc networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Interference and power constrained broadcast and multicast routing in wireless ad hoc networks using directional antennas

Computer Communications
Near-optimal multicriteria spanner constructions in wireless ad hoc networks

IEEE/ACM Transactions on Networking (TON)
Continuous Data Collection Capacity of Wireless Sensor Networks under Physical Interference Model

MASS '11 Proceedings of the 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems
Low-Latency broadcast scheduling in ad hoc networks

WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
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

This paper studies the problem of interference-free broadcast in wireless ad hoc networks. In particular, we are interested in asymmetric power assignments so that the induced broadcast communication graph is both, energy efficient and has a short collision-free broadcast schedule. We consider both random and deterministic node layouts and develop four different broadcast schemes with provable performance guarantees on three optimization objectives simultaneously: total energy consumption, network lifetime and collision-free schedule length. We also show extensive numerical results which support our findings.