Efficient scheduling scheme using connected dominating set for sensed data aggregators in sensor networks

2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

A power efficient scheduling scheme extending the life time of sensor nodes on wireless sensor networks has been proposed in this paper. This power efficient sleep scheduling algorithm is based on the connected dominating set approach. This approach first constructs a connected dominating set for parent selection and uses the conjugative sleep scheduler scheme for data aggregation. The re-calculation of connected dominating set when the node is in ON condition and in OFF conditions have been discussed. Finally, the performance of connected dominating set approach is compared with minimum spanning tree approach. By simulating the network with different node density, it is observed that, our proposed approach performs better than spanning tree topology. Whenever a sensor node fails or a new node is added to the network, the conjugative scheduling scheme evaluates the route maintenance. Remaining power levels of nodes have been examined in order to increase the network lifetime.

Cite

CITATION STYLE

APA

Sampoornam, K. P., & Rameshwaran, K. (2012). Efficient scheduling scheme using connected dominating set for sensed data aggregators in sensor networks. In Procedia Engineering (Vol. 30, pp. 152–158). https://doi.org/10.1016/j.proeng.2012.01.846

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free