Integer and combinatorial optimization
Integer and combinatorial optimization
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Introduction to algorithms
Online computation and competitive analysis
Online computation and competitive analysis
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Approximation algorithms for directed Steiner problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete 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
Power Consumption in Packet Radio Networks (Extended Abstract)
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
IEEE Transactions on Mobile Computing
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
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Multicast time maximization in energy constrained wireless networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Maximizing the Lifetime of Dominating Sets
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Maximum-lifetime routing: system optimization & game-theoretic perspectives
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Fast algorithm for multicast and data gathering in wireless networks
Information Processing Letters
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Lifetime evaluation of ad hoc networks
CSN '07 Proceedings of the Sixth IASTED International Conference on Communication Systems and Networks
A comprehensive efficient flooding algorithm using directional antennas for mobile ad hoc networks
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
A Shoelace-Based QoS Routing Protocol for Mobile Ad Hoc Networks Using Directional Antenna
Wireless Personal Communications: An International Journal
Power-dependable transactions in mobile networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Fully localised energy-efficient multicast in large-scale wireless ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
Novel algorithms for the network lifetime problem in wireless settings
Wireless Networks
Improved approximation algorithms for maximum lifetime problems in wireless networks
Theoretical Computer Science
Improved approximation bounds for maximum lifetime problems in wireless ad-hoc network
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Hi-index | 0.00 |
A major problem in wireless networks is how to route either broadcast, unicast or multicast traffic so as to maximize the lifetime, i.e., the time until the battery of a transmitting node drains out. Focusing on the fundamental single-session problem, our solution approach is based on the employment of multi-topology routing schemes. Such a scheme consists of a set of routing topologies, which are employed sequentially, for some prescribed duration times.First, we consider the standard wireless environment of multiple recipients, which correspond to omnidirectional antennas. For the cases of either single-topology schemes or unicast sessions, we establish optimal solutions of polynomial complexity. For the general (multi-topology) cases of broadcast and multicast, which are NP-hard, we derive a novel heuristic scheme, and demonstrate its efficiency by way of simulations.We then consider an alternative, single-recipient wireless environment, which corresponds to the important case of directional antennas. While the employment of directional antennas is known to posses significant advantages over the traditional omnidirectional transmission, the problem of lifetime maximization under this environment has received only limited attention.We demonstrate that the change from the traditional (multiple-recipients) environment to the single-recipient environment is of major significance in terms of computational complexity and produces an interesting twist of difficulty: namely, for the standard model, the single-topology broadcast problem is computationally solvable and the multi-topology problem is NP-hard, while the opposite holds for the single-recipient model. Finally, we discuss the extension of our results to the case of multiple sessions.