Abstract
The dynamic topology of a mobile ad hoc network poses a real challenge in the design of hierarchical routing protocol, which combines proactive with reactive routing protocols and takes advantages of both. And as an essential technique of hierarchical routing protocol, clustering of nodes provides an efficient method of establishing a hierarchical structure in mobile ad hoc networks. In this paper, we designed a novel clustering algorithm and a corresponding hierarchical routing protocol for large-scale mobile ad hoc networks. Each cluster is composed of a cluster head, several cluster gateway nodes, several cluster guest nodes, and other cluster members. The proposed routing protocol uses proactive protocol between nodes within individual clusters and reactive protocol between clusters. Simulation results show that the proposed clustering algorithm and hierarchical routing protocol provide superior performance with several advantages over existing clustering algorithm and routing protocol, respectively.
Highlights
A mobile ad hoc network (MANET) [1, 2] is a wireless communication network, at which nodes use peer-to-peer packets transmission and multihop routes to communication
(2) Reactive routing: in this case, nodes in the network do not regularly maintain routing table for all destinations, just only when a node has data packets to send to some given destination; it checks its routing table to determine whether it has an active route to the destination
In order to utilize the network resources efficiently, HCAR absorbs the quintessence of ZRP to use proactive strategy between nodes within individual clusters and reactive strategy between clusters, not like CBRP to use on-demand strategy between nodes of both intracluster and intercluster communication to purely decrease the routing overhead and HSR, CGSR to use table-driven strategy to communicate in both intra- and interzone to decrease average end-to-end delay but increase the cost of routing overhead unwillingly
Summary
A mobile ad hoc network (MANET) [1, 2] is a wireless communication network, at which nodes use peer-to-peer packets transmission and multihop routes to communication. The SCCR (Signal Characteristic Clustering Routing), using SCBC (Signal Characteristic Based Clustering) algorithm in [23], elects the node, which has a long link holding time to take the cluster head responsibility This method can decrease the possibility of reclustering, but it cannot ensure the elected cluster head is logically centric and more profitable to play the cluster head role and to increase the whole network performance. Based on the analysis of the above, a hybrid clustering algorithm (HCA) based on the cost metric which takes the link expiration time and node’s relative degree into account was designed and a corresponding routing protocol (HCAR) was proposed in Sections 2 and 3, respectively.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
