Volume-3 , Issue-10 , Oct - 2015 Go Back

Data de-duplication is a data compression technique which is used to eliminate the duplicates for the repeated data. It is been extensively used in the cloud storage to minimize the amount of storage size and save maximum bandwidth. The convergent technique is been suggested, to encrypt the data before outsourcing to protect the confidentiality for the sensitive data while using de-duplication. In order to provide better data security, a hybrid cloud is been proposed. A hybrid cloud is a combination of private cloud and public cloud bound together. Private cloud is a place where some critical activities can be performed like security, setting the privileges to the users, setting the token number etc. whereas the public cloud is a place where some noncritical activities are performed like outsourcing an encrypted file. This paper formally addresses authorization with data de-duplication; we present several new de-duplications supporting the authorized duplicate check in the hybrid cloud architecture. In this paper we attempt to address the authorized de-duplication check, combined with convergent encryption for providing the better security to the sensitive data using the hybrid cloud architecture.

Deduplication; authorized duplicate check; confidentiality; hybrid cloud

[1] Mihir Bellare, Sriram Keelveedhi, and Thomas Ristenpart “Dupless: Server-Aided Encryption for Deduplicated Storage”, SEC'13 Proceedings of the 22nd USENIX conference on Security, ISBN: 978-1-931971-03-4, Pages 179-194, USENIX Association Berkeley, CA, USA ©2013.
[2] Paul Anderson and Le Zhang, “Fast and secure laptop backups with encrypted de-duplication”, LISA'10 Proceedings of the 24th international conference on Large installation system administration, Article No. 1-8, USENIX Association Berkeley, CA, USA ©2010.
[3] Shweta Pochhi and Vanita Babanne,”A Survey on Secure and Authorized Data Deduplication”, International Journal of Science and Research (IJSR),Volume 3 Issue 11, November 2014.
[4] Jin Li, Xiaofeng Chen, Mingqiang Li, Jingwei Li, P. Lee, and Wenjing Lou “Secure deduplication with efficient and reliable convergent key management”, IEEE Transactions on Parallel and Distributed Systems (TPDS), volume:25, Issue 6 2014.
[5] Shai Halevi, Danny Harnik, Benny Pinkas, and Alexandra Shulman-Peleg, “Proofs of ownership in remote storage systems”, CCS '11 Proceedings of the 18th ACM conference on Computer and communications security, ISBN: 978-1-4503-0948-6, Pages 491-500, ACM New York, NY, USA ©2011.
[6] S. Bugiel, S. Nurnberger, A. Sadeghi, and T. Schneider, “Twin clouds: An architecture for secure cloud computing”, In Workshop on Cryptography and Security in Clouds (WCSC 2011), 2011.
[7] NIST’s Policy on Hash Functions, Available: http://csrc.nist.gov/groups/ST/hash/policy.html [Online]., Sept. 2012.
[8] D. Meister and A. Brinkmann, “Multi-Level Comparison of Data Deduplication in a Backup Scenario”, SYSTOR '09 Proceedings of SYSTOR 2009: The Israeli Experimental Systems Conference, ISBN: 978-1-60558-623-6, Article No. 8, ACM New York, NY, USA ©2009.
[9] J.S. Plank and L. Xu, “Optimizing Cauchy Reed-Solomon Codes for Fault-Tolerant Network Storage Applications”, in Proc. 5th IEEE Int’l Symp. NCA, Cambridge, MA, USA, July 2006, pp.173-180.
[10] M.O. Rabin, “Fingerprinting by Random Polynomials”, Center for Research in Computing Technology, Harvard University, Cambridge, MA, USA, Tech. Rep. TR-CSE-03-01, 1981.
[11] M.O. Rabin, “Efficient Dispersal of Information for Security, Load Balancing, Fault Tolerance”, J. ACM, vol. 36, no. 2, pp. 335-348, Apr. 1989.
[12] A. Rahumed, H.C.H. Chen, Y. Tang, P.P.C. Lee, and J.C.S. Lui, “A secure Cloud Backup System with Assured Deletion and Version Control”, In Proc. 3rd Int’l Workshop Security Cloud Computing, pp. 160-167, 2011.
[13] A.D. Santis and B. Masucci, “Multiple Ramp Schemes”, IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1720-1728, July 1999.
[14] M.W. Storer, K. Greenan, D.D.E. Long, and E.L. Miller, “Secure Data Deduplication”, in Proc. StorageSS, pp. 1-10, 2008.
[15] Jin Li, Yan Kit Li, Xiaofeng Chen, Patrick P. C. Lee, Wenjing Lou “A Hybrid Cloud Approach for Secure Authorized De-duplication”, in vol: pp no-99, IEEE, 2014.
[16] J. R. Douceur, A. Adya, W. J. Bolosky, D. Simon, and M. Theimer, “Reclaiming space from duplicate files in a serverless distributed file system”, In ICDCS, pages 617–624, 2002.
[17] D. Ferraiolo and R. Kuhn, “Role-based access controls”, In 15th NIST-NCSC National Computer Security Conf., 1992.
[18] V.P.Muthukumar and R.Saranya, "A Survey on Security Threats and Attacks in Cloud Computing", International Journal of Computer Sciences and Engineering, Page No : 120-125, Volume-02 , Issue-11, E-ISSN: 2347-2693, Nov -2014.

