Movement Of Sensor Nodes Research Articles

Intrusion Detection Mechanism for Empowered Intruders Using IDEI

In the past, intrusion detection has been extensively investigated as a means of ensuring the security of wireless sensor networks. Anti-recon technology has made it possible for an attacker to get knowledge about the detecting nodes and plot a route around them in order to evade detection. An "empowered intruder" is one who poses new threats to current intrusion detection technologies. Furthermore, the intended impact of detection may not be obtained in certain subareas owing to gaps in coverage caused by the initial deployment of detection nodes at random. A vehicle collaboration sensing network model is proposed to solve these difficulties, in which mobile sensing cars and static sensor nodes work together to identify intrusions by empowered intruders. An algorithm for mobile sensing vehicles, called Intrusion Detection Mechanism for Empowered Intruders(IDEI), and a sleep-scheduling technique for static nodes form the basis of our proposal. Sophisticated intruders will be tracked by mobile sensors, which will fill in the gaps in coverage, while static nodes follow a sleep schedule and will be woken when the intruder is discovered close. Our solution is compared to current techniques like Kinetic Theory Based Mobile Sensor Network (KMsn)and Mean Time to Attacks (MTTA) in terms of intrusion detection performance, energy usage, and sensor node movement distance. IDEI's parameter sensitivity is also examined via comprehensive simulations. It is clear from the theoretical analysis and simulation findings that our idea is more efficient and available.

MMSCM: A multiple mobile sinks coverage maximization based hierarchical routing protocol for mobile wireless sensor networks

AbstractMobile wireless sensor network (MWSN) adapts to the requirements of mobility of civil and military network devices and has received a lot of attention. Designing an efficient, low‐energy, and fault‐tolerant routing protocol for the frequently changing topology of highly mobile MWSNs is challenging. Most routing protocols today only support the movement of sensor nodes or only sink. This paper proposes a Multiple Mobile Sinks Coverage Maximization based hierarchical routing protocol for mobile wireless sensor networks (MMSCM), which allows sensor nodes and sinks to move simultaneously. The MMSCM divides the monitoring area into virtual grids and deploys a movable sink in each grid cell. Sink selects the appropriate next hop for each cluster head in the area to build an optimal routing forest and collects data from all routing tree root nodes at a uniform speed along the specified path with maximum coverage. Simulation results show that, compared with current advanced routing algorithms, the MMSCM protocol can better solve the network delay problem and improve data throughput while extending the network life cycle, which is more suitable for time‐sensitive application scenarios.

AUV-aided data collection considering adaptive ocean currents for underwater wireless sensor networks

Autonomous underwater vehicle (AUV)-assisted data collection is an efficient approach to implementing smart ocean. However, the data collection in time-varying ocean currents is plagued by two critical issues: AUV yaw and sensor node movement. We propose an adaptive AUV-assisted data collection strategy for ocean currents to address these issues. First, we consider the energy consumption of an AUV in conjunction with the value of information (VoI) over the sensor nodes and formulate an optimization problem to maximize the VoI-energy ratio. The AUV yaw problem is then solved by deriving the AUV's reachable region in different ocean current environments and the optimal cruising direction to the target nodes. Finally, using the predicted VoI-energy ratio, we sequentially design a distributed path planning algorithm to select the next target node for AUV. The simulation results indicate that the proposed strategy can utilize ocean currents to aid AUV navigation, thereby reducing the AUV's energy consumption and ensuring timely data collection.

PUF-Based Mutual-Authenticated Key Distribution for Dynamic Sensor Networks

Because of the movements of sensor nodes and unknown mobility pattern, how to ensure two communicating (static or mobile) nodes authenticate and share a pairwise key is important. In this paper, we propose a mutual-authenticated key distribution scheme based on physical unclonable functions (PUFs) for dynamic sensor networks. Compared with traditional key predistribution schemes, the proposal reduces the storage overhead and the key exposure risks and thereby improves the resilience against node capture attacks. Mutual authentication is provided by the PUF challenge-response mechanism. However, the PUF response is not transmitted in plain forms so as to resist the modelling attacks, which is vulnerable in some existing PUF-based schemes. We demonstrate the proposed scheme to improve the secure connectivity and other performances by analysis and experiments.

