Data Access In Disruption Tolerant Networks Using Cooperative Caching

M. Arshi, N. Deepak

Abstract


Disruption tolerant networks (DTNs) consist of mobile devices that call each other opportunistically.Due to the low node density and impulsive nodemobility, only broken network connectivity exists in DTNs, and the ensuing obscurity of maintaining end-to end communication links makes it obligatory to use “carry and-forward†methods for data transmission. Models ofsuch networks consist of groups of individuals moving in adversity mending areas, military battlefields, or urbansensing applications. In such networks, node mobilityis subjugated to let mobile nodes take data as communicate and forward data opportunistically when contacting others. The input difficulty is, consequently, how to decide the suitable communicate assortment plan.


References


A. Balasubramanian, B. Levine, and A. Venkataramani, “DTN Routing as a Resource Allocation Problem,†Proc. ACM SIGCOMM Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm., pp. 373-384, 2007.

C. Boldrini, M. Conti, and A. Passarella, “ContentPlace: Social- Aware Data Dissemination in Opportunistic Networks,†Proc. 11th Int’l Symp. Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM), pp. 203-210, 2008.

L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “Web Caching and Zipf-Like Distributions: Evidence and Implications.†Proc. IEEE INFOCOM, vol. 1, 1999.

J. Burgess, B. Gallagher, D. Jensen, and B. Levine, “MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks,†Proc. IEEE INFOCOM, 2006.

H. Cai and D.Y. Eun, “Crossing over the Bounded Domain: From Exponential to Power-Law Inter-Meeting Time in MANET,†Proc. ACM MobiCom, pp. 159-170, 2007.

P. Cao and S. Irani, “Cost-Aware WWW Proxy Caching Algorithms,†Proc. USENIX Symp. Internet Technologies and Systems, 1997.

A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, “Impact of Human Mobility on Opportunistic Forwarding Algorithms,†IEEE Trans. Mobile Computing, vol. 6, no. 6, pp. 606-620, June 2007.

P. Costa, C. Mascolo, M. Musolesi, and G. Picco, “Socially Aware Routing for Publish-Subscribe in Delay-Tolerant Mobile Ad Hoc Networks,†IEEE J. Selected Areas in Comm., vol. 26, no. 5, pp. 748- 760, June 2008.

E. Daly and M. Haahr, “Social Network Analysis for Routing in Disconnected Delay-Tolerant MANETs,†Proc. ACM MobiHoc, 2007.

H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli, “Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages,†Proc. ACM MobiHoc, pp. 257-266, 2003.

J. Eriksson, L. Girod, B. Hull, R. Newton, S. Madden, and H. Balakrishnan, “The Pothole Patrol: Using a Mobile Sensor Network for Road Surface Monitoring,†Proc. ACM Sixth Ann. Int’l Conf. Mobile Systems, Applications and Services (MobiSys), 2008.

V. Erramilli, A. Chaintreau, M. Crovella, and C. Diot, “Diversity of Forwarding Paths in Pocket Switched Networks,†Proc. Seventh ACM SIGCOMM Conf. Internet Measurement (IMC), pp. 161-174, 2007.

V. Erramilli, A. Chaintreau, M. Crovella, and C. Diot, “Delegation Forwarding,†Proc. ACM MobiHoc, 2008.

K. Fall, “A Delay-Tolerant Network Architecture for Challenged Internets,†Proc. ACM SIGCOMM Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm., pp. 27-34, 2003.

L. Fan, P. Cao, J. Almeida, and A. Broder, “Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol,†IEEE/ACM Trans. Networking, vol. 8, no. 3, pp. 281-293, June 2000


Full Text: PDF [Full Text]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.

Â