A social overlay-based forwarding scheme for mobile social networks

Sun Kyum Kim, Jun Yeop Lee, Sung-Bong Yang

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In mobile social networks, forwarding is a challenging problem since there may be no end-to-end paths. Existing schemes using overlays are not applicable to pure mobile social networks since they use environments different from the mobile social networks. To resolve this problem, we propose a novel forwarding scheme that considers the common neighbor similarity and contact probability. In the proposed scheme, the more nodes have in common, the more likely they are to be friends, and higher contact probabilities between nodes increase the chances they will arrive at the destination. The proposed scheme constructs an overlay using two layers with the common neighbor similarity and the contact probability and forwards messages to the destinations through the overlay. Experimental results show that the proposed scheme outperforms most known forwarding schemes in terms of balancing the network traffic and transmission delay.

Original languageEnglish
Pages (from-to)2439-2451
Number of pages13
JournalWireless Networks
Volume22
Issue number7
DOIs
Publication statusPublished - 2016 Oct 1

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Kim, Sun Kyum ; Lee, Jun Yeop ; Yang, Sung-Bong. / A social overlay-based forwarding scheme for mobile social networks. In: Wireless Networks. 2016 ; Vol. 22, No. 7. pp. 2439-2451.
@article{5f10fda539714d6b8f721a5e91105078,
title = "A social overlay-based forwarding scheme for mobile social networks",
abstract = "In mobile social networks, forwarding is a challenging problem since there may be no end-to-end paths. Existing schemes using overlays are not applicable to pure mobile social networks since they use environments different from the mobile social networks. To resolve this problem, we propose a novel forwarding scheme that considers the common neighbor similarity and contact probability. In the proposed scheme, the more nodes have in common, the more likely they are to be friends, and higher contact probabilities between nodes increase the chances they will arrive at the destination. The proposed scheme constructs an overlay using two layers with the common neighbor similarity and the contact probability and forwards messages to the destinations through the overlay. Experimental results show that the proposed scheme outperforms most known forwarding schemes in terms of balancing the network traffic and transmission delay.",
author = "Kim, {Sun Kyum} and Lee, {Jun Yeop} and Sung-Bong Yang",
year = "2016",
month = "10",
day = "1",
doi = "10.1007/s11276-015-1162-2",
language = "English",
volume = "22",
pages = "2439--2451",
journal = "Wireless Networks",
issn = "1022-0038",
publisher = "Springer Netherlands",
number = "7",

}

A social overlay-based forwarding scheme for mobile social networks. / Kim, Sun Kyum; Lee, Jun Yeop; Yang, Sung-Bong.

In: Wireless Networks, Vol. 22, No. 7, 01.10.2016, p. 2439-2451.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A social overlay-based forwarding scheme for mobile social networks

AU - Kim, Sun Kyum

AU - Lee, Jun Yeop

AU - Yang, Sung-Bong

PY - 2016/10/1

Y1 - 2016/10/1

N2 - In mobile social networks, forwarding is a challenging problem since there may be no end-to-end paths. Existing schemes using overlays are not applicable to pure mobile social networks since they use environments different from the mobile social networks. To resolve this problem, we propose a novel forwarding scheme that considers the common neighbor similarity and contact probability. In the proposed scheme, the more nodes have in common, the more likely they are to be friends, and higher contact probabilities between nodes increase the chances they will arrive at the destination. The proposed scheme constructs an overlay using two layers with the common neighbor similarity and the contact probability and forwards messages to the destinations through the overlay. Experimental results show that the proposed scheme outperforms most known forwarding schemes in terms of balancing the network traffic and transmission delay.

AB - In mobile social networks, forwarding is a challenging problem since there may be no end-to-end paths. Existing schemes using overlays are not applicable to pure mobile social networks since they use environments different from the mobile social networks. To resolve this problem, we propose a novel forwarding scheme that considers the common neighbor similarity and contact probability. In the proposed scheme, the more nodes have in common, the more likely they are to be friends, and higher contact probabilities between nodes increase the chances they will arrive at the destination. The proposed scheme constructs an overlay using two layers with the common neighbor similarity and the contact probability and forwards messages to the destinations through the overlay. Experimental results show that the proposed scheme outperforms most known forwarding schemes in terms of balancing the network traffic and transmission delay.

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

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

U2 - 10.1007/s11276-015-1162-2

DO - 10.1007/s11276-015-1162-2

M3 - Article

AN - SCOPUS:84950248493

VL - 22

SP - 2439

EP - 2451

JO - Wireless Networks

JF - Wireless Networks

SN - 1022-0038

IS - 7

ER -