Optimizing Opportunistic Routing in Asynchronous Wireless Sensor Networks

Asynchronous sleep schedule and geographical routing are two efficient and scalable solutions for wireless sensor networks (WSNs). However, the schedule may degrade the delay performance of the routing protocol, and the optimal combined utilization of these two solutions is still an open question. In this letter, we propose a geographical-based opportunistic routing protocol for asynchronous WSNs. Each node maintains multiple relay candidates that make geographical progresses of more than a threshold $\gamma$ , and opportunistically forwards data packet to the first candidate that wakes up. We can obtain the optimal end-to-end delay performance, by just tuning $\gamma$ . Analytical and simulation results show that the derived optimal $\gamma$ can make a good tradeoff between the single-hop delay and the hop count of forwarding path, and minimize the end-to-end delay of forwarding path.