scholarly journals An Adaptive Data Gathering Algorithm for Minimum Travel Route Planning in WSNs Based on Rendezvous Points

Symmetry ◽  
2019 ◽  
Vol 11 (11) ◽  
pp. 1326
Author(s):  
Mukhtar Ghaleb ◽  
Shamala Subramaniam ◽  
Safwan M. Ghaleb
Keyword(s):  
Energy Savings ◽  
Data Gathering ◽  
Route Planning ◽  
Mobile Element ◽  
Large Data ◽  
Base Station ◽  
Sensor Nodes ◽  
Aggregated Data ◽  
Tour Length ◽  
Rendezvous Points

A recent trend in wireless sensor network (WSN) research is the deployment of a mobile element (ME) for transporting data from sensor nodes to the base station (BS). This helps to achieve significant energy savings as it minimizes the communications required among nodes. However, a major problem is the large data gathering latency. To address this issue, the ME (i.e., vehicle) should visit certain rendezvous points (i.e., nodes) to collect data before it returns to the BS to minimize the data gathering latency. In view of this, we propose a rendezvous-based approach where some certain nodes serve as rendezvous points (RPs). The RPs gather data using data compression techniques from nearby sources (i.e., affiliated nodes) and transfer them to a mobile element when the ME traverses their paths. This minimizes the number of nodes to be visited, thereby reducing data gathering latency. Furthermore, we propose a minimal constrained rendezvous point (MCRP) algorithm, which ensures the aggregated data are relayed to the RPs based on three constraints: (i) bounded relay hop, (ii) the number of affiliation nodes, and (iii) location of the RP. The algorithm is designed to consider the ME’s tour length and the shortest path tree (SPT) jointly. The effectiveness of the algorithm is validated through extensive simulations against four existing algorithms. Results show that the MCRP algorithm outperforms the compared schemes in terms of the ME’s tour length, data gathering latency, and the number of rendezvous nodes. MCRP exhibits a relatively close performance to other algorithms with respect to power algorithms.

The Gamification in Education, Healthcare, and Industry

2021 ◽  
pp. 206-232
Author(s):  
Puvvadi Baby Maruthi
Keyword(s):  
Data Aggregation ◽  
Mobile Element ◽  
Mobile Node ◽  
Base Station ◽  
Sensor Nodes ◽  
Aggregated Data ◽  
Three Layer Architecture ◽  
Save Energy ◽  
Aggregation Technique ◽  
Entire Network

Wireless sensor networks (WSN) consist of large numbers of sensor nodes, which are limited in battery power and communication range and have multi-modal sensing capabilities. In this chapter, energy-efficient data aggregation technique is proposed to improve the lifetime of the sensor. Here, the author has used three layer architecture by deploying mobile element/node, which can periodically visit cluster heads (CHs) at which first level data aggregation has been applied to eliminate redundancy. After collecting data from all CHs, mobile element itself will perform second level of data aggregation to eliminate further redundancy. After collecting data from CHs, mobile element will move towards base station/sink and transmits data to base station/sink in order to save energy of entire network. Here, the author has made an attempt to prove that in WSN during data gathering if mobile elements are used to collect the aggregated data from CHs, energy consumption of the entire network will be reduced. The proposed data aggregation with mobile node helps in improving the lifetime of the WSN.

scholarly journals Delay Tolerance and Energy Saving in Wireless Sensor Networks with a Mobile Base Station

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Oday Jerew ◽  
Nizar Al Bassam
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Saving ◽  
Data Gathering ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Hop Count ◽  
Tour Length ◽  
Mobile Base

Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile devices. A mobile device roams sensing fields and collects data from sensors through a short transmission range. Multihop communication is used to improve data gathering by reducing the tour length of the mobile device. In this paper we study the trade-off between energy saving and data gathering latency in wireless sensor networks. In particular, we examine the balance between the relay hop count and the tour length of a mobile Base Station (BS). We propose two heuristic algorithms, Adjacent Tree-Bounded Hop Algorithm (AT-BHA) and Farthest Node First-Bounded Hop Algorithm (FNF-BHA), to reduce energy consumption of sensor nodes. The proposed algorithms select groups of Collection Trees (CTs) and a subset of Collection Location (CL) sensor nodes to buffer and forward data to the mobile BS when it arrives. Each CL node receives sensing data from its CT nodes within bounded hop count. Extensive experiments by simulation are conducted to evaluate the performance of the proposed algorithms against another heuristic. We demonstrate that the proposed algorithms outperform the existing work with the mean of the length of mobile BS tour.

scholarly journals An Energy Efficient Secure Data Aggregation in Wireless Sensor Networks

2021 ◽  
Author(s):  
Jenice Prabu A ◽  
Hevin Rajesh D
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Data Communication ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Malicious Nodes ◽  
Aggregated Data

