Kumar Nitesh

A routing load balanced trajectory design for mobile sink in wireless sensor networks

Unbalanced energy depletion is a well-known problem in wireless sensor networks which is causing hot spot problem as a result of multi-hop communication to forward data to the static sink. This uneven energy consumption can decrease the network lifetime significantly. In the recent years, mobile sink has been introduced towards the solution of this hot spot problem. In this paper, we propose an algorithm to design efficient trajectory for mobile sink in wireless sensor networks which is applicable for delay bound applications. The algorithm is based on rendezvous points where a mobile sink visits the rendezvous points of a predetermined delay bound trajectory. The proposed algorithm determines these rendezvous points based on the routing load. Our proposed algorithm is endorsed through wide simulation, and the results validate that the algorithm allows a mobile sink to collect data in a specified delay limit while maintaining the energy consumption of the nodes.

Indegree-based path design for mobile sink in wireless sensor networks

Sink mobility has strongly proven its efficiency in enhancing the network lifetime and also balancing the remaining energy of the sensor nodes of a wireless sensor network. However, the technique has several critical issues affecting its performance. One of the major issues is the path selection for the mobile sink. In this work, we propose a centralized rendezvous point (RP) based path selection technique to ensure the coverage of each sensor node. Here the RPs are selected from the normal sensor nodes with the objective of covering each sensor node through the minimum number of RPs. The proposed algorithm is compared with a technique finding the same number of RPs using the existing k-means clustering algorithm over the deployed sensor nodes. The cluster centers are treated as the RPs. Both the algorithms were simulated rigorously and the comparison result proves the effectiveness of the proposed algorithm.

A delay-bound efficient path design algorithm for mobile sink in wireless sensor networks

Hotspot problem is one of the major hindrance in the long run functioning of the wireless sensor network. Sink mobility has strongly emerged as a potential solution to it. Here, mobile sink visits the proximity of sensor nodes to collect data from them. However, this results into a lengthy path which is undesirable in most of the applications bounded by some delay. In our work, we propose a rendezvous point(RP)-based delay bound path design for the mobile sink. In the proposed method, the target area is partitioned into hexagonal cells whose centers are considered as the potential positions of RPs. These potential positions are minimized on the basis of several network parameters to select minimum number of RPs to form the delay bound path. Extensive simulations were carried over the proposed algorithm to compare its results with some existing algorithm using several performance metrics like hop count, network lifetime and many more to prove its effectiveness.

Distributed fault detection and recovery algorithms in two-tier wireless sensor networks

Failure of relay nodes in a cluster-based WSN is catastrophic as they act as cluster heads that are responsible for collecting sensed data, aggregate them and send to a sink. Therefore, fault tolerance of relay nodes is an important issue in cluster based WSNs. In this paper, we present a distributed algorithm to detect faulty relay nodes with Om message complexity where m is the number of relay nodes. It is shown that the proposed algorithm can detect any relay node with transient or permanent fault based on neighbouring table information. We also propose a distributed algorithm for local recovery of the member sensor nodes of a failed relay node with message exchange complexity of On where n is the number of sensor nodes. The proposed algorithms are simulated extensively using Weibull distribution under several scenarios of WSN and compared with existing algorithms to show its superiority.

DFDA: A Distributed Fault Detection Algorithm in Two Tier Wireless Sensor Networks

Detection of faulty relay nodes in two tier wireless sensor network (WSN) is an important issue. In this paper, we present a distributed fault detection algorithm for the upper tier of a cluster based WSN. Any faulty relay node is identified by its neighbors on the basis of the neighboring table associated with them. Time redundancy is used to tolerate transient faults and to minimize the false alarms. The algorithm has O(m) message complexity in the worst case for a WSN with m relay nodes. Simulation results are presented and analyzed with various performance metrics, including detection accuracy and false alarm rate.

Relay Node Placement with Assured Coverage and Connectivity: A Jarvis March Approach

Relay node placement preserving coverage and connectivity is an important problem for the deployment of a fault tolerant two tier wireless sensor network (WSN). In this paper, we propose an algorithm for relay node placement that ensures k-coverage of the sensor nodes and s-connectivity of the relay nodes within the network. The basic goal of the algorithm is to optimize the network cost by using least number of relay nodes. This is carried out by reducing the overlapped coverage area of the relay nodes. The algorithm is based on the spiral traversal of sensor nodes, which is generated by using Jarvis March approach. The proposed algorithm runs in

Energy efficient path selection for mobile sink and data gathering in wireless sensor networks

O(n^{2})

Energy efficient fault-tolerant clustering algorithm for wireless sensor networks

O(n2) time for n sensor nodes and is shown to be a 1.5-approximation algorithm. It is equally efficient for different and unequal degree of coverage and connectivity in the target area. The algorithm is experimented through the simulation run for different scenarios of WSN. The experimental results are then compared with some existing algorithms to demonstrate its effectiveness.