Novel Algorithms for the Network Lifetime Problem in Wireless Settings

Authors:
Michael Elkin;Yuval Lando;Zeev Nutov;Michael Segal;Hanan Shpungin
Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105;Department of Communication Systems Engineering, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105;Computer Science Division, The Open University of Israel, Raanana, Israel 43107;Department of Communication Systems Engineering, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105;Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel 84105
Venue:
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Year:
2008

Citing 14
Cited 1

Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities

SIAM Journal on Discrete Mathematics
Wireless information networks

Wireless information networks
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Maximum-lifetime routing algorithms for networks with omnidirectional and directional antennas

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Maximum Lifetime Broadcasting in Wireless Networks

IEEE Transactions on Computers
Approximation Algorithm for Maximum Lifetime in Wireless Sensor Networks with Data Aggregation

SNPD-SAWN '06 Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Maximizing lifetime for data aggregation in wireless sensor networks

Mobile Networks and Applications
Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks

Mobile Networks and Applications
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks

IEEE Transactions on Mobile Computing
Fast algorithm for multicast and data gathering in wireless networks

Information Processing Letters
Additive guarantees for degree bounded directed network design

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
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
An exponential improvement on the MST heuristic for minimum energy broadcasting in ad hoc wireless networks

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Energy efficient data gathering in multi-hop hierarchical wireless ad hoc networks

FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, non-replenishable battery charge. The battery charge is then reduced after each transmission, depending on the transmission distance. One of the major problems in wireless network design is to route network traffic efficiently so as to maximize the network lifetime, i.e., the number of successful transmissions. This problem is known to be NP-Hard for a variety of network operations. In this paper we are interested in two fundamental types of transmissions, broadcast and data gathering.We provide polynomial time approximation algorithms, with guaranteed performance bounds, for the maximum lifetime problem under two communication models, omnidirectional and unidirectional antennas. We also consider an extended variant of the maximum lifetime problem, which simultaneously satisfies additional constraints, such as bounded hop-diameter and degree of the routing tree, and minimizing the total energy used in a single transmission.