Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Intermittently Connected Mobile Ad Hoc NetworksOpportunistic Content Search in Intermittently Connected Mobile Ad Hoc Networks

Intermittently Connected Mobile Ad Hoc Networks: Opportunistic Content Search in Intermittently... [Apart from designing forwarding strategies to delivery a content from its publisher to their interested consumers [26][27][21][17][18][10][11], content search or content lookup is another fundamental problem that determines the architecture and performance of opportunistic content distribution networks in the ICMANs context. This is largely because only after discovering the information about its interested contents (e.g., content identifiers, related node addresses and even corresponding meta-data), a mobile user can determine which contents to be downloaded and accordingly activate the downloading process over the network. Note that distributed content search schemes have been widely studied since peer-to-peer (P2P) networks become a promising technology for content dissemination over the Internet [3]. Moreover, due to the common characteristics such as decentralized architecture, self-organization and self-healing features between P2P networks and MANETs, similar content search schemes are also extensively investigated for MANETs based mobile content distribution networks [14][19][15][46][25][8][37]. Unfortunately, to the best of knowledge, one of the key assumptions of underlying routing protocols (i.e., the existence of end-to-end routing path between any two nodes) for all such content search schemes becomes untenable in the ICMANs context, since ICMANs experience intermittent connections due to high node mobility, sporadic node density, short transmission range, and so on [54][36].] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Intermittently Connected Mobile Ad Hoc NetworksOpportunistic Content Search in Intermittently Connected Mobile Ad Hoc Networks

Download PDF
22 pages

Loading next page...
 
/lp/springer-journals/intermittently-connected-mobile-ad-hoc-networks-opportunistic-content-lzokvV5mHE
Publisher
Springer New York
Copyright
© The Author(s) 2011
ISBN
978-1-4614-1571-8
Pages
83 –104
DOI
10.1007/978-1-4614-1572-5_3
Publisher site
See Chapter on Publisher Site

Abstract

[Apart from designing forwarding strategies to delivery a content from its publisher to their interested consumers [26][27][21][17][18][10][11], content search or content lookup is another fundamental problem that determines the architecture and performance of opportunistic content distribution networks in the ICMANs context. This is largely because only after discovering the information about its interested contents (e.g., content identifiers, related node addresses and even corresponding meta-data), a mobile user can determine which contents to be downloaded and accordingly activate the downloading process over the network. Note that distributed content search schemes have been widely studied since peer-to-peer (P2P) networks become a promising technology for content dissemination over the Internet [3]. Moreover, due to the common characteristics such as decentralized architecture, self-organization and self-healing features between P2P networks and MANETs, similar content search schemes are also extensively investigated for MANETs based mobile content distribution networks [14][19][15][46][25][8][37]. Unfortunately, to the best of knowledge, one of the key assumptions of underlying routing protocols (i.e., the existence of end-to-end routing path between any two nodes) for all such content search schemes becomes untenable in the ICMANs context, since ICMANs experience intermittent connections due to high node mobility, sporadic node density, short transmission range, and so on [54][36].]

Published: Sep 20, 2011

Keywords: Mobile Node; Distribute Hash Table; Cache Size; Query Message; Cache Space

There are no references for this article.