📞 +91-7667918914 | ✉️ ijarcce@gmail.com
IJARCCE Logo
International Journal of Advanced Research in Computer and Communication Engineering A monthly Peer-reviewed & Refereed journal
ISSN Online 2278-1021ISSN Print 2319-5940Since 2012
IJARCCE adheres to the suggestive parameters outlined by the University Grants Commission (UGC) for peer-reviewed journals, upholding high standards of research quality, ethical publishing, and academic excellence.
← Back to VOLUME 5, ISSUE 5, MAY 2016

Finding Secure and Reliable Routing in Densely Distributed Wireless Sensor Networks

Sushmitha S.R, Mrs R Anitha

DOI: 10.17148/IJARCCE.2016.55237

Abstract: The main purpose of a sensor network is information gathering and delivery. Therefore, the quantity and quality of the data delivered to the end-user is very important. In this paper, we focus on designing a general energy efficient, fault tolerant, and highly reliable routing protocol that prolongs the network lifetime; we call it greedy geographical routing algorithm (GGRA). Our objective is to determine in a Multi-hop network the optimal number of cooperating nodes per hop to minimize the end-to-end total energy consumption while satisfying an outage probability requirement at each hop. Identify the effect of the number of cooperating nodes on energy consumption, all other parameters, i.e., transmission power; rate and reliability are kept constant. Simulation results reveal that the proposed algorithm yields a longer network lifetime, less packet latency, and higher delivery ratio than other existing schemes.



Keywords: network lifetime, secure, reliable, energy.

How to Cite:

[1] Sushmitha S.R, Mrs R Anitha, “Finding Secure and Reliable Routing in Densely Distributed Wireless Sensor Networks,” International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE), DOI: 10.17148/IJARCCE.2016.55237