scholarly journals Heuristics for scheduling data gathering with limited base station memory

2019 ◽  
Vol 285 (1-2) ◽  
pp. 149-159 ◽  
Author(s):  
Joanna Berlińska
Keyword(s):  
Data Gathering ◽  
Base Station ◽  
Limited Base

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 A lifetime-enhancing cooperative data gathering and relaying algorithm for cluster-based wireless sensor networks

2020 ◽  
Vol 16 (2) ◽  
pp. 155014771990011 ◽  
Author(s):  
G Pius Agbulu ◽  
G Joselin Retna Kumar ◽  
A Vimala Juliet
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Data Gathering ◽  
Relay Node ◽  
Base Station ◽  
Huffman Coding ◽  
Wireless Sensor ◽  
Data Propagation ◽  
Gradient Descent Algorithm

Despite unique energy-saving dispositions of cluster-based routing protocols, clustered wireless sensor networks with static sinks typically have problems of unbalanced energy consumptions, as the cluster head nodes around the sink are typically loaded with traffic from upper levels of clusters. This results in reduced lifetimes of the nodes and deterioration of other crucial performances. Meanwhile, it has been inferred from current literature that dedicated relay cooperation in cluster-based wireless sensor networks guarantees longer lifetime of the nodes and more improved performance. Therefore, to attain further enhanced performance among the current schemes, a lifetime-enhancing cooperative data gathering and relaying algorithm for cluster-based wireless sensor networks is proposed in this article. The proposed lifetime-enhancing cooperative data gathering and relaying algorithm shares the nodes into clusters using a hybrid K-means clustering algorithm that combines K-means clustering and Huffman coding algorithms. It makes full use of dedicated relay cooperative multi-hop communication with network coding mechanisms to achieve reduced data propagation cost from the various cluster sections to the central base station. The relay node selection is framed as a NP-hard problem, with regard to communication distances and residual energy metrics. Furthermore, to resolve the problem, a gradient descent algorithm is proposed. Simulation results endorse the proposed scheme to outperform related schemes in terms of latency, lifetime, and energy consumption and delivery rates.

Energy-Efficient Routing Protocol of Wireless Sensor Network for Industrial Application

2013 ◽  
Vol 579-580 ◽  
pp. 732-739
Author(s):  
Zhi Yan Ma ◽  
Guang You Yang ◽  
Jing Jing Zhou ◽  
Xiong Gan
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Time Slot ◽  
Data Gathering ◽  
Base Station ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Death Time ◽  
Leach Protocol ◽  
Energy Efficient Clustering

An energy-efficient wireless sensor routing protocol (Energy-efficient clustering hierarchy routing protocol, EECH) for industrial field is proposed based on LEACH protocol according to the energy inefficiency of existing routing protocols and the characteristics of industrial field applications. The EECH protocol takes full advantages of the node clustering and time slot distribution in LEACH and implements the functions such as clustering, multi hop time slot distribution, node sleeping and data gathering. The cluster heads can be evenly distributed in the area with the geography location information of the wireless nodes, so that the optimal data gathering path can be established. Meanwhile, the EECH protocol can reduce the conflict in data receiving/transmitting and the energy consumption of the nodes, and extend the network lifetime through the multi hop time slot distribution and node sleep mechanism. The simulation results have shown that the death time of the first node in EECH protocol is extended double time than that of LEACH protocol. When most of the nodes dies, the amount of received data of the base station node is more than twice as much as the LEACH protocol, which has verified the energy efficiency characteristic of the EECH protocol.

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 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.

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.

An Energy-Efficient Routing Mechanism (EERM) for Wireless Sensor and Actor Networks

2021 ◽  
Author(s):  
Muhammad Kashif Saeed ◽  
Khalid Mahmood ◽  
Mahmood Ul Hassan ◽  
Ansar Munir Shah ◽  
Jahangir Khan ◽  
...  
Keyword(s):  
Energy Efficient ◽  
Data Gathering ◽  
Research Area ◽  
Efficient Solutions ◽  
Base Station ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Area Of Interest ◽  
Routing Mechanism ◽  
Actor Networks

Abstract Wireless Sensor and actor networks (WSANs) are the most vital research area in the wireless communication field. It consists of sensors, actors, and the base station, where actor nodes work as these networks' spine. The network's main objective is to sense the critical information from the area of interest and then send it to the base station. After that, it can make accurate decisions. This project proposes an Energy-Efficient Routing Mechanism (EERM) technique for the effective routing process. It works in three phases, which are Network initialization, data gathering, and routing. Once the node senses the data and tries to forward it to the base station, it chooses the sensor/ actor nodes from its neighbors having more energy and less distance towards the base station, a final node. As a result, there are significantly fewer chances of data loss due to battery depletion. Moreover, it confirms that there is no data duplication. After successful data transmission, the node will be set as in sleeping mode to save energy. EERM evaluates with other gossiping routing techniques like FELGossiping, ELGossiping, and LGossiping. It notices that there is less data packet loss in it. More nodes are alive in additional iterations due to energy-efficient solutions, which increases the network lifetime.

Sign in / Sign up

Export Citation Format

Share Document