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

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/97773

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/97773

题名:	A Reliable Local Recovery Routing Protocol Based on Clustering Coefficient for Mobile Ad Hoc Networks
作者:	Tsai, Yihjia;Yao, Chenhan;Huang, Wenfa
贡献者:	淡江大學資訊工程學系暨研究所
关键词:	Ad Hoc Networks;Reliable Routing Protocol;Local Recovery;Clustering Coeﬃcient;Complex Network
日期:	2012
上传时间:	2014-04-21 14:41:18 (UTC+8)
出版者:	Bethel: Binary Information Press
摘要:	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.
關聯:	Journal of Computational Information Systems 8(6), pp.2511-2518
显示于类别:	[資訊工程學系暨研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	184	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章