Localized Delaunay Triangulation for Topological Construction and Routing on MANETs

Mobile Ad Hoc networks (or MANETs) offer selfconfigurability through automated construction and maintenance of topology on mobile hosts. We present a novel protocol based on localized Triangulation, which offers good routing quality but incurs low overhead. It does not drain the network bandwidth by imposing large amount of protocol traffic. The total protocol traffic grows linearly with the number of the nodes, which is one of the most scalable among known schemes. Furthermore, the quality of routing is ensured by inheriting the correctness guarantee of GPSR. It is also found that, through careful selection of possible edges for the triangulation, the resulting topology can lead to low energy consumptions. This triangulation algorithm works well in a distributed and dynamic manner with reasonable time complexity. Existing algorithms for triangulation/ planarization are also described and compared with our algorithm based on both analytical and experimental results.

[1]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[2]  M. S. Corson,et al.  A performance comparison of the temporally-ordered routing algorithm and ideal link-state routing , 1998, Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166).

[3]  Vaduvur Bharghavan,et al.  Spine routing in ad hoc networks , 1998, Cluster Computing.

[4]  R. Scopigno,et al.  Parallel 3D Delaunay Triangulation , 1993, Comput. Graph. Forum.

[5]  Deepinder P. Sidhu,et al.  Open shortest path first (OSPF) routing protocol simulation , 1993, SIGCOMM 1993.

[6]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[7]  H. T. Kung,et al.  Geographic routing for wireless networks , 2000 .

[8]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[9]  Voon Chin Phua,et al.  Wireless lan medium access control (mac) and physical layer (phy) specifications , 1999 .

[10]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[11]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[12]  David A. Maltz,et al.  The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[13]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[14]  Nitin H. Vaidya,et al.  Location-aided routing (LAR) in mobile ad hoc networks , 1998, MobiCom '98.

[15]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[16]  Marcelo Spohn,et al.  SOURCE TREE ADAPTIVE ROUTING (STAR) PROTOCOL , 1999 .

[17]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[18]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[19]  D. F. Watson.  Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..

[20]  Nitin H. Vaidya,et al.  GeoTORA: a protocol for geocasting in mobile ad hoc networks , 2000, Proceedings 2000 International Conference on Network Protocols.

[21]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[22]  G. Sicuranza,et al.  The landmark hierarchy: A new hierarchy for routing in very large networks , 1988 .

[23]  Adrian Bowyer,et al.  Computing Dirichlet Tessellations , 1981, Comput. J..

[24]  Robin Sibson,et al.  Locally Equiangular Triangulations , 1978, Comput. J..

[25]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[26]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[27]  Ivan Stojmenovic,et al.  Ad hoc Networking , 2004 .

[28]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

[29]  S. M. Heemstra de Groot,et al.  Power-aware routing in mobile ad hoc networks , 1998, MobiCom '98.