Core Location-Aided Cluster-Based Routing Protocol for Mobile Ad Hoc Networks
Tzay-Farn Shih, Hsu‐Chun Yen · 2006
Abstract:- 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.