scholarly journals Detecting Anonymous Target and Predicting Target Trajectories in Wireless Sensor Networks

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 719
Author(s):  
P. Leela Rani ◽  
G. A. Sathish Kumar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Target Tracking ◽  
Target Detection ◽  
Sensor Node ◽  
Minimum Energy ◽  
Maximum Error ◽  
Base Station ◽  
Position Estimation ◽  
Wireless Sensor

Target Tracking (TT) is an application of Wireless Sensor Networks (WSNs) which necessitates constant assessment of the location of a target. Any change in position of a target and the distance from each intermediate sensor node to the target is passed on to base station and these factors play a crucial role in further processing. The drawback of WSN is that it is prone to numerous constraints like low power, faulty sensors, environmental noises, etc. The target should be detected first and its path should be tracked continuously as it moves around the sensing region. This problem of detecting and tracking a target should be conducted with maximum accuracy and minimum energy consumption in each sensor node. In this paper, we propose a Target Detection and Target Tracking (TDTT) model for continuously tracking the target. This model uses prelocalization-based Kalman Filter (KF) for target detection and clique-based estimation for tracking the target trajectories. We evaluated our model by calculating the probability of detecting a target based on distance, then estimating the trajectory. We analyzed the maximum error in position estimation based on density and sensing radius of the sensors. The results were found to be encouraging. The proposed KF-based target detection and clique-based target tracking reduce overall expenditure of energy, thereby increasing network lifetime. This approach is also compared with Dynamic Object Tracking (DOT) and face-based tracking approach. The experimental results prove that employing TDTT improves energy efficiency and extends the lifetime of the network, without compromising the accuracy of tracking.

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 Bioinspired Evolutionary Algorithm Based for Improving Network Coverage in Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Mohammadjavad Abbasi ◽  
Muhammad Shafie Bin Abd Latiff ◽  
Hassan Chizari
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Evolutionary Algorithm ◽  
Sensor Node ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Target Area ◽  
Network Coverage ◽  
Detection Model

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.

scholarly journals Peningkatan Kinerja Protokol PEGASIS Dengan Pembagian Area Dan Pembentukan Chain Secara Adaptif

2020 ◽  
Vol 7 (6) ◽  
pp. 1271
Author(s):  
Muhammad Riko Anshori Prasetya ◽  
Waskhito Wibisono
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Base Station ◽  
Wireless Sensor

<p><em>Wireless Sensor Networks</em> (WSN) merupakan sebuah perangkat jaringan yang terdiri dari <em>Base Station</em> (BS) dan beberapa sensor node. WSN sendiri banyak digunakan dalam berbagai bidang seperti bidang industri, kesehatan, militer, dan pengelolaan bencana. Penggunaan WSN ini sendiri ditunjukkan untuk mendapatkan informasi terkait suhu, intensitas cahaya, getaran, panas, dan lain-lain. Saat mengumpulkan informasi, sensor <em>node</em> membutuhkan energi, namun sensor <em>node</em> memiliki energi yang terbatas. PEGASIS merupakan salah satu algoritma <em>routing</em> protokol dengan sistem <em>chain-based</em> yang berguna untuk menyelesaikan permasalahan tersebut. Namun dalam penggunaan berskala luas, protokol ini membutuhkan energi besar dalam melakukan transmisi data. Oleh karena itu, penelitian ini mengusulkan sebuah pengembangan PEGASIS, yaitu VCLUS-PEGASIS. VCLUS-PEGASIS memodifikasi area PEGASIS dengan membaginya menjadi beberapa grid secara vertikal. Selain itu, <em>chain</em> dalam satu <em>grid</em> akan diubah apabila terjadi transmisi yang panjang antara satu node dengan node tetangganya yang masih dalam satu area menggunakan algoritma K-Means. Hal tersebut bertujuan untuk meminimalisasi pengiriman energi setiap transmisi. Hasil pengujian menujukkan jika protokol VCLUS-PEGASIS mampu untuk mempertahankan masa hidup node dan menurunkan transmisi energi daripada PEGASIS.</p>

scholarly journals Detection of Replay Attack through Sequence Number Encryption in EDDK based WSNs

2020 ◽  
Vol 9 (9) ◽  
pp. 593-599
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Replay Attack ◽  
Local Cluster ◽  
Sequence Number ◽  
Replay Attacks

Wireless sensor networks can be used to deliver status information to users in real time. The sensor nodes used in wireless sensor networks are arranged by attaching sensors to acquire necessary information, such as vibration, sound, light, and temperature. Since a sensor node is small in size and inexpensive, it is advantageous for monitoring large areas. When a sensor node senses a change in a situation, this event information is wirelessly communicated with other sensor nodes and transmitted to a base station. However, since the sensor nodes used in wireless sensor networks are small and inexpensive, there are restrictions in terms of their battery life, memory, and computing power. An attacker can easily compromise a sensor node and use a compromised node to attempt message tampering and energy consumption attacks. EDDK is a scheme that detects attacks from compromised nodes through key management. EDDK uses a pairwise key and a local cluster key to defend against various attacks in the network. In addition, EDDK protects against replay attacks by using sequence numbers and guarantees message integrity. However, since the sequence number and sensor node ID are not encrypted, they can be used as an attack element. An attacker can attempt a replay attack by manipulating the sequence number through sniffing. A replay attack that occurs in a wireless sensor network consumes sensor node energy and confuses the user. In order to defend against such an attack, we propose a sequence number encryption scheme. The proposed scheme detects new types of replay attacks and shows about 7% energy improvement.

Enable Efficient Data Aggregation for Region-Based Top-K Queries in Wireless Sensor Networks

2014 ◽  
Vol 556-562 ◽  
pp. 6311-6315
Author(s):  
Yong Qing Wang ◽  
Jing Tian Tang ◽  
Xing Po Ma
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Storage ◽  
Data Aggregation ◽  
Energy Cost ◽  
Sensor Node ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor

We study data aggregation for region-based top-k queries in wireless sensor networks, which is one kind of internet of things. Because the energy of sensor nodes is limited and a sensor node will die if it has no energy left, one of the important targets for all protocols in wireless sensor networks is to decrease the energy consumption of the sensor nodes. For a sensor node, communication cost is much more than other kinds of energy cost such as energy cost on computation and data storage. Thus, a very efficient way to decrease the energy cost of the sensor nodes is to decrease the quality of the sensing data that will be transmitted to the base station. In this paper, we use the technique of data aggregation to achieve this goal, and propose an algorithm to construct a novel Data Aggregation Tree (DAT) in the query region. To check the efficiency of DAT, we have made a simulation on OMNET, and the results show that DAT can shrink large quality of data when they are transmitted to the base station, and the life time of the sensor networks can thus be prolonged..

scholarly journals An Improved Threshold-Sensitive Stable Election Routing Energy Protocol for Heterogeneous Wireless Sensor Networks

Information ◽  
2019 ◽  
Vol 10 (4) ◽  
pp. 125 ◽  
Author(s):  
Liquan Zhao ◽  
Qi Tang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Minimum Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Heterogeneous Wireless Sensor Networks ◽  
Heterogeneous Wireless Sensor Network ◽  
Stable Election Protocol

In the Threshold-Sensitive Stable Election Protocol, sensors are randomly deployed in the region without considering the balanced energy consumption of nodes. If a node that has been selected as a cluster head is located far away from the base station, it will affect the efficiency of the network due to its early death. This paper proposes an improved energy efficient routing protocol named Improved Threshold-Sensitive Stable Election protocol (ITSEP) for heterogeneous wireless sensor networks. Firstly, we use a node state transformation mechanism to control the number of cluster heads in high-density node areas. Secondly, the proposed protocol improves the threshold formula by considering the distance from the node to the base station, the number of neighbor nodes, its residual energy, and the average distance between nodes. In addition, an optimal route with minimum energy consumption for cluster heads has been selected throughout data transmission. Simulation results show that this algorithm has achieved a longer lifetime than the stable election protocol algorithm, modified stable election protocol algorithm, and threshold-sensitive stable election protocol algorithm for the heterogeneous wireless sensor network.

scholarly journals Sec-Didrip: A Secure Routing Protocol for Wsn Using Ns-3

2019 ◽  
Vol 8 (11) ◽  
pp. 8-11
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Sensor Node ◽  
Base Station ◽  
Current Data ◽  
Secure Routing ◽  
Wireless Sensor ◽  
Data Discovery ◽  
Secure Routing Protocol

Wireless sensor networks (WSN) are responsible on improving or updating and distributing security commands for the data discovery and the dissemination protocols to update the sensor Node configuration parameters. There are two drawbacks to all current data discovery and the dissemination protocols. First, they are based on the centralized strategy; the data item can only be distributed by the base station. For emerging multi-owner-multi-user WSNs, such a strategy is not appropriate. Furthermore, those conventions have not been proposed in view of security and in this manner, assailants can promptly dispatch endeavors to harm the system. This article proposes the first-named convention (Sec-DiDrip) for secure and circulated data discovery and dissemination.

An Improved Localization Algorithm in Wireless Sensor Networks

2014 ◽  
Vol 1049-1050 ◽  
pp. 2144-2148
Author(s):  
Ran Ran Li ◽  
Lei Li ◽  
Xiao Hui Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Low Complexity ◽  
Position Estimation ◽  
Original Version ◽  
Wireless Sensor ◽  
Localization Algorithm

Min-Max localization algorithm is usually used to acquire the position of a sensor node in wireless sensor networks by the reason of its simpleness and low complexity. However, Min-Max algorithm provides a coarse position estimation. In order to increase its accuracy, an Extended Min-Max (E-Min-Max) algorithm has been proposed. In this paper we focus on this algorithm and propose an improved E-Min-Max algorithm to enhance its accuracy further. Simulations show that the improved E-Min-Max algorithm outperforms its original version in localization.

UCAEE: Uniform Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks

2020 ◽  
Vol 10 ◽  
Author(s):  
Karuna Babber
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Clustering Algorithm ◽  
Minimum Energy ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing

Background: The advent of wireless sensor networks makes it possible to track the events even in the remotest areas that too without human intervention. But severe resource constraints, generally energy of sensor nodes push researchers worldwide to develop energy efficient protocols in order to accomplish the application objectives of these networks. Objective: However, till date there is no energy efficient routing protocol which provides uniformity with maximum resource utilization for WSNs. Methods: In this paper, a Uniform Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks (UCAEE) has been proposed. UCAEE is a base station controlled algorithm where entire sensing area is partitioned into uniform clusters. The motive of the algorithm is to split the sensing area into uniform clusters and to select cluster heads and gate-way nodes within each cluster so that the network energy can be balanced in a best possible way. Conclusion: UCAEE achieves minimum energy consumption during data transmission and reception. Results: Simulation results indicate that proposed UCAEE algorithm conserves more energy than its contemporary clustering algorithms like LEACH, PEGASIS and SECA and promises better network lifetime of wireless sensor networks.

Sign in / Sign up

Export Citation Format

Share Document