scholarly journals Energy-Balanced Multisensory Scheduling for Target Tracking in Wireless Sensor Networks

Sensors ◽  
2018 ◽  
Vol 18 (10) ◽  
pp. 3585 ◽  
Author(s):  
Juan Feng ◽  
Hongwei Zhao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Target Tracking ◽  
Cluster Head ◽  
Sleep Time ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sleep Scheduling ◽  
Scheduling Strategy ◽  
Multiple Sensors

One important way to extend the lifetime of wireless sensor networks (WSNs) is to manage the sleep scheduling of sensor nodes after they are deployed. Most of the existing works on node scheduling mainly concentrate on nodes which have only one sensor, and they regard a node and its sensor modules as a whole to manage sleep scheduling. Few works involve the sensed modules scheduling of the sensor nodes, which have multiple sensors. However, some of the sensed modules (such as video sensor) consume a lot of energy. Therefore, they have less energy efficiency for multisensory networks. In this paper, we propose a distributed and energy-balanced multisensory scheduling strategy (EBMS), which considers the scheduling of both the communication modules and the sensed modules for each node in target tracking WSNs. In EBMS, the network is organized as clustering structures. Each cluster head adaptively assigns a sleep time to its cluster members according to the position of the members. Energy-balanced multisensory scheduling strategy also proposes an energy balanced parameter to balance the energy consumption of each node in the network. In addition, multi-hop coordination scheme is proposed to find the optimal cooperation among clusters to maximize the energy conservation. Experimental results show that EBMS outperformed the state-of-the-art approaches.

scholarly journals Security Issues of Wireless Sensor Networks Based on Target Tracking

2016 ◽  
Vol 12 (10) ◽  
pp. 97
Author(s):  
Jun Ma
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Target Tracking ◽  
Large Scale ◽  
Target Location ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Security Issues ◽  
Head Node

<span style="font-family: 'Times New Roman',serif; font-size: 10pt; -ms-layout-grid-mode: line; mso-fareast-font-family: SimSun; mso-fareast-theme-font: minor-fareast; mso-ansi-language: EN-US; mso-fareast-language: EN-US; mso-bidi-language: AR-SA;">In this paper the dynamic point target tracking is studied, and a message driven target tracking algorithm based on non-ranging is proposed by combining the actual sensor node characteristics. By tissue tracking around the target sensor nodes collaborate to establish a tracking cluster and the cluster head node for data fusion to accurately locate the target and thus formed a kind of efficient and precise distributed dynamic tracking cluster algorithm of DTC. The tracking cluster can follow the target as a shadow, and it can realize the management of the cluster itself and constantly report to the sink node to the target location. The protocol is especially suitable for the use of large scale wireless sensor networks with low node cost.</span>

scholarly journals Routing Optimization and Secure Target Tracking in Distributed Wireless Sensor Networks

2012 ◽  
pp. 396-419
Author(s):  
Majdi Mansouri ◽  
Khoukhi Lyes ◽  
Hichem Snoussi ◽  
Cédric Richard
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Target Tracking ◽  
Cluster Head ◽  
Target Position ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Routing Optimization ◽  
Relay Location ◽  
Communication Path

Due to the limited energy supplies of nodes in wireless sensor networks (WSN), optimizing their design under energy constraints, reducing their communication costs, and securing their aggregated data are of paramount importance. To this goal, and in order to efficiently solve the problem of target tracking in WSN with quantized measurements, the authors propose to jointly estimate the target position and the relay location, and select the secure sensor nodes and the best communication path. Firstly, the authors select the appropriate group in order to balance the energy dissipation and to provide the required data of the target in the WSN. This selection is also based on the transmission power between a single sensor and a cluster head (CH). Secondly, the authors detect the malicious sensor nodes based on the information relevance of their measurements. Thirdly, they select the best communication path between the candidate sensor and the CH. Then, the authors estimate jointly the target position and the relay location using Quantized Variational Filtering (QVF) algorithm. The selection of candidate sensors is based on multi-criteria function, which is computed by using the predicted target position provided by the QVF algorithm. The proposed algorithm for the detection of malicious sensor nodes is based on Kullback-Leibler distance between the current target position distribution and the predicted sensor observation, while the best communication path is selected as well as the highest signal-to-noise ratio (SNR) at the CH. The efficiency of the proposed method is validated by extensive simulations in target tracking for wireless sensor networks.

