Abstract
In a broadcasting task, a source sends a message to all the nodes of a network. There exist methods for flooding a network intelligently and for scheduling node activities. Dominating sets and neighbor elimination based broadcasting is currently the most efficient broadcasting scheme in terms of the number of retransmitted messages to complete a broadcast. It provides basis for defining other broadcasting protocols by changing the definition of the delay (timeout) function used to decide how long a dominating node should wait before making a retransmission. In this article, we propose thirteen such variants. They are all reliable, meaning that all the nodes connected to a source will receive the message, assuming an ideal MAC layer. Eight of them are hexagonal based; four are distance-based, giving priority to the neighbors that are further or nearer from the retransmitting node; and one is using a random timeout. Beyond these variants, we propose three different ways to update the timeout values during a broadcasting process. Our experimental data shows that the updating process of the timeout values has no significant impact compared to the selected timeout function. From the thirteen variants we deliberately proposed some worst-case timeout functions to see its impact in the broadcasting process. We confirm by our experimental data that indeed the selected timeout function has an impact in the broadcasting process. Although our experimental data shows that the new further distance-based scheme outperforms almost all schemes in terms of number of messages to complete a broadcast, it also shows that a random function (the way IEEE 802.11 works) is a very good choice.
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
Durresi, A., Paruchuri, V.: Geometric Broadcast Protocol for Sensor and Actor Networks. In: AINA 2005. IEEE 19th International Conference on Advanced Information Networking and Applications, 25-30 March 2005, vol. 1, pp. 343–348 (2005)
Gosnell, M.R., Albarelli, R., Cheng, M.X., McMillin, B.: Energy balanced broadcasting through delayed intelligence. In: ITCC 2005. Int. Conf. Information Technology: Coding and Computing, April 4-6, 2005. vol. 2, pp. 627–632 (2005)
Garcia, F., Solano, J., Stojmenovic, I.: Connectivity based k-hop clustering in wireless networks. Telecommunication Systems 22(1-4), 205–220 (2003)
Hogie, L., Bouvry, P., Seredynski, M., Guinand, F.: A Bandwidth-Efficient Broadcasting Protocol for Mobile Multi-hop Ad hoc Networks, ICNICONSMCL 2006. IEEE Computer Society Press, Los Alamitos (2006)
Ho, C., Obraczka, K., Tsudik, G., Viswanath, K.: Flooding for reliable multicast in multihop ad hoc networks, 3rd Int. Workshop on Discrete Algorithms and Methods for Mobile Computers and Communications DIAL’M (August 1999)
Kim, D., Maxemchuk, N.F.: A comparison of flooding and random routing in mobile ad hoc network, 3rd New York Metro Area Networking Workshop (September 2003)
Kim, B., Yang, J., Zhou, D., Sun, M.T.: Energy-aware connected dominating set construction in mobile ad hoc networks, 14th Int. Conf. Computer Communications and Networks ICCCN, October 17-19, 2005, pp. 229–234 (2005)
Lin, C.R., Gerla, M.: Adaptive clustering for mobile wireless networks. IEEE J. Selected Areas in Communications 15(7), 1265–1275 (1997)
Ni, S.Y., Tseng, Y.C., Chen, Y.S., Sheu, J.P.: The broadcast storm problem in a mobile ad hoc network. In: Proc. MOBICOM, Seattle, pp. 151–162 (August 1999)
Stojmenovic, I., Wu, J.: Broadcasting and activity scheduling in ad hoc networks. In: Basagni, S., Conti, M., Giordano, S., Stojmenovic, I. (eds.) Mobile Ad Hoc Networking, pp. 205–229. IEEE/Wiley (2004)
Stojmenovic, I.: Comments and corrections to Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks. IEEE Transactions on Parallel and Distributed Systems 15(11), 1054–1055 (2004)
Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. IEEE Trans. on Parallel and Distributed Systems 13(1), 14–25 (2002)
Wu, J., Li, H.: A Dominating Set Based Routing Scheme in Ad Hoc Wireless Networks. In: Proc. DIAL M: Int’l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., pp. 7–14 (1999)
Zhou, D., Sun, M.-T., Lai, T.-H.: A Timer-based Protocol for Connected Dominating Set Construction in IEEE 802.11 Multihop Mobile Ad Hoc Networks, IEEE SAINT, pp. 2–8 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
García-Nocetti, F., Ovalle-Martínez, F.J., Solano-González, J., Stojmenović, I. (2007). The Impact of Delay in Dominating Set and Neighbor Elimination Based Broadcasting in Ad Hoc Networks. In: Kranakis, E., Opatrny, J. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2007. Lecture Notes in Computer Science, vol 4686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74823-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-74823-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74822-9
Online ISBN: 978-3-540-74823-6
eBook Packages: Computer ScienceComputer Science (R0)