Volume-3 , Issue-1 , Jan - 2015 Go Back

This paper discusses the design of adaptive learningSystem based on student’s learning styles. The system adaptively is based on two learning style models, which are VAK and Felder. The VAK learning styles include visual, auditory, and kinesthetic, while the Felder learning styles include global and sequential. This system will combine these learning styles to alter its course presentation to each student. The system extends the advantages of conventional e-learning which are classroom and platform independence.

Adaptive, E-Learning, Learning Styles, Kinesthetic, Auditory

[1] Khan, B. H. (1997). Web-based instruction (WBI): What is it andwhy is it?In B. H. Khan (Ed.), Web-based instruction (pp. 5-18).Englewood Cliffs, NJ: Educational Technology Publications.
[2] Brusilovsky, P. (1996). Methods and techniques of adaptivehypermedia. User Modeling and User Adapted Interaction, 6(2-3),87-129.
[3] Brusilovsky, P. (2001). Adaptive hypermedia. User Modeling andUser Adapted Interaction, 11, 87-110.
[4] Sohn, B. (2005). E-learning and primary and secondary education inKorea.KERIS Korea Education & Research Information Service,2(3), 6-9.
[5] Gilbert, & Jones, M. G. (2001). E-learning is e-normous. ElectricPerspectives, 26(3), 66-82.
[6] Khan, B. H. (2005). Managing e-learning: Design, delivery,implementation and evaluation. Hershey, PA: Information SciencePublishing.
[7] Lai, K., Pratt, K., & Grant, A. (2003). State of the art and trends indistance, flexible, and open learning: A review of the literature.Dunedin, New Zealand: School of Education, University of Otago.
[8] Saltzbert, S., &Polyson, S. (1995). Distributed learning on theWorld Wide Web. Syllabus, 9(1), 10-12.
[9] Miles-Board, T. J. (2004). Everything integrated: A framework forassociative writing in the web. Unpublished doctoral dissertation,University of Southampton, Southampton.
[10] Kay, J. (2001). Learner control.User Modeling and User AdaptedInteraction, 11(1-2), 111-127.
[11] Oppermann, R., Rashev, R., &Kinshuk. (1997, July 14-16).Adaptability and adaptivity in learning system.Paper presented atthe Knowledge Transfer, London, UK.
[12] Papanikolaou, Grigoriadou, M., Kornilakis, H., &Magoulas, G. D.(2003). Personalizing the interaction in a web-based educationalhypermedia system: The case of INSPIRE.User Modeling and UserAdapted Interaction, 13(3), 213-267.
[13] Bennett, C. (1979). Individual differences and how teachersperceive them. The Social Studies, 70(2), 56-61.
[14] James, W. B., & Blank, W. E. (1993). Review and critique ofavailable learning-style instruments for adults.

Saheli D.Bobade and Poonam A. Manjare, "A Model of Adaptive E-Learning System Based On Thinking and Learning Style," International Journal of Computer Sciences and Engineering, Vol.3, Issue.1, pp.101-104, 2015.

In this paper, we used algorithm for load balancing of workload among the various nodes of grid network by using Ant Colony Optimization (ACO). Load balancing is one in all the most difficult problems in networking that is need to distribute the dynamic work across multiple nodes to confirm that no single node is overloaded. The main contribution of our work is to balance the whole system load whereas making an attempt to maximize and minimize the parameter. Actually when two or more co-positioned ants exchange their knowledge, they extend their movement radius to a bigger domain and this causes better awareness of the environment. There is a similar idea which is inspired from the pheromone deposits from the ants while wandering. Other ants can pursue the ant by using this pheromone deposited. This idea is applied in most of ant colony optimization problems.

Ant Colony Optimization (ACO), Pheromone updation table, Grid Networks, Load Balancing

[1] Kumar Nishant, Pratik Sharma, Vishal Krishna, Chhavi Gupta and Kuwar Pratap Singh Nitin and Ravi Rastogi,” Load Balancing of Nodes in Cloud Using Ant Colony Optimization”, 2012 14th International Conference on Modelling and Simulation”, 978-0-7695-4682-7/12, © 2012 IEEE.
[2] Sandip Kumar Goyal , Manpreet Singh,” Adaptive and Dynamic Load Balancing in Grid Using Ant Colony Optimization”, International Journal of Engineering and Technology (IJET), ISSN : 0975-4024, Vol 4 No 4 Aug-Sep 2012.
[3] M. LAl-Dahoud Ali and Mohamed A. Belal,” Multiple Ant Colonies Optimization for Load Balancing in Distributed Systems”, ICTA’07, April 12-14, Hammamet, Tunisia.
[4] A. D. Ali, and M. A. Belal, “Multiple ant colonies optimization for load balancing in distributed systems,” in Proc. Inter. Conf. (ICTA’07), 2007.
[5] R.A. Arnous, H.A. Arafat and M.M. Salem, Improving the Load Balancing within the Data Network via Modified AntNet Algorithm, Proceedings of the 5th International Conference on Information and Communication Technology, pp. 189-195, 2007.