J. Suresh and S. Jhansi Rani, "Secure Authorized Deduplication Based on Hybrid Cloud Approach," International Journal of Computer Sciences and Engineering, Vol.3, Issue.10, pp.1-5, 2015.

Wireless Sensor Network is an auspicious network in which wireless sensors are disseminated in a region for examining the physical world. Wireless sensor network consists of nodes called sensor nodes that does data acquisition and transmit the acquired data to sink. Since the power source has limited energy, so to prolong the lifetime of WSNs clustering is considered as an effective technique. One of the clustering techniques is Stable Election Protocol. The communication among nodes leads to loss of energy. Once, the energy of node is bygone then that node is declared as dead node and hence the network becomes shaky. The goal of SEP protocol is to improve the stability period of a network. So this paper focuses on increasing the stability period of WSN using Genetic Algorithm (GA). The GA is applied on SEP for the proficiency in stability period.

Wireless Sensors Network, clustering, energy, stable election protocol, genetic algorithm

[1] Sreehari, M., Sreehari, M., Naik, L. and Raju, S. “Extended Stable Election Protocol for increasing lifetime of the WSN”, International Journal of Engineering Research and Applications, Jan 2015, pp. 39-42.
[2] Ma, W., Cao, Y., Wei, W., Hei, X. and Ma, J. “Energy-Efficient Collaborative Communication for Optimization Cluster Heads Selection Based on Genetic Algorithms in Wireless Sensor Networks”, International Journal of Distributed Sensor Networks, Sep 2014, pp. 1-11.
[3] AboZahhad, M., Ahmed, M.S., Sabor, N. and Sasaki, S. “A New Energy-Efficient Adaptive Clustering Protocol Based on Genetic Algorithm for Improving the Lifetime and the Stable Period of Wireless Sensor Networks”, International Journal of Energy, Information and Communications, Vol. 5, 2014, pp. 47-72.
[4] Rehma, O., Javaid, N., Manzoor, B., Hafeezl, A., Iqbal, A. and Ishfaq, M. “Energy Consumption Rate based Stable Election Protocol for WSNs”, International Workshop on Body Area Sensor Networks, 2013, pp. 932-937.
[5] Charanpreet Kaur and Amit Chhabra, "An Energy Efficient Multihop Routing Protocol for Wireless Sensor Networks", International Journal of Computer Sciences and Engineering, Volume-03, Issue-07, Page No (86-91), Jul -2015, E-ISSN: 2347-2693
[6] Khan, A.A., Javaid, N., Qasim, U., Lu, Z. and Khan, A.Z. “HSEP: Heterogeneity-aware Hierarchical Stable Election Protocol for WSNs”, Seventh International Conference on Broadband, Wireless Computing, Communication and Applications, IEEE, 2012, pp. 373-378.
[7] Kashaf, A., Javaid, N., Khan, A.Z. and Khan, A.I. “TSEP: Threshold-sensitive Stable Election Protocol for WSNs”, International Conference on Frontiers of Information Technology, IEEE, 2012, pp.164-168.
[8] Baranidharan, B. and Santhi, B. “An Evolutionary Approach to Improve the Lifetime of the Wireless Sensor Network”, Journal of Theoretical and Applied Information Technology, Vol. 33, No.2, Nov 2011, pp. 177-183.
[9] Hussain, S., Matin W.A. and Islam, O. “Genetic Algorithm for Energy Efficient Clusters in Wireless Sensor Networks”, International Conference on Information Technology, IEEE, 2007, pp. 147-154.
[10] Haibo, Z., Yuanming, W. and Guangzhong, X. “EDFM：A Stable Election Protocol based on Energy Dissipation Forecast Method for Clustered Heterogeneous Wireless Sensor Networks”, IEEE, 2009, pp. 1-4.
[11] Islam, M., M., Matin, A., M. and Mondol, K., T. “Extended Stable Election Protocol (SEP) for Three- level Hierarchical Clustered Heterogeneous WSN”, Wireless Sensor System, IEEE, pp. 1-4. 2010.
[12] Smaragdakis G., Matta I., Bestavros A. “SEP: A Stable Election Protocol for clustered heterogeneous wireless sensor networks”, Proc of the International Workshop on SANPA 2004, pp. 251-261, 2004.
[13] Ferentinos P.,K. and Tsiligriidis A., T. “Adaptive design optimization of wireless sensor network using genetic algorithms”, 2nd Conference on Sensor and Ad Hoc Communication and Networks, Vol. 51, 2007, pp. 1031-1051
[14] D. Suresh and K. Selvakumar, "A Hop Based Robust Routing Protocol in Wireless Sensor Network", International Journal of Computer Sciences and Engineering, Volume-02, Issue-08, Page No (78-81), Aug -2014, E-ISSN: 2347-2693
[15] Anastasi, G., Conti M., Francesco, M. D. and Passarella, A.”Energy conservation in wireless sensor networks: A survey”, Ad Hoc Networks, Vol. 7, June 2008, pp. 537–568.
[16] Younis, O. and Fahamy, S. “Distributed clustering in ad-hoc sensor networks: A hybrid, energy-efficient approach”, in Proc. IEEE INFOCOM, Mar. 2004, Vol. 1, pp. 629–640.

Jasmeet Kaur and Sukhwinder Sharma, "Genetic Algorithm based Stable Election Protocol for WSN," International Journal of Computer Sciences and Engineering, Vol.3, Issue.10, pp.6-10, 2015.

