scholarly journals An Efficient Mobility Model for Improving Transmissions in Multi-UAVs Enabled WSNs

Drones ◽  
2018 ◽  
Vol 2 (3) ◽  
pp. 31 ◽  
Author(s):  
Mohd. Sayeed ◽  
Rajesh Kumar
Keyword(s):  
Wireless Sensor Networks ◽  
Data Transmission ◽  
Topological Structure ◽  
Mobility Model ◽  
Wireless Sensor ◽  
Coverage Problem ◽  
Wide Range ◽  
Aerial Vehicle ◽  
Navigation Control ◽  
Simulation Results

Multi-Unmanned Aerial Vehicle (UAV) enabled Wireless Sensor Networks (WSNs) provide a wide range of applications, covering civilian and military expeditions along with geographical navigation, control, and reconnaissance. The coordinated networks formed between the UAVs and the WSNs help in enhancing the issues related to quality as well as coverage. The overall coverage issues result in starvation as an effect of long waiting time for the nodes, while forwarding the traffic. The coverage problem can be resolved by an intelligent choice of UAV way-points. Therefore, a specialized UAV mobility model is required which takes into account the topological structure as well as the importance of strategic locations to fix UAV way-points and decide the data transmission paradigm. To resolve this problem, a novel mobility model is proposed, which takes into account the attraction factor for setting up the way-points for UAV movements. The model is capable of deciding between the locations which result in more coverage, increased throughput with lesser number of UAVs employed, as justified by the simulation results and comparative evaluations.

A Small World Routing Protocol in Wireless Sensor Networks

2011 ◽  
Vol 474-476 ◽  
pp. 828-833
Author(s):  
Wen Jun Xu ◽  
Li Juan Sun ◽  
Jian Guo ◽  
Ru Chuan Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Small World ◽  
Wireless Sensor ◽  
Small World Network ◽  
Average Delay ◽  
Network Diameter ◽  
Simulation Results

In order to reduce the average path length of the wireless sensor networks (WSNs) and save the energy, in this paper, the concept of the small world is introduced into the routing designs of WSNs. So a new small world routing protocol (SWRP) is proposed. By adding a few short cut links, which are confined to a fraction of the network diameter, we construct a small world network. Then the protocol finds paths through recurrent propagations of weak and strong links. The simulation results indicate that SWRP reduces the energy consumption effectively and the average delay of the data transmission, which leads to prolong the lifetime of both the nodes and the network.

scholarly journals Mathematical Modeling and Simulation of Wireless Sensor Network Coverage Problem

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Jianxia Guo
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Heterogeneous Network ◽  
Base Station ◽  
Wireless Sensor ◽  
Selection Strategy ◽  
Hop Count ◽  
Heterogeneous Wireless Sensor Networks ◽  
Simulation Results

The research on wireless sensor networks has achieved a lot in recent years and some of the results have been put into practical applications, but with the increasing demand and requirements for wireless sensor networks, many old and new problems need to be solved urgently. In this paper, a data topology optimization algorithm based on local tree reconstruction for heterogeneous wireless sensor networks is proposed for data transmission in wireless sensor networks that are easily affected by external instabilities. This heterogeneous network can accomplish better data transmission; firstly, the nodes are divided into different layers according to the hop count of nodes in the network, and a certain proportion of relay nodes are selected for different layer nodes; then, different initial energy is set for different layer nodes, and since the data packets of different nodes have different sizes, the corresponding data aggregation coefficients are used in this paper according to the actual data requirements of the network during data transmission; finally, the topology of the tree is dynamically updated in real time during the operation of the network to extend the lifetime of the nodes. The simulation results verify that the proposed heterogeneous network topology evolution algorithm effectively extends the network lifetime and improves the utilization of nodes. This paper establishes a modified least-squares target localization model to achieve accurate 3D localization of targets in real scenes and proposes an optimal base station node selection strategy based on spectral clustering using the location distribution information of base station nodes in space. The simulation results show that the error of the terminal 3D coordinates calculated by the proposed algorithm is smaller than the real coordinates, and the error is smaller than other existing algorithms with the same simulation data.

scholarly journals The channel for hidden data transmission in WSN

