Advertisement

DoTRo: A New Dominating Tree Routing Algorithm for Efficient and Fault-Tolerant Leader Election in WSNs and IoT Networks

  • Ahcène BounceurEmail author
  • Madani Bezoui
  • Loic Lagadec
  • Reinhardt Euler
  • Laouid Abdelkader
  • Mohammad Hammoudeh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11005)

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.

Keywords

Wireless Sensor Network IoT Leader election Distributed algorithms Dominating Tree Routing 

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Raynal, M.: Distributed Algorithms for Message-Passing Systems, vol. 500. Springer, Heidelberg (2013).  https://doi.org/10.1007/978-3-642-38123-2CrossRefzbMATHGoogle Scholar
  3. 3.
    Hirschberg, D.S., Sinclair, J.B.: Decentralized extrema finding in circular configuration of processors. Commun. ACM 23(11), 627–628 (1980)MathSciNetCrossRefGoogle Scholar
  4. 4.
    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)MathSciNetCrossRefGoogle Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    Peleg, D.: Time-optimal leader election in general networks. J. Parallel Distrib. Comput. 8(1), 96–99 (1990)CrossRefGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    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_42CrossRefGoogle Scholar
  14. 14.
    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_53CrossRefGoogle Scholar
  15. 15.
    Santoro, N.: Design and Analysis of Distributed Algorithms, vol. 56. Wiley, Hoboken (2007)zbMATHGoogle Scholar
  16. 16.
    Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, Burlington (1996)zbMATHGoogle Scholar
  17. 17.
    CupCarbon simulator. http://www.cupcarbon.com
  18. 18.
    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)Google Scholar
  19. 19.
    Tanenbaum, A.S., Wetherall, D.J.: Computer Networks, 5th edn, pp. 368–370. Pearson Education, London (2010)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Ahcène Bounceur
    • 1
    • 2
    • 5
    Email author
  • Madani Bezoui
    • 1
    • 3
  • Loic Lagadec
    • 1
    • 4
  • Reinhardt Euler
    • 1
    • 2
  • Laouid Abdelkader
    • 5
    • 6
  • Mohammad Hammoudeh
    • 7
  1. 1.Lab-STICC CNRS UMR 6285BrestFrance
  2. 2.Université de Bretagne OccidentaleBrestFrance
  3. 3.Department of MathematicsUniversité de BoumerdesBoumerdesAlgeria
  4. 4.ENSTA BretagneBrestFrance
  5. 5.LIMED LaboratoryBejaiaAlgeria
  6. 6.University of El-ouedEl OuedAlgeria
  7. 7.Manchester Metropolitan UniversityManchesterUK

Personalised recommendations