Indian Journal of Science and Technology
DOI: 10.17485/ijst/2014/v7i12.15
Year: 2014, Volume: 7, Issue: 12, Pages: 2118–2123
Original Article
M. Vinothini* and A. Umamakeswari
Department of Computer Science and Engineering, SASTRA University, India; vinomuthukumar89@gmail.com, aum@cse.sastra.edu
A network designed by the number of sensor nodes, senses the data from the environment, processes the data and routes it to the sink via the Cluster head (CH) and the group of intermediate nodes. The routing is carried out by these intermediate nodes efficiently from the source to the destination. To perform this transmission accurately, there are a number of issues to be considered, wherein the reliability issues and routing overhead are the key concern considered in this paper. A novel technique named “Efficient Neighbor Coverage Routing Protocol” (ENCRP) is proposed in this paper. This in turn reduces the routing overhead by using some proposed techniques such as finding rebroadcast delay and connectivity factor. This enables an efficient packet transmission among these nodes. Our result shows that the proposed routing technique has better performance by considering the metrics such as Throughput, Energy Utilization, Packet delivery ratio and End-toend delay compared to Dual Homed Routing (DHR) Protocol.
Keywords: Routing Overhead, Routing Protocol, Wireless Sensor Network
Subscribe now for latest articles and news.