Consistent and Proficient Algorithm for Data Gathering in Wireless Sensor Networks
Balamurugan · Journal of Computer Science · 2011
Problem statement: A wireless sensor network is usually deployed in a harsh geographical area to gather data that can be delivered to the remotely located base station.Sensor nodes have irreplaceable energy source, limited computational capability and limited memory.It is a challenge to maximize the use of energy of these sensor nodes to extend the network lifetime.Approach: This study proposes a Rank-Based Data Gathering Algorithm for wireless sensor networks.Sensor nodes were randomly distributed in a network field of different sizes.For every round of data communication, the algorithm steps were as follows: A set of sensor nodes or vertices were given a random rank between 0 and 1.A link formed between any two nodes if they were within each other's transmission range.If a sensor node had the highest rank among its neighbors, then it considered an associate node, else it falls into the leaf node.Next, the associate nodes form a complete graph among them and later form a Rooted Directed Tree (RDT) after an implementation of Kruskal's Minimum Spanning Tree algorithm and the Breadth First Search algorithm.Finally, a model that takes into account the energy when deciding what type of node a sensor was implemented.Results and Conclusion: After recording the simulation results, it is concluded that the RBDG yields a better outcome in terms of lifetime and delay per round for TDMA than other popular data gathering algorithms.