Abstract In Wireless sensor network, the major issues are security and energy consumption. There may be several numbers of malicious nodes present in sensor networks. Several techniques have been proposed by the researchers to identify these malicious nodes. WSNs contain many sensor nodes that sense their environment and also transmit their data via multi-hop communication schemes to the base station. These sensor nodes provides power supply using battery and the energy consumption of these batteries must be low. Securing the data is to avoid attacks on these nodes and data communication. The aggregation of data helps to minimize the amount of messages transmitted within the network and thus reduces overall network energy consumption. Moreover, the base station may distinguish the encrypted and aggregated data based on the encryption keys during the decryption of the aggregated data. In this paper, two aspects of the problem is concerned, we investigate the efficiency of data aggregation: first, how to develop cluster-based routing algorithms to achieve the lowest energy consumption for aggregating data, and second, security issues in wsn. By using Network simulator2 (NS2) this scheme is simulated. In the proposed scheme, energy consumption, packet delivery ratio and throughput is analyzed. The proposed clustering, routing, and protection protocol based on the MCSDA algorithm shows significant improvement over the state-of - the-art protocol.

scholarly journals Predictive Trajectory-Based Mobile Data Gathering Scheme for Wireless Sensor Networks

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Fan Chao ◽  
Zhiqin He ◽  
Renkuan Feng ◽  
Xiao Wang ◽  
Xiangping Chen ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Gathering ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Center ◽  
Mobile Data ◽  
Tour Planning ◽  
Mobile Data Gathering

Tradition wireless sensor networks (WSNs) transmit data by single or multiple hops. However, some sensor nodes (SNs) close to a static base station forward data more frequently than others, which results in the problem of energy holes and makes networks fragile. One promising solution is to use a mobile node as a mobile sink (MS), which is especially useful in energy-constrained networks. In these applications, the tour planning of MS is a key to guarantee the network performance. In this paper, a novel strategy is proposed to reduce the latency of mobile data gathering in a WSN while the routing strategies and tour planning of MS are jointly optimized. First, the issue of network coverage is discussed before the appropriate number of clusters being calculated. A dynamic clustering scheme is then developed where a virtual cluster center is defined as the MS sojourn for data collection. Afterwards, a tour planning of MS based on prediction is proposed subject to minimizing the traveling distance to collect data. The proposed method is simulated in a MATLAB platform to show the overall performance of the developed system. Furthermore, the physical tests on a test rig are also carried out where a small WSN based on an unmanned aerial vehicle (UAV) is developed in our laboratory. The test results validate the feasibility and effectiveness of the method proposed.

A Novel Nature Instilled Moving Sink Architecture for Data Gathering in Wireless Sensor Networks

2020 ◽  
Vol 11 (1) ◽  
pp. 36-48
Author(s):  
Amiya Bhusan Bagjadab ◽  
Sushree Bibhuprada B. Priyadarshini
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Gathering ◽  
Mobile Sink ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Packet Forwarding ◽  
Battery Power ◽  
Communication Distance

Wireless sensor networks are commonly used to monitor certain regions and to collect data for several application domains. Generally, in wireless sensor networks, data are routed in a multi-hop fashion towards a static sink. In this scenario, the nodes closer to the sink become heavily involved in packet forwarding, and their battery power is exhausted rapidly. This article proposes that a special node (i.e., mobile sink) will move in the specified region and collect the data from the sensors and transmit it to the base station such that the communication distance of the sensors will be reduced. The aim is to provide a track for the sink such that it covers maximum sensor nodes. Here, the authors compared two tracks theoretically and in the future will try to simulate the two tracks for the sink movement so as to identify the better one.

scholarly journals Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree, and Grid Topologies

2009 ◽  
Vol 5 (5) ◽  
pp. 463-479 ◽  
Author(s):  
Yoram Revah ◽  
Michael Segal
Keyword(s):  
Data Gathering ◽  
Directional Antennas ◽  
Base Station ◽  
Sensor Nodes ◽  
Delivery Time ◽  
Packet Delivery ◽  
Central Node ◽  
Hazard Detection ◽  
Wide Range ◽  
Efficient Data

We address the problem of gathering information in sensor webs consisting of sensors nodes, wherein a round of communication sensor nodes have messages to be sent to a distant central node (called the base station) over the shortest path. There is a wide range of data gathering applications like target and hazard detection, environmental monitoring, battlefield surveillance, etc. Consequently, efficient data collection solutions are needed to improve the performance of the network. In this article, we take into account the fact that interference can occur at the reception of a message at the receiver sensor. In order to save redundant retransmissions and energy, we assume a known distribution of sources (each node wants to transmit at most one packet) and one common destination. We provide a number of scheduling algorithms jointly minimizing both the completion time and the average packet delivery time. We define our network model using directional antennas and consider Ring, Tree, and Grid Network (and its generality) topologies. All our algorithms run in low-polynomial time.

scholarly journals Security in wireless sensor networks

2019 ◽  
Vol 8 (1) ◽  
pp. 13
Author(s):  
Bahae ABIDI ◽  
Abdelillah JILBAB ◽  
Mohamed EL HAZITI
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Aggregation ◽  
Secure Communication ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Aggregated Data ◽  
Secure Data ◽  
Secure Data Aggregation