scholarly journals A Comparative Study of Target Tracking Approaches in Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Asmaa Ez-Zaidi ◽  
Said Rakrak
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Target Tracking ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Future Directions ◽  
Wide Range ◽  
Comprehensive Survey ◽  
The Subject ◽  
Intense Research

Wireless sensor networks have been the subject of intense research in recent years. Sensor nodes are used in wide range of applications such as security, military, and environmental monitoring. One of the most interesting applications in wireless sensor networks is target tracking, which mainly consists in detecting and monitoring the motion of mobile targets. In this paper, we present a comprehensive survey of target tracking approaches. We then analyze them according to several metrics. We also discuss some of the challenges that influence the performance of tracking schemes. In the end, we conduct detailed analysis and comparison between these algorithms and we conclude with some future directions.

scholarly journals Energy Consumption Based Low Energy Aware Gateway (LEAG) Protocol in Wireless Sensor Networks

2019 ◽  
Vol 8 (5S3) ◽  
pp. 128-132 ◽  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Cluster Head ◽  
Base Station ◽  
Low Energy ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware

Wireless Sensor Networks (WSN) consists of a large amount of nodes connected in a self-directed manner. The most important problems in WSN are Energy, Routing, Security, etc., price of the sensor nodes and renovation of these networks is reasonable. The sensor node tools included a radio transceiver with an antenna and an energy source, usually a battery. WSN compute the environmental conditions such as temperature, sound, pollution levels, etc., WSN built the network with the help of nodes. A sensor community consists of many detection stations known as sensor nodes, every of which is small, light-weight and portable. Nodes are linked separately. Each node is linked into the sensors. In recent years WSN has grow to be an essential function in real world. The data’s are sent from end to end multiple nodes and gateways, the data’s are connected to other networks such as wireless Ethernet. MGEAR is the existing mechanism. It works with the routing and energy consumption. The principal problem of this work is choosing cluster head, and the selection is based on base station, so the manner is consumes energy. In this paper, develop the novel based hybrid protocol Low Energy Aware Gateway (LEAG). We used Zigbee techniques to reduce energy consumption and routing. Gateway is used to minimize the energy consumption and data is send to the base station. Nodes are used to transmit the data into the cluster head, it transmit the data into gateway and gateway compress and aggregate the data then sent to the base station. Simulation result shows our proposed mechanism consumes less energy, increased throughput, packet delivery ration and secure routing when compared to existing mechanism (MGEAR).

A Node Authentication Model in Wireless Sensor Networks With Locked Cluster Generation

2021 ◽  
pp. 236-250
Author(s):  
C. R. Bharathi ◽  
Alapati Naresh ◽  
Arepalli Peda Gopi ◽  
Lakshman Narayana Vejendla
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Cluster Formation ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Generation ◽  
Secure Network

In wireless sensor networks (WSN), the majority of the inquiries are issued at the base station. WSN applications frequently require collaboration among countless sensor nodes in a network. One precedent is to persistently screen a region and report occasions. A sensor node in a WSN is initially allocated with an energy level, and based on the tasks of that sensor node, energy will be reduced. In this chapter, two proposed methods for secure network cluster formation and authentication are discussed. When a network is established then all the nodes in it must register with cluster head and then authentication is performed. The selection of cluster head is done using a novel selection algorithm and for authenticating the nodes. Also, a novel algorithm for authentication is used in this chapter. The validation and authorization of nodes are carried over by managing the keys in WSN. The results have been analyzed using NS2 simulator with an aid of list of relevant parameters.

scholarly journals Energy-Efficient Unequal Chain Length Clustering for Wireless Sensor Networks in Smart Cities

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Mohammad Baniata ◽  
Jiman Hong
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Chain Length ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Smart Cities ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor

The recent advances in sensing and communication technologies such as wireless sensor networks (WSN) have enabled low-priced distributed monitoring systems that are the foundation of smart cities. These advances are also helping to monitor smart cities and making our living environments workable. However, sensor nodes are constrained in energy supply if they have no constant power supply. Moreover, communication links can be easily failed because of unequal node energy depletion. The energy constraints and link failures affect the performance and quality of the sensor network. Therefore, designing a routing protocol that minimizes energy consumption and maximizes the network lifetime should be considered in the design of the routing protocol for WSN. In this paper, we propose an Energy-Efficient Unequal Chain Length Clustering (EEUCLC) protocol which has a suboptimal multihop routing algorithm to reduce the burden on the cluster head and a probability-based cluster head selection algorithm to prolong the network lifetime. Simulation results show that the EEUCLC mechanism enhanced the energy balance and prolonged the network lifetime compared to other related protocols.