Sensing Coverage Algorithm of Sparse Mobile Sensor Node with Trade-Off between Packet Loss Rate and Transmission Delay

To solve the problem of sensing coverage of sparse wireless sensor networks, the movement of sensor nodes is considered and a sensing coverage algorithm of sparse mobile sensor node with trade-off between packet loss rate and transmission delay (SCA_SM) is proposed. Firstly, SCA_SM divides the monitoring area into several grids of same size and establishes a path planning model of multisensor nodes’ movement. Secondly, the social foraging behavior of Escherichia coli in bacterial foraging is used. A fitness function formula of sensor nodes’ moving paths is proposed. The optimal moving paths of all mobile sensor nodes which can cover the entire monitoring area are obtained through the operations of chemotaxis, replication, and migration. The simulation results show that SCA_SM can fully cover the monitoring area and reduce the packet loss rate and data transmission delay in the process of data transmission. Under certain conditions, SCA_SM is better than RAND_D, HILBERT, and TCM.

QoS Analysis Of Kinematic Effects For Bluetooth HC-05 And NRF24L01 Communication Modules On WBAN System

Wireless Body Area Network (WBAN) consists of a number of sensor nodes that are attached to the human body, and intended for monitor the human body condition. The WBAN system has several wireless communication modules that are used for sending or exchanging data between sensor nodes and gateway nodes or gateway nodes. There are some factors that are used to decide which communication modules should be implemented on WBAN system, including communication efficiency, distance range, power consumption, and the effect of mobility on QoS. In this study, we analyze the impact of the kinematic movement of sensor nodes on QoS parameter of HC-05 Bluetooth and NRF25L01 communication modules, during sending and receiving process among nodes. We assume that the sensor node and gateway node are attached on the limbs to catch the movement. We use Quality of Service (QoS) parameters such as delay, jitter, and packet loss, to analyze the impact of movement on communication modules. Based on the experimental result, it was found that the average value of delay and jitter for booth communication modules was slightly influenced by the speed of the sensor node movement. During the sensor node movement and data transmission, we found that the NRF24L01 module have a lower delay and jitter value than Bluetooth HC-05 module. The percentage of packet loss tends to be stable at 0% value, even though the speed value becomes higher.

Event-Driven Sensor Deployment in an Underwater Environment Using a Distributed Hybrid Fish Swarm Optimization Algorithm

In open and complex underwater environments, targets to be monitored are highly dynamic and exhibit great uncertainty. To optimize monitoring target coverage, the development of a method for adjusting sensor positions based on environments and targets is of crucial importance. In this paper, we propose a distributed hybrid fish swarm optimization algorithm (DHFSOA) based on the influence of water flow and the operation of an artificial fish swarm system to improve the coverage efficacy of the event set and to avoid blind movements of sensor nodes. First, by simulating the behavior of foraging fish, sensor nodes autonomously tend to cover events, with congestion control being used to match node distribution density to event distribution density. Second, the construction of an information pool is used to achieve information-sharing between nodes within the network connection range, to increase the nodes’ field of vision, and to enhance their global search abilities. Finally, we conduct extensive simulation experiments to evaluate network performance in different deployment environments. The results show that the proposed DHFSOA performs well in terms of coverage efficacy, energy efficiency, and convergence rate of the event set.

A node coverage algorithm for a wireless-sensor-network-based water resources monitoring system

