A revised BROGO algorithm for leader election in wireless sensor and IoT networks

The BROGO algorithm has been recently presented for Leader Election in Wireless Sensor and IoT Networks, where after finding a spanning tree of a network, each leaf will route a message through its branch to the root in order to determine the leader in that branch. The root will then elect the global leader among the received branch leaders. The main drawback of this algorithm is a possible failure of the root node before the beginning of the election process. In this paper, we propose a revised version of the BROGO algorithm in which the non-faulty node with the smallest identifier is considered as a root. This can be done using the Wait-Before-Starting (WBS) concept, which guarantees a maximum of reliability and quality of service. The obtained results show that this process has no impact on the initial energy consumption generated by the BROGO algorithm.

[1]  M. Tahar Kechadi,et al.  CupCarbon: a multi-agent and discrete event wireless sensor network design and simulation tool , 2014, SimuTools.

[2]  Sung-Hoon Park,et al.  An efficient algorithm for leader-election in synchronous distributed systems , 1999, Proceedings of IEEE. IEEE Region 10 Conference. TENCON 99. 'Multimedia Technology for Asia-Pacific Information Infrastructure' (Cat. No.99CH37030).

[3]  Nicola Santoro,et al.  Design and analysis of distributed algorithms , 2006, Wiley series on parallel and distributed computing.

[4]  R VenugopalK,et al.  An Improved Leader Election Algorithm for Distributed Systems , 2013 .

[5]  M. Tahar Kechadi,et al.  D-LPCN: A distributed least polar-angle connected node algorithm for finding the boundary of a wireless sensor network , 2017, Ad Hoc Networks.

[6]  Tai Woo Kim,et al.  A leader election algorithm in a distributed computing system , 1995, Proceedings of the Fifth IEEE Computer Society Workshop on Future Trends of Distributed Computing Systems.

[7]  Kavita Khanna,et al.  Leader Election Algorithms in Distributed Systems , 2014 .

[8]  Nasser Yazdani,et al.  Improved algorithms for leader election in distributed systems , 2010, 2010 2nd International Conference on Computer Engineering and Technology.

[9]  Ahcène Bounceur,et al.  BROGO: A New Low Energy Consumption Algorithm for Leader Election in WSNs , 2017, 2017 10th International Conference on Developments in eSystems Engineering (DeSE).

[10]  R. Newman-Wolfe,et al.  An optimal distributed algorithm for failure-driven leader election in bounded-degree networks , 1992, Proceedings of the Third Workshop on Future Trends of Distributed Computing Systems.

[11]  Mahdi Zargarnataj.  New Election Algorithm based on Assistant in Distributed Systems , 2007, 2007 IEEE/ACS International Conference on Computer Systems and Applications.

[12]  Ahcène Bounceur,et al.  A wait-before-starting algorithm for fast, fault-tolerant and low energy leader election in WSNs dedicated to smart-cities and IoT , 2017, 2017 IEEE SENSORS.

[13]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[14]  Gurdip Singh.  Efficient distributed algorithms for leader election in complete networks , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[15]  Hector Garcia-Molina,et al.  Elections in a Distributed Computing System , 1982, IEEE Transactions on Computers.

[16]  Joost-Pieter Katoen,et al.  Design and analysis of dynamic leader election protocols in broadcast networks , 1993, Distributed Computing.