Battery capacity measurement and analysis using lithium coin cell battery
ISLPED '01 Proceedings of the 2001 international symposium on Low power electronics and design
Algorithmic aspects of topology control problems for 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
Multicast time maximization in energy constrained wireless networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Effect of overhearing transmissions on energy efficiency in dense sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Does topology control reduce interference?
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Maximizing network lifetime of broadcasting over wireless stationary ad hoc networks
Mobile Networks and Applications
A model for battery lifetime analysis for organizing applications on a pocket computer
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Energy efficient battery management
IEEE Journal on Selected Areas in Communications
Lifetime maximization for multicasting in energy-constrained wireless networks
IEEE Journal on Selected Areas in Communications
Self-managing energy-efficient multicast support in MANETs under end-to-end reliability constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Absence of line power supplies imposes severe constraints on nodes in wireless ad hoc and sensor networks. In this paper, we concentrate on finding a broadcast tree that maximizes the network's lifetime. Previous studies showed that this problem is polynomially solvable when assuming receivers consume no energy or only designated receivers consume energy for receiving packets. Due to the broadcast nature of the wireless medium, however, unintended active nodes in the receiving range of a transmitting node may overhear the message and hence contribute to energy wastage. Under the overhearing cost (OC) model, the problem becomes NP-hard and the approximation ratio of the existing solutions, which are optimal under the non-overhearing cost (NOC) model, can be as bad as Ω(n). We investigate the problem by developing heuristic solutions. Simulation results show that our algorithms outperform the existing ones by up to 100%.