Search

In a wireless sensor network, sensor nodes can send data to the sink directly or through some intermediate nodes. The nearby nodes of the sinks are heavily loaded and thus exhaust energy more rapidly and create a hotspot problem in the network. Mobile sink nodes enable the sensor network to enhance its lifetime. In this paper, a routing protocol is proposed and considers more than one number of mobile sinks in the network. Here, two different types of sink movements (Random Sink Movement) and (Circular Sink Movement) is proposed. The first one is based on the random waypoint model, whereas, in the second one, the sinks move in a circular path. The sink nodes broadcast their mobility information into the network during movement in regular intervals to make aware of the sensor nodes regarding sinks availability. The sinks node mobility information helps the sensor nodes to discover the most energy efficient and delay tolerant path towards the sink node. Simulation results show that our proposed MSHRP routing algorithm can reduce the hotspot problem and lengthen the network lifetime. Further an improvement is observed on the performance in comparison with the existing protocols in terms of energy consumption, end-to-end delay, node lifetime, and average hop distance to sink. The proposed RSM model reduces the energy consumption by 51.56 percent,43.3 percent and 20 percent respectively than RBR, PEGASIS and EPEGASIS. Similarly, the proposed CSM model reduces the energy consumption by 67.8 percent, 62.11 percent and 46.7 percent as compared to RBR,PEGASIS and EPEGASIS respectively. [ABSTRACT FROM AUTHOR]

The effectiveness of wireless sensor network (WSN) in Internet of Thing (IoT) based large scale application depends on the deployment method along with the routing protocol. The sensor nodes are an important component of WSN-assisted IoT network running on limited and non-rechargeable energy resource. The performance of WSN-assisted IoT is decreased, when network is deployed at large area. So, developing robust and energy-efficient routing protocol is a challenging task to prolong the network lifetime. In contrast to the state-of-the-art techniques this paper introduces Scalable and energy efficient routing protocol (SEEP). SEEP leverages the multi-hop hierarchical routing scheme to minimize the energy consumption. To achieve scalable and energy efficient network, SEEP employs a multi-tier based clustering framework. The network area in SEEP is divided into various zones with the help of proposed subarea division algorithm. The number of zones in the network are increased as the network size increases to avoid long-distance communication. Every zone is divided into certain number of clusters (sub-zones) and the number of clusters are increased towards the base station, whereas the zone width is decreased. In every cluster, some of the optimal nodes are promoted as a Relay Node (RN) and Cluster Head (CH). Normal nodes send their sensed data to the base station via local RN and CH in a multi-hop way. Furthermore, propose protocol provides a trade-off between distance and energy to prolong the network lifetime. In the proposed framework, static and mobile scenarios have been considered by applying Random walk and Random waypoint model for node mobility in simulation to make it more realistic as the various application of WSN-assisted IoT. The effectiveness of SEEP is examined against LEACH, M-LEACH, EA-CRP, TDEEC, DEEC, SEP, and MIEEPB, and result indicates that SEEP performs better for different network metrics: network lifetime, scalability, and energy efficiency. [ABSTRACT FROM AUTHOR]

In this paper, we tackle the problem of designing a random mobility model generating a target node spatial distribution. More specifically, we solve a long standing open problem by presenting two versions of the well-known random waypoint (RWP) mobility model in bounded regions generating a uniform steady-state node spatial distribution. In the first version, named temporal-RWP, we exploit the temporal dimension of node mobility and achieve uniformity by continuously changing the speed of a mobile node as a function of its location and of the density function of trajectories in the movement region R. In the second version, named spatial-RWP, we instead exploit the spatial dimension and achieve uniformity by selecting waypoints according to a suitably defined mix of probability density functions. Both proposed models can be easily incorporated in wireless network simulators, and are thus of practical use. The RWP models presented in this paper allow for the first time completely removing the well-known border effect causing possible inaccuracies in mobile network simulation, thus completing the picture of a 'perfect' simulation methodology drawn in existing literature. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) are often deployed in harsh environments. Thus adversaries can capture some nodes, replicate them and deploy those replicas back into the strategic positions in the network to launch a variety of attacks. These are referred to as node replication attacks. Some methods of defending against node replication attacks have been proposed, yet they are not very suitable for the mobile wireless sensor networks. In this paper, we propose a new protocol to detect the replicas in mobile WSNs. In this protocol, polynomial-based pair-wise key pre-distribution scheme and Counting Bloom Filters are used to guarantee that the replicas can never lie about their real identifiers and collect the number of pair-wise keys established by each sensor node. Replicas are detected by looking at whether the number of pair-wise keys established by them exceeds the threshold. We also derive accurate closed form expression for the expected number of pair-wise keys established by each node, under commonly used random waypoint model. Analyses and simulations verify that the protocol accurately detects the replicas in the mobile WSNs and supports their removal. [ABSTRACT FROM AUTHOR]