The application of wireless sensor network can achieve real-time monitoring of the underwater environment. Nodes must be effectively deployed in the targeted monitoring area to gain full coverage of the resources in a monitored area of water. However, the variability of flowing water is likely to cause a delay in the transmission of the resource data. Node mobility also requires the use of a more advanced algorithm in the coverage control method of the WSN. What type of methods or measures should be used to deploy mobile sensor nodes to effectively meet the requirement of water resource monitoring tasks and realize the full coverage of water resources, thereby improving the monitoring quality? Moreover, how can the coverage capacity of mobile sensor nodes be improved in water resource monitoring? These are pressing research issues to resolve. This study proposes the deployment of an algorithm for an improved sensor network k-coverage based on probabilistic sensing; maximum weight matching is introduced to realize a centralized allocation strategy, which can effectively reduce the energy consumed in node allocation. The coverage results obtained in a simulation were higher than those of the event probability and the energy-efficient coverage algorithms. The energy consumed during sensor node movement was lower than that with the latter two approaches, indicating that the network node coverage algorithm based on probabilistic sensing that is proposed in this study can effectively meet the requirements for the application of WSNs in water resource monitoring.

감시정찰용 이동형 센서노드의 이동 명령 생성기

Using a large number of low-cost sensor nodes enables the monitoring of physical properties in dangerous or isolated environments. How each sensor node is deployed and moved becomes a very important issue, because a finite number of sensor nodes are used. The spatial gradients of the measurements are used to effectively monitor the physical properties such as the environment temperature, vibration, or the intensity of radio activity. The gradient is estimated from the perturbation/correlation, which is used to measure property changes with respect to sensor node movement. Each sensor node’s movement is planned based on the gradient value, the distribution of all sensor nodes, and the area measured/not measured. The proposed sensor node planner shows better performance than when using evenly distributed/fixed sensor nodes.

CBCD: Cluster based Clone Detection in Mobile Wireless Sensor Networks

Wireless Sensor Network consists of independent sensor nodes that are responsible for monitoring physical conditions. WSN is deployed in hostile environments. So it is vulnerable to capture and compromise by an attacker. An adversary can launch various types of attacks on WSN that can be classified as layer-dependent attack and layer-independent attacks. The layer-independent attacks are Sybil attack and Clone attack. In Clone attack an adversary can capture a sensor and creates clone of a captured node. These clone nodes are deployed in network area. It is difficult to detect clone nodes in the sensor network. There are so many clone detection protocols are available in static and mobile sensor networks. It is more challenging to detect clone attack in mobile WSN compared to the static WSN. The proposed clone attack detection protocol called as Cluster Based Clone Attack Detection (CBCD) discovers the clone nodes available in Mobile WSN. In this protocol sensor network divided into clusters. All the clusters have a cluster head and random number of sensors nodes. This protocol detect clone node according to the movement of sensor nodes. The clone is identified when sensor node move within the cluster or other clusters in the sensor network. Theoretical analysis and simulations have been conducted to evaluate the protocol in terms of clone detection time, clone detection ratio, memory consumption.

Mathematical Model of Security Framework for Routing Layer Protocol in Wireless Sensor Networks

