Link-aware geographic routing in WSN
Kaozhu Dai, Qianping Wang, Wen Qiang Xu, Cui Han, Meng Xiong, Yizhe Cheng · 2010
Traditional greedy geographic routing usually selects the neighbor node which distance to the destination node is nearest as the next hop node. This routing algorithm to find the minimum hop may choose low-quality data transmission link, resulting in lower packet delivery ratio and the reliability of data transmission worse. To solve this problem, summing up the existing geographic routing based on link quality measurement, and then a kind of geographic routing based on EWMA is proposed. In the algorithm, nodes use periodic broadcast package to evaluate link quality with its neighbor nodes, and to exchange geographic information. Forwarding node selects the neighbor node which to destination node closer and the link quality better as the next hop node. It effectively reduces data packet loss and improves the reliability of data transmission.