A NOVEL APPROACH TO ELECTION ALGORITHM FOR COORDINATOR SELECTION IN WIRELESS SENSOR NETWORKS

Computer Engineering

In a wireless sensor networks, coordinator election is a very important issue. An important challenge faced is the adoption of efficient algorithms for coordinator election. A coordinator is responsible of making sure the synchronization between different devices. In addition, a coordinator would assure the responsibility of dispatching IP, updating routing information and service list. Among all the algorithms reported in the literature, the Bully and Ring algorithms have gained more popularity. Their drawbacks are message passing cost and complexity. Many modified Bully and ring algorithms have been proposed to reduce the redundancy of the election process and the number of message passing. However, their modifications did not take available resources of a node into consideration. So our aim is to find out a new and improved algorithm for the election of the coordinator with reduced message passing and reduced message overhead along with maximum number of available resources. This paper will introduce a naïve algorithm for electing a coordinator based on the sensor node having the set of available resources.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.