CROP: Community-Relevance-Based Opportunistic Routing in Delay Tolerant Networks

Je-Wei CHANG; Chien CHEN

doi:10.1587/transcom.E97.B.1875

CROP: Community-Relevance-Based Opportunistic Routing in Delay Tolerant Networks

Je-Wei CHANG, Chien CHEN

Full Text Views

0

Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E97-B No.9 pp.1875-1888

Publication Date: 2014/09/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E97.B.1875

Type of Manuscript: PAPER

Category: Network

Authors

Je-Wei CHANG
National Chiao Tung University
Chien CHEN
National Chiao Tung University

Keyword

delay tolerant network, opportunistic routing, social networks

Cite this

Copy

Je-Wei CHANG, Chien CHEN, "CROP: Community-Relevance-Based Opportunistic Routing in Delay Tolerant Networks" in IEICE TRANSACTIONS on Communications, vol. E97-B, no. 9, pp. 1875-1888, September 2014, doi: 10.1587/transcom.E97.B.1875.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E97.B.1875/_p

Copy

@ARTICLE{e97-b_9_1875,
author={Je-Wei CHANG, Chien CHEN, },
journal={IEICE TRANSACTIONS on Communications},
title={CROP: Community-Relevance-Based Opportunistic Routing in Delay Tolerant Networks},
year={2014},
volume={E97-B},
number={9},
pages={1875-1888},
abstract={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.},
keywords={},
doi={10.1587/transcom.E97.B.1875},
ISSN={1745-1345},
month={September},}

Copy

TY - JOUR
TI - CROP: Community-Relevance-Based Opportunistic Routing in Delay Tolerant Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1875
EP - 1888
AU - Je-Wei CHANG
AU - Chien CHEN
PY - 2014
DO - 10.1587/transcom.E97.B.1875
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E97-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2014
AB - 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.
ER -