A content-centric framework for effective data dissemination in opportunistic networks

Ling Jyh Chen, Chen Hung Yu, Cheng Long Tseng, Hao Hua Chu, Cheng Fu Chou

Research output: Contribution to journalArticle

27 Citations (Scopus)

Abstract

In this paper, we address the challenges of content transfer in opportunistic networks, and propose techniques to better facilitate data dissemination based on the characteristics of the content. To investigate this problem from its origins, we propose three message scheduling algorithms: Sequential Forwarding (SF), Full Interleaving (FI), and Block-based Interleaving (BI). Each algorithm is embedded in a specially tailored data dissemination technique to evaluate the benefits of applying it to different types of content and data dissemination methods. Three types of content (file, video and web) are considered and evaluated, and the dissemination methods considered are Layered Multiple Description Coding (LMDC) based and file-based. Using simulations as well as both synthetic and realistic network scenarios, we evaluate the proposed schemes in terms of latency and user perceived quality, and demonstrate how the schemes can achieve much better latency performance for file transfers. Furthermore, we show that using LMDC-based techniques leads to higher user perceived quality, since the end user is allowed to "preview" video file or web content, even before the data has been completely transferred. The effectiveness and robustness of our message scheduling algorithms and their corresponding content dissemination techniques make them ideal solutions that can go a long way toward effective data dissemination in opportunistic networks.

Original languageEnglish
Article number4530733
Pages (from-to)761-772
Number of pages12
JournalIEEE Journal on Selected Areas in Communications
Volume26
Issue number5
DOIs
Publication statusPublished - 2008 Jun 1

Fingerprint

Scheduling algorithms

Keywords

  • Delay/disruption tolerant networks
  • Layered coding
  • Multiple description coding
  • Opportunistic networks
  • Routing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

A content-centric framework for effective data dissemination in opportunistic networks. / Chen, Ling Jyh; Yu, Chen Hung; Tseng, Cheng Long; Chu, Hao Hua; Chou, Cheng Fu.

In: IEEE Journal on Selected Areas in Communications, Vol. 26, No. 5, 4530733, 01.06.2008, p. 761-772.

Research output: Contribution to journalArticle

Chen, Ling Jyh ; Yu, Chen Hung ; Tseng, Cheng Long ; Chu, Hao Hua ; Chou, Cheng Fu. / A content-centric framework for effective data dissemination in opportunistic networks. In: IEEE Journal on Selected Areas in Communications. 2008 ; Vol. 26, No. 5. pp. 761-772.
@article{f6103239419c471a8ef8b33731cd38d7,
title = "A content-centric framework for effective data dissemination in opportunistic networks",
abstract = "In this paper, we address the challenges of content transfer in opportunistic networks, and propose techniques to better facilitate data dissemination based on the characteristics of the content. To investigate this problem from its origins, we propose three message scheduling algorithms: Sequential Forwarding (SF), Full Interleaving (FI), and Block-based Interleaving (BI). Each algorithm is embedded in a specially tailored data dissemination technique to evaluate the benefits of applying it to different types of content and data dissemination methods. Three types of content (file, video and web) are considered and evaluated, and the dissemination methods considered are Layered Multiple Description Coding (LMDC) based and file-based. Using simulations as well as both synthetic and realistic network scenarios, we evaluate the proposed schemes in terms of latency and user perceived quality, and demonstrate how the schemes can achieve much better latency performance for file transfers. Furthermore, we show that using LMDC-based techniques leads to higher user perceived quality, since the end user is allowed to {"}preview{"} video file or web content, even before the data has been completely transferred. The effectiveness and robustness of our message scheduling algorithms and their corresponding content dissemination techniques make them ideal solutions that can go a long way toward effective data dissemination in opportunistic networks.",
keywords = "Delay/disruption tolerant networks, Layered coding, Multiple description coding, Opportunistic networks, Routing",
author = "Chen, {Ling Jyh} and Yu, {Chen Hung} and Tseng, {Cheng Long} and Chu, {Hao Hua} and Chou, {Cheng Fu}",
year = "2008",
month = "6",
day = "1",
doi = "10.1109/JSAC.2008.080603",
language = "English",
volume = "26",
pages = "761--772",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - A content-centric framework for effective data dissemination in opportunistic networks

AU - Chen, Ling Jyh

AU - Yu, Chen Hung

AU - Tseng, Cheng Long

AU - Chu, Hao Hua

AU - Chou, Cheng Fu

PY - 2008/6/1

Y1 - 2008/6/1

N2 - In this paper, we address the challenges of content transfer in opportunistic networks, and propose techniques to better facilitate data dissemination based on the characteristics of the content. To investigate this problem from its origins, we propose three message scheduling algorithms: Sequential Forwarding (SF), Full Interleaving (FI), and Block-based Interleaving (BI). Each algorithm is embedded in a specially tailored data dissemination technique to evaluate the benefits of applying it to different types of content and data dissemination methods. Three types of content (file, video and web) are considered and evaluated, and the dissemination methods considered are Layered Multiple Description Coding (LMDC) based and file-based. Using simulations as well as both synthetic and realistic network scenarios, we evaluate the proposed schemes in terms of latency and user perceived quality, and demonstrate how the schemes can achieve much better latency performance for file transfers. Furthermore, we show that using LMDC-based techniques leads to higher user perceived quality, since the end user is allowed to "preview" video file or web content, even before the data has been completely transferred. The effectiveness and robustness of our message scheduling algorithms and their corresponding content dissemination techniques make them ideal solutions that can go a long way toward effective data dissemination in opportunistic networks.

AB - In this paper, we address the challenges of content transfer in opportunistic networks, and propose techniques to better facilitate data dissemination based on the characteristics of the content. To investigate this problem from its origins, we propose three message scheduling algorithms: Sequential Forwarding (SF), Full Interleaving (FI), and Block-based Interleaving (BI). Each algorithm is embedded in a specially tailored data dissemination technique to evaluate the benefits of applying it to different types of content and data dissemination methods. Three types of content (file, video and web) are considered and evaluated, and the dissemination methods considered are Layered Multiple Description Coding (LMDC) based and file-based. Using simulations as well as both synthetic and realistic network scenarios, we evaluate the proposed schemes in terms of latency and user perceived quality, and demonstrate how the schemes can achieve much better latency performance for file transfers. Furthermore, we show that using LMDC-based techniques leads to higher user perceived quality, since the end user is allowed to "preview" video file or web content, even before the data has been completely transferred. The effectiveness and robustness of our message scheduling algorithms and their corresponding content dissemination techniques make them ideal solutions that can go a long way toward effective data dissemination in opportunistic networks.

KW - Delay/disruption tolerant networks

KW - Layered coding

KW - Multiple description coding

KW - Opportunistic networks

KW - Routing

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

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

U2 - 10.1109/JSAC.2008.080603

DO - 10.1109/JSAC.2008.080603

M3 - Article

AN - SCOPUS:44649087051

VL - 26

SP - 761

EP - 772

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

IS - 5

M1 - 4530733

ER -