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
Y1 - 2009
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
T2 - 2009 International Conference on Advanced Information Networking and Applications Workshops, WAINA 2009
Y2 - 26 May 2009 through 29 May 2009
ER -