scholarly journals An Energy-Aware Method for Selecting Cluster Heads in Wireless Sensor Networks

2020 ◽  
Vol 10 (21) ◽  
pp. 7886
Author(s):  
Atefeh Rahiminasab ◽  
Peyman Tirandazi ◽  
M. J. Ebadi ◽  
Ali Ahmadian ◽  
Mehdi Salimi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Cluster Head ◽  
Base Station ◽  
Energy Resources ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Dynamic Clustering ◽  
Clustering Protocol

Wireless sensor networks (WSNs) include several sensor nodes that have limited capabilities. The most critical restriction in WSNs is energy resources. Moreover, since each sensor node’s energy resources cannot be recharged or replaced, it is inevitable to propose various methods for managing the energy resources. Furthermore, this procedure increases the network lifetime. In wireless sensor networks, the cluster head has a significant impact on system global scalability, energy efficiency, and lifetime. Furthermore, the cluster head is most important in combining, aggregating, and transferring data that are received from other cluster nodes. One of the substantial challenges in a cluster-based network is to choose a suitable cluster head. In this paper, to select an appropriate cluster head, we first model this problem by using multi-factor decision-making according to the four factors, including energy, mobility, distance to centre, and the length of data queues. Then, we use the Cluster Splitting Process (CSP) algorithm and the Analytical Hierarchy Process (AHP) method in order to provide a new method to solve this problem. These four factors are examined in our proposed approach, and our method is compared with the Base station Controlled Dynamic Clustering Protocol (BCDCP) algorithm. The simulation results show the proposed method in improving the network lifetime has better performance than the base station controlled dynamic clustering protocol algorithm. In our proposed method, the energy reduction is almost 5% more than the BCDCP method, and the packet loss rate in our proposed method is almost 25% lower than in the BCDCP method.

A Cluster Algorithm for Wireless Sensor Networks Based on Energy Efficiency

2015 ◽  
Vol 785 ◽  
pp. 744-750
Author(s):  
Lei Gao ◽  
Qun Chen
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Selection Criterion ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Head Node

In order to solve the energy limited problem of sensor nodes in the wireless sensor networks (WSN), a fast clustering algorithm based on energy efficiency for wire1ess sensor networks is presented in this paper. In the system initialization phase, the deployment region is divided into several clusters rapidly. The energy consumption ratio and degree of the node are chosen as the selection criterion for the cluster head. Re-election of the cluster head node at this time became a local trigger behavior. Because of the range of the re-election is within the cluster, which greatly reduces the complexity and computational load to re-elect the cluster head node. Theoretical analysis indicates that the timing complexity of the clustering algorithm is O(1), which shows that the algorithm overhead is small and has nothing to do with the network size n. Simulation results show that clustering algorithm based on energy efficiency can provide better load balancing of cluster heads and less protocol overhead. Clustering algorithm based on energy efficiency can reduce energy consumption and prolong the network lifetime compared with LEACH protocol.

scholarly journals Qualification of Cluster Header and Cluster Member in Wireless Sensor Networks

2019 ◽  
Vol 8 (2S6) ◽  
pp. 101-105
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Sensor Node ◽  
Data Transfer ◽  
Cluster Head ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node

Many researches have been proposed for efficiency of data transmission from sensor nodes to sink node for energy efficiency in wireless sensor networks. Among them, cluster-based methods have been preferred In this study, we used the angle formed with the sink node and the distance of the cluster members to calculate the probability of cluster head. Each sensor node sends measurement values to header candidates, and the header candidate node measures the probability value of the header with the value received from its candidate member nodes. To construct the cluster members, the data transfer direction is considered. We consider angle, distance, and direction as cluster header possibility value. Experimental results show that data transmission is proceeding in the direction of going to the sink node. We calculated and displayed the header possibility value of the neighbor nodes of the sensor node and confirmed the candidates of the cluster header for data transfer as the value. In this study, residual energy amount of each sensor node is not considered. In the next study, we calculate the value considering the residual energy amount of the node when measuring the header possibility value of the cluster.

Sign in / Sign up

Export Citation Format

Share Document