Vaishnavi Aher,Sayali Khairnar,Madhuri Shinde and Priyanka Shirole, "Load Balancing of node in Network using Ant Colony Optimization," International Journal of Computer Sciences and Engineering, Vol.3, Issue.1, pp.105-108, 2015.

Tree patterns are graphic representations of queries over data trees. They are actually matched against an input data tree to answer a query. Since the turn of the 21st century, an astounding research effort has been focusing on tree pattern models and matching optimization (a primordial issue). We also review and discuss the two main families of approaches for optimizing tree pattern matching, namely pattern tree minimization and holistic matching. We finally present actual tree pattern-based developments, to provide a global overview of this significant research topic. A semantic search engine for XML is presented. X search has a simple query language, suitable for a naive user. It returns semantically related document fragments that satisfy the users query. Query answers are ranked using extended information-retrieval techniques and are generated in an order similar to the ranking. The performance of the different techniques as well as the recall and the precision were measured experimentally. Read the tables information from the corresponding database and generate code for the appropriate databases and convert the tables into XML at file format. This converted XML file is been presented to the user.

XML Streams, Keyword Search, Data Retrieval, Relationship, Semantic, Search Engine, Unstructured Data

[1].Sara Cohen, Jonathan Mamou, Yaron Kanza, Yehoshua Sagiv, “A Semantic Search Over An XML Data”, School of Computer Science and Engineering The Hebrew University of Jerusalem 91904, Israel. Proceedings of the 29th VLDB Conference, Berlin,
Germany, 2003.
[2]S.S. Cohen, Y. Kanza, and Y. Sagiv. “Generating relations from XML documents”. In Proc 9th International Conference on Database Theory, Siena (Italy), Jan. 2003.Springer-Verlag.
[3]L. Quin, “Extensible Markup Language (XML)”, World Wide Web Consortium (W3C), http://www.w3.org/XML/, 2006.
[4]C. Sun, C.-Y. Chan and A. K. Goenka. “Multiway SLCA-based Keyword Search in XML Data”. In Proc. of WWW, 2007.
[5] Joseph Fong, Francis Pang, “Converting Relational Database into XML Document”, Department of Computer Science, City University of Hong Kong - 1529-4188.
[6] Bhavana V. Kumbhare, S. J. Karale, “A Semantic Search Over An XML Data”, International Journal of Advanced Research in Computer Science and Software Engineering.VOL:3, Issue 5,May 2013.
[7]Marouane Hachicha and Jerome Darmont, Member, IEEE Computer Society, “A Survey on XML Tree Patterns”, IEEE Transactions on Knowledge and Data Engineering VOL: 25 NO: 1 YEAR 2013.

Beena Kumari Yadav, Utkarsha S. Deo and Tejaswi S. Kuldharan, "Evaluation of XML Using Tree Pattern Minimization and Holistic Approaches," International Journal of Computer Sciences and Engineering, Vol.3, Issue.1, pp.109-113, 2015.

Now a day’s internet plays major role in our communications. Based on the convergence of routing protocols we can recover the failure network. The slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failure in network, we present the mechanism i.e., Generating Alternating Routing Configurations is called Multiple Routing Configurations. Our proposed MRC guarantees recovery in all singe failure scenarios, using a single mechanism to handle both link and node failure and without knowing root cause of the failure. MRC is strictly connection less and assumes only destination based hop-by-hop forwarding. In this paper we present MRC, and analyze its performance with respect to scalability, back up path lengths and distribution after a failure.

MRC, Scalability, Backup Path Lengths, Load Distribution

[1]. Amund Kvalbein, Audun Fosselie Hansen, Tarik Cicici “Fast IP Network Recovery using Multiple Routing Configurations” IEEE/ACM Transactions on Networking. Vol. 17, No. 2.April 2009
[2]. C.Labovitz, A. Ahuja, A. Bose, and F. Jahanian. “Delayed internet routing convergence”, IEEE/ACM Trans. Networking. Vol.9. no. 3,pp 293-306, Jun. 2001.
[3]. D.D. Clark, “the design philosophy of the DARPA internet protocols”, ACM SIGCOMM, Comput. Commun. Rev., vol. 18, no.4.pp. 106-114, Aug. 1988.
[4]. C.Boutremans, G. Iannaccone, and C.Diot. “ Impact of link failures on VoIP performance.” In Proc. Int . Workshop on Network and Operating System Support m for Digital Audio and video,2002, pp.63-71.
[5]. A.Basu and J.G. Riecke, “Stability isuues in OSPF routing” in Proc. ACM SIGCOMM, San Diego, CA, AUG. 2001, pp. 225-236.

