A Path Recovery Routing Protocol Based on Clustering Coefficient in Ad Hoc Networks

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

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

Title:	A Path Recovery Routing Protocol Based on Clustering Coefficient in Ad Hoc Networks
Authors:	YAO, Chenhan;TSAI, Yihjia;HUANG, Wenfa
Contributors:	淡江大學資訊工程學系
Keywords:	Ad Hoc Networks;Routing Protocol;Local Recovery;Clustering Coeﬃcient;Complex Network
Date:	2012-01
Issue Date:	2014-04-21 14:42:56 (UTC+8)
Publisher:	Bethel: Binary Information Press
Abstract:	In ad hoc network, nodes communicate with each other through wireless multi-hop links. When a node wants to send data to another node, it uses some routing algorithm to ﬁnd the path before data delivery. In on-demand routing protocol, the source asks its neighbors to ﬁnd the route leading to the destination. Route discovery is typically performed via ﬂooding, 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 path recovery routing protocol based on clustering coeﬃcient (LPRCC) which can reduce the route discovery times when route failure occur. The clustering coeﬃcient is one of properties in complex network. Simulation results show our protocol can decrease the number of control packets and increase route delivery ratio.
Relation:	Journal of Computational Information Systems 8(2), pp.469-476
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	278	View/Open