This paper presents efficient clustering with side information using probabilistic latent Semantic indexing. Meta information is available in many texts mining application. It may be useful or sometimes it is a risky approach to add side information. The aim of this work is to resolve clustering problem, for data mining problems, in which auxiliary information is available, to enhance the extraction of text document. The work proposed an approach, Probabilistic Latent Semantic Indexing, which gives more efficiency by considering class labels and also will be applicable for large number of clusters. The goal of this work is to utilize side information available with the documents for clustering, to improve the efficiency of the clusters and also to reduce the time required to form clusters.

Text Mining, Side information, Clustering, LSI, Probabilistic Latent Semantic Indexing

[1] Charu C. Aggarwal and Yuchen Zhao, “On the Use of Side Information for Mining Text Data”, in IEEE Transactions on Knowledge and Data Engineering, Vol. 26, No. 6, June 2014.
[2] S. Guha, R. Rastogi, and K. Shim, “CURE: An efficient clustering algorithm for large databases,” in Proc. ACM SIGMOD Conf., New York, NY, USA, 1998, pp. 73–84.
[3] R. Ng and J. Han, “Efficient and effective clustering methods for spatial data mining,” in Proc. VLDB Conf., San Francisco, CA,USA, 1994, pp. 144–155.
[4] T. Zhang, R. Ramakrishnan, and M. Livny, “BIRCH: An efficient data clustering method for very large databases,” in Proc. ACM SIGMOD Conf., New York, NY, USA, 1996, pp. 103–114.
[5] Vilas V Pichad and Sachin N Deshmukh, "Role of Document Clustering For Forensic Analysis Investigation System", International Journal of Computer Sciences and Engineering, Volume-03, Issue-03, Page No (116-120), Mar -2015, E-ISSN: 2347-2693
[6] D. Cutting, D. Karger, J. Pedersen, and J. Tukey, “Scatter/Gather: A cluster-based approach to browsing large document collections,” in Proc. ACM SIGIR Conf., New York, NY, USA, 1992, pp. 318–329.
[7] C. C. Aggarwal and P. S. Yu, “A framework for clustering massive text and categorical data streams,” in Proc. SIAM Conf. Data Mining, 2006, pp. 477–481.
[8] H. Schutze and C. Silverstein, “Projections for efficient document clustering,” in Proc. ACM SIGIR Conf., New York, NY, USA, 1997, pp. 74–81.
[9] M. Steinbach, G. Karypis, and V. Kumar, “A comparison of document clustering techniques,” in Proc. Text Mining Workshop KDD, 2000, pp. 109–110.
[10] S. Elakkiya and T. Kavitha, "Detection of Text Using Connected Component Clustering and Nontext Filtering", International Journal of Computer Sciences and Engineering, Volume-03, Issue-04, Page No (53-57), Apr -2015, E-ISSN: 2347-2693
[11] S. Guha, R. Rastogi, and K. Shim, “ROCK: A robust clustering algorithm for categorical attributes,” Inf. Syst., vol. 25, no. 5, pp. 345–366, 2000.
[12] A. Jain and R. Dubes, Algorithms for Clustering Data. Englewood Cliffs, NJ, USA: Prentice-Hall, Inc., 1988.
[13] C. C. Aggarwal, S. C. Gates, and P. S. Yu, “On using partial supervision for text categorization,” IEEE Trans. Knowl. Data Eng., vol. 16, no. 2, pp. 245–255, Feb. 2004.
[14] G. P. C. Fung, J. X. Yu, and H. Lu, “Classifying text streams in the presence of concept drifts,” in Proc. PAKDD Conf., Sydney, NSW, Australia, 2004, pp. 373–383.
[15] H. Frigui and O. Nasraoui, “Simultaneous clustering and dynamic keyword weighting for text documents,” in Survey of Text Mining, M. Berry, Ed. New York, NY, USA: Springer, 2004, pp. 45–70.
[16] C. C. Aggarwal and H. Wang, Managing and Mining Graph Data. New York, NY, USA: Springer, 2010.
[17] C. C. Aggarwal and P. S. Yu, “A framework for clustering massive text and categorical data streams,” in Proc. SIAM Conf. Data Mining, 2006, pp. 477–481.

Sonal S.Deshmukh and R.N.Phursule, "Efficient Clustering of Text Documents for Feature Selection on the use of side Information," International Journal of Computer Sciences and Engineering, Vol.3, Issue.10, pp.10-16, 2015.

P2P network stands amidst one of the best and attractive network tool. This approach made the allocation of contents through internet accessible. For unstructured P2P networks Bloom Cast deliver as an efficient technique for text sending scheme. In order to conclude a guaranteed recall at a communication cost of the network, Bloom Cast makes copies of the capacity in the network constantly at a random across the P2P networks. To abutment random node sampling and network size appraisal Bloom Cast appropriate its hybrid network which is an aggregate of a lightweight DHT (distributed hash table) and an unstructured P2P overlay. There are prospects of malicious codes and false agreement in unstructured P2P networks. At times it achieves false identities resulting in false activity with other character. The normal method here uses the conception of DHT and influence management which arrange efficient file transmission. In the expected system, we propose a novel strategy, called Bloom Cast, an efficient and effective full-text transportation scheme, in satisfied networks. The query demand independent archetype strategy, we propose a novel strategy, called Bloom Cast, to support efficient and adequate text transmission. Bloom Cast are mathematically that the recall can be guaranteed at a communication cost of O (square root N), where N is the size of the network.

