Advancement in wireless technologies allows mobile devices to access Internet from anywhere at any time.

Each network is identified by unique IP address. Mobile IP allows a mobile node to change its network without changing IP address. Internet Engineering Task Force (IETF) has suggested several mobility management protocols such MIPv6, HMIPv6, PMIPv6 etc. for perpetual mobility. MIPv6 is a Host-Based Mobility Management (HBMM) protocol and provides global mobility solution to the mobile node. MIPv6 suffers from basic mobility related problems such as handover latency, packet loss etc. Recently the IETF has suggested Network-Based Mobility Management (NBMM) protocol. The Proxy Mobile IPv6 (PMIPv6) is first NBMM protocol. PMIPv6 significantly decreases the signaling overhead, but still has some issues related to the security, handover latency and packet loss. This paper proposes Secure and an Optimized Authentication Scheme in PMIPv6 (SOAS-PMIPv6) to reduce signaling overhead. The proposed scheme provides higher security than the basic PMIPv6 protocol and moreover reduces the signaling cost with respect to contemporary protocols. This paper performs comprehensive analysis on handover latency, packet delivery cost, packet loss etc. and the performance of protocols is mathematically investigated. Numerical result shows that the proposed scheme has improved performance than the MIPv6 in terms of handover latency and provides optimized security than PMIPv6 based protocols.

Cloud services have provided important solutions for drastically reducing the cost of data management and maintenance. However, data outsourcing not only deprives clients of direct control over their data but also allows the server to gain direct access to the client data. Data encryption has been recognized as the solution to the privacy issue, but it also creates new challenges for both industry and academia. A naive question is whether the client still has the capability to query and obtain useful information when the data are encrypted and stored remotely. This paper investigates a solution to one of the most important types of query operations over encrypted data, namely multi-dimensional range queries. Our solution combines cryptographic techniques with the bucketization approach. We leverage a three-party architecture and secure multiparty computation to design and analyze the security of the protocols. Further, we discuss solutions for both static and dynamic datasets where new data records can be appended. First, we present the solutions for the case when the set of attributes in the query is pre-defined. Subsequently, we discuss the generalization.

With evolution of internet, security becomes a major concern. Number of malicious programs called malware, travels through network into systems. They have many advanced properties like self-hiding, self-healing and stealth mode execution, which are hard to detect. Therefore, the major challenge for researchers today is to detect and mitigate such programs. Since there is a new virus implemented every minute no detection mechanism can be designed which gives 100% protection but by keeping the anti-virus database up to date we can escape many attacks. In this paper, an effort has been made to explain the design of a system program which can scan the vulnerable files on the system, generate logs and this can later be used to design antivirus software and stop virus execution. This program aims to scan system files and target the files which are vulnerable present on the system based on their file extensions. It generates logs after the system scan is complete which can be studied and used for anti-virus creation.

Frame Relay and Asynchronous Transfer Mode (ATM) are two famous technologies in wide-area networks that use the virtual circuits for connecting and multiplexing many branches and networks. Those technologies can be used to carry different types of information such as real-time information which needs high data rate, low delay and an efficient throughput of the network's data communication devices. This paper is a study based on simulation for comparative performance evaluation between the Frame Relay and ATM to understand the overview and the nature of these technologies focusing on real-time applications using the OPNET simulation tool for analyzing the performance of voice application. The evaluation parameters are traffic sent, traffic received, delay, Jitter and the end-to-end delay which have been used to compare the performance of the ATM and Frame Relay in high-speed networks. The simulation results demonstrate that the ATM has high traffic sent, high traffic received, and less delay compared to the Frame Relay. In addition, this paper may be considered as an insight for the new researchers to guide them to an overview, essentials, and understanding of the virtual connections for Frame Relay and ATM.

Information is one of the single most important factor for understanding a situation as well as deciding upon a solution by effectively devising a working method. Thus the magnitude of securely delivering information to the correct individual or organization has always been a prime concern. The field of Cryptography deals with such necessities as to encrypt the information in such a way so that only the intended receiver, equipped with the right armoury, can decipher the message. Here in this paper a method for encrypting character data has been presented whereby the ASCII values of individual character is converted into their Hex values before they are turned into their binary form, and randomly assigned a single digit Odd integer value for a 1 and single digit Even integer value for a 0. Going forward we do some more processing of the data to make it even more secure, these will be discussed in due course. The receiver must possess a valid Image key in order to decrypt the text. This image is generated during encryption from two RGB (Red, Green and Blue) values- having a difference of a random number produced within the range of total length of the plaintext.

The current use of Personal Identification Number (PIN) for verification of the validity of a customer’s identity on Automated Teller Machine (ATM) systems is susceptible to unauthorized access and illegal withdrawal of cash from the ATM, hence, the need for more reliable means of carrying out user authentication. We present a three-tier authentication model with three layers of authentication using password, fingerprint and One-Time-Password (OTP). The identity of an ATM user is validated using password, fingerprint and OTP. Object-Oriented Analysis and Design Methodology (OOADM) was employed in the investigation of the existing system and analysis of the proposed system. Microsoft Visual Basic.NET and Microsoft SQL Server were employed in the implementation of the system. The result is a three-tier authentication model for ATM. Alphabetic keys and some special character keys were introduced to the existing numeric keypad for authentication. The ATM was interfaced with a fingerprint reader for improved security.

Clustering is an important technique in data mining to partition the data objects into clusters. It is a way to generate groups from the data objects. Different data clustering methods or algorithms are discussed in the various literature. Some of these are efficient while some are inefficient for large data. The k-means, Partition Around Method (PAM) or k-medoids, hierarchical and DBSCAN are various clustering algorithms. The k-means algorithm is more popular than the other algorithms used to partition data into k clusters. For this algorithm, k should be provided explicitly. Also, initial means are taken randomly but this may generate clusters with poor quality. This paper is a study and implementation of an improved clustering algorithm which automatically predicts the value of k and uses a new technique to take initial means. The performance analysis of the improved algorithm and other algorithms by using real and dummy datasets is presented in this paper. To measure the performance of algorithms, this paper uses running time of algorithms and various cluster validity measures. Cluster validity measures include sum squared error, silhouette score, compactness, separation, Dunn index and DB index. Also, the k predicted by the improved algorithm is compared with optimal k suggested by elbow method. It is found that both values of k are almost similar. Most of the values of validity measures for the improved algorithm are found to be optimal.