Destination-Based Greedy Routing Protocol for Wireless Sensor Networks
In recent years, a lot of focus has been done on establishing Wireless Sensor Networks (WSNs) for environment monitoring, natural disaster management, military and remote medical systems. When it comes to WSNs, the major problem faced is the implementation of efficient routing protocol that is fault tolerant and can avoid obstacles. An obstacle is a region that does not provide any sensing or communication capability and thus adds up to the delay overhead and impacts the performance of the WSN. Here in, the authors propose a simple and yet effective routing protocol uses greedy algorithm, with a few tweaks that help to cover the major limitations faced while still respecting the constraints of WSNs.
Subscribe to the Developer Insider Newsletter
From the hottest programming languages to commentary on the Linux OS, get the developer and open source news and tips you need to know. Delivered Tuesdays and Thursdays