S. Nagaparameshwara Chary, "Generating Alternate Routing Configurations for Fast Network Recovery," International Journal of Computer Sciences and Engineering, Vol.3, Issue.1, pp.114-117, 2015.

The peer to peer network has open nature which leads to exposure of various malicious activities. To eradicate these malicious activities, peers can build trust relationships among them. This paper presents distributed algorithm that enable a peer to reason about trustworthiness of other peers based on past interaction and recommendation. Using this algorithm peers will have their own adjacency trust network. Two modules of trust, service and recommendation are proposed to measure trustworthiness for providing services and giving recommendation. Interactions and recommendations are computed based on importance, recentness and peer satisfaction parameter. Also, while computing recommendation, recommender’s trustworthiness and confidence will be considered.

Peer to Peer Systems; Trust Models; Trust Relationships; Reputation; Networking; Network Security

[1] F. Cornelli, E. Damiani, S .D. C. di Vimercati, S. Paraboschi, and P. Samarati,” Choosing Reputable Servents in P2P Network,” Proc. 11th World Wide Web Conf. (WWW), 2002
[2] A.A. Selcuk, E. Uzun, and M.R. Pariente, “A Reputation-Based Trust Management System for P2P Networks, ” Proc. IEEE/ ACM Forth Int’I Symp. Cluster Computing and the Grid (CCGRID) , 2004.
[3] J. Kleinberg, “ The Small-World Phenomenon: An Algorithmic Perspective,” Proc. 32nd ACM Symp. Theory of Computing, 2000
[4] S. Saroiu, P. Gummadi, and S. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems, “Proc. Multimedia Computing and Networking, 2002.
[5] M. Ripeanu, I. Foster, and A. Lamnitchi, “Mapping The Gnutella Network: Properties of Large-scale Peer-to-Peer Systems and Implications for System Design, “IEEE Internet Computing, Vol.6,no. 1,pp. 50-57, Jan. 2002
[6] S. Saroiu, K. Gnummadi, R. Dunn, S.D. Gribble, and H.M. Levy, “An Analysis of Internet Content Delivery System, “ Proc. Fifth USENIX Symp. Operating System Design and Implementation (OSDI), 2002.
[7] Y. Zhong, “Formation of Dynamic Trust and Uncertain Evidence for User Authorization,” PhD thesis, Dept. of Computer Science, Purdue Univ., 2004.
[8] D.H. McKnight, “Conceptualizing Trust: A Typology and E-Commerce Customer relationships Model,” Proc. 34th Ann. Hawaii Int’I conf. System Science (HICSS) , 2001.
[9] C. Dellarocas, “Immunizing Online Reputation Reporting Systems Against Unfair Ratings and Discriminatory Behavior,” Proc. Second ACM Conf. Electronic Commerce (EC), 2000.
[10] S. Xiao and I. Benbasat,” The Formation of Trust and Distrust in Recommendation agents in Repeated Interactions: A process-tracing Analysis,” Proc. Fifth ACM Conf. Electronic Commerce (EC), 2003.

Roshan Bhandure, Siddharth Gujrathi, Jangila Basumatary, Pooja Padekar , Rakesh Shirsath, "Secure Trust Model for Peer to Peer Network," International Journal of Computer Sciences and Engineering, Vol.3, Issue.1, pp.118-126, 2015.

In networked system, peer-to-peer systems are widely used in today’s world. Widely growing networks and openness of networked systems brings some sort of insecurities in the interactions and operations. Hence, in this paper, we make a trust network first. In this trust network model, we make some trust relationships between systems or peers which are going to interact. So that, this helps peers to make decisions whether to interact with particular peer or system or not.

Peer-to-Peer Systems, Trust Management, Reputation, Security

[1] K. Aberer and Z. Despotovic, “Managing Trust in a Peer-2-PeerInformation System,” Proc. 10th Int’l Conf. Information and KnowledgeManagement (CIKM), 2001.
[2] F. Cornelli, E. Damiani, S.D.C. di Vimercati, S. Paraboschi, and P.Samarati, “Choosing Reputable Servents in a P2P Network,” Proc.11th World Wide Web Conf. (WWW), 2002.
[3] S. Kamvar, M. Schlosser, and H. Garcia-Molina, “The (Eigentrust)Algorithm for Reputation Management in P2P Networks,” Proc.12th World Wide Web Conf. (WWW), 2003.
[4] L. Xiong and L. Liu, “Peertrust: Supporting Reputation-BasedTrust for Peer-to-Peer Ecommerce Communities,” IEEE Trans.Knowledge and Data Eng., vol. 16, no. 7, pp. 843-857, July 2004.
[5] A.A. Selcuk, E. Uzun, and M.R. Pariente, “A Reputation-BasedTrust Management System for P2P Networks,” Proc. IEEE/ACM

