Abstract
We extend the work of energy-efficient wireless communication initiated by Wieselthier et al. in a new direction. Instead of minimizing the total energy consumption, our goal is to minimize the maximum energy consumption among all nodes, thereby achieving the longest network lifetime. We formulate a new model for energy-efficient communication in wireless networks, called the MinMax energy model, that distributes the energy consumption among nodes evenly by constructing appropriate multicast/broadcast trees which may not consume minimum total energy. We propose a few fundamental computational problems related to our model and study their complexities.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: On the construction of energy-efficient broadcast and multicast trees in wireless networks. In: INFOCOM. IEEE Computer Press, Los Alamitos (2000)
Cagali, M., Hubaux, J.P., Enz, C.: Minimum-energy broadcast in all-wireless networks: Np-completeness and distribution issues. In: MOBICOM, pp. 172–182 (2002)
Liang, W.: Constructing minimum-energy broadcast trees in wireless ad hoc networks. In: MOBICOM, pp. 112–122 (2002)
Li, F., Nikolaidis, I.: On minimum-energy broadcasting in all-wireless networks. In: LCN, pp. 193–202 (2001)
Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Algorithms for energy-efficient multicasting in static ad hoc wireless networks. Mobile Networks and Applications 6 (2001)
Stojmenovic, I., Seddigh, M., Zunic, J.: Internal nodes based broadcasting in wireless networks. In: HICSS (2001)
Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating sets and neighbor elimination-based broadcasting algorithm in wireless networks. IEEE Trans. on Parallel and Distributed Systems 13, 14–25 (2002)
Cartigny, J., Simplot, D., Stojmenovic, I.: Localized minimum-energy broadcasting in ad-hoc networks. In: INFOCOM, vol. 3, pp. 2210–2217 (2003)
Thai, M.T., Li, Y., Du, D.Z., Ai, C.: On the construction of energy-efficient broadcast tree with hitch-hiking in wireless networks. In: IEEE International Performance, Computing, and Communications Conference, pp. 135–139 (2005)
Guo, S., Yang, O.: Localized operations for distributed minimum energy multicast algorithm in mobile ad hoc networks. IEEE Trans. on Parallel and Distributed Systems 18(2), 186–198 (2007)
Bein, D., Zheng, S.Q.: An effective algorithm for computing energy-efficient broadcasting trees in all-wireless networks. In: WWASN (2008)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Proc. of a Symp. on the Complexity of Computer Computations. The IBM Research Symposiam Series, pp. 85–103. Plenum Press, New York (1972)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 2nd edn. MIT Press, Cambridge (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bein, D., Zheng, S.Q. (2011). A New Model for Energy-Efficient All-Wireless Networks. In: Brazier, F.M.T., Nieuwenhuis, K., Pavlin, G., Warnier, M., Badica, C. (eds) Intelligent Distributed Computing V. Studies in Computational Intelligence, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24013-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-24013-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24012-6
Online ISBN: 978-3-642-24013-3
eBook Packages: EngineeringEngineering (R0)