Abstract
In wireless sensor and IoT networks dedicated to smart-cities, a leader node performs critical tasks such as generating encryption/decryption keys. In this paper, the leader is the node situated at the extreme left of the network. It is the node which starts the algorithm of searching the boundary nodes. These nodes will be used to monitor any sensitive, dangerous or inaccessible site. For this type of application, the used algorithm must be robust and fault-tolerant because it is difficult or even impossible to intervene in the presence of node failures. If this node is the leader, such a situation can be catastrophic. In this article, we present a new algorithm called DoTRo, which is based on a tree routing protocol. It starts with local leaders which will launch the flooding process to determine a spanning tree. During this process, their values will be forwarded. If two spanning trees meet, the tree that routes the best value continues its process while the other tree stops. The remaining tree root will be the leader. This algorithm is low energy consuming with reduction rates that can exceed 85% with respect to the classical minium finding algorithm. It is efficient and fault-tolerant since it works even in the presence of node failures and communication disconnectivity. Additionally, the energy consumption is well balanced between nodes. Finally, the complexity and the proof of convergence of the proposed algorithm is presented.
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11036-020-01599-z/MediaObjects/11036_2020_1599_Fig1_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11036-020-01599-z/MediaObjects/11036_2020_1599_Fig2_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11036-020-01599-z/MediaObjects/11036_2020_1599_Fig3_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11036-020-01599-z/MediaObjects/11036_2020_1599_Fig4_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11036-020-01599-z/MediaObjects/11036_2020_1599_Fig5_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11036-020-01599-z/MediaObjects/11036_2020_1599_Fig6_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11036-020-01599-z/MediaObjects/11036_2020_1599_Fig7_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11036-020-01599-z/MediaObjects/11036_2020_1599_Fig8_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11036-020-01599-z/MediaObjects/11036_2020_1599_Fig9_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11036-020-01599-z/MediaObjects/11036_2020_1599_Fig10_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11036-020-01599-z/MediaObjects/11036_2020_1599_Fig11_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11036-020-01599-z/MediaObjects/11036_2020_1599_Fig12_HTML.png)
Similar content being viewed by others
References
Bounceur A, Euler R, Benzerbadj A, Kechadi T (2015) Finding the polygon hull in wireless sensor networks. In: EURO 2015, 27th European Conference on Operational Research, University of Strathclyde, Glasgow, Scotland, pp 12–15
Bezoui M, Bounceur A, Lagadec L, Euler R, Hammoudeh M, Laouid A, Tari A (2018) Detecting gaps and voids in wsns and iot networks: the angle-based method, pp 26–27
Bounceur A, Bezoui M, Hammoudeh M, Lagadec L, Euler R (2019) Finding the polygon hull of a network without conditions on the starting vertex. In: Transactions on Emerging Telecommunications Technologies. Wiley, New York
Saoudi M, Lalem F, Bounceur A, Euler R, Kechadi M. -T., Laouid A, Bezoui M, Sevaux M (2017) D-lpcn: a distributed least polar-angle connected node algorithm for finding the boundary of a wireless sensor network. Ad Hoc Netw 56:56–71
Raynal M (2013) Distributed Algorithms for Message-Passing Systems, vol 500. Springer, New York
Baker T, Aldawsari B, Tawfik H, Reid D, Ngoko Y (2015) Greedi: An energy efficient routing algorithm for big data on cloud. Ad Hoc Networks 35:83–96. [Online]. Available: https://doi.org/10.1016/j.adhoc.2015.06.008
Hussain AJ, Marcinonyte DM, Iqbal F, Tawfik H, Baker T, Al-Jumeily D (2018) Smart home systems security. In: 20th IEEE International Conference on High Performance Computing and Communications; 16th IEEE International Conference on Smart City; 4th IEEE International Conference on Data Science and Systems, HPCC/SmartCity/DSS 2018, Exeter, United Kingdom, June 28-30. [Online]. Available: https://doig.org/10.1109/HPCC/SmartCity/DSS.2018.00235, pp 1422–1428
Ghafir I, Saleem J, Hammoudeh M, Faour H, Prenosil V, Jaf S, Jabbar S, Baker T (2018) Security threats to critical infrastructure: the human factor. J Supercomput 74(10):4986–5002. [Online]. Available: https://doi.org/10.1007/s11227-018-2337-2
Baker T, Mackay M, Shaheed A, Aldawsari B (2015) Security-oriented cloud platform for soa-based SCADA. In: 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, CCGrid 2015, Shenzhen, China, May 4-7, 2015. [Online]. Available: https://doi.org/10.1109/CCGrid.2015.37, pp 961–970
Santoro N (2006) Design and analysis of distributed algorithms, vol 56. Wiley, New York
Bounceur A, Bezoui M, Lounis M, Euler R, Teodorov C (2018) A new dominating tree routing algorithm for efficient leader election in iot networks. In: Consumer Communications & Networking Conference (CCNC), 2018 15th IEEE Annual. IEEE, pp 1– 2
Bounceur A, Bezoui M, Euler R, Kadjouh N, Lalem F (2017) Brogo: a new low energy consumption algorithm for leader election in wsns. In: Developments in eSystems Engineering (DeSE), 2017 10th International Conference on. IEEE, pp 218–223
Biswas T, Bhardwaj R, Ray AK, Kuila P (2018) A novel leader election algorithm based on resources for ring networks. Int J Commun Syst 31(10):e3583
Bounceur A, Bezoui M, Euler R, Lalem F (2017) A wait-before-starting algorithm for fast, fault-tolerant and low energy leader election in wsns dedicated to smart-cities and iot. In: SENSORS, 2017 IEEE. IEEE, pp 1–3
Bounceur A, Bezoui M, Noreen U, Euler R, Lalem F, Hammoudeh M, Jabbar S (2017) Logo: A new distributed leader election algorithm in wsns with low energy consumption. In: International Conference on Future Internet Technologies and Trends. Springer, New York, pp 1–16
Derhab A, Badache N (2008) A self-stabilizing leader election algorithm in highly dynamic ad hoc mobile networks. IEEE Trans Parall Distrib Syst 19(7):926–939
BeaulahSoundarabai P, Thriveni J, Venugopal K, Patnaik L (2013) An improved leader election algorithm for distributed systems. Int J Next-Generation Netw 5(1):21
Khan M, Agarwal N, Jaiswal S, Khan JA (2017) An announcer based bully election leader algorithm in distributed environment. In: International Conference on Next Generation Computing Technologies. Springer, New York, pp 664–674
Garcia-Molina H (1982) Elections in a distributed computing system. IEEE Trans Comput 1:48–59
Raychoudhury V, Cao J, Niyogi R, Wu W, Lai Y (2014) Top k-leader election in mobile ad hoc networks. Perv Mob Comput 13:181–202
Hirschberg DS, Sinclair JB (1980) Decentralized extrema-finding in circular configurations of processors. Commun ACM 23(11):627–628
Dolev D, Klawe M, Rodeh M (1982) An o (n log n) unidirectional distributed algorithm. J Algorithms 3:245–260
Gallager RG, Humblet PA, Spira PM (1983) A distributed algorithm for minimum-weight spanning trees. ACM Trans Program Languages Syst (TOPLAS) 5(1):66–77
Peleg D (1990) Time-optimal leader election in general networks. J Parall Distrib Comput 8 (1):96–99
Malpani N, Welch JL, Vaidya N (2000) 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. ACM, pp 96–103
Park VD, Corson MS (1997) A highly adaptive distributed routing algorithm for mobile wireless networks,” in . In: INFOCOM’97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution., Proceedings IEEE, vol. 3. IEEE, pp 1405–1413
Vasudevan S, Kurose J, Towsley D (2004) Design and analysis of a leader election algorithm for mobile ad hoc networks. In: Network Protocols, 2004. ICNP 2004 Proceedings of the 12th IEEE International Conference on. IEEE, pp 350–360
Boukerche A, Abrougui K (2006) An efficient leader election protocol for mobile networks. In: Proceedings of the 2006 international conference on Wireless communications and mobile computing. ACM, pp 1129–1134
Ingram R, Shields P, Walter JE, Welch JL (2009) An asynchronous leader election algorithm for dynamic networks. In: Parallel & Distributed Processing, 2009. IPDPS 2009. IEEE International Symposium on. IEEE, pp 1–12
Lynch NA (1996) Distributed algorithms. Elsevier, New York
Tanenbaum AS, Wetherall DJ (2010) Computer Networks. Pearson, vol. 5
Bounceur A (2016) Cupcarbon: a new platform for designing and simulating smart-city and iot wireless sensor networks (sci-wsn). In: Keynote in the Proceedings of the ACM International Conference on Internet of things and Cloud Computing, Cambridge, United Kingdom
Bounceur A, Marc O, Lounis M, Soler J, Clavier L, Combeau P, Vauzelle R, Lagadec L, Euler R, Bezoui M, et al. (2018) Cupcarbon-lab: An iot emulator. In: 2018 15th IEEE Annual Consumer Communications & Networking Conference (CCNC). IEEE, pp 1–2
Lalem F, Bounceur A, Bezoui M, Saoudi M, Euler R, Kechadi T, Sevaux M (2017) Lpcn: Least polar-angle connected node algorithm to find a polygon hull in a connected euclidean graph. J Netw Comput Appl 93:38–50
Bounceur A, Euler R, Benzerbadj A, Kechadi T, et al. (2015) Finding the polygon hull in wireless sensor networks. In: EURO 2015-27th European Conference on Operational Research, University of Strathclyde, Glasgow, Scotland, 12-15 July 2015
Lounis M, Mehdi K, Bounceur A (2014) A Cupcarbon tool for simulating destructive insect movements. In: 1st IEEE international conference on information and communication technologies for disaster management (ICT-DM?14), Algiers, Algeria
Bounceur A, Mir S (2008) Estimation of test metrics for ams/rf bist using copulas. In: 2008 IEEE 14th International Mixed-Signals, Sensors, and Systems Test Workshop. IEEE, pp 1–6
Aldabbas O, Abuarqoub A, Hammoudeh M, Raza U, Bounceur A (2016) Unmanned ground vehicle for data collection in wireless sensor networks: mobility-aware sink selection. Open Autom Control Syst J 8(1)
Alwajeeh T, Combeau P, Bounceur A, Vauzelle R (2016) Efficient method for associating radio propagation models with spatial partitioning for smart city applications. In: The Proceedings of the ACM International Conference on Internet of things and Cloud Computing, Cambridge, United Kingdom
CupCarbon simulator. [Online]. Available: http://www.cupcarbon.com
Mehdi K, Lounis M, Bounceur A, Kechadi T (2014) Cupcarbon: A multi-agent and discrete event wireless sensor network design and simulation tool. In: 7th International ICST Conference on Simulation Tools and Techniques, Lisbon, Portugal, 17-19 March 2014. Institute for Computer Science, Social Informatics and Telecommunications …, pp 126–131
De Meulenaer G, Gosset F, Standaert F-X, Pereira O (2008) On the energy cost of communication and cryptography in wireless sensor networks. In: 2008 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications. IEEE, pp 580–585
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Kadjouh, N., Bounceur, A., Bezoui, M. et al. A Dominating Tree Based Leader Election Algorithm for Smart Cities IoT Infrastructure. Mobile Netw Appl 28, 718–731 (2023). https://doi.org/10.1007/s11036-020-01599-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11036-020-01599-z