Dipti S. Borade, Kalpana S. Gulwe, Ganesh R. Chaudhari, Satish N. Aghav and Mayur A. Ahire, "Trust Model for Peer-To-Peer Systems," International Journal of Computer Sciences and Engineering, Vol.3, Issue.1, pp.127-129, 2015.

Cloud computing is the key powerhouse in numerous organizations due to shifting of their data to the cloud environment. The use of cloud computing has been increased rapidly in various organizations as it provides multiple benefits in terms of low cost and accessibility of data. There are different types of issues have been observed in cloud computing environment that need to be addressed. In the past, International Data Corporation (IDC) conducted a survey of 263 IT executives to gauge their opinion about the usage of IT cloud services in companies. As a result, Security was ranked first and observed utmost issue of cloud computing. So nowadays, protection of data in cloud is a big deal. Organizations mislay control over the data as soon as data moves to the cloud. Thus, protection needed to secure data is directly proportional to the value of the data.The first level of security where cryptography can help cloud computing is secure storage .There are already some cloud providers that have started providing secure storage services but offering different levels of protection.The major handicap of secure storage is that we cannot outsource the processing of this data without decrypting it before or without revealing the keys used for encryption. In this paper, various techniques to secure data access in cloud environment has been analyzed and during analysis it is observed that security need to be addressed for securing transaction in such a way that transaction should be encrypted and not be decrypted during access. Moreover, access should be provided to the users as per their access rights. Security can be enhanced by use of multi cloud as single cloud that become less popular with customers due to risks of service availability failure and the possibility of malicious insiders in the single cloud.

Cloud Computing,Single Cloud,Multi Cloud,Homomorphic Encryption,HELIB