P2P network, Bloom Cast, Bloom Filter, Content Sharing, Distributed Hash Table

[1] aSmallW orld. http://www .asmallworld.net.
[2] Burton H. Bloom. Space/time trade-offs in hash coding with allowable errors. Comm.of the ACM, 13(7):422–426, 1970.
[3] Title=Bittorentprotocol,http://www.bittorrent.com/protocol/html Bram Cohen.
[4] A. Broder and M. Mitzenmacher. Network applications of bloom lters: A survey .In Proc. of the 40th Annual Allerton Conference on Communication, Control and Computing, pages 636 – 646, Illinios, USA, 2002.
[5] Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, and A yellet T al. The bloomier filter an efficient data structure for static support lookup tables. In SODA '04: Proc. of the Fifteenth Annual ACM-SIAM Symp. on Discrete Algorithms, pages 30–39, Philadel-phia, P A, USA, 2004.
[6] Saar Cohen and Y ossi Matias. Spectral bloom filters. In SIGMOD '03: Proc. of the 2003 ACM SIGMOD Int. conference on Management of data, pages 241–252, New York, NY , USA, 2003. ACM Press.
[7] S. Dharmapurikar, P . Krishnamurthy, T . Sproull, and J. Lockwood. Deep packetinspection using parallel bloom filters. Micro, IEEE, 24(1):52 – 61, 2003.
[8] Henrich Eisenhardt, Muller. Spektrale bloom-filter fur peer-to-peer information re-trieval. In Proceedings Informatik 2004, pages 44–48, 2004.
[9] Li Fan, Pei Cao, Jussara Almeida, and Andrei Z. Broder. Summary cache: a scal-able wide-area web cache sharing protocol. IEEE/ACM Trans. Netw., 8(3):281–293, 2000.
[10] Mohd. Amjad, "Wireless Network Security: Susceptibilities, Extortion and kiosk", International Journal of Computer Sciences and Engineering, Volume-01, Issue-03, Page No (10-14), Nov -2013, E-ISSN: 2347-2693
[11] Maciej Ceglowski Joshua Schachter. Loaf, a simple emailextension for contactrecognition using bloomlter, http://loaf.cantbedone.org, 2004.
[12] R.A. Ferreira, M.K. Ramanathan, A. Awan, A. Grama, and S. Jagannathan, “Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks,” Proc. IEEE Fifth Int‟l Conf. Peer to Peer Computing (P2P ‟05), pp. 165-172, 2005.
[13] E. Cohen and S. Shenker, “Replication Strategies in Unstructured Peer-to-Peer Networks,” Proc. ACM SIGCOMM ‟02. pp. 177-190, 2002.
[14] P. Reynolds and A. Vahdat, “Efficient Peer-to-Peer Keyword Searching,” Proc. ACM/IFIP/USENIX 2003 Int‟l Conf. Middleware (Middleware ‟03), pp. 21-40, 2003.
[15] H. Song, S. Dharmapurikar, J. Turner, and J. Lockwood, “Fast Hash Table Lookup Using Extended Bloom Filter: An Aid to Network Processing,” Proc. ACM SIGCOMM, 2005.
[16] C. Tang and S. Dwarkadas, “Hybrid Global-Local Indexing for Effcient Peer-to-Peer Information Retrieval,” Proc. First Conf. Symp. Networked Systems Design and Implementation (NSDI ‟04),p. 16, 2004.
[17] D. Li, J. Cao, X. Lu, and K. Chen, “Efficient Range Query Processing in Peer-to-Peer Systems,” IEEE Trans. Knowledge and Data Eng., vol. 21, no. 1, pp. 78-91, Jan. 2008.
[18] G.S. Manku, “Routing Networks for Distributed Hash Tables,” Proc. ACM 22nd Ann. Symp. Principles of Distributed Computing (PODC ‟03), pp. 133-142, 2003.
[19] H. Shen, Y. Shu, and B. Yu, “Efficient Semantic-Based Content Search in P2P Network,” IEEE Trans. Knowledge and Data Eng.,vol. 16, no. 7, pp. 813-826, July 2004.
[20] A. Broder and M. Mitzenmacher, “Network Applications of Bloom Filters: A Survey,” Internet Math., vol. 1, no. 4, pp. 485-509, 2004.
[21] V. King and J. Saia, “Choosing a Random Peer,” Proc. ACM 23rdAnn. Symp. Principles of Distributed Computing (PODC ‟04), pp. 125-130, 2004.
[22] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H.Balakrishnan, “Chord: A Scalable Peer -to-Peer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM ‟01, pp. 149 -160, 2001.

S. Hemanjali and I.M.V. Krishna, "A Secure and Effective Content Transmission in Content Based Networks Using Bloom Cast," International Journal of Computer Sciences and Engineering, Vol.3, Issue.10, pp.17-21, 2015.

Mobile computing is a new computing paradigm that embeds time, place and person in computing. The combination of networking and mobility induces a new dimension to the application and services. Communications over network consume energy resources of the network. Therefore it is essential to have mechanism that consume fewer resources over network. Comforting communication is the strategy that can improve the life of network by saving resources. Comforting communication is identified as a process by which users contribute and mingle resources relating to transmission of data to improve their performances. In this paper, we proposed a Capacity-Enriched Comforting topology control scheme that considers both upper layer network capacity and physical layer relay selection in comforting communications.

