Privacy of intellectual Mobile Data using Location Proof Updating System with Sensor Networks

	International Journal of P2P Network Trends and Technology (IJPTT)
	© 2016 by IJPTT Journal
	Volume - 6 Issue - 5
	Year of Publication : 2016
	Authors : R.Meenatchi, C.Santhi priya

Citation

R.Meenatchi, C.Santhi priya "Privacy of intellectual Mobile Data using Location Proof Updating System with Sensor Networks". International Journal of P2P Network Trends and Technology (IJPTT), V6(5):16-21 Sep - Oct 2016, ISSN:2249-2615, www.ijpttjournal.org, Published by Seventh Sense Research Group.

Abstract

Graph theory is one of the basic tool for analysing computer networks such as wireless mesh network, Adhoc network, sensor networks. Conventional graph theory is not accurately describe the node and link of wireless network so it is not used for modern complex wireless networks and also the random graph and weighted graph theory not clearly illustrate the properties of wireless networks. To overcome these problem a new idea is developed, that is called Polychromatic set. In this paper, I introduced the concept of Polychromatic set theory for describing the node and link in wireless network for efficient routing scheme. The estimation result shows it is simple, effective. The performance is better compare than any other conventional routing method. It can be achieved by ns-2 simulator.

References

[1] M. Gadouleau and S. Riis, “Graph-theoretical constructions for graph entropy and network coding based communications,” IEEE Trans. Inform. Theory, vol. 57, no. 10, pp. 6703–6717, Oct. 2011.
[2] M.M. Zavlanos, M. B. Egerstedt, and G. J.Pappas, “Graphtheoretic connectivity control of mobile robot networks,” Proc. IEEE, vol. 99, no. 9, pp. 1525–1540, Sep. 2011.
[3] L.Levitin, M. Karpovsky, and M. Mustafa, “Minimal sets of turns for breaking cycles in graphs modeling networks,” IEEE Trans. Parallel Distrib. Syst., vol. 21, no. 9, pp. 1342– 1352, Sep. 2010.
[4] S.Lee, E. M. Belding-Royer, and C. E. Perkins, “Scalability study of the ad-hoc on-demand distance vector routing protocol,” ACM/Wiley Int. J. Netw. Manag., vol. 13, no. 2, pp. 97–114, 2003.
[5] I. Norros and H. Reittu, “Network models with a „soft hierarchy?: A random graph construction with loglog scalability,” IEEE Netw., vol. 22, no. 2, pp. 40–46, Mar.– Apr. 2008.
[6] J. Blum, M. Ding, A. Thaeler, and X. Cheng, “Connected dominating set in sensor networks and MANETs,” in Handbook of Combinatorial Optimization. Norwell, MA: Kluwer, 2004, pp. 329–369.
[7] X. Li, X. Xu, F. Zou, H.Du, P.Wan, Y. Wang, and W. Wu,“A PTAS for node-weighted Steiner tree in unit disk graphs,” in Proc. 3rd Int. Conf. Combinat. Optimiz. Applicat., vol. 5573. 2009, pp. 36–48.
[8] M.Gjoka, C.T.Butts, M.Kurant, and A. Markopoulou,“Multigraph sampling of online social networks,” IEEE J. Sel. Areas Commun., vol. 29, no. 9, pp. 1893–1905, Sep. 2011.
[9] M.Newman, “The structure and function of complex networks,” SIAM Rev., vol. 45, no. 2, pp. 167–256, 2003.
[10] G. Cantor, “Uber eine Eigen schaft des Inbegriffes aller reellen algebrais-chen zahlen,” Crelles J. Mathematik, vol. 77, pp. 258–262, 1874.
[11] J. Eriksson, M. Faloutsos, and S. V. Krishnamurthy, “DART: Dynamic address routing for scalable ad hoc and mesh networks,” IEEE/ACM Trans. Netw., vol. 15, no. 1, pp. 119–132, Jan. 2009.
[12] Q.Chen, Q. Zhang, and Z. Niu, “A graph theory based opportunistic link scheduling for wireless ad hoc networks,” IEEE Trans. Wireless commun., vol. 8, no. 10, pp. 5075– 5085, Oct. 2009.
[13] P.K. Biswas, “A formal framework for multicast communication,” IEEE Syst. J.,, vol. 4, no. 3, pp. 353–362, Sep. 2010.
[14] G. Cantor, “Uber eine Eigenschaft des Inbegriffes aller reellen algebrais- chen zahlen,” Crelles J. Mathematik, vol. 77, pp. 258–262, 1874.
[15] S. Li and X. Wang, “Polychromatic set theory-based spectrum access in cognitive radios,” IET Commun., vol. 6, no. 8, pp. 909–916, 2012. 58 IEEE SYSTEMS JOURNAL, VOL. 7, NO. 1, MARCH 2013.
[16] S.Li, “The application of polychromatic sets in computer aided design,” M.S. thesis, Dept. Comput. Sci., Xi?an Jiaotong Univ., Suzhou, China, 2004.
[17] Z. Li and L. Xu, “Polychromatic sets and its application in simulating complex objects and systems,” Comput. Oper. Res., vol. 30, no. 6, pp. 851–860, 2003.
[18] S.Li, X.Wang, and S. Zhao, “Multipath routing for video streaming in wireless mesh networks,” Ad Hoc Sensor Wireless Netw., vol. 11, nos. 1–2, pp. 73–92, 2011.
[19] C. Lim, S.Bohacek, J.P. Hespanha, and K.Obraczka, “Hierarchical max-flow routing,” in Proc. IEEE Global Telecommun. Conf., vol. 1. Dec. 2005, pp. 545–550.

Keywords
weighted graph, Conventional graph, Polychromatic sets, Routing, wireless ad hoc networks.