[1] Introduction to cloud computing architecture [online]. Sun Microsystems USA: Santa Clara:Sun Microsystems 2009.URL:http://http://www.scribd.com/doc/17274860/Introduction-to-Cloud-Computing-Architecture, Accessed 08 June 2010.
[2] Peter Mell, and Tim Grance, Draft NIST Working Definition of Cloud Computing, 2009: from http://csrc.nist.gov/groups/SNS/cloud-computing/
[3] Michael Armbrust et al. Above the Clouds: A Berkeley View of Cloud Computing Technical report EECS-2009-28,UCBerkeley,http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-28.html, Feb 2009.
[4] Amazon Elastic Computing Cloud, aws.amazon.com/ec2
[5] Cloud Hosting, CLoud Computing and Hybrid Infrastructure from GoGrid, http://www.gogrid.com
[6] FlexiScale Cloud Comp and Hosting, www.flexiscale.com
[7] Cloud computing [online].Cloud computing Asia: 2010.URL:http://www.cloudcomputinglive.com/asia/platform-as-a-service.html, Accessed December 08,2010.
[8] Google App Engine, URL http://code.google.com/appengine
[9] Windows Azure, www.microsoft.com/azure
[10] Salesforce CRM, http://www.salesforce.com/platform
[11] What is Saas and What are its advantages?[online]. Metaquote Software corp:2008-2011.URL:http://www.teamwox.com/en/teamwox/tutorials/71,Accessed September 15, 2010.
[12] Dedicated Server, Managed Hosting, Web Hosting by Rackspace Hosting, http://www.rackspace.com
[13] SAP Business ByDesign, www.sap.com/sme/solutions/
[14] Laying the ground work for Public cloud and Private Cloud [online]. Dell inc: 15 June2010.URL: http://whitepapers.businessweek.com/data/memberRegister.do,Accessed July 06,2010.
[15] CloudComputing UseCases White Paper [online]. SA(shared alike): July 2,2010. URL: http://www.scribd.com/doc/18172802/Cloud-Computing-Use-Cases-Whitepaper, Accessed July 21,2010.
[16] A community approach to cloud computing [online]. Orange Business Services:July-August 2010.URL:http://www.orangebusiness.com/en/mnc2/footer/news/enterprise_briefing/summer2010/cloud-computing.jsp ,Accessed July 23, 2010
[17] Deloitte. Executive Forum - Cloud Computing: risks, mitigation strategies, and the role of Internal Audit. Available: http://www.deloitte.com
[18] C. Pettey and B. Tudor. Gartner says worldwide cloud services market to surpass $68 billion in 2010 Available: http://www.gartner.com/it/page.jsp?id=1389313
[19] Cloud Computing Services - New Market Report Published.Available:http://www.companiesandmarkets.com/r.ashx?id=41AETZYHJ289173&prk=ecb8413c602cb89051067456b636c7b9 , Press Office. (2010, 31 August 2010).
[20] Xing Zhou, Xiaofei Tang, Research and Implementation of RSA Algorithm for Encryption and Decryption, Department of Computer Science and Technology Harbin, china,2011.
[21] Eman M.Mohamed, Hatem S. Abdelkader, Sherif EI-Etriby ―Enhanced Data Security Model for Cloud Computing‖, The 8th International Conference on Informatics and Systems (INFOS2012) - 14-16 May Cloud and Mobile Computing Track.
[22] Dubey, Ashutosh Kumar, M. Namdev, and Shiv Shakti Shrivastava. "Cloud-user security based on RSA and MD5 algorithm for resource attestation and sharing in java environment",Software Engineering (CONSEG), 2012 CSI Sixth International Conference on IEEE, 2012.
[23] Prashant Rewagad, yogita pawar,” Use of Digital Signature with Diffie Hellman Key Exchange and AES Encryption Algorithm to Enhance Data Security in Cloud Computing”, CSNT '13 Proceedings of the 2013 International Conference on Communication Systems and Network Technologies IEEE computer society Washington,DC, Page No. ( 437-439 ),USA2013.
[24] Alowolodu, Ogundele, “Elliptic Curve Cryptography for Securing Cloud Computing Applications”, International Journal of Computer Applications, Vol.- 66, No. -23, March 2013.
[25] Radhika G, K.V.V. Satyanarayana, Tejaswi A,” Efficient Framework for Deploying Information in Cloud Virtual Datacenters with Cryptography Algorithms”, International Journal of Computer Trends and Technology- volume-4,Issue-3,2013.
[26] Hongwei Li1, Yuanshun Dai1, 2, Bo Yang1,” Identity-Based Cryptography for Cloud Security” http://eprint.iacr.org/2011/169.pdf.
[27] R. Rivest, L. Adleman and M. Dertouzos, “On Data Banks And Privacy Homomorphisms”, Foundations of Secure Computation, Page No. (169–180),1978.
[28] C. Gentry, “A Fully Homomorphic Encryption Scheme”, PhD Thesis, Stanford University, http://crypto.stanford.edu/craig, 2009.
[29] C. Gentry. , “ Fully homomorphic encryption using ideallattices”, In Proc. of STOC, ACM, Page No(169-178)., 2009
[30] M. van Dijk, C. Gentry, S. Halevi and V. Vaikuntanathan, “FullyHomomorphic Encryption Over the Integers”, Advances in Cryptology, Eurocrypt 2010, Lecture Notes in Computer Science, Page No. (24–43), 2010.
[31] Z. Brakerski, C. Gentry and V. Vaikuntanathan, “Fully Homomorphic Encryption without Bootstrapping”, Innovations in Theoretical Computer Science Conference, Page No. (309–325), 2012.
[32] C. Gentry, S. Halevi and N. Smart, “Homomorphic Evaluation Of The AES Circuit”, Advances in Cryptology, Crypto 2012, Lecture Notes in Computer Science, Page No.( 850–867), 2012.
[33] N. Smart and F. Vercauteren, “Fully Homomorphic SIMD Operations”, Designs, Codes and Cryptography, 2012.
[34] C. Gentry, “Computing Arbitrary Functions Of Encrypted Data”, Communications Of The ACM, Page No.( 97–105), 2010.
[35] C. Gentry and S. Halevi, “Implementing Gentry’s Fully-Homomorphic Encryption Scheme”, Advances in Cryptology, EuroCrypt 2011, Lecture Notes in Computer Science, Page No.( 129–148), 2011.
[36] M. Naehrig, K. Lauter and V. Vaikuntanathan, “Can Homomorphic Encryption Be Practical? ”, ACM Workshop on Cloud Computing Security Workshop, Page No.( 113–124), 2011.
[37] Smart, N. P., & Vercauteren, F. ,” Fully homomorphic encryption with relatively small key and ciphertext sizes In Public Key Cryptography–PKC”, Springer Berlin Heidelberg, Page No(420-443),2010.
[38] Cramer, R., Damgård, I., & Nielsen, J. B. ,”Multiparty computation from threshold homomorphic encryption”, Springer Berlin Heidelberg ,Page No( 280-300),2001.

Rachna Jain, Sushila Madan and Bindu Garg, "Analyzing Various Existing Security Techniques to Secure Data Access in Cloud Environment," International Journal of Computer Sciences and Engineering, Vol.3, Issue.1, pp.130-135, 2015.