Mobile Ad Hoc Network, Comforting Communications, Physical layer, Topology control

[1]. Sujata Agrawal, K.D. Kulat and M. B.Daigavane, "Evaluation of Routing Algorithm for Ad-hoc and Wireless Sensor Network Protocol", International Journal of Computer Sciences and Engineering, Volume-01, Issue-02, Page No (11-18), Oct -2013, E-ISSN: 2347-2693
[2]. Q. Guan et al., “Capacity-Optimized Topology Control for MANETs with Cooperative Communications,” IEEE Trans. Wireless Commun., vol. 10, July 2011, pp. 2162–70.
[3]. P. Santi, “Topology Control in Wireless Ad Hoc and Sensor Networks,” ACM Computing Surveys, vol. 37, no. 2, 2005, pp. 164–94.
[4]. Mayank Kumar, Muskan2 and Rohtash, "Security Challenges in Routing Protocols and a Proposed Schema in MANET", International Journal of Computer Sciences and Engineering, Volume-02, Issue-08, Page No (39-44), Aug -2014, E-ISSN: 2347-2693
[5]. Q. Guan et al., “Impact of Topology Control on Capacity of Wireless Ad Hoc Networks,” Proc. IEEE ICCS, Guangzhou, P. R. China, Nov. 2008.
[6]. K. Woraditet al., “Outage Behavior of Selective Relaying Schemes,” IEEE Trans. Wireless Commun., vol. 8, no.8, 2009, pp. 3890–95.
[7]. M. Burkhart et al., “Does Topology Control Reduce Interference?,” Proc. 5th ACM Int’l. Symp. Mobile Ad Hoc Networking and Computing, Tokyo, Japan, May 2004, pp.9-19
[8]. P. Gupta and P. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Info. Theory, vol. 46, no. 2, 2000, pp. 388–404.

Suman Saroj, Raj Gaurang Tiwari and Pankaj Kumar, "A Model for Efficiency Estimation of Routing Protocols for Ad-hoc Network," International Journal of Computer Sciences and Engineering, Vol.3, Issue.10, pp.22-25, 2015.

Mobile Ad Hoc Network (MANET), because of its decentralized architecture, dynamic topologies and also due to rapid advancement of wireless devices has become a popular area of research. Though the self-configuring characteristic of Ad Hoc network finds application in various domains, they are exposed to vulnerabilities by malicious attackers which might compromise the entire network and reduce the overall performance of the network. These threats need to be dealt; giving rise to various solutions that would not only maintain the network efficiency but also ensure a successful data transmission along with high level of security. Such solution would require detailed information about the vulnerabilities and different type of attacks which would then lead to computing different detection and prevention mechanisms. This paper gives an overview of vulnerabilities of MANETs, different types of threats and discusses various detection and prevention mechanisms against them.

MANET, ad hoc security, vulnerabilities, prevention, detection

[1] Mohammad Ilyas, “The Handbook of Ad Hoc Wireless Networks” Text Book.
[2] Amitabh Mishra, “Security and Quality of Service in ad hoc wireless networks” (chapter 1, 3), ISBN- 13 978-0-521-87824-1 Handbook
[3] Sukla Banerjee , “Detection/Removal of Cooperative Black and Gray Hole Attack in Mobile Ad-Hoc Networks”, Proceedings of the World Congress on Engineering and Computer Science 2008 WCECS 2008, October 22 - 24, 2008, San Francisco, USA.
[4] Gangotri A Khiratkar and Swati S Mahajan, "Performance Analysis of Cluster Based Routing Protocol for Ad hoc Networks", International Journal of Computer Sciences and Engineering, Volume-02, Issue-04, Page No (141-143), Apr -2014, E-ISSN: 2347-2693
[5] Pradip M. Jawandhiya, Mangesh M. Ghonge, Dr. M.S.Ali, Prof. J.S. Deshpande, “A Survey of Mobile Ad Hoc Network Attacks ”, International Journal of Engineering Science and Technology, Vol. 2(9), 2010, 4063-4071
[6] Dipali D. Punwatkar and Kapil N. Hande, "A Review of Malicious Node Detection in Mobile Ad-hoc Networks", International Journal of Computer Sciences and Engineering, Volume-02, Issue-02, Page No (65-69), Feb -2014, E-ISSN: 2347-2693
[7] Y.C. Hu, A. Perrig, and D.B. Johnson, “Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols,” Proc. 2003 ACM Workshop on Wireless Security (WiSe 2003), ACM Press, 2003, pp. 30–40.
[8] D.Anitha and Dr.M.Punithavalli : A Collaborative Selfish Replica with Watchdog and Pathrater in MANETS. In IJCSMC, Vol. 2, Issue. 3, March 2013.
[9] S.Madhavi and Dr. Tai Hoon Kim: An Intrusion Detection System in Mobile Ad Hoc Networks. In International Journal of Security and Its Applications Vol. 2, No.3, July, 2008.
[10] Ali EI-Mousl and Ashraf Suyyagh: Ad Hoc Networks Security Challenges. In 7th International Multi-Conference on Systems, Signals and Devices, 2010.

Kewal Vora, Jugal Shah, Shreyas Parmar and Shivani Bhattacharjee, "MANETs: Overview of Vulnerabilities, Security Threats and Prevention and Detection Techniques," International Journal of Computer Sciences and Engineering, Vol.3, Issue.10, pp.26-31, 2015.