Most of the environmental and non-attended applications of Wireless Sensor Networks (WSN's) need mobile sensor nodes. However, mobility of sensor nodes increases security issues in WSNs and it's also vulnerable to various kinds of attacks. Dynamic WSN emerges two most common issues related to the authentication of moving sensor nodes and security in communication and key distribution. After possible movement of sensor node requires authenticating again and again from the base station or some other trusted nodes. Similarly, confidentiality in communication and key distribution is an important factor against man-in-middle type of attacks. Till the day most of the WSN's security researchers concentrate on the static environment. Though there schemes are secure and efficient but not sufficient to secure mobile WSN's environment. In this paper we have proposed a novel protocol framework and related mathematical model for secure routing layer communication and key distribution in mobile WSN's. After that we apply this model for performance evaluation on the basis of static as well as dynamic scenario for different number of nodes which shows that our framework is satisfactorily suitable for dynamic WSNs applications.

A Network Topology Control and Identity Authentication Protocol with Support for Movable Sensor Nodes.

It is expected that in the near future wireless sensor network (WSNs) will be more widely used in the mobile environment, in applications such as Autonomous Underwater Vehicles (AUVs) for marine monitoring and mobile robots for environmental investigation. The sensor nodes’ mobility can easily cause changes to the structure of a network topology, and lead to the decline in the amount of transmitted data, excessive energy consumption, and lack of security. To solve these problems, a kind of efficient Topology Control algorithm for node Mobility (TCM) is proposed. In the topology construction stage, an efficient clustering algorithm is adopted, which supports sensor node movement. It can ensure the balance of clustering, and reduce the energy consumption. In the topology maintenance stage, the digital signature authentication based on Error Correction Code (ECC) and the communication mechanism of soft handover are adopted. After verifying the legal identity of the mobile nodes, secure communications can be established, and this can increase the amount of data transmitted. Compared to some existing schemes, the proposed scheme has significant advantages regarding network topology stability, amounts of data transferred, lifetime and safety performance of the network.

Parametric Comparative Analysis of Underwater Wireless Sensor Networks Routing Protocols

underwater wireless sensor networks have found many applications in today's world as they are used in medical applications, sea exploration, military applications and many more. With the advancement in the underwater wireless sensor networks technology, new research challenges are found that are to be resolved like how efficient routing can be done without sacrificing energy consumption of the sensor nodes, how the deployment of the sensor nodes should be done and so on. Due to the movement of sensor nodes with the water currents, the deployment and routing becomes a difficult task. In this paper, various routing protocols like Information Carrying routing protocol, Depth Based routing protocol, Constraint Based Depth based routing protocol, Directional flooding routing protocol are discussed and a comparative analysis of these routing protocols on the basis of various parameters like localization information, network topology, and use of control packets, network architecture used is presented.

The Design of an Optimal and Secure Routing Model in Wireless Sensor Networks by Using PSO Algorithm

Abstract Wireless sensor networks (WSNs) are consisted of tens, hundreds or even thousands of self-directed sensors which are embedded in an environment wirelessly at a distance from each other to communicate with each other, and their task is discovering and aggregation of environmental information and transmitting it to a monitoring center. Continuous movement of sensor nodes and their limited battery power causes routing problems for these types of networks. Thus, providing a reliable and secure protocol in wireless sensor networks seems crucial. Our main emphasis in this paper is on utilizing artificial intelligence techniques such as clustering and Particle Swarm Optimization (PSO) algorithm for finding a safe and efficient routing in wireless sensor networks.

A dynamic key management scheme for dynamic wireless sensor networks

AbstractDynamic wireless sensor network (DWSN) is a group of mobile sensor nodes deployed in an intended area. Secure communication in DWSNs depends on the existence of an efficient key management scheme. Because of the movements of sensor nodes and unknown mobility pattern, dynamic key management is an important issue in such networks. In this paper, we propose a new key management scheme, which uses key pre‐distribution and post‐deployment key establishment mechanisms for DWSNs. The proposed approach ensures that the two communicating nodes share at least one common key. It also provides efficient ways for key generation and revocation as well as addition or deletion of mobile sensor nodes. Compared with the other key management schemes, which are designed for DWSNs, our simulation and analytical results demonstrate the efficiency of the proposed approach in terms of confidentiality, resilience, memory usage, energy consumption and overhead. Copyright © 2014 John Wiley & Sons, Ltd.

A Fuzzy Based Predictive Cluster Head Selection Scheme for Wireless Sensor Networks

Abstract Clustering, an energy efficient approach is used in Wireless Sensor Network. Clustering involves cluster formation and Cluster Head Selection. As the Cluster Head is involved in carrying out the entire communication, a high energy node has to be selected as Cluster Head. In this paper, a novel predictive Fuzzy based Cluster Head selection algorithm is proposed. The proposal suggests a new input parameter, Rate of recurrent Communication apart from the standard parameters namely the Residual Power of Sensor Nodes, Degree of Neighboring Nodes, Distance between the Node and Base Station, Sensor Node Movement. In this approach, the fuzzy logic evaluates the Cluster Head Selection Probability which is based on the node’s previous communication history to decide the Cluster Head. The proposed algorithm is implemented using Matlab. The simulation results show that the proposed Cluster Head Selection technique is superior to other proposals.

Bioinspired Evolutionary Algorithm Based for Improving Network Coverage in Wireless Sensor Networks

Wireless sensor networks (WSNs) include sensor nodes in which each node is able to monitor the physical area and send collected information to the base station for further analysis. The important key of WSNs is detection and coverage of target area which is provided by random deployment. This paper reviews and addresses various area detection and coverage problems in sensor network. This paper organizes many scenarios for applying sensor node movement for improving network coverage based on bioinspired evolutionary algorithm and explains the concern and objective of controlling sensor node coverage. We discuss area coverage and target detection model by evolutionary algorithm.

Autonomous Deployment in Mobile Sensor Systems

In order to reduce the distribution cost of sensor nodes, a mobile sensor deployment has been proposed. The mobile sensor deployment can be solved by finding the optimal layout and planning the movement of sensor nodes with minimum energy consumption. However, previous studies have not sufficiently addressed these issues with an efficient way. Therefore, we propose a new deployment approach satisfying these features, namely a tree-based approach. In the tree-based approach, we propose three matching schemes. These matching schemes match each sensor node to a vertex in a rake tree, which can be trivially transformed to the target layout. In our experiments, the tree-based approach successfully deploys the sensor nodes in the optimal layout and consumes less energy than previous works.

Deployment of a mobile wireless sensor network with k-coverage constraint: a cellular learning automata approach

Deployment of a wireless sensor network is a challenging problem, especially when the environment of the network does not allow either of the random deployment or the exact placement of sensor nodes. If sensor nodes are mobile, then one approach to overcome this problem is to first deploy sensor nodes randomly in some initial region within the area of the network, and then let the sensor nodes to move around and cooperatively and gradually increase the covered section of the area. Recently, a cellular learning automata-based deployment strategy, called CLA-DS, is introduced in literature which follows this approach and is robust against inaccuracies which may occur in the measurements of sensor positions or in the movements of sensor nodes. Despite its advantages, this deployment strategy covers every point within the area of the network with only one sensor node, which is not enough for applications with k-coverage requirement. In this paper, we extend CLA-DS so that it can address the k-coverage requirement. This extension, referred to as CLA-EDS, is also able to address k-coverage requirement with different values of k in different regions of the network area. Experimental results have shown that the proposed deployment strategy, in addition to the advantages it inherits from CLA-DS, outperforms existing algorithms such as DSSA, IDCA, and DSLE in covering the network area, especially when required degree of coverage differs in different regions of the network.

Coverage enhancement by using the mobility of mobile sensor nodes

Coverage is a fundamental problem in sensor networks. Sensor coverage, which reflects how well a sensor network is monitored by sensors, is an important measure for the quality of service (QoS) that a sensor network can provide. In mobile sensor networks, the mobility of sensor nodes can be utilized to enhance the coverage of the network. Since the movement of sensor nodes will consume much energy, this mobility of sensor nodes should be properly managed by some pre-defined schemes or protocols. By noticing this issue, some existing works have proposed several movement-assisted sensor deployment schemes. These works assume that the target field is a 2-dimensional space. In this paper, we study a generalized case of this problem whereby the target field can be a space which ranges from 1-dimensional to 3-dimensional. Two variations of the movement-assisted sensor deployment problem with different optimization objectives were formulated. We identify a set of basic attributes which can be used as guidelines for designing movement-assisted sensor deployment schemes. Based on these attributes, we propose efficient algorithms for both variants of the movement-assisted sensor deployment problem.