Link-Aware Geographic Routing in Wireless Sensor Networks

To solve the problem that geographic routing using traditional greedy metric decreases successful packet delivery on non-ideal communication link, we propose a link-aware geographic routing (LAG). The LAG not only expects the minimum Euclidean distance between neighbor nodes and the destination, but also requires the better link quality between the current node and relevant neighbor nodes during the selection of the next hop. To avoid selecting the neighbor nodes with bad links as the next hop, the LAG employs the blacklist approach to filter them out under the threshold of link quality. The simulation results show that, compared with traditional greedy routing on the non-ideal links, the LAG increases the packet delivery rate by 22% and decreases energy consumption by 12%. Our simulations also demonstrate the LAG´s scalability on densely deployed wireless networks.