CROP: Community-Relevance-based Opportunistic routing in delay tolerant networks

Je Wei Chang, Chien Chen

研究成果: Article同行評審

10 引文 斯高帕斯(Scopus)

摘要

Researchers have developed several social-based routing protocols for delay tolerant networks (DTNs) over the past few years. Two main routing metrics to support social-based routing in DTNs are centrality and similarity metrics. These two metrics help packets decide how to travel through the network to achieve short delay or low drop rate. This study presents a new routing scheme called Community-Relevance based Opportunistic routing (CROP). CROP uses a different message forwarding approach in DTNs by combining community structure with a new centrality metric called community relevance. One fundamental change in this approach is that community relevance values do not represent the importance of communities themselves. Instead, they are computed for each community-community relationship individually, which means that the level of importance of one community depends on the packet's destination community. The study also compares CROP with other routing algorithms such as BubbleRap and SimBet. Simulation results show that CROP achieves an average delivery ratio improvement of at least 30% and can distribute packets more fairly within the network.

原文English
頁(從 - 到)1875-1888
頁數14
期刊IEICE Transactions on Communications
E97-B
發行號9
DOIs
出版狀態Published - 1 一月 2014

指紋

深入研究「CROP: Community-Relevance-based Opportunistic routing in delay tolerant networks」主題。共同形成了獨特的指紋。

引用此