Tarunpreet Bhatia

A genetic algorithm based distance-aware routing protocol for wireless sensor networks

A new cluster head selection algorithm in wireless sensor networks, coined as GADA-LEACH is proposed to reduce energy dissipation and improve the network lifetime.It makes use of Genetic Algorithm (GA) for optimized CH selection and concept of relay node for Distance Aware (DA) routing.Fitness function incorporates residual energy of nodes, distance between CH and nodes, and distance of BS from all CHs for better CH selection. A Wireless Sensor Network (WSN) is an aggregation of sensor nodes which are remotely deployed in large numbers, operate autonomously in an unattended environment and have limited energy resource. In most of the hierarchical routing protocols, the cluster head (CH) selection is on the basis of random probability equation. There is a scope to reduce the energy dissipation by improving CH selection procedure. The proposed scheme, coined as GADA-LEACH, makes use of evolutionary genetic algorithm for improving CH selection in legacy LEACH routing protocol in sensor networks. The concept of relay node is introduced which acts as an intermediary between CH and base station (BS) to ease the communication between the CH and BS. The simulation results obtained supports that our proposed algorithm is efficient in terms of network lifetime. Display Omitted

Data security in mobile cloud computing paradigm: a survey, taxonomy and open research issues

The incessant spurt of research activities to augment capabilities of resource-constrained mobile devices by leveraging heterogeneous cloud resources has created a new research impetus called mobile cloud computing. However, this rapid relocation to the cloud has fueled security and privacy concerns as users’ data leave owner’s protection sphere and enter the cloud. Significant efforts have been devoted by academia and research community to study and build secure frameworks in cloud environment, but there exists a research gap for comprehensive study of security frameworks in mobile cloud computing environment. Therefore, we aim to conduct a comprehensive survey to analyze various cryptographic, biometric and multifactor lightweight solutions for data security in mobile cloud. This survey highlights the current security issues in mobile cloud environment and infrastructure, investigates various data security frameworks and provides a taxonomy of the state-of-the-art data security frameworks and deep insight into open research issues for ensuring security and privacy of data in mobile cloud computing platform.

QoS Comparison of MANET Routing Protocols

The primary concern for the deployment of MANET is to promote flexibility, mobility and portability. This mobility causes dynamic change in topology and poses challenges for designing routing algorithms. In the past few years, many ad hoc network protocols have been developed and research is still going on. It becomes quite difficult to say which protocols may perform well under different network scenarios such as varying network size, mobility of nodes and network load etc. This paper analyzes the performance of proactive protocols like DSDV, OSLR, reactive protocols like AODV, DSR and hybrid protocol such as ZRP. The analysis guides us to the evaluation of various performance metrics such as throughput, packet delivery fraction, normalized routing load and average end to end delay under different scenarios such as varying network size, speed of the node and pause time. The focus of this paper is to have quantitative analysis to guide which protocol to choose for specified network and goal.

Cryptanalysis and improvement of certificateless proxy signcryption scheme for e-prescription system in mobile cloud computing

Certificateless proxy signcryption (CLPSc) is one of the most efficient security primitives for secure data transmission. The entrustment of signing rights to a proxy signcrypter at the behest of an original signcrypter imparts its utility in various fields such as an online proxy auction, healthcare industry, cloud computing, mobile-agents, ubiquitous computing, etc. Unlike the traditional sign-then-encrypt approach, signcryption primitive saves computational costs and bandwidth load. Recently, a pairing-free CLPSc scheme has been proposed which claims to be secure against forgery under adaptive chosen-message attacks. This paper unveils that the aforementioned scheme has failed to provide unforgeability. As an improvement of their scheme, a novel pairing-free certificateless proxy signcryption scheme using elliptic curve cryptography (ECC) has been proposed for e-prescription system in mobile cloud computing. The proposed scheme is proven to be secure against indistinguishability under adaptive chosen-ciphertext attack and existential forgery under adaptive chosen-message attack in the random oracle model against Type 1 and Type 2 adversaries through formal analysis. The proposed scheme outperforms the existing schemes in terms of computational efficiency making it suitable for futuristic mobile cloud computing applications.

TRUST based energy efficient routing in LEACH for wireless sensor network

Wireless sensor networks are often placed in an open environment and are susceptible to various attacks. Traditional cryptography methods are not effectual in WSNs. Trust management has been proved to be an effective measure to enhance security as well as to handle threats for WSNs. In this paper, TBE-LEACH, an improvement in LEACH protocol has been proposed by introducing trust to provide secure routing. The simulation results demonstrate that proposed scheme is better in terms of network lifetime and energy consumption.

Performance analysis of LEACH and its variants

The increased interest in use and area of Wireless sensor networks(WSN) have led to designing of many new routing protocols in which energy awareness is of great consideration. In this paper LEACH and its two variants LEACH-E, LEACH-EX is analyzed by simulation. Their performance is compared by varying parameters such as initial energy, probability of CH node election and size of the packet.

Secure Certificateless Proxy Re-encryption Without Pairing

A Proxy Re-encryption (PRE) is a cryptographic scheme for delegation of decryption rights. In a PRE scheme, a semi-honest proxy agent of Bob re-encrypts the ciphertext, on the message intended for Alice, on behalf of Bob, without learning anything about the message. The PRE schemes are useful in the scenarios where data are desired to be shared with the authorized users over the cloud. For such important applications, in this paper, we present an efficient and secure proxy re-encryption scheme. To avoid the overhead due to certification and to get rid of the key escrow issue of identity-based setting, we construct our scheme on the certificateless setting. The scheme has been proved secure in random oracle model under the standard assumption, the hardness of the computational Diffie-Hellman problem (CDHP). Moreover, as we device a pairing-free construction, our scheme is significantly more efficient than the best available scheme.

Analysis of pattern matching algorithms in network intrusion detection systems

Pattern-Matching algorithms are vastly being implemented in the NIDS (Network Intrusion Detection Systems) nowadays in order to keep a check on any malicious activities of any trespasser. With an increase in Network traffic with time, the pattern-matching algorithms should be quick so as to keep a check and keep up with the network speed. Hence, it is very important to choose the right algorithm for our purpose in order to get the work done with ease and in a quick manner. Although there are many pattern-matching algorithms that exist but we decided to take into consideration some majorly popular ones which include: Naive approach, Knuth-MorrisPratt algorithm, RabinKarp Algorithm and also the trie data structure which is still not that popular in this field but we believe can be helpful in the future. The above mentioned algorithms are compared in order to check which of them is most efficient in pattern/Intrusion detection. Pcap files have been used as datasets in order to determine the efficiency of the algorithm by taking into consideration their running times respectively.