A Mobile AdHoc Network(MANET) consists of wireless hosts that may have various degree of mobility. Movement of hosts resulting in a change of topology which require some mechanism establishing the fresh route through mobile nodes and also determining new routes in case of failures. Several routing protocol based on routing information update mechanism, use of temporal information, routing topology, and utilization of specific resources. Proactive and reactive routing protocols have already been proposed based on routing information update mechanism for adhoc networks. Location Aided Routing(LAR) can be classified as the routing protocol based on specific resources like Global Positioning System. LAR is a routing mechanism which attempts to reduce the control message overhead of AdHoc on demand distance vector(AODV) routing protocol by flooding only the portion of the network that is likely to contain the route to destination. LAR takes the advantage of resource like GPS coordinates to identify a possible location of the destination node. Based on this information, LAR defines a portion of the network which called a request zone which will be subject to the limited flooding, thus reducing the total number of the control packet travelling through the network during the route discovery process. LAR-I algorithm, which determine the request zone and the expected zone in the process of route discovery. The significant communication overhead can be avoided if the routing strategy is changed. Different strategy of request zone can be used for that in Location Aided Routing e.g., Triangle and Rectangle request zone. Performance of MANET widely depends on the node mobility which was important parameter.

LAR, Routing Protocol, GPS, Request Zone

[1] Siva Ram Murthy, C. and B. S. Manoj. Ad hoc Wireless Networks: Architectures and Protocols. 1St Edn. , Prentice Hall, USA, pp: 880, 2004.
[2] Ehsan H, Uzmi ZA,“ Performance Comparison Of Ad Hoc Wireless Network Routing Protocols,” Proceedings of INMIC, pp. 475-465, Dec, 2004.
[3] Abolh asan M, Wyosocki T , Dutkiewicz E,“ A review of routing protocols for mobile ad hocnetworks,”Journal of ad hoc networks 1: pp.1-22, 2004
[4] Y.B. Ko and N. H. Vaidya, "Location-Aided Routing in Mobile Ad Hoc-Scale for Ad Hoc Networks," Proceedings of the second ACM international symposium on Mobile ad hoc networking & computing, Long Beach, CA, USA, Wireless Networks (6)307–321, 2000.
[5] Gergely V. Záruba, Vamsi K. Chaluvadi, and Azeem M. Suleman, “LABAR: Location Area Based Ad Hoc Routing for GPS-Scarce Wide-Area Ad Hoc Networks”IEEE;00, 2003,7-7669955-1-1889953;0-13.
[6] B. Karp and H. Kung,. “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks” in: Proceedings of ACM MobiCom, 2000, pp. 243–254.
[7] Tzay-Farn Shih and Hsu-Chun Yen, “Location-aware routing protocol with dynamic adaptation ofrequest zone for mobile ad hoc networks”, Springer Wireless Network,14:321–333,DOI 10.1007/s11276-006- 9955-y, 2008.
[8] Mohammad A. Mikki, “Energy Efficient Location Aided Routing Protocol for Wireless MANETs” International Journal of computer science and Information Security, Vol. 4, No.1 & 2, pp 331-337, 2009.
[9] Karim El Defrawy, Member, and Gene Tsudik, Senior Member,“Privacy-Preserving Location-Based On- Demand Routing in MANETs” IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, ( 29): 10,1926-1934, 2011.
[10] Haiying Shen and Lianyu Zhao ALERT, “An Anonymous LocationBased Efficient Routing Protocol in MANETs” IEEE TRANSACTIONS ON MOBILE COMPUTING, 2013, (12) 6:1079-1093.

Ajay Prasad and Kiran Gautam, "Analysis of Location Aided Routing Protocols for MANETs: A Literature Survey," International Journal of Computer Sciences and Engineering, Vol.3, Issue.1, pp.136-140, 2015.

Now a days, there are many possible ways to transmitting the data. Any communication of internet and networks application requires security. During the transmission confidential data can be hacked in different ways. So privacy and security are very important issues at the time of transmission over the internet. Steganography is the art of hiding information in other information. It is going to gain its importance due to the exponential growth and confidential communication of potential computer users over the internet. In image Steganography, secret communication is achieved to embed a message into cover image and generate a stego- image. There are different type data hidings techniques are used for secure data transmission. In this paper describes the different data hiding techniques for secure data transmission.

Secure image transmission, Data hiding, Steganography

