Improving opportunistic data dissemination via known vector

Jyh How Huang, Ying Yu Chen, Yi Chao Chen, Shivakant Mishra, Ling-Jyh Chen

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

Abstract

An opportunistic network is a network where each node only has connectiviy with other nodes opportunistically. To disseminate data in this kind of network is a challenging task and had drawn lots of research effort. When two nodes have connectivity with each other, the data bundles stored in their memory will be either replicated or forwarded to the other node in the hope that the data eventually reaches the destination node. The protocols that has only one copy of each data bundle is catagorized as forwarding protocol while the ones with multiple copies called replicating protocols. In opportunistic network, the replicating protocols are preferred over forwarding protocols. Yet, a big overhead is to be solved for replicating routing protocols, i.e. the exchanging of metadata. To avoid sending data bundles the other party already has, replicating protocols usually exchange metadata at the beginning of the connecting period. The naive method, sending the data bundles index summary in the memory, seems reasonable. But over time, this metadata exchange will become a big overhead. This paper propose a new scheme of indexing data bundles in the memory and can also reduces the metadata exchanged by large extent.

Original languageEnglish
Title of host publicationProceedings - 2009 International Conference on Advanced Information Networking and Applications Workshops, WAINA 2009
Pages838-843
Number of pages6
DOIs
Publication statusPublished - 2009 Oct 23
Event2009 International Conference on Advanced Information Networking and Applications Workshops, WAINA 2009 - Bradford, United Kingdom
Duration: 2009 May 262009 May 29

Publication series

NameProceedings - International Conference on Advanced Information Networking and Applications, AINA
ISSN (Print)1550-445X

Other

Other2009 International Conference on Advanced Information Networking and Applications Workshops, WAINA 2009
CountryUnited Kingdom
CityBradford
Period09/5/2609/5/29

Fingerprint

Metadata
Network protocols
Data storage equipment
Computer networks
Routing protocols

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Huang, J. H., Chen, Y. Y., Chen, Y. C., Mishra, S., & Chen, L-J. (2009). Improving opportunistic data dissemination via known vector. In Proceedings - 2009 International Conference on Advanced Information Networking and Applications Workshops, WAINA 2009 (pp. 838-843). [5136754] (Proceedings - International Conference on Advanced Information Networking and Applications, AINA). https://doi.org/10.1109/WAINA.2009.128

Improving opportunistic data dissemination via known vector. / Huang, Jyh How; Chen, Ying Yu; Chen, Yi Chao; Mishra, Shivakant; Chen, Ling-Jyh.

Proceedings - 2009 International Conference on Advanced Information Networking and Applications Workshops, WAINA 2009. 2009. p. 838-843 5136754 (Proceedings - International Conference on Advanced Information Networking and Applications, AINA).

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