Mobile ad hoc Network (MANET) is a type of wireless mobile network that does not guarantee continuous network connectivity. Intermittently connected network (ICMAN) refers to the network where no end-to-end paths exist from time to time. However in normal MANET, usually end-to-end paths exist, which is not the case in ICMAN. This concept is also similar to Delay Tolerant Network, since both require a ‘store-carry-forward’ style of message propagation. In such a network, people move around and contact each other based on their common interests. The routing hence becomes a process to resolve the social feature differences between a source and a destination. Present social friendship avoid selfness node based Routing in which temporally differentiated friendships are used to make the forwarding decisions of messages. In a typical sensor network, where small packets generated by sensors need to be periodically reported to the base station, end-to-end delay plays a more important role. This paper presents how to achieve the minimum end-to-end delay for regular traffic through routing.

MANET, Routing protocol, Throughput and Delay, Social aware routing, social features

[1] Mayank Kumar and Tanya Singh, "A Survey on Security Issue in Mobile AD-HOC Network and Solutions", International Journal of Computer Sciences and Engineering, Volume-02, Issue-03, Page No (71-75), Mar -2014, E-ISSN: 2347-2693
[2] Dipali D. Punwatkar and Kapil N. Hande, "A Review of Malicious Node Detection in Mobile Ad-hoc Networks", International Journal of Computer Sciences and Engineering, Volume-02, Issue-02, Page No (65-69), Feb -2014, E-ISSN: 2347-2693
[3] K.Vijayalakshmi, Dr. R. Manicka Chezian “A Study On Security Consideration In MANET”. National Conference on Emerging Trends In Big Data Analytics, FEB, 2015, ISBN 97893 80800417.
[4] J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine, “MaxProp: Routing for vehicle-based disruption-tolerant networking,” in Proc. IEEE Conf. Compute. Commun., Barcelona, Spain, Apr. 2006, pp. 1–11.
[5] P. Hui, A. Chaintreau, J. Scott, R. Gas’s, J. Crowcroft, and C. Diot, “Pocket switched networks and the consequences of human mobility in conference environments,” in Proc. ACM SIGCOMM Workshop Delay Tolerant Newt., Philadelphia, PA, USA, Aug. 2005, pp. 244–251.
[6] D. Zhao, H. Ma, S. Tang, et al., “COUPON: A cooperative framework for building sensing maps in mobile opportunistic networks,” to appear in IEEE Trans. Parallel Diatribe. Syst., Feb. 2014.
[7] P. Li, Y. Fang, J. Li, and X. Huang, “Smooth trade-offs between throughput and delay in mobile ad hoc networks,” IEEE Trans. Mobile Compute., vol. 11, no. 3, pp. 427–438, Mar. 2012.
[8] D. Ciullo, V. Martina, M. Garrett, and E. Leonardo, “Impact of correlated mobility on delay-throughput performance in mobile ad hoc networks,” IEEE/ACM Trans. Newt., vol. 19, no. 6, pp. 1745–1758, Dec. 2011.
[9] J. Zhang, X. Wang, X. Tian, Y. Wang, X. Chu, and Y. Cheng, “Optimal multicast capacity and delay tradeoffs in MANETs,” IEEE Trans. Mobile Compute., vol. 13, no. 5, pp. 1104–1117, May. 2014.
[7] P. Li, Y. Fang, and J. Li, “Throughput, delay, and mobility in wireless ad hoc networks,” in Proc. IEEE Conf. Compute. Commun. San Diego, CA, USA, Mar. 2010, pp. 1–9.
[10] N. Lu, T. H. Luan, M. Wang, X. Shen, and F. Bai, “Capacity and delay analysis for social-proximity urban vehicular networks,” in Proc. IEEE Conf. Compute. Commun. Orland, FL, USA, Mar. 2012, pp. 1476–1484.
[11] X. Wang, W. Huang, S. Wang, J. Zhang, and C. Hu, “Delay and capacity tradeoffs analysis for motion cast,” IEEE/ACM Trans. Newt., vol. 19, no. 5, pp. 1354–1367, Oct. 2011.
[12] M. J. Neely and E. Modiano, “Capacity and delay tradeoffs for ad hoc mobile networks,” IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 1917–1937, Jun. 2005.
[13] S. Toumpis and A. J. Goldsmith, “Large wireless networks under fading, mobility, and delay constraints,” in Proc. IEEE Conf. Compute. Commun. Hong Kong, Mar. 2004, pp. 609–619.
[14]Gangotri A Khiratkar and Swati S Mahajan, "Performance Analysis of Cluster Based Routing Protocol for Ad hoc Networks", International Journal of Computer Sciences and Engineering, Volume-02, Issue-04, Page No (141-143), Apr -2014, E-ISSN: 2347-2693
[15] A. E. Gamal, J. Mammon, B. Prabhakar, and D. Shah, “Throughput-delay trade-off in wireless networks,” in Proc. IEEE Conf. Compute. Commun. Hong Kong, Mar. 2004, pp. 464–475.
[16] N. Banal and Z. Liu, “Capacity, delay and mobility in wireless ad-hoc networks,” in Proc. IEEE Conf. Compute. Commun. San Francisco, CA, USA, Apr. 2003, vol. 2, pp. 1553–1563.
[17] G. Sharma, R. R. Mazumdar, and N. B. Shroff, “Delay and capacity trade-offs in mobile ad hoc networks: A global perspective,” IEEE/ACM Trans. Newt., vol. 15, no. 5, pp. 981–992, Oct. 2007.

