路标迭代提取和剔除的自适应空洞处理算法

Route-Sign-Based Adaptive Void Handling Geographical Routing Algorithm

针对无线传感器网络贪婪地理路由协议中的路由空洞问题,提出一种高效的基于路标迭代提取和剔除的自适应空洞处理算法.该算法中,当探测包贪婪转发遇到空洞时,在网络拓扑局部平面化的基础上,以左(右)手法则提取空洞边界并沿其逆(顺)时针周边模式双向转发,同时,分布式地进行路标的迭代提取和剔除,直到获取的路标使得后续的数据包依次以它们为中间目标节点进行传输而不再遇到空洞为止.仿真结果表明,该协议能够以较小的控制开销代价获得次最优的传输路径,极大地提高了路由协议的性能,可以应用于无法消除路由空洞的大规模无线传感器网络贪婪地理路由协议.

To handle routing void of greedy geographical routing in wireless sensor networks, an efficiency adaptive void-handle algorithm is proposed, which is based on route signs that are distributed extracted and eliminated iteratively. Probes are sent by source to extract the route signs on the greedy path to destination. Based on the local planar graph, probes can take a clockwise （anticlockwise） traversal using the right （left） hand rule in perimeter mode, when it reaches the routing void. At the same time, route signs are distributed extracted and eliminated iteratively. The route signs are feedback to source and can guide the data packets delivered from source to destination never meeting routing void. Simulation shows that the algorithm can acquire a suboptimal routing path, with a high QoS performance in delivery delay and a mean throughout, so it can be applied to greedy geographical routing in large scale wireless sensor networks which have routing voids.