An Efficient On-Demand Hierarchical Routing Protocol Based on Autonomous Clustering for Mobile Ad Hoc Networks

2007 ◽  
Author(s):  
Ryotaro ODA ◽  
Tomoyuki OHTA ◽  
Yoshiaki KAKUDA
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Hierarchical Routing ◽  
On Demand ◽  
Mobile Ad Hoc ◽  
Hierarchical Routing Protocol ◽  
Hoc Networks

scholarly journals A Clustering Routing Protocol for Mobile Ad Hoc Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Jinke Huang ◽  
Xiaoguang Fan ◽  
Xin Xiang ◽  
Min Wan ◽  
Zhenfu Zhuo ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocol ◽  
Clustering Algorithm ◽  
Ad Hoc ◽  
Superior Performance ◽  
Hierarchical Routing ◽  
Mobile Ad Hoc ◽  
Hierarchical Routing Protocol ◽  
Hoc Networks

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.

Sign in / Sign up

Export Citation Format

Share Document