A SURVEY OF VOID HANDLING TECHNIQUES FOR GEOGRAPHIC ROUTING IN WIRELESS NETWORKS

被引：135

作者：

Chen, Dazhi ^{[1
]}

Varshney, Pramod K. ^{[2
]}

机构：

[1] Syracuse Univ, Dept Elect Engn & Comp Sci, Syracuse, NY 13244 USA

[2] Syracuse Univ, New York State Ctr Adv Technol Comp Applicat & So, Syracuse, NY 13244 USA

来源：

IEEE COMMUNICATIONS SURVEYS AND TUTORIALS | 2007年 / 9卷 / 01期

关键词：

D O I：

10.1109/COMST.2007.358971

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Communications voids, where geographic greedy forwarding fails to move a packet further towards its destination, are an important issue for geographic routing in wireless networks. This article presents an overview of the void problem and surveys the currently available void-handling techniques (as of July 2006) for geographic routing. In the survey, we classify these void-handling techniques into six categories, each designed with a different approach, that is, planar-graph-based, geometric, flooding-based, cost-based, heuristic, and hybrid. For each category, we present its basic principle and illustrate some classic techniques as well as the latest advances. We also provide a qualitative comparison of these techniques and discuss some possible directions of future research.

引用

页码：50 / 67

页数：18