Saswati Mukherjee

Wormhole Detection Based on Ordinal MDS Using RTT in Wireless Sensor Network

In wireless communication, wormhole attack is a crucial threat that deteriorates the normal functionality of the network. Invasion of wormholes destroys the network topology completely. However, most of the existing solutions require special hardware or synchronized clock or long processing time to defend against long path wormhole attacks. In this work, we propose a wormhole detection method using range-based topology comparison that exploits the local neighbourhood subgraph. The Round Trip Time RTT for each node pair is gathered to generate neighbour information. Then, the network is reconstructed by ordinal Multidimensional Scaling MDS followed by a suspicion phase that enlists the suspected wormholes based on the spatial reconstruction. Iterative computation of MDS helps to visualize the topology changes and can localize the potential wormholes. Finally, a verification phase is used to remove falsely accused nodes and identify real adversaries. The novelty of our algorithm is that it can detect both short path and long path wormhole links. Extensive simulations are executed to demonstrate the efficacy of our approach compared to existing ones.

Addressing Forwarder's Dilemma: A Game-Theoretic Approach to Induce Cooperation in a Multi-hop Wireless Network

Nodes in a multi-hop wireless network often have limited or constrained resources. Therefore, to increase their lifetime, intermediate nodes are often unwilling to forward packets for other nodes, thereby decreasing network throughput. Thus, some mechanism has to be designed which prevents the nodes from adopting such selfish behavior. In this paper, we suggest a scheme using game theory to induce such cooperation. The nodes are the players and their strategies are their packet forwarding probabilities. We design novel utility functions to capture the characteristics of packet forwarding dilemma. We then set up simulations to analyze the Nash equilibrium points of the game. We show that cooperation in multi-hop communication is feasible at the operating point if the costs of packet forwarding are not too high.

A Personalized Mobile Application Using Location Based Service

Technology has transformed the cell phone from being a mere phone to become an indispensable medium for contact, information and entertainment. One of the most common features of mobile communication is Location Management, which keeps track of the locations of the mobile users who leave the home location and roam into foreign network. Location Based Service (LBS) plays an important role in the rapidly evolving world of mobile applications. In this paper, a novel personalized application using location based service has been proposed and implemented. When the mobile user is away from its home location, he/she can launch that application which automatically sends SMS to those mobile numbers present in the “contacts” applicable to visitor location i.e., friends and relatives in the visitor location.

A Novel Incentive Based Scheme to Contain Selective Forwarding in Wireless Sensor Network

Selective forwarding or dropping of packets is a serious threat to multi hop communication in a Wireless Sensor Network (WSN). There are various schemes to induce cooperation in a WSN to overcome this problem. In this paper, we have introduced a novel adversary model and have proposed an incentive based scheme to inspire cooperation among nodes in a WSN. The scheme has been formally analyzed. The efficacy of the scheme is also established through various simulation experiments.

EAER-AODV: Enhanced Trust Model Based on Average Encounter Rate for Secure Routing in MANET

Secure routing is an integral part of MANET for protecting the network operations from malicious behaviour. However, the dynamic nature of MANET demands some stringent mechanism that can ensure security in routing. We have redefined an existing trust model by forming a 3-dimensional metric in order to deal with the dynamic topology of MANET. In this paper, we have proposed a trust based routing protocol named Enhanced Average Encounter Rate-AODV (EAER-AODV) that employs the trust model based on nodes’ opinion. In EAER-AODV, opinion represents the trust among nodes which is updated frequently according to the protocol specification. Trust based on recommendation is also used to exchange the trust information among nodes. In this protocol, a node selects a routing path according to the trust values of its neighbour nodes. Extensive simulation analysis shows that EAER-AODV can effectively avoid the malicious nodes and nodes having frequent mobility while selecting the routes. It is also shown that EAER-AODV is compared with existing methods to prove its efficacy.

A reliable two-tier energy-efficient topology building algorithm for Wireless Sensor Networks

In spite of various constraints present in Wireless Sensor Networks (WSN), it has become popular in various application domains which need useful information. Among these constraints, energy conservation is the most important aspect. One of the known strategies to save energy and to prolong the lifetime of the WSNs is topology control. In this paper, a reliable energy-efficient topology control algorithm in wireless sensor networks is proposed. The proposed algorithm considers the residual energy and number of neighbors of each node for cluster formation, which is critical for well-balanced energy dissipation of the network. Knowledge-based inference approach is employed to select cluster head. Finally, reliable cluster heads are selected that maintain connectivity and coverage with respect to time. The algorithm not only balances the energy load of each node but also provides global reliability for the whole network. Simulation results demonstrate that the proposed algorithm effectively prolong the network lifetime and reduces the energy consumption.

Detection of selective forwarding attack in wireless ad hoc networks using binary search

Selective forwarding attack is one of the most harmful attacks in wireless networks. This paper proposes an algorithm to defend against selective forwarding attacks based on binary search technique in clustered wireless ad hoc network. In the first phase, the cluster head raises an alarm when number of packets dropped along a path is more than a threshold value. In the second phase, control packets and hello packets are exchanged along a misbehaving routing path between the wireless node and a cluster head to detect compromised node. Experimental results demonstrate that the detection efficiency of the proposed algorithm is more than 90%. The algorithm can detect multiple compromised nodes if they exist. We have also experimented to estimate the threshold value of packet drops and computed the required rate of drops of compromised nodes so that they can be detected.

An efficient binary playfair algorithm using a 4×4 playfair key matrix

Playfair cipher is a digraph cipher which is not preferred now a day for two main reasons. Firstly, it can be easily cracked if there is enough text and secondly, frequency analysis of digraph is anyway possible. This paper proposes a new solution, which encrypts / decrypts each byte by applying the Playfair on its nibbles with the help of a reduced 4×4 Key matrix. This byte by byte encryption supports any character (even multilingual character), number (of any base), symbol and any type of media file and thereby ensures flexibility. Randomness of the algorithm is achieved by rotating the key matrix randomly after encryption / decryption of each byte. Several operations are performed to support the mechanism of lightweight cryptography. The proposed method is implemented and compared with other popular ciphers on the basis of certain parameters, like Avalanche Effect, Time Complexity, and Space Requirement. The result obtained demonstrates efficiency of the proposed algorithm.