Multiple Sink Dynamic Destination Geographic Routing in Wireless Sensor Networks

Abstract

In this work, we propose Multiple Sink Dynamic Destination Geographic Routing (MSDDGR), a routing protocol for multiple sink wireless sensor networks. MSDDGR is based on greedy forwarding scheme, which decides the route only using the neighboring information in the local network topology. When a packet needs to be sent, the sender selects the nearest sink as the current destination, which brings dynamic destination assignment. We also analyze the impact of routing holes problem in the deployment of multiple sinks. This is a common problem in greedy forwarding routing protocols. Our simulations demonstrate the effectiveness of MSDDGR’s performance.