Huang, JH, Chen, YY, Chen, YC, Mishra, S & Chen, L-J 2009, Improving opportunistic data dissemination via known vector. in Proceedings - 2009 International Conference on Advanced Information Networking and Applications Workshops, WAINA 2009., 5136754, Proceedings - International Conference on Advanced Information Networking and Applications, AINA, pp. 838-843, 2009 International Conference on Advanced Information Networking and Applications Workshops, WAINA 2009, Bradford, United Kingdom, 09/5/26. https://doi.org/10.1109/WAINA.2009.128
Huang JH, Chen YY, Chen YC, Mishra S, Chen L-J. Improving opportunistic data dissemination via known vector. In Proceedings - 2009 International Conference on Advanced Information Networking and Applications Workshops, WAINA 2009. 2009. p. 838-843. 5136754. (Proceedings - International Conference on Advanced Information Networking and Applications, AINA). https://doi.org/10.1109/WAINA.2009.128
Huang, Jyh How ; Chen, Ying Yu ; Chen, Yi Chao ; Mishra, Shivakant ; Chen, Ling-Jyh. / Improving opportunistic data dissemination via known vector. Proceedings - 2009 International Conference on Advanced Information Networking and Applications Workshops, WAINA 2009. 2009. pp. 838-843 (Proceedings - International Conference on Advanced Information Networking and Applications, AINA).
@inproceedings{a448280722224936a12a2652fc0890ff,
title = "Improving opportunistic data dissemination via known vector",
abstract = "An opportunistic network is a network where each node only has connectiviy with other nodes opportunistically. To disseminate data in this kind of network is a challenging task and had drawn lots of research effort. When two nodes have connectivity with each other, the data bundles stored in their memory will be either replicated or forwarded to the other node in the hope that the data eventually reaches the destination node. The protocols that has only one copy of each data bundle is catagorized as forwarding protocol while the ones with multiple copies called replicating protocols. In opportunistic network, the replicating protocols are preferred over forwarding protocols. Yet, a big overhead is to be solved for replicating routing protocols, i.e. the exchanging of metadata. To avoid sending data bundles the other party already has, replicating protocols usually exchange metadata at the beginning of the connecting period. The naive method, sending the data bundles index summary in the memory, seems reasonable. But over time, this metadata exchange will become a big overhead. This paper propose a new scheme of indexing data bundles in the memory and can also reduces the metadata exchanged by large extent.",
author = "Huang, {Jyh How} and Chen, {Ying Yu} and Chen, {Yi Chao} and Shivakant Mishra and Ling-Jyh Chen",
year = "2009",
month = "10",
day = "23",
doi = "10.1109/WAINA.2009.128",
language = "English",
isbn = "9780769536392",
series = "Proceedings - International Conference on Advanced Information Networking and Applications, AINA",
pages = "838--843",
booktitle = "Proceedings - 2009 International Conference on Advanced Information Networking and Applications Workshops, WAINA 2009",

}

TY - GEN

T1 - Improving opportunistic data dissemination via known vector

AU - Huang, Jyh How

AU - Chen, Ying Yu

AU - Chen, Yi Chao

AU - Mishra, Shivakant

AU - Chen, Ling-Jyh

PY - 2009/10/23

Y1 - 2009/10/23

N2 - An opportunistic network is a network where each node only has connectiviy with other nodes opportunistically. To disseminate data in this kind of network is a challenging task and had drawn lots of research effort. When two nodes have connectivity with each other, the data bundles stored in their memory will be either replicated or forwarded to the other node in the hope that the data eventually reaches the destination node. The protocols that has only one copy of each data bundle is catagorized as forwarding protocol while the ones with multiple copies called replicating protocols. In opportunistic network, the replicating protocols are preferred over forwarding protocols. Yet, a big overhead is to be solved for replicating routing protocols, i.e. the exchanging of metadata. To avoid sending data bundles the other party already has, replicating protocols usually exchange metadata at the beginning of the connecting period. The naive method, sending the data bundles index summary in the memory, seems reasonable. But over time, this metadata exchange will become a big overhead. This paper propose a new scheme of indexing data bundles in the memory and can also reduces the metadata exchanged by large extent.

AB - An opportunistic network is a network where each node only has connectiviy with other nodes opportunistically. To disseminate data in this kind of network is a challenging task and had drawn lots of research effort. When two nodes have connectivity with each other, the data bundles stored in their memory will be either replicated or forwarded to the other node in the hope that the data eventually reaches the destination node. The protocols that has only one copy of each data bundle is catagorized as forwarding protocol while the ones with multiple copies called replicating protocols. In opportunistic network, the replicating protocols are preferred over forwarding protocols. Yet, a big overhead is to be solved for replicating routing protocols, i.e. the exchanging of metadata. To avoid sending data bundles the other party already has, replicating protocols usually exchange metadata at the beginning of the connecting period. The naive method, sending the data bundles index summary in the memory, seems reasonable. But over time, this metadata exchange will become a big overhead. This paper propose a new scheme of indexing data bundles in the memory and can also reduces the metadata exchanged by large extent.

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

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

U2 - 10.1109/WAINA.2009.128

DO - 10.1109/WAINA.2009.128

M3 - Conference contribution

AN - SCOPUS:70350092333

SN - 9780769536392

T3 - Proceedings - International Conference on Advanced Information Networking and Applications, AINA

SP - 838

EP - 843

BT - Proceedings - 2009 International Conference on Advanced Information Networking and Applications Workshops, WAINA 2009

ER -