Dynamic Cooperative Routing (DCR) in wireless sensor networks

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Wireless Sensor Networks(WSNs) have micro sensors connected in a network with processing capabilities for communications. It is subjected to a set of resource constraints such as battery power, bandwidth and lifetime. The existing cooperative routing is addressed to reduce the energy consumption. We propose Dynamic Cooperative Routing (DCR) to conserve energy and maximization of lifetime with a static and mobile sink. A mathematical model is developed for the best placement of the sink in the deployment to reduce the distance between sources and sink. A comparative study of DCR algorithm with the existing algorithm is obtained for a static and mobile sink. In case of mobile sink, Comparative analysis shows the improvement in lifetime and energy conservation by 70% and 65% respectively over the existing algorithms. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.

Cite

CITATION STYLE

APA

Sivasankari, H., Leelavathi, R., Shaila, K., Venugopal, K. R., Iyengar, S. S., & Patnaik, L. M. (2012). Dynamic Cooperative Routing (DCR) in wireless sensor networks. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (Vol. 108 LNICST, pp. 87–92). https://doi.org/10.1007/978-3-642-35615-5_13

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