An adaptive routing algorithm considering position and social similarities in an opportunistic network

Kiyoung Jang, Junyeop Lee, Sun Kyum Kim, Ji Hyeun Yoon, Sung Bong Yang

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

An opportunistic network (OPPNET) is a wireless networks without an infrastructure. In OPPNET, communication intermittently occurs when one node meets with another node. Thus, a connected path between the source and destination nodes rarely exists. For this reason, nodes need not only to forward messages but are also to store and carry messages as relay nodes. In OPPNET, several routing algorithms that rely on relay nodes with appropriate behavior have been proposed. Some of these are referred to as context-ignorant routing algorithms, which manipulate flooding, and others are referred to as context-aware routing algorithms, which utilize the contextual information. We propose a routing algorithm that employs a novel similarity based on both position and social information. We combine the position similarity with the social similarity using the fuzzy inference method to obtain the enhanced performance. Through this method, the proposed algorithm utilizes more proper relay nodes in forwarding adaptively and achieves significant improvement on the performance especially under memory constrained environment. We analyze the proposed algorithm on the NS-2 network simulator with the home-cell community-based mobility model. Experimental results show that the proposed algorithm outperforms typical routing algorithms in terms of the network traffic and delivery delay.

Original languageEnglish
Pages (from-to)1537-1551
Number of pages15
JournalWireless Networks
Volume22
Issue number5
DOIs
Publication statusPublished - 2016 Jul 1

Fingerprint

Routing algorithms
Adaptive algorithms
Network routing
Fuzzy inference
Telecommunication networks
Wireless networks
Simulators
Data storage equipment

All Science Journal Classification (ASJC) codes

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

Cite this

Jang, Kiyoung ; Lee, Junyeop ; Kim, Sun Kyum ; Yoon, Ji Hyeun ; Yang, Sung Bong. / An adaptive routing algorithm considering position and social similarities in an opportunistic network. In: Wireless Networks. 2016 ; Vol. 22, No. 5. pp. 1537-1551.
@article{b308cf052b0147fea1d230bb2431734c,
title = "An adaptive routing algorithm considering position and social similarities in an opportunistic network",
abstract = "An opportunistic network (OPPNET) is a wireless networks without an infrastructure. In OPPNET, communication intermittently occurs when one node meets with another node. Thus, a connected path between the source and destination nodes rarely exists. For this reason, nodes need not only to forward messages but are also to store and carry messages as relay nodes. In OPPNET, several routing algorithms that rely on relay nodes with appropriate behavior have been proposed. Some of these are referred to as context-ignorant routing algorithms, which manipulate flooding, and others are referred to as context-aware routing algorithms, which utilize the contextual information. We propose a routing algorithm that employs a novel similarity based on both position and social information. We combine the position similarity with the social similarity using the fuzzy inference method to obtain the enhanced performance. Through this method, the proposed algorithm utilizes more proper relay nodes in forwarding adaptively and achieves significant improvement on the performance especially under memory constrained environment. We analyze the proposed algorithm on the NS-2 network simulator with the home-cell community-based mobility model. Experimental results show that the proposed algorithm outperforms typical routing algorithms in terms of the network traffic and delivery delay.",
author = "Kiyoung Jang and Junyeop Lee and Kim, {Sun Kyum} and Yoon, {Ji Hyeun} and Yang, {Sung Bong}",
year = "2016",
month = "7",
day = "1",
doi = "10.1007/s11276-015-1048-3",
language = "English",
volume = "22",
pages = "1537--1551",
journal = "Wireless Networks",
issn = "1022-0038",
publisher = "Springer Netherlands",
number = "5",

}

An adaptive routing algorithm considering position and social similarities in an opportunistic network. / Jang, Kiyoung; Lee, Junyeop; Kim, Sun Kyum; Yoon, Ji Hyeun; Yang, Sung Bong.

In: Wireless Networks, Vol. 22, No. 5, 01.07.2016, p. 1537-1551.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An adaptive routing algorithm considering position and social similarities in an opportunistic network

AU - Jang, Kiyoung

AU - Lee, Junyeop

AU - Kim, Sun Kyum

AU - Yoon, Ji Hyeun

AU - Yang, Sung Bong

PY - 2016/7/1

Y1 - 2016/7/1

N2 - An opportunistic network (OPPNET) is a wireless networks without an infrastructure. In OPPNET, communication intermittently occurs when one node meets with another node. Thus, a connected path between the source and destination nodes rarely exists. For this reason, nodes need not only to forward messages but are also to store and carry messages as relay nodes. In OPPNET, several routing algorithms that rely on relay nodes with appropriate behavior have been proposed. Some of these are referred to as context-ignorant routing algorithms, which manipulate flooding, and others are referred to as context-aware routing algorithms, which utilize the contextual information. We propose a routing algorithm that employs a novel similarity based on both position and social information. We combine the position similarity with the social similarity using the fuzzy inference method to obtain the enhanced performance. Through this method, the proposed algorithm utilizes more proper relay nodes in forwarding adaptively and achieves significant improvement on the performance especially under memory constrained environment. We analyze the proposed algorithm on the NS-2 network simulator with the home-cell community-based mobility model. Experimental results show that the proposed algorithm outperforms typical routing algorithms in terms of the network traffic and delivery delay.

AB - An opportunistic network (OPPNET) is a wireless networks without an infrastructure. In OPPNET, communication intermittently occurs when one node meets with another node. Thus, a connected path between the source and destination nodes rarely exists. For this reason, nodes need not only to forward messages but are also to store and carry messages as relay nodes. In OPPNET, several routing algorithms that rely on relay nodes with appropriate behavior have been proposed. Some of these are referred to as context-ignorant routing algorithms, which manipulate flooding, and others are referred to as context-aware routing algorithms, which utilize the contextual information. We propose a routing algorithm that employs a novel similarity based on both position and social information. We combine the position similarity with the social similarity using the fuzzy inference method to obtain the enhanced performance. Through this method, the proposed algorithm utilizes more proper relay nodes in forwarding adaptively and achieves significant improvement on the performance especially under memory constrained environment. We analyze the proposed algorithm on the NS-2 network simulator with the home-cell community-based mobility model. Experimental results show that the proposed algorithm outperforms typical routing algorithms in terms of the network traffic and delivery delay.

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

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

U2 - 10.1007/s11276-015-1048-3

DO - 10.1007/s11276-015-1048-3

M3 - Article

AN - SCOPUS:84939824167

VL - 22

SP - 1537

EP - 1551

JO - Wireless Networks

JF - Wireless Networks

SN - 1022-0038

IS - 5

ER -