An adaptive clustering routing transition protocol in ad hoc networks

Authors:
Xu Jia;Li Zhi;Li Qian-mu;Liu Feng-yu
Affiliations:
Institute of Computer Science, Nanjing University of Science and Technology, Xiaolinwei Street 200#, Nanjing, Jiangsu 210094, China;Institute of Computer Science, Nanjing University of Science and Technology, Xiaolinwei Street 200#, Nanjing, Jiangsu 210094, China;Institute of Computer Science, Nanjing University of Science and Technology, Xiaolinwei Street 200#, Nanjing, Jiangsu 210094, China;Institute of Computer Science, Nanjing University of Science and Technology, Xiaolinwei Street 200#, Nanjing, Jiangsu 210094, China
Venue:
Computer Communications
Year:
2008

Citing 5
Cited 2

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An efficient routing protocol for wireless networks

Mobile Networks and Applications - Special issue: routing in mobile communications networks
The Spatial Node Distribution of the Random Waypoint Mobility Model

Mobile Ad-Hoc Netzwerke, 1. deutscher Workshop über Mobile Ad-Hoc Netzwerke WMAN 2002
The performance impact of traffic patterns on routing protocols in mobile ad hoc networks

MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Adaptive clustering for mobile wireless networks

IEEE Journal on Selected Areas in Communications

Cluster overlay-dynamic source routing: highly scalable routing protocol

ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
Swarm mobility and its impact on performance of routing protocols in MANETs

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

To solve the expansibility problem of traditional flat routing protocols in ad hoc networks, an adaptive clustering routing transition protocol (ACRT) was proposed in this paper, by using the idea of adaptive clustering, routing transition and profits by the merits of passive clustering and gradual clustering. ACRT creates clusters adaptively by real-time apperceiving network scale which can solve the conflict between the expansibility of flat routing protocols and clustering overhead of clustering routing protocols. This mechanism takes the compatibility among different routing mechanisms into account to obtain high routing efficiency. ACRT can eliminate hangovers of flat routing protocol to reduce the occupancy of resources and storage cost by strict transition strategy. Simulation results show that ACRT has good expansibility and adaptive control action. ACRT is a correct and efficient routing mechanism.