A Reliable Local Recovery Routing Protocol Based on Clustering Coefficient for Mobile Ad Hoc Networks

機構典藏 > College of Engineering > Graduate Institute & Department of Computer Science and Information Engineering > Journal Article > Item 987654321/97773

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/97773

Title:	A Reliable Local Recovery Routing Protocol Based on Clustering Coefficient for Mobile Ad Hoc Networks
Authors:	Tsai, Yihjia;Yao, Chenhan;Huang, Wenfa
Contributors:	淡江大學資訊工程學系暨研究所
Keywords:	Ad Hoc Networks;Reliable Routing Protocol;Local Recovery;Clustering Coeﬃcient;Complex Network
Date:	2012
Issue Date:	2014-04-21 14:41:18 (UTC+8)
Publisher:	Bethel: Binary Information Press
Abstract:	Nodes in mobile ad hoc network communicate with each other through wireless multi-hop links. When a node wants to send data to another node, it uses some routing protocol to ﬁnd the path. In on-demand routing protocols, the source starts a route discovery to ﬁnd the route leading to the destination. Route discovery is typically performed via ﬂooding, which consumes a lot of control packets. Because of node mobility, the network topology change frequently and cause the route broken. In this paper, we propose a reliable local recovery routing protocol based on clustering coeﬃcient (RLRCC). We choose a route with higher route cost which can decrease the number of route failure occur and also can reduce the route discovery times. Simulation results show our protocol can decrease the number of control packets and increase route delivery ratio.
Relation:	Journal of Computational Information Systems 8(6), pp.2511-2518
Appears in Collections:	[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	183	View/Open