A social transitivity-based data dissemination scheme for opportunistic networks

Jaesung Ku, Yangwoo Ko, Jisun An, Dongman Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

A social-based routing protocol for opportunistic networks considers the direct delivery as forwarding metrics. By ignoring the indirect delivery through intermediate nodes, it misses chances to find paths that are better in terms of delivery ratio and time. To overcome this limitation, we propose to incorporate transitivity, which considers the indirect delivery through intermediate nodes, as one of the forwarding metrics. We also found that some message forwards do not improve the delivery performance. To reduce the number of these useless forwards, the proposed scheme forwards messages to an encountered node when the increase of total utility value is greater than a threshold. Using a simulator with real world trace data sets, we compare the proposed scheme with the existing protocols, epidemic routing and SimBetTS. Compared with SimBetTS, the proposed scheme increases delivery ratio by 1.5 percent and decreases delay time by 2 percent while reducing overhead by 30 percent.

Original languageEnglish
Title of host publication2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks", WoWMoM 2010 - Digital Proceedings
DOIs
Publication statusPublished - 27 Aug 2010
Externally publishedYes
Event2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks", WoWMoM 2010 - Montreal, QC, Canada
Duration: 14 Jun 201017 Jun 2010

Other

Other2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks", WoWMoM 2010
CountryCanada
CityMontreal, QC
Period14/6/1017/6/10

Fingerprint

Routing protocols
Time delay
Simulators

Keywords

  • Data dissemination
  • Delay-Tolerant networks
  • Opportunistic networks
  • Opportunistic routing
  • Social-based routing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software

Cite this

Ku, J., Ko, Y., An, J., & Lee, D. (2010). A social transitivity-based data dissemination scheme for opportunistic networks. In 2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks", WoWMoM 2010 - Digital Proceedings [5534912] https://doi.org/10.1109/WOWMOM.2010.5534912

A social transitivity-based data dissemination scheme for opportunistic networks. / Ku, Jaesung; Ko, Yangwoo; An, Jisun; Lee, Dongman.

2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks", WoWMoM 2010 - Digital Proceedings. 2010. 5534912.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ku, J, Ko, Y, An, J & Lee, D 2010, A social transitivity-based data dissemination scheme for opportunistic networks. in 2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks", WoWMoM 2010 - Digital Proceedings., 5534912, 2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks", WoWMoM 2010, Montreal, QC, Canada, 14/6/10. https://doi.org/10.1109/WOWMOM.2010.5534912
Ku J, Ko Y, An J, Lee D. A social transitivity-based data dissemination scheme for opportunistic networks. In 2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks", WoWMoM 2010 - Digital Proceedings. 2010. 5534912 https://doi.org/10.1109/WOWMOM.2010.5534912
Ku, Jaesung ; Ko, Yangwoo ; An, Jisun ; Lee, Dongman. / A social transitivity-based data dissemination scheme for opportunistic networks. 2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks", WoWMoM 2010 - Digital Proceedings. 2010.
@inproceedings{fce07a087ebb4353b67b4cb5b3bdfcd6,
title = "A social transitivity-based data dissemination scheme for opportunistic networks",
abstract = "A social-based routing protocol for opportunistic networks considers the direct delivery as forwarding metrics. By ignoring the indirect delivery through intermediate nodes, it misses chances to find paths that are better in terms of delivery ratio and time. To overcome this limitation, we propose to incorporate transitivity, which considers the indirect delivery through intermediate nodes, as one of the forwarding metrics. We also found that some message forwards do not improve the delivery performance. To reduce the number of these useless forwards, the proposed scheme forwards messages to an encountered node when the increase of total utility value is greater than a threshold. Using a simulator with real world trace data sets, we compare the proposed scheme with the existing protocols, epidemic routing and SimBetTS. Compared with SimBetTS, the proposed scheme increases delivery ratio by 1.5 percent and decreases delay time by 2 percent while reducing overhead by 30 percent.",
keywords = "Data dissemination, Delay-Tolerant networks, Opportunistic networks, Opportunistic routing, Social-based routing",
author = "Jaesung Ku and Yangwoo Ko and Jisun An and Dongman Lee",
year = "2010",
month = "8",
day = "27",
doi = "10.1109/WOWMOM.2010.5534912",
language = "English",
isbn = "9781424472659",
booktitle = "2010 IEEE International Symposium on {"}A World of Wireless, Mobile and Multimedia Networks{"}, WoWMoM 2010 - Digital Proceedings",

}

TY - GEN

T1 - A social transitivity-based data dissemination scheme for opportunistic networks

AU - Ku, Jaesung

AU - Ko, Yangwoo

AU - An, Jisun

AU - Lee, Dongman

PY - 2010/8/27

Y1 - 2010/8/27

N2 - A social-based routing protocol for opportunistic networks considers the direct delivery as forwarding metrics. By ignoring the indirect delivery through intermediate nodes, it misses chances to find paths that are better in terms of delivery ratio and time. To overcome this limitation, we propose to incorporate transitivity, which considers the indirect delivery through intermediate nodes, as one of the forwarding metrics. We also found that some message forwards do not improve the delivery performance. To reduce the number of these useless forwards, the proposed scheme forwards messages to an encountered node when the increase of total utility value is greater than a threshold. Using a simulator with real world trace data sets, we compare the proposed scheme with the existing protocols, epidemic routing and SimBetTS. Compared with SimBetTS, the proposed scheme increases delivery ratio by 1.5 percent and decreases delay time by 2 percent while reducing overhead by 30 percent.

AB - A social-based routing protocol for opportunistic networks considers the direct delivery as forwarding metrics. By ignoring the indirect delivery through intermediate nodes, it misses chances to find paths that are better in terms of delivery ratio and time. To overcome this limitation, we propose to incorporate transitivity, which considers the indirect delivery through intermediate nodes, as one of the forwarding metrics. We also found that some message forwards do not improve the delivery performance. To reduce the number of these useless forwards, the proposed scheme forwards messages to an encountered node when the increase of total utility value is greater than a threshold. Using a simulator with real world trace data sets, we compare the proposed scheme with the existing protocols, epidemic routing and SimBetTS. Compared with SimBetTS, the proposed scheme increases delivery ratio by 1.5 percent and decreases delay time by 2 percent while reducing overhead by 30 percent.

KW - Data dissemination

KW - Delay-Tolerant networks

KW - Opportunistic networks

KW - Opportunistic routing

KW - Social-based routing

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

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

U2 - 10.1109/WOWMOM.2010.5534912

DO - 10.1109/WOWMOM.2010.5534912

M3 - Conference contribution

AN - SCOPUS:77955893230

SN - 9781424472659

BT - 2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks", WoWMoM 2010 - Digital Proceedings

ER -