Privacy Preserving of Information sharing system for Human Networks

Privacy Preserving of Information sharing system for Human Networks

  IJETT-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
  
© 2015 by IJETT Journal
Volume-30 Number-5
Year of Publication : 2015
Authors : Gatta Pushpa, Sri Lakshmi Kanagala

Citation 

Gatta Pushpa, Sri Lakshmi Kanagala"Privacy Preserving of Information sharing system for Human Networks", International Journal of Engineering Trends and Technology (IJETT), V30(5),257-262 December 2015. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group

Abstract
Now a day’s sharing information of mobile devices are becoming necessary of our daily lives. So that sharing information using existing mobile device technology rely on efficiency of internet and also increase time complexity. Because by using existing technology to transfer sharing data through server. This architecture is inefficient in many situations and also does not utilize abundant inter device communication opportunities in many scenarios. This paper proposed the inter device network for direct interactive with mobile device. By implementing this architecture each device not communicate with centralize device. The communication process can be done by using inter device network for sharing information. In this paper we can also provide security of transferring data by using prime order complement data cryptography technique for data encryption and decryption. By implementing those techniques we provide more efficiency of internet and also provide more security of transferred data.

 References

[1]. K. Fall, “A Delay-Tolerant Network Architecture for Challenged Internets,” Proc. Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm., pp. 27-34, 2003.
[2] A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, “Pocket Switched Networks: Real-World Mobility and Its Consequences for Opportunistic Forwarding,” IEEE J. Selected Areas Comm., vol. 26, no. 5, pp. 748-760, Feb. 2005.
[3] A. Chaintreau, P. Hui, 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.
[4] C. Qian and S. Lam, “Greedy Distance Vector Routing,” Proc. 31st Int’l Conf. Distributed Computing Systems (ICDCS ’11), pp. 857-868, June 2011.
[5] S.S. Lam and C. Qian, “Geographic Routing in DDimensional Spaces with Guaranteed Delivery and Low Stretch,” Proc. ACM SIGMETRICS Joint Int’l Conf. Measurement and Modeling of Computer Systems (SIGMETRICS ’11), pp. 257- 268, 2011.
[6] Y. Zhao and J. Wu, “B-Sub: A Practical Bloom-Filter-Based Publish-Subscribe System for Human Networks,” Proc. Int’l Conf. Distributed Computing Systems (ICDCS ’10), pp. 634-643, 2010
[7]. C. Liu and J. Wu, “An Optimal Probabilistic Forwarding Protocol in Delay Tolerant Networks,” Proc. MobiHoc ’09, pp. 105-114, 2009.
[8] I. Carreras, D.P. Francesco, D. Miorandi, D. Tacconi, and I. Chlamtac, “Why Neighborhood Matters: Interests-Driven Opportunistic Data Diffusion Schemes,” Proc. Third ACM Workshop Challenged Networks (CHANTS ’08), pp. 81-88, 2008.
[9] W. Fang, F. Liu, F. Yang, L. Shu, and S. Nishio, “Energy- Efficient Cooperative Communication for Data Transmission in Wireless Sensor Networks,” Consumer Electronics, IEEE Trans., vol. 56, no. 4, pp. 2185-2192, Nov. 2010.
[10] Y. Li, D. Jin, L. Su, and L. Zeng, “Stability and Scalability Properties for Dynamic Content Updates over Delay Tolerant Networks,” Proc. 20th Int’l Conf. Computer Comm. and Networks (ICCCN ’11), pp. 1-6, Aug. 2011.
[11] G. Sollazzo, M. Musolesi, and C. Mascolo, “TACO-DTN: a Time- Aware Content-Based Dissemination System for Delay Tolerant Networks,” Proc. ACM First Int’l MobiSys Workshop Mobile Opportunistic Networking (MobiOpp ’07), pp. 83-90, 2007.
[12] T. Pongthawornkamol, K. Nahrstedt, and G. Wang, “The Analysis of Publish/Subscribe Systems over Mobile Wireless Ad Hoc Networks,” Proc. ACM Fourth Ann. Int’l Conf. Mobile and Ubiquitous Systems: Networking and Services (MobiQuitous ’07), pp. 1-8, Aug. 2007.
[13]A. Carzaniga, D.S. Rosenblum, and A.L. Wolf, “Content- Based Addressing and Routing: A General Model and its Application,” 2000.
[14] P.T. Eugster, P.A. Felber, R. Guerraoui, and A.M. Kermarrec, “The Many Faces of Publish/Subscribe,” ACM Computing Surveys, vol. 35, no. 2, pp. 114-131, 2003.
[15]. [28] W. Hu, J. Wang, X. Gao, Y. Chen, Q. Liu, and G. Li, “Godson-3: A Scalable Multicore Risc Processor with X86 Emulation,” Micro, IEEE , vol. 29, no. 2, pp. 17-29, Mar.-Apr. 2009.
[16] W. Hu, R. Wang, Y. Chen, B. Fan, S. Zhong, X. Gao, Z. Qi, and X.Yang, “Godson-3B: A 1 ghz 40 w 8-Core 128 gflops Processor in 65 nm cmos,” Proc. IEEE Int’l Solid-State Circuits Conf. Digest of Technical Papers (ISSCC ’11), pp. 76-78, Feb. 2011.
[17] A. Broder and M. Mitzenmacher, “Network Applications of Bloom Filters: A Survey,” Internet Math., pp. 636-646, 2002.

Keywords
Security, routing, cryptography, wireless network.