%0 Journal Article
%T Route-Sign-Based Adaptive Void Handling Geographical Routing Algorithm<br>路标迭代提取和剔除的自适应空洞处理算法
%A ZHANG Heng-Yang
%A WANG Ling
%A LIU Yun-Hui
%A CAI Xuan-Ping
%A <br>张衡阳
%A 王 玲
%A 刘云辉
%A 蔡宣平
%J 软件学报
%D 2009
%I 
%X 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.
%K wireless sensor networks
%K greedy geographical routing
%K routing void
%K adaptive void handling
%K route sign<br>无线传感器网络
%K 贪婪地理路由
%K 路由空洞
%K 自适应空洞处理
%K 路标
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=2E2F6CEF0C402513F950CD97AE15B796&yid=DE12191FBD62783C&vid=A04140E723CB732E&iid=F3090AE9B60B7ED1&sid=142C33398131A07A&eid=43D114DF111A2096&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=18