Paper Info
Title
A centralized adaptive hybrid routing mechanism for Ad Hoc networks
Abstract
Hybrid routing protocols in Ad Hoc networks combine proactive routing protocols with on-demand routing protocols and take advantages of both. However, the cost in delays and overheads resulted from simple domain formation algorithm of existing hybrid routing protocols is a main obstacle in improving the performance of overall ad hoc network. Owing to the above issues, in this paper we creatively apply the idea of clustering routing to hybrid routing protocols and propose a centralized adaptive hybrid routing protocol referred to as CAHR. In CAHR, several key nodes are selected using the centralized adaptive selection algorithm and different domains are formed according to the key nodes elected. By taking advantages of the key nodes, redundancy of routing forward is avoided, routing overheads are reduced and as a consequence, routing efficiency is improved. With simulations in OPNET Modeler of various scenarios, the superiority of CAHR is verified over traditional hybrid routing protocols in routing overheads, end-to-end latency, throughput and packet delivery rate.
Year
DOI
Venue
2014
10.1109/WPMC.2014.7014831
WPMC
Keywords
Field
DocType
clustering routing,routing efficiency,packet delivery rate,opnet modeler,simple domain formation algorithm,end-to-end latency,delays,centralized adaptive hybrid routing mechanism,on-demand routing protocols,routing protocols,ad hoc networks,cahr protocol,mobile computing,routing
Link-state routing protocol,Dynamic Source Routing,Computer science,Policy-based routing,Static routing,Destination-Sequenced Distance Vector routing,Computer network,Hybrid routing,Wireless Routing Protocol,Real-time computing,Zone Routing Protocol,Distributed computing
Conference
ISSN
Citations 
PageRank 
1347-6890
1
0.36
References 
Authors
4
4
Name
Order
Citations
PageRank
Jiaqi Xu11069.50
Chunxiu Xu211.37
Xijie Zhang310.36
Xiang Xiao4219.66