A Novel Routing Scheme to Use the Rule of First Encounter within OOP-Routing for Delay Tolerant Ad-Hoc Networks

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

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/105962

題名:	A Novel Routing Scheme to Use the Rule of First Encounter within OOP-Routing for Delay Tolerant Ad-Hoc Networks
作者:	Yang, Shih-Yang;Jiang, Jiun-Ting;Chen, Po-Zung
關鍵詞:	DTN;Routing;Epidemic;NS2;OOP
日期:	2013-01-31
上傳時間:	2016-04-22 13:12:39 (UTC+8)
摘要:	In DTNs, most of the routing developments are addressed in specific scenarios. However, about zero-knowledge routing, fewer breakthroughs can make their ways for novel developments. From this paper, we propose a novel routing in terms of zero-knowledge, namely OOPFE. We get the routing idea through observations in the daily life. In the 400-meter relay race of the World Olympic Game, the average speed is faster than that of the individual 400-meters race. We attempt to use the characteristic and further research by the way of “relay-delivering message” to tackle the tradeoff for increasing the delivery ratio and decreasing the number of duplication in the random moving scenarios. And, we have got a novel method and used NS2 Simulator to verify. Since the hop-limit greatly affects the efficiency, we also analyze the average number of hop counts for different hop-limits. The results show that this routing more ssuitable for the scenarios when the speed of source nodes is slower or the size of the network scenario is larger.
關聯:	Journal of Communications and Information Sciences 3(1), pp.47-59
DOI:	10.4156/jcis.vol3.issue1.6
顯示於類別:	[資訊工程學系暨研究所] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	130	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章