In the point of internet users they give preference to content information, when compare to content information now current scenario gives more important to location based information. WSN face many limitations of cache techniques in terms of short communication range, reliability, security, privacy, mobility, poor processing capabilities, small storage and limited bandwidth availability. The services or data are offered to a broad category of users via the internet by the virtualization of the resources in the clouds. The tasks of the applications are executed after scheduling to proper machines and assigning with appropriate resources. The cache nodes which helps to find the user through fast and easiest way, reduce the hop count as an existing integer linear programming (ILP) problem when path of cache nodes destination to the user. So therefore ILP not able to solve in time, thought another method of approach have been introduced that is novel multipath routing transmission mechanism based on the network coding (MRNC). Quantitatively analysis of Proposed system Optimality of the shortest-path routing in Content-Centric Networking (CCN) in terms of application-level performance metrics. By using network coding technology, users Interest packet is divided into multiple child interest packet, and the content is divide and random linear codes and the content, thus the content is cache fragmentation. Content retrieval process is become into more child content. Proposed method more efficient to track paths, fastest short paths and reduce computation time comparatively integer linear programming (ILP).

Information centric networking, network coding, energy efficiency, caching strategy

[1]. D. Kim, S. W.Lee, Y. B. Ko , Jae-HoonKim, (2015, April) Cache capacity-aware content centric networking under flash crowds, Journal of Network and Computer Applications, Vol:50, , PP- 101-113.
[2]. W. K. Chai , D. He, I. Psaras, G. Pavlou., (2013) Cache ‘‘less for more’’ in information-centric networks. (extended version), Computer Communications, Vol. 36. PP-758–770.
[3]. S. Wassermann, K. Faust., (1994) Social Network Analysis: Methods and Applications, Cambridge University Press, Cambridge.
[4]. K. Suksomboony, S. Tarnoiz, Y. Jiyz, M. Koibuchiyz, K. Fukudayz, S. Abeyz, N. Motonoriyz, M. Aokiyz, S. Urushidaniyz and S. Yamada., (2014, March) PopCache: Cache More or Less Based on Content Popularity for Information-Centric Networking, IEEE Conference on Local Computer Networks.
[5]. M. Xie, I. Widjaja, H. Wang., (May 2012) Enhancing cache robustness for content-centric networking, IEEE INFOCOM. Orlando, USA.
[6]. Y. Xu, Y. Li, T. Lin, G. Zhang, Z. Wang, S. Ci., (2012, March) A Dominatingset- based Collaborative Caching withRequest Routing in Content Centric Networking, IEEE International Conference on Communications (ICC), pp.3624 – 3628.
[7]. S. Guha and S. Khuller., (1998) Approximation algorithms for connecteddominating sets”, Algorithmica, Vol-20(4), pp-374–387.
[8]. Ahlswede R, Cai N, Li S-Y, Yeung R.,(2000) Network information flow. IEEE Trans Inf Theory,” vol. 46, pp. 1204–1216.
[9]. Wang J, Ren J, Lu K, Wang J, Liu S, Westphal C., (2014) An optimal cache management framework for information-centric networks with network coding, In: 2014 IFIP networking conference. Trondheim, Norway, pp. 1-9.
[10]. Yang M, Yang Y., (2014) Applying network coding to peer-to-peer file sharing, IEEE Trans Computer, vol. 63, pp. 1938–50.
[11]. Zhang X, Li B., (2009) Optimized multipath network coding in lossy wireless networks. Selected Areas in Communication, IEEE Journal on. vol. 27, pp. 622-634.