Email this article A New Approach to NCL Selection In DTNS Based On a Probabilistic Selection Metric
Abstract
The propose of caching technique in wireless ADHOC networks profits by the supposition of existing end-to-end ways amidst mobile nodes, and the way from a supplicant to the information source leftovers unaltered every single through data access as a rule. Such supposition empowers any in the middle of node on the way to store the go by information. The accomplishment of such an optional caching procedure is perilously disabled in DTNs, which don't presuppose any persevering system availability. Given that information are sent by means of pioneering contacts, the inquiry and answered information may take distinctive routes, and it is muddled for hubs to gather the data about question times passed by and make caching assumption. To expand the security while efficient data transmission in Disruption tolerant networks adopted AES algorithm is presented which delivers effective security and reduces computation complexity.
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.
Refbacks
- There are currently no refbacks.
Copyright © 2013, All rights reserved.| ijseat.com
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.
Â