2017 ◽  
Vol 63 (2) ◽  
pp. 209-216
Author(s):  
Radosław O. Schoeneich ◽  
Marcin Golański ◽  
Michał Kucharski ◽  
Marek Franciszkiewicz ◽  
Dawid Zgid
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Data Aggregation ◽  
Additional Data ◽  
Wireless Sensor ◽  
Covert Channel ◽  
Data Packets ◽  
Simulation Results ◽  
Hidden Data

Abstract This paper describes an idea and realisation of hidden data transmision using Tiny Aggregation Covert Channel (TAGCC)in Wireless Sensor Networks. Our solution uses data aggregation mechanism called Tiny Aggregation (TAG). The protocol is based on idea of hidden messages sending without generate additional data packets and encryption. The paper describes details of proposed algorithm and simulation results obtained during testing of the sensor networks with hidden channel TAGCC.

Algorithms for Spatial Partitioning in Wireless Sensor Network

2013 ◽  
pp. 109-133
Author(s):  
Kakia Panagidi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Scheduling Algorithm ◽  
Voronoi Tessellation ◽  
Minimum Energy ◽  
Wireless Sensor ◽  
Coverage Problem ◽  
Minimum Energy Consumption ◽  
Wide Range ◽  
Military Healthcare

Recent interest in integrated electronic devices (sensors) that operate wirelessly creates a wide range of applications related to national security, surveillance, military, healthcare, and environmental monitoring. Many visions of the future include people immersed in an environment surrounded by sensors and intelligent devices, which use smart infrastructures to improve the quality of life. However, a fundamental feature of sensor networks is coverage: how these tiny devices can cover a certain terrain. These devices should be organized in an optimal manner, consuming the minimum energy and covering the whole area of interest. The coverage concept is subject to a wide range of interpretations due to the variety of sensors and applications. Different coverage formulations have been proposed based on the subject to be covered (area in relation to specific items and obstacles), sensor development mechanisms (random versus deterministic), and other properties of wireless sensor networks (e.g. network connectivity and minimum energy consumption). In this chapter, the authors study the coverage problem in wireless sensor networks using the most recent algorithms. The aim of this chapter is to present these algorithms and a comparison between them based on various criteria. The Node Self-Scheduling algorithm, the Centralized Voronoi Tessellation (CVT), the Particle Swarm Optimization Algorithm (PSO), the Virtual Forces Algorithm (VFA), etc. are analyzed. Through the algorithms’ analysis, the interested reader can have a complete view of the proposed solutions related to the coverage problem.

An Improved D-SMART Algorithm for Wireless Sensor Networks

2021 ◽  
pp. 2250009
Author(s):  
Jun Wang ◽  
Yanhui Xu ◽  
Li Li ◽  
Yansui Du ◽  
Liang Zhao
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Data Aggregation ◽  
Residual Energy ◽  
Low Energy ◽  
Wireless Sensor ◽  
Negative Number ◽  
Dynamic Slicing ◽  
Simulation Results

In this paper, a secure and low energy dynamic slicing algorithm, namely, Improved D-SMART (IM-D-SMART) based on the Data Aggregation Protocol on Slice Mix Aggregate (D-SMART) is proposed to improve the security and confidentiality of wireless sensor networks and reduce the energy consumption of nodes in data collection and transmission in wireless sensor networks. According to the importance of data, the residual energy of nodes and the relative density of nodes, the data are dynamically partitioned to improve the D-SMART algorithm. Simultaneously, sending negative number splicing is used to compensate for the loss caused by the collision of data transmission between nodes. The simulation results show that IM-D-SMART outperforms D-SMART in terms of computation, privacy and communication cost.

scholarly journals Routing Algorithm with Uneven Clustering for Energy Heterogeneous Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-9 ◽  
Author(s):  
Ying Zhang ◽  
Wei Xiong ◽  
Dezhi Han ◽  
Wei Chen ◽  
Jun Wang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Routing Algorithm ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Heterogeneous Wireless Sensor Networks ◽  
Transmission Stage ◽  
Simulation Results

Aiming at the “hotspots” problem in energy heterogeneous wireless sensor networks, a routing algorithm of heterogeneous sensor network with multilevel energies based on uneven clustering is proposed. In this algorithm, the energy heterogeneity of the nodes is fully reflected in the mechanism of cluster-heads’ election. It optimizes the competition radius of the cluster-heads according to the residual energy of the nodes. This kind of uneven clustering prolongs the lifetime of the cluster-heads with lower residual energies or near the sink nodes. In data transmission stage, the hybrid multihop transmission mode is adopted, and the next-hop routing election fully takes account of the factors of residual energies and the distances among the nodes. The simulation results show that the introduction of an uneven clustering mechanism and the optimization of competition radius of the cluster-heads significantly prolonged the lifetime of the network and improved the efficiency of data transmission.

