Core location-aided cluster-based routing protocol for mobile ad hoc networks

Instead of blindly searching for a route in the entire network, the location-based routing protocol uses the location information of mobile nodes to confine routing space into a smaller range that reduces routing overhead and broadcast storm. In this paper, we propose a location-aided cluster-based routing protocol called Core Location-Aided Cluster-based Routing protocol (CLACR). CLACR partitions the entire network into square clusters. In each cluster, a cluster head is selected for routing. Instead of flooding route request packets in the entire network blindly, CLACR computes the desired route by using Dijkstra algorithm in a cluster-by-cluster basis. Only cluster heads, source, and destination nodes are needed to participate in routing procedure that reduce routing overhead tremendously. In order to maintain a shorter path, a route optimization is used to adjust the constructed path dynamically. A local route repair is applied to fix path, while the source or destination nodes roam off a cluster. It is helpful to lengthen the lifetime of route effectively. CLACR can easily be extended to provide geocasting service. Simulation results show that the performance of our routing protocol is better than other protocol.

[1]  Gaetano Borriello,et al.  Location Systems for Ubiquitous Computing , 2001, Computer.

[2]  Nitin H. Vaidya,et al.  Geocasting in mobile ad hoc networks: location-based multicast algorithms , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[3]  Yu-Chee Tseng,et al.  GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks , 2001, Telecommun. Syst..

[4]  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.

[5]  Mario Gerla,et al.  GloMoSim: A Scalable Network Simulation Environment , 2002 .

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

[7]  Lixia Zhang,et al.  Forwarding Group Multicast Protocol (FGMP) for multihop, mobile wireless networks , 1998, Cluster Computing.

[8]  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..

[9]  Rahul Jain,et al.  Geographical routing using partial information for wireless ad hoc networks , 2001, IEEE Wirel. Commun..

[10]  Satish K. Tripathi,et al.  Signal stability-based adaptive routing (SSA) for ad hoc mobile networks , 1997, IEEE Wirel. Commun..

[11]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[12]  Ivan Stojmenovic,et al.  Position-based routing in ad hoc networks , 2002, IEEE Commun. Mag..

[13]  Srdjan Capkun,et al.  GPS-free Positioning in Mobile Ad Hoc Networks , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.

[14]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[15]  Tomasz Imielinski,et al.  GeoCast—geographic addressing and routing , 1997, MobiCom '97.

[16]  Juha-Pekka Makela,et al.  Indoor geolocation science and technology , 2002, IEEE Commun. Mag..

[17]  Michael J. Rycroft,et al.  Understanding GPS. Principles and Applications , 1997 .