Improving Opportunistic Data Dissemination via Known Vector Export

@article{huang:dissemination, 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.}, address = {Los Alamitos, CA, USA}, author = {Huang, Jyh H. and Chen, Ying Y. and Chen, Yi C. and Mishra, Shivakant and Chen, Ling J.}, citeulike-article-id = {5687430}, citeulike-linkout-0 = {http://doi.ieeecomputersociety.org/10.1109/WAINA.2009.128}, citeulike-linkout-1 = {http://dx.doi.org/10.1109/WAINA.2009.128}, doi = {10.1109/WAINA.2009.128}, isbn = {978-0-7695-3639-2}, journal = {Advanced Information Networking and Applications Workshops, International Conference on}, keywords = {cambridge\_haggle, crawdad, information-dissemination, opportunistic-networks, princeton\_zebranet}, pages = {838--843}, posted-at = {2009-08-31 10:21:46}, priority = {2}, publisher = {IEEE Computer Society}, title = {Improving Opportunistic Data Dissemination via Known Vector}, url = {http://dx.doi.org/10.1109/WAINA.2009.128}, volume = {0}, year = {2009} }

TY - JOUR ID - huang:dissemination L3 - citeulike-article-id:5687430 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. JF - Advanced Information Networking and Applications Workshops, International Conference on SN - 978-0-7695-3639-2 AD - Los Alamitos, CA, USA EP - 843 TI - Improving Opportunistic Data Dissemination via Known Vector PB - IEEE Computer Society VL - 0 SP - 838 KW - cambridge_haggle KW - crawdad KW - information-dissemination KW - opportunistic-networks KW - princeton_zebranet AU - Huang, Jyh AU - Chen, Ying AU - Chen, Yi AU - Mishra, Shivakant AU - Chen, Ling PY - 2009/// UR - http://dx.doi.org/10.1109/WAINA.2009.128 ER -