Abstract
A leader node in Ad hoc networks and especially in WSNs and IoT networks is needed in many cases, for example to generate keys for encryption/decryption, to find a node with minimum energy or situated in an extreme part of the network. In our work, we need as a leader the node situated on the extreme left of the network to start the process of finding its boundary nodes. These nodes will be used to monitor any sensitive, dangerous or non-accessible site. For this kind of applications, algorithms must be robust and fault-tolerant since it is difficult and even impossible to intervene if a node fails. Such a situation can be catastrophic in case that this node is the leader. In this paper, we present a new algorithm called DoTRo, which is based on a tree routing protocol. It starts from local leaders which will start the process of flooding to determine a spanning tree. During this process their value will be routed. If two spanning trees meet each other then the tree routing the best value will continue its process while the other tree will stop it. The remaining tree is the dominating one and its root will be the leader. This algorithm turns out to be low energy consuming with reduction rates that can exceed 85%. It is efficient and fault-tolerant since it works in the case where any node can fail and in the case where the network is disconnected.
This project is supported by the French National Research Agency ANR PERSEPTEUR - REF: ANR-14-CE24-0017.
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
References
Saoudi, M., et al.: D-LPCN: a distributed least polar-angle connected node algorithm for finding the boundary of a wireless sensor network. Ad Hoc Netw. 56(1), 56–71 (2017)
Raynal, M.: Distributed Algorithms for Message-Passing Systems, vol. 500. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38123-2
Hirschberg, D.S., Sinclair, J.B.: Decentralized extrema finding in circular configuration of processors. Commun. ACM 23(11), 627–628 (1980)
Dolev, D., Klawe, M., Rodeh, M.: An O(n log n) unidirectional distributed algorithm for extrema finding in a circle. J. Algorithms 3(3), 245–260 (1982)
Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. (TOPLAS) 5(1), 66–77 (1983)
Peleg, D.: Time-optimal leader election in general networks. J. Parallel Distrib. Comput. 8(1), 96–99 (1990)
Malpani, N., Welch, J.L., Vaidya, N.: Leader election algorithms for mobile ad hoc networks. In: Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 96–103. ACM (2000)
Park, V.D., Corson, M.S.: A highly adaptive distributed routing algorithm for mobile wireless networks. In: The Proceedings of the Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution, vol. 3, pp. 1405–1413 (1997)
Vasudevan, S., DeCleene, B., Immerman, N., Kurose, J., Towsley, D.: Leader election algorithms for wireless ad hoc networks. In: The Proceedings of the IEEE DARPA Information Survivability Conference and Exposition 2003, vol. 1, pp. 261–272 (2003)
Vasudevan, S., Kurose, J., Towsley, D.: Design and analysis of a leader election algorithm for mobile ad hoc networks. In: The Proceedings of the 12th IEEE International Conference on Network Protocols. ICNP 2004, pp. 350–360 (2004)
Boukerche, A., Abrougui, K.: An efficient leader election protocol for mobile networks. In: Proceedings of the ACM International Conference on Wireless Communications and Mobile Computing, pp. 1129–1134 (2006)
Ingram, R., Shields, P., Walter, J.E., Welch, J.L.: An asynchronous leader election algorithm for dynamic networks. In: IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2009, pp. 1–12 (2009)
Hammoudeh, M.: Modelling clustering of sensor networks with synchronised hyperedge replacement. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 490–492. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87405-8_42
Hammoudeh, M., Alsbou’i, T.A.A.: Building programming abstractions for wireless sensor networks using watershed segmentation. In: Balandin, S., Koucheryavy, Y., Hu, H. (eds.) NEW2AN/ruSMART -2011. LNCS, vol. 6869, pp. 587–597. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22875-9_53
Santoro, N.: Design and Analysis of Distributed Algorithms, vol. 56. Wiley, Hoboken (2007)
Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, Burlington (1996)
CupCarbon simulator. http://www.cupcarbon.com
Mehdi, K., Lounis, M., Bounceur, A., Kechadi, T.: CupCarbon: a multi-agent and discrete event wireless sensor network design and simulation tool. In: IEEE 7th International Conference on Simulation Tools and Techniques (SIMUTools 2014), Lisbon, Portugal (2014)
Tanenbaum, A.S., Wetherall, D.J.: Computer Networks, 5th edn, pp. 368–370. Pearson Education, London (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Bounceur, A., Bezoui, M., Lagadec, L., Euler, R., Abdelkader, L., Hammoudeh, M. (2019). DoTRo: A New Dominating Tree Routing Algorithm for Efficient and Fault-Tolerant Leader Election in WSNs and IoT Networks. In: Renault, É., Boumerdassi, S., Bouzefrane, S. (eds) Mobile, Secure, and Programmable Networking. MSPN 2018. Lecture Notes in Computer Science(), vol 11005. Springer, Cham. https://doi.org/10.1007/978-3-030-03101-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-03101-5_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-03100-8
Online ISBN: 978-3-030-03101-5
eBook Packages: Computer ScienceComputer Science (R0)