Impact of Holes on Geometric Ad-hoc Routing Protocols

Author

Chhieng, V.M. ; Choi, Ryan H. ; Wong, Raymod K.

Author_Institution

Nat. ICT, New South Wales Univ., Sydney, NSW

Volume

2

fYear

2006

fDate

Sept. 2006

Firstpage

1

Lastpage

6

Abstract

All geometric routing protocols use Greedy Forwarding strategy to forward messages towards their destinations. When messages reach their local minima, all routing protocols use Face Traversal strategy to guide messages around holes to their next recovery points using either left hand rule or right hand rule. Often non-optimal rule is chosen and as a result, path-quality is degraded. In this paper, we study the impact of the use of non-optimal rule during Face Traversal strategy that is an essential part of all geometric routing protocol. We also analyze the cost of approximating network holes so that optimal rules can be used in all cases.

Keywords

ad hoc networks; greedy algorithms; message passing; routing protocols; face traversal strategy; geometric ad-hoc routing protocol; greedy forwarding strategy; Australia; Computer networks; Cost function; Degradation; Face detection; Planarization; Routing protocols; Sensor phenomena and characterization; Wireless networks; Wireless sensor networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Networks, 2006. ICON '06. 14th IEEE International Conference on

Conference_Location

Singapore

ISSN

1556-6463

Print_ISBN

0-7803-9746-0

Type

conf

DOI

10.1109/ICON.2006.302682

Filename

4087753