K. Vijayalakshmi and R. Manicka Chezian, "Gregarious Characteristics Based Social Aware Routing in Mobile Ad-Hoc Network," International Journal of Computer Sciences and Engineering, Vol.3, Issue.10, pp.32-37, 2015.

Response time (RT) has a significant feature in both of traditionally response time (TRT) with physical (face-to-face) Businesses, and Automated response time (ART) with web-based businesses. The TRT is very primitive in physical (face-to-face) business and depended on human activity with devices reliability as well. TRT is very changeable from one person to another person and very complicate to calculate results of response time analysis due to that the TRT very manually and far from using of modern technologies. Nevertheless in ART the response time depended on web technology components, one of the web technology components is software web server that is between frontend (presentation) and backend (database). Web server in any ART by Web-based response time (WRT) is more advanced than TRT. The example of open source web server is apache web server. In this paper the evaluation of response time for different versions of apache web servers which is compatibility with different PhpMyadmin-EasyPhp. Thus, each version of Easyphp is with different version of Apache, Mysql, Php (AMP). The versions of apache web servers which tested are: 1) EasyPhp1.7 with apache 1.3.27, 2) EasyPhp1.8 with apache1.3.33, 3) EasyPhp3 with apache 2.2.11 4) EasyPhp5.6.3.0 with apache 1.3.27, and 5) EasyPhp12.1 with apache 2.4.2. All those versions of apache web server will be test it by simple search engine for Page Generated in Seconds with 32-bit computer Architecture and 64-bits computer Architecture. Web server is one of the mostly important tiered architecture in web technology components that communicate between client side and server side. There are plenty of different versions of web servers with Phpmyadmin-Easyphp. In this paper, the response time of the best apache web server will be found out over either computer architecture 32-bit or 64-bit. Finally the relation between computer architecture and internet architecture became one of our aims. The only suitable methodology for this paper that related and followed is the waterfall model because it’s appropriate than the other methodologies.

Web Technlogy components; Web response time; EasyPHP; search engine; apache web server.

[1] Dr.Kamaran.A.A.Faraj and Aree.A.Najeb ," SMS- Classroom Feedback Systems", (accepted to be published at Tikrit Journal of Pure Science, vol. 18, Issue 2, August 2013).
[2] Faraj, K., “Automated Recruitment System”, Faculty Science, Computer Department, University of
Sulamani,KRG 2010.
[3] Daniel, A., “The E-business(R) Evolution: Living and Working in an Interconnected World”, Prentice Hall PTR, 2000.
[4] Michael Grottk, Lei Li, Kalyanaraman Vaidyanathan, and Kishor Trivedi, “Analysis of Software Aging in a Web Server, IEEE TRANSACTIONS ON RELIABILITY, VOL. 55, NO.3, SEPTEMBER 2006.
[5] Vangie Beal," Apache Web server", [Online]. Available: www.webopedia.com/TERM/A/Apache_Web_server. html.
[6] “Apache 1.3 API Documentation,” Apache Software Foundation [Online]. Available: http://httpd.apache.org/dev/apidoc/apidoc_HARD_SERVER_LIMIT.html
[7] “Apache Core Features,” [Online]. Available: http://httpd.apache.org/docs/1.3/mod/core.html
[8] “What Does Open Source Mean in Linux? Does Window Have A License to Prevent Window User To
Use Certain Program,” [Online]. Available: http://answers.yahoo.com/question/index;_ylt=AwrBT9ol7PZVo8EA_U9XNyoA;_ylu=X3oDMTByMjB0aG5zBGNvbG8DYmYxBHBvcwMxBHZ0aWQDBHNlYwNzYw--?qid=20150815123156AAxc63o
[9] Erwin Z. (2011). What is XAMPP? Available: http://www.qwhatis.com/what-is-xampp/. Last accessed 20 July 2015

Kamaran. Hama Ali. A. Faraj, Tara Nawzad Ahmad, Hawar Othman Sharif and Pshko Rasul, "Response Time analysis for Apache Web server versions based on 32 or 64 bit Architecture," International Journal of Computer Sciences and Engineering, Vol.3, Issue.10, pp.38-42, 2015.

The Item set Mining is one of the most well known techniques to extract knowledge from data. The mechanism having some problematic data, for those further enhancements have been applied based on the Big Data in which some performances has-been explores on Map Reduce machine. The new approach for mining large datasets such as K-means, Mahout which targets on speed and time while Big FIM is optimized to run on really large datasets. K-means algorithm depends on Map Reduce, which is the infrastructure for prepare more datasets of certain scattered clusters. These clusters are combined in the form of nodes and edges and also display the item sets. The execution of these clusters can also be implemented on large datasets also with high scalability and performance.

Big Data;Hadoop; Map Reduce;Mahout;K-Means

