Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Algorithms for energy-efficient multicasting in static ad hoc wireless networks
Mobile Networks and Applications
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Data Structures, Algorithms and Applications in Java
Data Structures, Algorithms and Applications in Java
Power-aware source routing protocol for mobile ad hoc networks
Proceedings of the 2002 international symposium on Low power electronics and design
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
New Results for Energy-Efficient Broadcasting in Wireless Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Approximation Algorithms for Connected Dominating Sets
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Resource-Limited Energy-Efficient Wireless Multicast of Session Traffic
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks
IEEE Communications Magazine
Weighted broadcast in linear radio networks
Information Processing Letters
Fast algorithm for multicast and data gathering in wireless networks
Information Processing Letters
Power efficient resilience and lifetime in wireless ad-hoc networks
Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
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
Power Assignment for Symmetric Communication in Wireless Sensor Networks
International Journal of Distributed Sensor Networks
Homogeneous 2-hop broadcast in 2D
Computational Geometry: Theory and Applications
An efficient power-aware broadcast technique for wireless ad hoc networks
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Topological Key Hierarchy for Energy-Efficient Group Key Management in Wireless Sensor Networks
Wireless Personal Communications: An International Journal
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Adjustable convergecast tree protocol for wireless sensor networks
Computer Communications
Maximum lifetime broadcasting in cooperative multi-hop wireless ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
Novel algorithms for the network lifetime problem in wireless settings
Wireless Networks
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
ACM Transactions on Algorithms (TALG)
Weighted broadcast in linear radio networks
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Homogeneous 2-hops broadcast in 2d
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part II
Improved approximation algorithms for maximum lifetime problems in wireless networks
Theoretical Computer Science
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 14.99 |
We consider the problem of broadcasting messages in a wireless energy-limited network so as to maximize network lifetime. An O(e \log e) algorithm to construct a broadcast tree that maximizes the critical energy of the network following the broadcast is developed. Additionally, we propose two new greedy heuristics to construct minimum energy broadcast trees. We show how our maximum critical energy algorithm may be coupled with our proposed greedy heuristics as well as with the greedy heuristics proposed in [27], [28] for the construction of minimum energy broadcast trees. Extensive simulations performed by us show that this coupling improves network lifetime significantly (between 48.3 percent and 328.9 percent) when compared with network lifetime using the base greedy heuristics in isolation.