[1]. Information Hiding: First International Workshop, R. J. Anderson, Editor, Lecture Notes in Computer Science 1174, Isaac Newton Institute, Cambridge, England, Springer-Verlag May 1996
[2]. An overview of image steganography by T. Morkel.
[3]. MamtaJuneja and Parvinder Singh Sandhu, (2013) “A New Approach for Information security using an Improved Steganography Technique”, Journal of Info.Pro.Systems, Vol 9, No:3, pp.405-424
[4]. N. F. Johnson and S. Katzenbeisser, “A Survey of steganographic techniques.in Information Hiding Techniques for Steganography and Digital Watermarking”, Artech House, (2000), pp. 43-78
[5]. J. Fridrich, M. Goljan, and R. Du, “Invertible authentication,” In Proc. of the SPIE, Security and Watermarking of Multimedia Jan. 2001.
[6]. D. Zou, Y. Q. Shi, Z. Ni, and W. Su, “A semi-fragile lossless digital watermarking scheme based on integer wavelet transform,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 16, no. 10, pp. 1294-1300, Oct. 2006.
[7]. S. W. Jung, L. T. Ha, and S. J. Ko, “A new histogram modification based reversible data hiding algorithm considering the human visual system,” IEEE Signal Processing Letters, vol. 18, no. 2, pp 95-98, Feb. 2011 .
[8]. Wen-Chung Kuo, Dong-Jin Jiang, Yu-Chih Huang, “A Reversible Data Hiding Scheme Based on Block Division”, Congress on Image and Signal Processing, Vol. 1, 27-30 May 2008.
[9]. J. Tian, “Reversible data embedding using difference expansion,” IEEE Trans. Circuits Syst. Video Technol., vol. 13, no. 8, pp. 890–896,Aug. 2003.
[10]. L. Kamstra and H. J. A. M. Heijmans, Reversible data embedding into images using wavelet techniques and sorting,” IEEE Transactions on Image Processing, vol. 14, no. 12, pp. 2082-2090, Dec. 2005.
[11].D. M. Thodi and J. J. Rodríguez, “Expansion embedding techniques for reversible watermarking,” IEEE Transactions on Image Processing, vol. 16, no. 3, pp. 721-730, Mar. 2007.
[12].Y. Hu, H. K. Lee, and J. Li, “DE-based reversible data hiding with improved overflow location map,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 19, no. 2, pp. 250-260, Feb. 2009.
[13].Coltuc, “Improved embedding for prediction-based reversible watermarking,” IEEE Transactions on Information Forensics and Security, vol. 6, no. 3, pp. 873-882, Sept. 2011.

Thanima Davis, Manish T.I and Dr. M. Azath, "Survey on Data Hiding Techniques for Secure Image Transmission," International Journal of Computer Sciences and Engineering, Vol.3, Issue.1, pp.141-144, 2015.

Today’s technical then lawful landscape gifts formidintelligent trials to distinct facts privacy. Distinct facts deposited in the rainraincloud may cover explanation numbers, passwords, notes, then extra important info thon could be used then misused via a miscreant, a competitor, or a court of law. These facts are cached, copied, then archived via rainraincloud facility providers (csps), regularly without users’ authorization then control. In practical self-destructing facts systems thon safe subtle facts meanwhile disclosure in our really mobile, social-networked, cloud-devious world. Self-destructing facts largely purposes on defensive the operator data’s privacy. All the facts then their replicas grow destructed or unreadintelligent afterward a user-stated time, without around operator intervention. In addition, the decryption key is destructed afterward the user-stated time. In this paper, we prereferred sedas, a scheme thon come crosswise this examination complete a single addition of unequal key means with dynamic packing means founded on t10 osd standard. Related to the scheme without selfdestructing facts mechanism, amount aimed at uploading then transferring with the planned sedas adequately decreases via fewer than 72%, smooth nevertheless dormancy aimed at upload/downloadvertisement events with self-destructing facts maneuver upsurges via fewer than 60%.

Dynamic Storage, Rainraincloud Computing, Facts Privacy, Self-Destructing Data