[1] Apache Hadoop project, http://hadoop.apache.org/
[2] Apache Mahout, http://mahout.apache.org/ , 2014.
[3] Moens, S.; Aksehirli, E.; Goethals, B., "Frequent Item set Mining for Big Data," Big Data, 2013 IEEE International Conference Page No( 111, 118), Oct. 2013
[4] Srinath Parera, Thilina Gunarathane, “Hadoop Map Reduce Cook Book”, [PACKT] publishing, ISBN: 9781849517287, Page No. (129-133), Jan 2013.
[5] Dean, Jeffrey, and Sanjay Ghemawat. "Map Reduce: simplified data processing on large clusters." Communications of the ACM volume 51, Issue 1, January 2008, Page No (107-113). ISSN: 0001-0782 EISSN: 1557-7317. In Proc.OSDI. USEXNIC, Association 2004.
[6] Borthakur, D. “The Hadoop Distributed File System: Architecture and Design”, 2007
[7] W. Z. Zhao, H. F. Ma, Q. He. “Parallel k-means clustering based on Map Reduce”. In CloudCom’09: Proceedings of the 1st International Conference on Cloud Computing, Page No (674-679), Berlin, Heidelberg, 2009.
[8] Ping ZHOU, Jingsheng LEI, Wenjun YE, “Large-Scale Data Sets Clustering Based on Map Reduce and Hadoop”, Journal of Computational Information Systems, 2011
[9] Zhihua Li, Xugong Song, WenhuiZh, Yanxia Chen,”K-Means Clustering Optimizisation Algorithm Based on Map Reduce”. ISCI. March 2015.
[10] Jiawei Han and Michelin Kamber. “Data Mining, Concepts and Techniques”. Morgan Kaufmann, 2001
[11] Qing He, Fuzhen Zhuang, Jincheng Li, Zhongzhi Shi, “Parallel Implementation of Classification Algorithms Based on Map Reduce”. Page No (655-662). 5th International Conference, RSKT, 2010.

Barooru Sasanka Kasyap and K.Syama Sundara Rao , "Generating Frequent Item Sets Using Apache Hadoop Map Reduce and Mahout," International Journal of Computer Sciences and Engineering, Vol.3, Issue.10, pp.43-47, 2015.

In mobile ad-hoc networks a routing procedure is always needed to find a path so as to forward the packets appropriately between the source and the destination. A routing protocol is a protocol that specifies how routers communicate with each other. Each router has a knowledge only of networks attached to it directly. A routing protocol shares this information first among immediate neighbors, and then throughout the network. This way, routers gain knowledge of the topology of the network. An ad hoc routing protocol is a standard, that controls how nodes decide which way to route packets between computing devices in a network [10]. Various routing protocols available for Ad- hoc networks are AODV, CGSR, DSDV, DSR, OLSR, WRP, ZRP etc. In this paper DSDV is represented.

MANET, DSDV, Routing protocol, Routing table

[1]. Deepak Kumar et al “Performance Comparison of DSDV and AODV Routing Protocols in MANETS” International Journal of Electronics Communication and Computer Technology (IJECCT) Volume 2 Issue 3 (May 2012)
[2]. Pooja saini and Meenakshi Sharma, "Impact of Multimedia Traffic on Routing Protocols in MANET", ISROSET-International Journal of Scientific Research in Network Security and Communication, Volume-03, Issue-03, Page No (1-5), May -Jun 2015
[3]. Bhagyashree Thakur, Sharda Patel, Ashok Verma and Shivendu Dubey, "Simulation Of Blackhole Nodes And Prevention Using IDS For MANET Reactive Routing Protocol AODV", International Journal of Computer Sciences and Engineering, Volume-02, Issue-12, Page No (114-120), Dec -2014, E-ISSN: 2347-2693
[4]. Prof. B.N. Jagdale, Prof. Pragati Patil, Prof. P. Lahane, Prof. D. Javale “Analysis and Comparison of Distance Vector, DSDV and AODV Protocol of MANET“ International Journal of Distributed and Parallel Systems (IJDPS) Vol.3, No.2, March 2012.
[5]. Akshai Aggarwal, Savita Gandhi, Nirbhay Chaubey. “Performance analysis of AODV, DSDV, and DSR in Manets“ International Journal of Distributed and Parallel Systems (IJDPS) Vol.2, No.6, November 2011.
[6]. Biswaraj Sen1, Sanku Sinha “A Simulation Based Performance Analysis of AODV and DSDV Routing Protocols in MANETs” International Journal of Modern Engineering Research (IJMER) www.ijmer.com Vol.2, Issue.4, July-Aug. 2012 pp-2404-2408 ISSN: 2249-6645
[7]. Ritika Kachal and Shrutika Suri, "Comparative Study and Analysis of DSR, DSDVAND ZRP in Mobile Ad-Hoc Networks", International Journal of Computer Sciences and Engineering, Volume-02, Issue-05, Page No (148-152), May -2014, E-ISSN: 2347-2693
[8]. Md. Shohidul Islam et al, “An Extensive Comparison among DSDV, DSR and AODV Protocols in MANET” International Journal of Computer Applications (0975 – 8887)Volume 15– No.2, February 2011
[9]. Preeti Singla “Review of Theoretical Comparison between ADOV, DSR and DSDV” International Conference on Advances in Management and Technology (iCAMT - 2013) Proceedings published in International Journal of Computer Applications® (IJCA) (0975 – 8887)
[10]. Sapna S. Kaushik1 & P.R.Deshmukh “Comparison of effectiveness of AODV, DSDV AND DSR Routing protocols in mobile adhoc networks” International Journal of Information Technology and Knowledge Management. July-December 2009, Volume 2, No. 2, pp. 499-502

Smita Das, "Routing table of DSDV in Mobile Ad-hoc Networking," International Journal of Computer Sciences and Engineering, Vol.3, Issue.10, pp.48-51, 2015.