Effective forwarding scheme for opportunistic networks based on refined contact probability and betweenness centrality

Sun Kyum Kim, Sung-Bong Yang

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

When forwarding in opportunistic networks, the higher contact probability that the destination node has, the more likely it is to forward a message to the destination. Moreover, the higher the betweenness centrality that a node has, the more likely it is to act as a bridge node toward the destination in the network. Each of these two metrics is exploited in existing forwarding schemes. Nevertheless, these schemes suffer from high network traffic and fail to balance network traffic and transmission delay while maintaining a lower hop count. To resolve these problems, we propose a novel forwarding scheme that considers refined contact probability and betweenness centrality. In the proposed scheme, nodes with higher probabilities of contact with other nodes tend to gather together, while nodes with higher betweenness centralities compensate for intermittent connection disruptions among nodes in the network. Experimental results show that the proposed scheme outperforms most known forwarding schemes in balancing network traffic and transmission delay.

Original languageEnglish
Pages (from-to)217-232
Number of pages16
JournalJournal of Information Science and Engineering
Volume33
Issue number1
DOIs
Publication statusPublished - 2017 Jan 1

Fingerprint

contact

All Science Journal Classification (ASJC) codes

  • Software
  • Human-Computer Interaction
  • Hardware and Architecture
  • Library and Information Sciences
  • Computational Theory and Mathematics

Cite this

@article{9788619040874d9bbad379847f0ac557,
title = "Effective forwarding scheme for opportunistic networks based on refined contact probability and betweenness centrality",
abstract = "When forwarding in opportunistic networks, the higher contact probability that the destination node has, the more likely it is to forward a message to the destination. Moreover, the higher the betweenness centrality that a node has, the more likely it is to act as a bridge node toward the destination in the network. Each of these two metrics is exploited in existing forwarding schemes. Nevertheless, these schemes suffer from high network traffic and fail to balance network traffic and transmission delay while maintaining a lower hop count. To resolve these problems, we propose a novel forwarding scheme that considers refined contact probability and betweenness centrality. In the proposed scheme, nodes with higher probabilities of contact with other nodes tend to gather together, while nodes with higher betweenness centralities compensate for intermittent connection disruptions among nodes in the network. Experimental results show that the proposed scheme outperforms most known forwarding schemes in balancing network traffic and transmission delay.",
author = "Kim, {Sun Kyum} and Sung-Bong Yang",
year = "2017",
month = "1",
day = "1",
doi = "10.6688/JISE.2017.33.1.13",
language = "English",
volume = "33",
pages = "217--232",
journal = "Journal of Information Science and Engineering",
issn = "1016-2364",
publisher = "Institute of Information Science",
number = "1",

}

TY - JOUR

T1 - Effective forwarding scheme for opportunistic networks based on refined contact probability and betweenness centrality

AU - Kim, Sun Kyum

AU - Yang, Sung-Bong

PY - 2017/1/1

Y1 - 2017/1/1

N2 - When forwarding in opportunistic networks, the higher contact probability that the destination node has, the more likely it is to forward a message to the destination. Moreover, the higher the betweenness centrality that a node has, the more likely it is to act as a bridge node toward the destination in the network. Each of these two metrics is exploited in existing forwarding schemes. Nevertheless, these schemes suffer from high network traffic and fail to balance network traffic and transmission delay while maintaining a lower hop count. To resolve these problems, we propose a novel forwarding scheme that considers refined contact probability and betweenness centrality. In the proposed scheme, nodes with higher probabilities of contact with other nodes tend to gather together, while nodes with higher betweenness centralities compensate for intermittent connection disruptions among nodes in the network. Experimental results show that the proposed scheme outperforms most known forwarding schemes in balancing network traffic and transmission delay.

AB - When forwarding in opportunistic networks, the higher contact probability that the destination node has, the more likely it is to forward a message to the destination. Moreover, the higher the betweenness centrality that a node has, the more likely it is to act as a bridge node toward the destination in the network. Each of these two metrics is exploited in existing forwarding schemes. Nevertheless, these schemes suffer from high network traffic and fail to balance network traffic and transmission delay while maintaining a lower hop count. To resolve these problems, we propose a novel forwarding scheme that considers refined contact probability and betweenness centrality. In the proposed scheme, nodes with higher probabilities of contact with other nodes tend to gather together, while nodes with higher betweenness centralities compensate for intermittent connection disruptions among nodes in the network. Experimental results show that the proposed scheme outperforms most known forwarding schemes in balancing network traffic and transmission delay.

UR - http://www.scopus.com/inward/record.url?scp=85050018970&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85050018970&partnerID=8YFLogxK

U2 - 10.6688/JISE.2017.33.1.13

DO - 10.6688/JISE.2017.33.1.13

M3 - Article

AN - SCOPUS:85050018970

VL - 33

SP - 217

EP - 232

JO - Journal of Information Science and Engineering

JF - Journal of Information Science and Engineering

SN - 1016-2364

IS - 1

ER -