Dominion Systematized Association New Routing Path Using BFS Algorithm

Salini Lingineni, D. Kumar


In Wireless Sensor Networks (WSN), energy is a very precious resource for sensor nodes and communication overhead is to be minimized. These sensor nodes encompass limitations such as power, memory and computational capability. Since medium Access Control sub layer controls transmissions of the media and collisions, it has significant impact in reducing energy consumption and increasing the channel’s efficiency. This paper proposes a new routing protocol based on BFS algorithm. Simulation Results show that the proposed protocol is efficient in terms of reducing energy consumption and increase the WSNs lifespan and achieves better performance than well-known protocols in terms of transmission delay, throughput, and packet delivery ratio. We propose an energy efficient adaptive multipath routing technique which utilizes multiple paths between source and the sink, adaptive because they have low routing overhead. Methods used recentralized heuristic and ant colony gossiping to find best energy efficient path. CAS (Cooperation-Aware Scheme) is used to reduce the traffic in the network. This work makes use of an extended Greedy Perimeter Stateless Routing (eGPSR) protocol that mainly focuses on energy efficient data transmission. The proposed approach can significantly reduce collision, sleep-delay and idle listening. Computer simulation approach is used to evaluate the proposed algorithm. This data transmission is based on the fact that the message that is sent to a distant node consumes more energy than the message that is sent to a short range transmission. The proposed routing technique achieves in terms of End-to-End Delay, Throughput, Portion of Living Node (PLN) and Network Lifetime. The experimental result shows that the use of eGPSR in routing has improved throughput with comparatively less delay.

Full Text:


Copyright (c) 2019 Edupedia Publications Pvt Ltd

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.


All published Articles are Open Access at 

Paper submission: