Taxonomy of Cluster-Based Target Tracking System in Wireless Sensor Networks

Author(s):  
Ammar Odeh

Objective: In the last decade, with the advancement of big data technology and the internet of things, Wireless Sensor Networks (WSN) become fundamental for the success of a different range of applications especially those demanding massive data processing. Methods: This paper investigates several tracking methods to introduce a novel cluster-based target tracking analysis model. Results: Some crucial factors of the cluster-based routing protocols are demonstrated, and a comparison among these different methods is conducted according to our taxonomy such as cluster formation, predicate/proactive, target speed, single or multi-object tracking, boundary problem, scalability, energy efficiency, and communication cost. This can help the community of researchers by providing clear information for further study. Conclusion: The proposed paper compares the differences and similarities between the available approaches across different categories in terms of the Cluster construction, Clustering method, Object Speed, Number of Objects, Boundary problem, and scalability. Finally, we can recognize some open issues that have so far gained little publicity or remain unexplored yet.

Author(s):  
Ammar Odeh ◽  
Eman Abdelfattah ◽  
Mofleh Al diabate

In the last decade, with the advancement of big data technology and the internet of things, wireless sensor networks (WSN) become fundamental for the success of different range of applications specially those demanding massive data processing. A target tracking system is a significant part of WSNs that has its own advantages and challenges. In this paper, the challenges of detecting and tracking a mobile device through cluster-based target tracking system in wireless sensor networks, are investigated. This paper investigates several tracking methods to introduce a novel cluster-based target tracking analysis model. In addition, some crucial factors of the cluster-based routing protocols are demonstrated, and a comparison among these different methods is conducted according to our taxonomy such as cluster formation, predicate/proactive, target speed, single or multi-object tracking, boundary problem, scalability, energy efficiency, and communication cost. Finally, a summary and conclusion are presented.


Sensors ◽  
2019 ◽  
Vol 19 (15) ◽  
pp. 3436
Author(s):  
Yang ◽  
Xiong ◽  
Wang ◽  
Zhang

Herein, the problem of target tracking in wireless sensor networks (WSNs) is investigated in the presence of Byzantine attacks. More specifically, we analyze the impact of Byzantine attacks on the performance of a tracking system. First, under the condition of jointly estimating the target state and the attack parameters, the posterior Cramer–Rao lower bound (PCRLB) is calculated. Then, from the perspective of attackers, we define the optimal Byzantine attack and theoretically find a way to achieve such an attack with minimal cost. When the attacked nodes are correctly identified by the fusion center (FC), we further define the suboptimal Byzantine attack and also find a way to realize such an attack. Finally, in order to alleviate the negative impact of attackers on the system performance, a modified sampling importance resampling (SIR) filter is proposed. Simulation results show that the tracking results of the modified SIR filter can be close to the true trajectory of the moving target. In addition, when the quantization level increases, both the security performance and the estimation performance of the tracking system are improved.


2019 ◽  
Vol 13 (2) ◽  
pp. 1618-1627 ◽  
Author(s):  
Abhishek Tripathi ◽  
Hari Prabhat Gupta ◽  
Tanima Dutta ◽  
Durgesh Kumar ◽  
Satyabrat Jit ◽  
...  

Author(s):  
Amandeep Kaur Sohal ◽  
Ajay Kumar Sharma ◽  
Neetu Sood

Background: An information gathering is a typical and important task in agriculture monitoring and military surveillance. In these applications, minimization of energy consumption and maximization of network lifetime have prime importance for green computing. As wireless sensor networks comprise of a large number of sensors with limited battery power and deployed at remote geographical locations for monitoring physical events, therefore it is imperative to have minimum consumption of energy during network coverage. The WSNs help in accurate monitoring of remote environment by collecting data intelligently from the individual sensors. Objective: The paper is motivated from green computing aspect of wireless sensor network and an Energy-efficient Weight-based Coverage Enhancing protocol using Genetic Algorithm (WCEGA) is presented. The WCEGA is designed to achieve continuously monitoring of remote areas for a longer time with least power consumption. Method: The cluster-based algorithm consists two phases: cluster formation and data transmission. In cluster formation, selection of cluster heads and cluster members areas based on energy and coverage efficient parameters. The governing parameters are residual energy, overlapping degree, node density and neighbor’s degree. The data transmission between CHs and sink is based on well-known evolution search algorithm i.e. Genetic Algorithm. Conclusion: The results of WCEGA are compared with other established protocols and shows significant improvement of full coverage and lifetime approximately 40% and 45% respectively.


2021 ◽  
Vol 40 (5) ◽  
pp. 8727-8740
Author(s):  
Rajvir Singh ◽  
C. Rama Krishna ◽  
Rajnish Sharma ◽  
Renu Vig

Dynamic and frequent re-clustering of nodes along with data aggregation is used to achieve energy-efficient operation in wireless sensor networks. But dynamic cluster formation supports data aggregation only when clusters can be formed using any set of nodes that lie in close proximity to each other. Frequent re-clustering makes network management difficult and adversely affects the use of energy efficient TDMA-based scheduling for data collection within the clusters. To circumvent these issues, a centralized Fixed-Cluster Architecture (FCA) has been proposed in this paper. The proposed scheme leads to a simplified network implementation for smart spaces where it makes more sense to aggregate data that belongs to a cluster of sensors located within the confines of a designated area. A comparative study is done with dynamic clusters formed with a distributive Low Energy Adaptive Clustering Hierarchy (LEACH) and a centralized Harmonic Search Algorithm (HSA). Using uniform cluster size for FCA, the results show that it utilizes the available energy efficiently by providing stability period values that are 56% and 41% more as compared to LEACH and HSA respectively.


Energies ◽  
2021 ◽  
Vol 14 (9) ◽  
pp. 2417
Author(s):  
Andrzej Michalski ◽  
Zbigniew Watral

This article presents the problems of powering wireless sensor networks operating in the structures of the Internet of Things (IoT). This issue was discussed on the example of a universal end node in IoT technology containing RFID (Radio Frequency Identification) tags. The basic methods of signal transmission in these types of networks are discussed and their impact on the basic requirements such as range, transmission speed, low energy consumption, and the maximum number of devices that can simultaneously operate in the network. The issue of low power consumption of devices used in IoT solutions is one of the main research objects. The analysis of possible communication protocols has shown that there is a possibility of effective optimization in this area. The wide range of power sources available on the market, used in nodes of wireless sensor networks, was compared. The alternative possibilities of powering the network nodes from Energy Harvesting (EH) generators are presented.


Sign in / Sign up

Export Citation Format

Share Document