Design Issues and Performance Analysis of Location-Aided Hierarchical Cluster Routing on the MANET

MANET (Mobile Ad-hoc Network) is a type of dynamic configuration wireless ad-hoc network that does not require the basic internet construction.  Clustering of devices in MANET could reduce overhead, flooding and collision in communication and make the network topology more stable. Cluster Heads (CHs) are determined dynamically and in charge of the routing of the cluster. Frequent search of CH nodes would lower the efficiency of network. Many clustering algorithms used in searching CH nodes only consider the hop counts. However, the hop numbers do not demonstrate the exact distance between two CH nodes. Therefore, the Location Aided Hierarchical Cluster Routing (LHCR), a more suitable way for mobile ad-hoc network routing is proposed.  The LHCR method arranges the nodes in the networks into hierarchical clusters by the amount and position of the data. Thereby, it avoids the nodes that are far away from each other being assigned to the same cluster, and at the same time taking the CH nodes' power amount into consideration to avoid over-transformation. Routing is taken care of by the highest level of the nodes in each cluster. Simulation results indicate that the LHCR is more efficient and effective than ZRP and AODV in larger networks.

[1]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

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

[3]  Ivan Marsic,et al.  Clustering overhead for hierarchical routing in mobile ad hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[4]  Eryk Dutkiewicz,et al.  A review of routing protocols for mobile ad hoc networks , 2004, Ad Hoc Networks.

[5]  P.H.J. Chong,et al.  A survey of clustering schemes for mobile ad hoc networks , 2005, IEEE Communications Surveys & Tutorials.

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

[7]  Sanjay Kumar Dhurandher,et al.  Stable Clustering with Efficient Routing in Wireless Ad Hoc Networks , 2007, 2007 2nd International Conference on Communication Systems Software and Middleware.

[8]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[9]  Charalampos Konstantopoulos,et al.  Lowest-ID with adaptive ID reassignment: a novel mobile ad-hoc networks clustering algorithm , 2006, 2006 1st International Symposium on Wireless Pervasive Computing.

[10]  N. Beijar Zone Routing Protocol ( ZRP ) , 2002 .

[11]  David A. Maltz,et al.  The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4 , 2007, RFC.

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

[13]  J. J. Garcia-Luna-Aceves,et al.  A routing protocol for packet radio networks , 1995, MobiCom '95.

[14]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[15]  Huirong Fu,et al.  A Novel Location-Service Protocol Based on $k$ -Hop Clustering for Mobile Ad Hoc Networks , 2007, IEEE Transactions on Vehicular Technology.

[16]  Jinyang Li,et al.  Cluster Based Routing Protocol(CBRP) Functional Specification , 1999 .

[17]  Mario Joa-Ng,et al.  A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks , 1999, IEEE J. Sel. Areas Commun..