METRICS OF A NEW SYMMETRICAL ENCRYPTION ALGORITHM

1G. RAMESH 2 Dr. R. UMARANI
1Research Scholar, Research and Development Centre, Bharathiyar University, Coimbatore, Tamilnadu
1mgrameshmca@yahoo.com
2 Associate Professor in Computer Science, Sri Sarada college for women, Salem -16
2umainweb@gmail.com


Abstract: The hacking is the greatest problem in the wireless local area network (WLAN). Many algorithms like DES, 3DES, AES,CAST, UMARAM and RC6 have been used to prevent the outside attacks to eavesdrop or prevent the data to be transferred to the end-user correctly. The authentication protocols have been used for authentication and key-exchange processes. A new symmetrical encryption algorithm is proposed in this paper to prevent the outside attacks to obtain any information from any data-exchange in Wireless Local Area Network(WLAN). The new symmetrical algorithm avoids the key exchange between users and reduces the time taken for the encryption, decryption, and authentication processes. It operates at a data rate higher than DES, 3DES, AES, UMARAM and RC6 algorithms. It is applied on a text file and an image as an application. The encryption becomes more secure and high data rate than DES,3DES,AES,CAST,UMARAM and RC6. A comparison has been conducted for the encryption algorithms like DES, 3DES,AES,CAST,UMARAM and RC6 at different settings for each algorithm such as different sizes of data blocks, different data types, battery power consumption, different key size and finally encryption/decryption speed. Experimental results are given to demonstrate the effectiveness of each algorithm.

Detecting Monotonic Graph over Edge Connectivity Constraint

Mr.Abhay Bhamaikar #1, Dr. P R Rao *2
# Department of Information Technology, Shree Rayeshwar Institute of Engineering and IT, Shiroda – Goa, India.
1 abhay_bhamaikar@rediffmail.com
* Department of Computer science and technology, Goa University, Goa, India.
2 pralhadrrao@gmail.com


Abstract: Edge Connectivity parameter of a given graph is widely used in graph mining and finds usage in wide range of applications like transportation problem , Microarray Data , Bioinformatics etc. Based upon the property of a given graph on edge connectivity constraint the decomposition of graph can be avoided, which in turn reduces computational time. The paper focuses at determining whether the given Graph (G) satisfies Monotone property over Edge Connectivity Constraint. It takes into consideration the Maximum degree, Minimum degree and Edge Connectivity values of given Graph (G), based on which the algorithm determines if the given graph satisfies Monotone Property.

Keywords: Maximum Degree, Minimum Degree, Edge Connectivity.

Data Mining Applications: A comparative study for Predicting Student’s Performance

Surjeet Kumar Yadav 1, Brijesh Bharadwaj2, Saurabh Pal3
1Research Scholor, Shri Venkateshwara University, Moradabad
Email: surjeet_k_yadav@yahoo.co.in
2Assistant Professor, Dr. R. M. L. Awadh University, Faizabad India
Email: wwwbkb@rediffmail.com
3Head, Dept. Of MCA,VBS Purvanchal University,Jaunpur, India
Email: drsaurabhpal@yahoo.co.in


Abstract: Knowledge Discovery and Data Mining (KDD) is a multidisciplinary area focusing upon methodologies for extracting useful knowledge from data and there are several useful KDD tools to extracting the knowledge. This knowledge can be used to increase the quality of education. But educational institution does not use any knowledge discovery process approach on these data. Data mining can be used for decision making in educational system. A decision tree classifier is one of the most widely used supervised learning methods used for data exploration based on divide & conquer technique. This paper discusses use of decision trees in educational data mining. Decision tree algorithms are applied on students’ past performance data to generate the model and this model can be used to predict the students’ performance. It helps earlier in identifying the dropouts and students who need special attention and allow the teacher to provide appropriate advising/counseling.

Keywords: Educational Data Mining, Classification, Knowledge Discovery in Database (KDD)

An Analysis of Fixed Probabilistic Route Discovery Mechanism using on-demand routing protocols

V.Mathivanan #1, E.Ramaraj *2 #1 Research Scholar, Alagappa University, Karaikkudi, Tamilnadu, India 1 vmathi1969@gmail.com #2 Director, Department of Computer center, Alagappa University, Karaikkudi, Tamilnadu, India 2 eramaraj62@gmail.com

Abstract: An ad hoc wireless network consists of set of mobile nodes connected without any central administration. Path finding processes in on-demand route discovery methods in mobile ad hoc networks (MANETs) use flooding. Source mobile node simply broadcast route request (RREQ) packet to its neighbour node and once again the neighbour node rebroadcast RREQ packet to its neighbour until unless route to a particular destination is found. The excessive RREQ packet can lead collision problem and consume more bandwidth in the network and decrease network performance. This paper examined the fixed probabilistic (FP) based broadcast method using existing on demand routing protocols such as on demand distance vector routing protocols (AODV) and dynamic source routing protocol (DSR). The author used NS-2 simulator for the evaluation of FP-AODV and FP-DSR with traditional AODV[1] and DSR[2] routing protocols using various parameters such as collision rate, routing overhead, network connectivity and throughput. The simulation result shows significant improvement in FP-AODV and FP-DSR.

Keywords: MANET, AODV, DSR, RREQ, broadcast

Read complete December 2011