Even in difficult places to reach, the new networking technique allows the easy deployment of sensor networks, although these wireless sensor networks confront a lot of constraints. The major constraint is related to the quality of information sent by the network. The wireless sensor networks use different methods to achieve data to the base station. Data aggregation is an important one, used by these wireless sensor networks. But this aggregated data can be subject to several types of attacks and provides security is necessary to resist against malicious attacks, secure communication between severely resource constrained sensor nodes while maintaining the flexibility of the topology changes. Recently, several secure data aggregation schemes have been proposed for wireless sensor networks, it provides better security compared with traditional aggregation. In this paper, we try to focus on giving a brief statement of the various approaches used for the purpose of secure data aggregation in wireless sensor networks.

scholarly journals Best Cluster Head Selection and Route Optimization for Cluster Based Sensor Network Using (M-pso) and Ga Algorithms

2021 ◽  
Author(s):  
Ved Prakash ◽  
Suman Pandey ◽  
deepti singh
Keyword(s):  
Sensor Network ◽  
Optimal Path ◽  
Cluster Head ◽  
Pso Algorithm ◽  
Vital Role ◽  
Base Station ◽  
Route Optimization ◽  
Sensor Nodes ◽  
Aggregated Data ◽  
Cluster Heads

Abstract Clustering plays a vital role in extending the lifespan and optimized direction of a wireless sensor network by integrating sensor nodes through clusters and choosing cluster heads (CHs) and non-cluster heads (NCHs). Cluster head aggregated data and non-cluster heads forward to the base station (BS). In this paper, we have introduced a new Dynamic Multipath Routing Protocol (DMPRP) for selections of cluster heads (CHs) and non-cluster heads (NCHs), which is ideally selected using M-PSO algorithm. After calculating the probabilities, the best selection of cluster heads has taken, and results have used to find the optimized shortest path using the Genetic Algorithm (GA). The GA algorithm uses an objective function consisting of a network to determine the optimal path.

Energy-Efficient Data-Aggregation Technique for Correlated Spatial and Temporal Data in Cluster-Based Sensor Networks

2020 ◽  
Vol 16 (2) ◽  
pp. 53-68
Author(s):  
Khushboo Jain ◽  
Anoop Kumar
Keyword(s):  
Sensor Networks ◽  
Data Aggregation ◽  
Energy Efficient ◽  
Data Gathering ◽  
Base Station ◽  
Sensor Nodes ◽  
Temporal Data ◽  
Network Applications ◽  
Efficient Data ◽  
Aggregation Technique

Continuous-monitoring applications in sensor network applications require periodic data transmissions to the base-station (BS), which may lead to unnecessary energy depletion. The energy-efficient data aggregation solutions in sensor networks have evolved as one of the favorable fields for such applications. Former research works have recommended many spatial-temporal designs and prototypes for successfully minimizing the data-gathering overheads, but these are constrained to their relevance. This work has proposed a data aggregation technique for homogeneous application set-ups in sensor networks. For this, the authors have employed two ways of model generation for reducing correlated spatial-temporal data in cluster-based sensor networks: one at the Sensor nodes (SNs) and the other at the Cluster heads (CHs). Building on this idea, the authors propose two types of data filtration, first at the SNs for determining temporal redundancies (TRs) in data readings by both relative deviation (RD) and adaptive frame method (AFM) and second at the CHs for determining spatial redundancies (SRs) by both RD and AFM.

scholarly journals A Method of Improving Energy Efficiency Through Geofencing and False Data Blocking In Context-Aware Architecture for Probabilistic Voting-Based Filtering Scheme of WSNs

2021 ◽  
Vol 13 (03) ◽  
pp. 97-107
Author(s):  
Su Man Nam ◽  
Youn Kyoung Seo
Keyword(s):  
Energy Savings ◽  
False Negative ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
False Alarms ◽  
Context Aware ◽  
Probabilistic Voting ◽  
Data Blocking ◽  
Compromised Nodes

In wireless sensor networks, sensor nodes have the disadvantage of being vulnerable to several attacks due to the use of wireless communication and constrained energy. Adversaries exploit vulnerable characteristics of these nodes to capture them and generate false positive and false negative attacks. These attacks result in false alarms in a base station and information loss in intermediate nodes. A context-aware architecture for a probabilistic voting-based filtering scheme (CAA-PVFS) identifies compromised nodes that cause the damage. Although this method immediately detects the compromised nodes using its CAA, its additional network use consumes unnecessary energy. In this paper, our proposed method configures geofencing for the compromised nodes and blocks the nodes using false data injection. The proposed method reduces the unnecessary energy of the additional network while maintaining security strength. Experimental results indicate that the proposed method offers energy savings of up to 17% while maintaining the security strength against the two attacks as compared to the existing method.

Sign in / Sign up

Export Citation Format

Share Document