Fault Tolerant Reliable Protocol (FTRP) Performance Evaluation in Wireless Sensor Networks: An Extensitive Study

2019 ◽  
pp. 1-36
Keyword(s):  
Wireless Sensor Networks ◽  
Fault Tolerance ◽  
Sensor Networks ◽  
Fault Tolerant ◽  
Cluster Head ◽  
Biological Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Good Performer ◽  
Wide Range

Fault Tolerant Reliable Protocol (FTRP) is proposed as a novel routing protocol designed for Wireless Sensor Networks (WSNs). FTRP offers fault tolerance reliability for packet exchange and support for dynamic network changes. The key concept used is the use of node logical clustering. The protocol delegates the routing ownership to the cluster heads where fault tolerance functionality is implemented. FTRP utilizes cluster head nodes along with cluster head groups to store packets in transient. In addition, FTRP utilizes broadcast, which reduces the message overhead as compared to classical flooding mechanisms. FTRP manipulates Time to Live values for the various routing messages to control message broadcast. FTRP utilizes jitter in messages transmission to reduce the effect of synchronized node states, which in turn reduces collisions. FTRP performance has been extensively through simulations against Ad-hoc On-demand Distance Vector (AODV) and Optimized Link State (OLSR) routing protocols. Packet Delivery Ratio (PDR), Aggregate Throughput and End-to-End delay (E-2-E) had been used as performance metrics. In terms of PDR and aggregate throughput, it is found that FTRP is an excellent performer in all mobility scenarios whether the network is sparse or dense. In stationary scenarios, FTRP performed well in sparse network; however, in dense network FTRP’s performance had degraded yet in an acceptable range. This degradation is attributed to synchronized nodes states. Reliably delivering a message comes to a cost, as in terms of E-2-E. results show that FTRP is considered a good performer in all mobility scenarios where the network is sparse. In sparse stationary scenario, FTRP is considered good performer, however in dense stationary scenarios FTRP’s E-2-E is not acceptable. There are times when receiving a network message is more important than other costs such as energy or delay. That makes FTRP suitable for wide range of WSNs applications, such as military applications by monitoring soldiers’ biological data and supplies while in battlefield and battle damage assessment. FTRP can also be used in health applications in addition to wide range of geo-fencing, environmental monitoring, resource monitoring, production lines monitoring, agriculture and animals tracking. FTRP should be avoided in dense stationary deployments such as, but not limited to, scenarios where high application response is critical and life endangering such as biohazards detection or within intensive care units.

An Obstacle-resistant Relay Node Placement in Constrained Environment

2019 ◽  
Author(s):  
Abhishek Verma ◽  
Virender Ranga
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mobile Robots ◽  
Relay Node ◽  
Wireless Sensor ◽  
Relay Node Placement ◽  
Node Placement ◽  
Simulation Results ◽  
Additional Hardware ◽  
Shape And Size

Relay node placement in wireless sensor networks for constrained environment is a critical task due to various unavoidable constraints. One of the most important constraints is unpredictable obstacles. Handling obstacles during relay node placement is complicated because of complexity involved to estimate the shape and size of obstacles. This paper presents an Obstacle-resistant relay node placement strategy (ORRNP). The proposed solution not only handles the obstacles but also estimates best locations for relay node placement in the network. It also does not involve any additional hardware (mobile robots) to estimate node locations thus can significantly reduce the deployment costs. Simulation results show the effectiveness of our proposed approach.

An Energy Efficient Routing Approach to Enhance Coverage for Application Specific Wireless Sensor Networks using Genetic Algorithm

2019 ◽  
Vol 13 ◽  
Author(s):  
Amandeep Kaur Sohal ◽  
Ajay Kumar Sharma ◽  
Neetu Sood
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Energy Efficient ◽  
Search Algorithm ◽  
Cluster Formation ◽  
Green Computing ◽  
Wireless Sensor ◽  
Energy Efficient Routing

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.

Sign in / Sign up

Export Citation Format

Share Document