標題: CROP: Community-Relevance-Based Opportunistic Routing in Delay Tolerant Networks
作者: Chang, Je-Wei
Chen, Chien
交大名義發表
資訊工程學系
資訊技術服務中心
National Chiao Tung University
Department of Computer Science
Information Technology Services Center
關鍵字: delay tolerant network;opportunistic routing;social networks
公開日期: 1-Sep-2014
摘要: 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.
URI: http://dx.doi.org/10.1587/transcom.E97.B.1875
http://hdl.handle.net/11536/25183
ISSN: 1745-1345
DOI: 10.1587/transcom.E97.B.1875
期刊: IEICE TRANSACTIONS ON COMMUNICATIONS
Volume: E97B
Issue: 9
起始頁: 1875
結束頁: 1888
Appears in Collections:Articles


Files in This Item:

  1. 000342729800015.pdf