A local recovery routing protocol with clustering coefficient

Authors:
Yih-Jia Tsai;Chen-Han Yao
Affiliations:
Department of Computer Science and Information Engineering, Tamkang University, Tamsui, Taipei, Taiwan;Department of Computer Science and Information Engineering, Tamkang University, Tamsui, Taipei, Taiwan
Venue:
AIC'10/BEBI'10 Proceedings of the 10th WSEAS international conference on applied informatics and communications, and 3rd WSEAS international conference on Biomedical electronics and biomedical informatics
Year:
2010

Citing 6
Cited 0

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

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Neighborhood aware source routing

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Enhancing Route Recovery for QAODV Routing in Mobile Ad Hoc Networks

ISPAN '08 Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks
A growing network model with high hub connectivity and tunable clustering coefficient

WSEAS Transactions on Information Science and Applications
Bypass routing: An on-demand local recovery protocol for ad hoc networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nodes in ad hoc networks communicate with other nodes via wireless multi-hop links. In on-demand routing protocol, nodes want to send data will provide route discovery to find routes. Route discovery is typically performed via flooding, which consumes a lot of control packets. Due to node mobility, the network topology change frequently and cause the route broken. In this paper, we propose a local recovery routing protocol with clustering coefficient (LRRCC) which can reduce the route discovery times when route failure occur. The clustering coefficient is one of properties in complex network. Simulation results show our protocol can decrease the number of control packets and increase route delivery ratio.