Using known vectors to improve data dissemination in opportunistic networks

Jyh How Huang, Ying Yu Chen, Li Ping Tung, Ling Jyh Chen

研究成果: 雜誌貢獻文章

2 引文 斯高帕斯(Scopus)

摘要

An opportunistic network is a type of challenged network in which contacts are intermittent, an end-to-end path rarely exists between the source and the destination, disconnection and reconnection are common occurrences, and link performance is highly variable or extreme. Conventional methods of data dissemination in opportunistic networks rely on a meta-message exchange scheme, called the summary vector (SV), to prevent redundant transmission of data bundles that already exist on receivers. We consider that the SV scheme is costly in terms of the data transmission overhead, which is unaffordable in opportunistic networks. Hence, we propose an alternative scheme, called the known vector (KV), to improve the efficiency of meta-message exchanges for data transmission in opportunistic networks. Using a comprehensive set of simulations with realistic network scenarios, we demonstrate that the KV scheme can be easily integrated into existing opportunistic network routing protocols (e.g., Epidemic and PRoPHET routing). Moreover, it can reduce the communication overhead significantly, thereby improving energy efficiency for data transmission in opportunistic networks.

原文英語
頁(從 - 到)59-69
頁數11
期刊International Journal of Ad Hoc and Ubiquitous Computing
17
發行號1
DOIs
出版狀態已發佈 - 2014

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

指紋 深入研究「Using known vectors to improve data dissemination in opportunistic networks」主題。共同形成了獨特的指紋。

  • 引用此