Abstract: In Computer networks, Messages are transmitted from sender to receiver with high security. Encryption Algorithm is used by sender to convert plain text into cipher text before sending text to receiver. At the receiver, Decryption Algorithm is used to convert cipher text into plain text. Sorting is a process of arranging data in a specific order according to requirements of Application. In the proposed paper I am using sorting algorithm to encrypt plain text into cipher text at the sender and at the receiver also sorting algorithm is used to convert cipher text into plain text. At the sender plain text is sorted in alphabetical order and the indices of characters of plain text are also sorted in that order and placed into index array. To the receiver cipher text and index array are sent. At the receiver index array, which contains indices of sorted plain text, is sorted in increasing order and characters of cipher text are also sorted in the same order to form plain text.   I followed the various stages of   Software Development Life Cycle to demonstrate the proposed sorting algorithm. Section I will give introduction about  proposed sorting  algorithm.  In section II, proposed Algorithm is Analyzed and Designed. In section III, proposed algorithm is Implemented using C programming Language. In section IV, I tested the implementation of proposed algorithm using different test cases. In section V, I concluded the proposed Algorithm.

Title: Kareem Naaz (KN) Encryption and Decryption using Sorting
Author: Shaik Kareem Basha
International Journal of Novel Research in Computer Science and Software Engineering
Novelty Journals

Abstract: Binary Search Tree (BST) and Balanced Binary Search Trees (BBST) are a category of Binary Trees, which provides efficient retrievals of data items. A BST T may be an empty binary tree. If non empty then it contains finite number of nodes. Though Binary Search Trees in comparision to sequential lists report a better performance of O(log n) time complexity for their insert, delete and retrieval operations, they also posses set backs. There are instances where binary search trees may grow to heights that equal n, the number of elements to be represented as the tree, there by degrading their performance. To eliminate this drawback, it is essential to convert BST into Balanced BST. Trees, whose height in the worst case turns out to be O(log n) are known as BBST. In this paper, five Algorithms ConstructBBST(), DivideList(), RDivideList(), ConstructList(), DisplayBBST() are proposed. We followed the various stages of Software Development Life Cycle to demonstrate the proposed algorithms. Section I will give introduction about proposed algorithms. In section II, proposed Algorithms are Analyzed and Designed. In section III, proposed algorithms are Implemented using C programming Language. In section IV, we will test the implementation of proposed algorithms using different test cases. In section V, we conclude the proposed Algorithms.

Title: Converting BST into Balanced BST using List
Author: Shaik Kareem Basha, Shaik Jaheda Begum, Fouzia bano
International Journal of Novel Research in Computer Science and Software Engineering
Novelty Journals

Abstract:  Now a day the person identification is most secure application used in many purpose such as attendance, registration, verification etc. Identification is based on biometrics, like face, ear, iris, fingerprint, signature and keystroke. Many researchers have done the work on different biometrics traits and found out the results using different parameters.  In This paper we work on two modalities ear and foot applied eigen image classifier for ear and modified sequential harr transforms classifier for foot. The result of individuals’ biometrics is calculated and after that we apply the fusion strategy at match score level. We used sum rule method for fusion to combine the biometrics and calculate the result.
Our paper displayed the result of ear and foot biometric modalities in terms of FAR, FRR and Wight score of individuals, normalizaled score, combined weight of modalities ear and foot and at last combined matching score of ear and foot. All the results are calculated on self created database of 100 parsons.

Keywords:  Multimodal biometrics, Eigen image, modified sequential harr transform, Euclidian distance.
Title: Ear and Foot Biometrics Best for Identification
Author: Snehlata Barde, A. S. Zadgaonkar
International Journal of Novel Research in Computer Science and Software Engineering
Novelty Journals

Abstract: Wireless mesh network rapidly change with current research. In it each wireless device has multiple uplinks for data transmission and speared signals in Omni and Directional. Currently mesh network make communication between devices with in each device zone but when user device move from one wireless device zone to another, where again need for new configuration in new zone wireless device to provide connectivity to user device. In our term paper we will proposed a solution for this problem. Wireless network work with 802.11 in wireless mesh network. In solution to solve mobility issue of wireless devices we present the combination of wireless network 802.11s, 802.15 and 802.16. Each wireless standard define wireless area of wireless devices in mesh network and make a division at each level between devices such as PAN (Personal Area Network), LAN (Local Area Network) and MAN (Metropolitan Network). User device make configuration at its area wireless device and mobility of this device from one area to another will be manage by gateway device of that zone and no need for reconfiguration every time on user device mobility.

Keywords: Data Transmission, Wireless Mesh Network, Provide Connectivity, Personal Area Network.
Title: Wireless Mesh Network Re-Authentication,
Author: Muhammad Aleem,Muhammad Tahir, Husnain Mushtaq, Nasir Jamal
International Journal of Novel Research in Computer Science and Software Engineering
Novelty Journals

Abstract: Today’s operating systems such as Windows 8 and Android make a change in the way of user interaction with computer devices. Due to cloud computing every task is completed with the collections of software in today’s operating systems those are purposed as user application such as document viewer, social network application, online supporting tools etc. Operating system interaction workflow between these applications is difficult to understand as per security point of view. During completion of a task it is also hard to know what result occurs at every step when operating system interacts with cloud services. As per data security importance operating systems interaction with cloud services become a cause of data disclosure. In this term paper we are going to present a framework for data prevention when our operating system interacts with cloud services. Framework manages inbound and outbound traffic of user operating system when user interacts with cloud services to prevent data from disclosure on internet.
Data disclosure is occur when user system interact with cloud services to complete a long term task define by user. During it system interacts with multiple applications available in cloud services. Framework will provide secure interaction between user system and cloud services. It’s allow only those cloud applications which are reliable and secure for data interaction with user system and complete all long term task one by one. This framework provides security mechanism with simple permission checks between user application interactions with cloud services.

Keywords:  Computer Devices, Document Viewer, Social Network Application, Online Supporting Tools Etc.
Title: Implement Data Security in Today's Operating System Group Members
Author: Muhammad Aleem, Muhammad Tahir, Nasir Jamal
International Journal of Novel Research in Computer Science and Software Engineering
Novelty Journals