Geometric Designs for Energy and Delay Computing for Data Gathering in Wireless Sensor Networks
P. Balamurugan, V. Ceronmani Sharmila, M. Mummoorthy · Asian Journal of Computer Science And Information Technology · 2015
In wireless sensor networks, Sensor nodes are deployed randomly in harsh physical surroundings to gather data and deliver the data to the remote base station. Since sensor nodes have to preserve energy source they have limited computation capability. The sensed information is difficult to be transmitted over the sensor network for a long period of time in an energy efficient manner. In this paper finding, a reliable and efficient data gathering method in wireless sensor networks is proposed. The high-level contribution of this study is the enhancement of a Rank- based data gathering algorithm and the impact of energy entity for Wireless Sensor Networks. Then the energy and delay of data gathering are evaluated. It is observed that the network lifetime with EE-RBDG is 3.8 and 3.0 times more than that incurred for LEACH and PEGASIS respectively. Overall, the rank-based data gathering algorithm and its energy entity can be a significant addition to the list of data gathering algorithms that can simultaneously maximize the network lifetime as well as minimize the energy delay per round of data gathering.