Abstract
The wireless networking environment presents some interesting challenges to the study of broadcasting and multicasting problems, because networks have to be different as occasion demands. Therefore, several types of broadcasting or multicasting protocols have been studied. This paper addresses the problem of broadcasting (and multicasting) focusing on the two points of energy efficient networking and of time efficient computing, where all base stations are fixed and each base station operates as an omni-directional antenna or transceiver. We developed one broadcasting algorithm based on the Stingy method and based on the two performance indices given above. We evaluate this and the other two algorithms based on the Greedy and Dijkstra methods. The purpose of this paper is to make clear the best performing domain of each algorithm. In this paper, the performances of these three algorithms are evaluated in many types of networks. The evaluation gave the result that the Stingy method provides the best performance for energy efficient networking in a type of network where basic stations are distributed wholly, not partially. In this type of network, the Stingy and Dijkstra methods have a trade-off relationship in the two performance indices.
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.
Similar content being viewed by others
References
Park, S., Bose, B.: All-to-All Broadcasting in Faulty Hypercubes. IEEE Trans. Computers 46(7), 749–755 (1997)
Yaku, M., Masuyama, H.: A Method of Fault-Tolerant All-to-All Personalized Communication in Banyan Networks. IPSJ Journal 42(10), 2476–2484 (2001)
Elisabeth, B.A., David, S.: An Optimal Fault-Tolerant Broadcasting Algorithm in Voronoi Cellular Networks. In: Proceedings of 15th IASTED International Conference Parallel and Distributed Computing and System (PDCS 2003), pp. 69–74 (2003)
Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: On the Construction of Energy Efficient Broadcast and Multicast Trees in Wireless Networks. In: Proceedings of IEEE INFOCOM 2000, pp. 585–594 (2000)
Wieselthier, J.E., Nguyen, G.D.: Algorithms for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks. Journal of Mobile Networks and Applications 6, 251–263 (2001)
Chao, C.M., Sheu, J.P., Hu, C.T.: Energy-Conserving Grid Routing Protocol in Mobile Ad Hoc Networks. In: Proceedings of the 2003 International Conference on Parallel Processing (ICPP 2003), pp. 265–272 (2003)
Chatzigiannakis, I., Nikoletseas, S., Sirakis, P.: An Efficient Routing Protocol for Hierarchical Ad-hoc Mobile Networks. In: Proceedings of 15th International Parallel and Distributed Processing Symposium (IPDPS 2001), April 2001, p. 185 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Masuyama, H., Murakami, K., Sasama, T. (2005). Algorithms for Energy-Efficient Broad- and Multi-casting in Wireless Networks. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31956-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-31956-6_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25339-6
Online ISBN: 978-3-540-31956-6
eBook Packages: Computer ScienceComputer Science (R0)