[1] I. F. Akyildiz, X. Wang, and W. Wang, “Wireless Mesh Networks: A Survey”, Computer Networks and ISDN Systems, Vol.47, Issue-2, 2005, pp.445-487.
[2] I. F. Akyildiz, and X. Wang, “A Survey on Wireless Mesh Networks”, IEEE Radio Communications, Vol.43, Issue-3, 2005, pp.23-30.
[3] M. Lee et al., “Emerging Standards for Wireless Mesh Technology”, IEEE Wireless Communications, Vol.13, Issue-4, 2006, pp.56-63.
[4] N.B. Salem, and J-P Hubaux, “Securing Wireless Mesh Networks”, IEEE Wireless Communications, Vol.13, Issue-2, 2006, pp.50-55.
[5] S. Han, E. Chang, L. Gao, T. Dillon, T., Taxonomy of Attacks on Wireless Sensor Networks, in the Proceedings of the 1st European Conference on Computer Network Defence (EC2ND), University of Glamorgan, UK, Springer Press, SpringerLink Date: December 2007.
[6] C. Karlof and D. Wagner, “Secure routing in wireless sensor networks: attacks and countermeasures,” Ad Hoc Networks 1, 2003, pp. 293-315.
[7] Y. Yang, Y. Gu, X. Tan and L. Ma, “A New Wireless Mesh Networks Authentication Scheme Based on Threshold Method,” 9th International Conference for Young Computer Scientists (ICYCS-2008), 2008, pp. 2260-2265.
[8] Iyengar, A. ; Res. Div., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA,” Scalability of dynamic storage allocation algorithms”, Published in: Frontiers of Massively Parallel Computing, 1996. Proceedings Frontiers '96., Sixth Symposium on the Date of Conference: 27-31 Oct 1996 Page(s): 223 – 232.
[9] Krish, K.R. ; Khasymski, A. ; Butt, A.R. ; Tiwari, S.” AptStore: Dynamic Storage Management for Hadoop”, Published in: Cloud Computing Technology and Science (CloudCom), 2013 IEEE 5th International Conference on (Volume:1 ) Date of Conference: 2-5 Dec. 2013 Page(s): 33 – 41.
[10] Krish, K.R. ; Virginia Tech, Blacksburg, VA, USA ; Khasymski, A. ; Butt, A.R. ; Tiwari, S.” AptStore: Dynamic storage management for hadoop”, Published in: Cluster Computing (CLUSTER), 2013 IEEE International Conference on Date of Conference: 23-27 Sept. 2013 Page(s): 1 – 5.
[11] Bouguettaya, A.R.A. ; Virginia Tech ; Eltoweissy, M.Y.” Privacy on the Web: facts, challenges, and solutions”, Published in: Security & Privacy, IEEE (Volume:1 , Issue: 6 ) Page(s): 40 – 49.
[12] Ningning Cheng ; Dept. of Comput. Sci., Univ. of California, Davis, Davis, CA, USA ; Xinlei Wang ; Wei Cheng ; Mohapatra, P.” Characterizing privacy leakage of public WiFi networks for users on travel”, Published in: INFOCOM, 2013 Proceedings IEEE Date of Conference: 14-19 April 2013 Page(s): 2769 – 2777.
[13] Shokri, R. ; LCA, EPFL, Lausanne, Switzerland ; Theodorakopoulos, G. ; Le Boudec, J.-Y. ; Hubaux, J.-P.” Quantifying Location Privacy”, Published in: Security and Privacy (SP), 2011 IEEE Symposium on Date of Conference: 22-25 May 2011 Page(s): 247 – 262.
[14] Tao Shu ; Dept. of CSE, Oakland Univ., Rochester, NY, USA ; Yingying Chen ; Jie Yang ; Williams, A.” Multi-lateral privacy-preserving localization in pervasive environments”, Published in: INFOCOM, 2014 Proceedings IEEE Date of Conference: April 27 2014-May 2 2014 Page(s): 2319 – 2327.
[15] Yanjiang Yang ; Inst. for Infocomm Res., Singapore ; Xiaoxi Han ; Feng Bao ; Deng, R.H.” A smart-card-enabled privacy preserving E-prescription system”, Published in: Information Technology in Biomedicine, IEEE Transactions on (Volume:8 , Issue: 1 ) Page(s): 47 – 58.
[16] Lingfang Zeng ; Wuhan Nat. Lab. for Optoelectron., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Shibin Chen ; Qingsong Wei ; Dan Feng, “SeDas: A Self-Destructing Data System Based on Active Storage Framework”, Published in: Magnetics, IEEE Transactions on (Volume:49 , Issue: 6 ) Page(s): 2548 – 2554.
[17] Fengshun Yue ; Sch. of Inf. Sci. & Eng., Central South Univ., Changsha, China ; Guojun Wang ; Qin Liu “A Secure Self-Destructing Scheme for Electronic Data”, Published in: Embedded and Ubiquitous Computing (EUC), 2010 IEEE/IFIP 8th International Conference on Date of Conference: 11-13 Dec. 2010 Page(s): 651 – 658.
[18] Xiao Fu ; Coll. of Comput. & Inf., Hohai Univ., Nanjing, China ; Zhijian Wang ; Hao Wu ; Jia-qi Yang “How to Send a Self-Destructing Email: A Method of Self-Destructing Email System” Published in: Big Data (BigData Congress), 2014 IEEE International Congress on Date of Conference: June 27 2014-July 2 2014 Page(s): 304 – 309.
[19] Lingfang Zeng ; Wuhan Nat. Lab. for Optoelectron., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Shibin Chen ; Qingsong Wei ; Dan Feng “SeDas: A self-destructing data system based on active storage framework”, Published in: APMRC, 2012 Digest Date of Conference: Oct. 31 2012-Nov. 2 2012 Page(s): 1 – 8.
[20] Lingfang Zeng ; Inf. Storage Div., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Zhan Shi ; Shengjie Xu ; Dan Feng “SafeVanish: An Improved Data Self-Destruction for Protecting Data Privacy”, Published in: Cloud Computing Technology and Science (CloudCom), 2010 IEEE Second International Conference on Date of Conference: Nov. 30 2010-Dec. 3 2010 Page(s): 521 – 528.

R.Aishwarya and S.Ramya , "SEDAS: Self - Destruction Facts Scheme Aimed At Circulated Thing Founded Dynamic Packing Frame Exertion," International Journal of Computer Sciences and Engineering, Vol.3, Issue.1, pp.145-151, 2015.