scholarly journals An Efficient Data-Gathering Scheme for Heterogeneous Sensor Networks via Mobile Sinks

2011 ◽  
Vol 8 (1) ◽  
pp. 296296 ◽  
Author(s):  
Po-Liang Lin ◽  
Ren-Song Ko
Keyword(s):  
Sensor Networks ◽  
Hot Spot ◽  
Data Gathering ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Buffer Overflow ◽  
Network Simulator ◽  
Data Sampling ◽  
Additional Energy ◽  
Mobile Sinks

Typical Wireless Sensor Networks (WSNs) use static sinks to collect data from all sensor nodes via multihop forwarding. This results in the hot spot problem since the nodes close to the sink have a tendency to consume more energy in relaying data from other nodes. Many approaches using mobile sinks have been proposed to prevent this problem, but these approaches still suffer from the buffer overflow problem due to the limited memory capacity of the sensor nodes. This paper proposes an approach in which the mobile sink traverses a subset of nodes. Given the characteristics of wireless communication, such an approach can effectively alleviate the buffer overflow problem without incurring additional energy consumption. To further alleviate the buffer overflow problem, we propose the Allotment Mechanism which allows nodes with different data sampling rates to share their memory and, thus, extend the overflow deadline. Finally, the effectiveness of the proposed approach is verified via the GloMoSim network simulator. The results show that our approach incurs fewer buffer overflows than other data-gathering schemes.

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 An Efficient Approach for Storage Balancing in Wireless Sensor Networks

2017 ◽  
Vol 13 (09) ◽  
pp. 4
Author(s):  
Asmaa Ez-zaidi ◽  
Said Rakrak
Keyword(s):  
Data Gathering ◽  
Mobile Sink ◽  
Memory Storage ◽  
Sensor Nodes ◽  
Storage Space ◽  
Effective Mechanism ◽  
New Approach ◽  
Mobile Sinks ◽  
Gathering Data ◽  
Improve Reliability

the use of mobile sinks in data collection has received much attention in recent years. In fact, mobility was introduced to solve problems that occur in data gathering with static sinks such as hotspots, quick energy depletion of sensor nodes and so on. Using mobile sinks provides an effective mechanism to improve reliability, security as well as connectivity within the network. Nevertheless, the sink’s mobility poses new challenges, especially when the sink follows an unpredictable movement while gathering data. In this case, the network will experience huge latency and suffer from significant packet loss particularly when sensor nodes do not have enough memory storage to buffer collected data between two successive visits of the mobile sink. In this paper we propose a new approach in which sensor nodes cooperate to manage the storage and prevent packet drops. When a node’s memory is almost full, it offloads its data to its neighbor nodes in function of their free spaces.  In case there are no neighbor nodes with sufficient storage space, the sink is urgently notified about the overloaded region that needs to be rapidly dumped. Simulation results reveal that our proposed approach decreases drastically the loss of packets and balances the sensor network.

scholarly journals Deadline-Aware Energy-Efficient Query Scheduling in Wireless Sensor Networks with Mobile Sink

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Murat Karakaya
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Scheduling Algorithm ◽  
Data Gathering ◽  
Mobile Sink ◽  
Base Station ◽  
Wireless Sensor ◽  
Mobile Sinks ◽  
Delay Tolerant ◽  
Query Scheduling

Mobile sinks are proposed to save sensor energy spent for multihop communication in transferring data to a base station (sink) in Wireless Sensor Networks. Due to relative low speed of mobile sinks, these approaches are mostly suitable for delay-tolerant applications. In this paper, we study the design of a query scheduling algorithm for query-based data gathering applications using mobile sinks. However, these kinds of applications are sensitive to delays due to specified query deadlines. Thus, the proposed scheduling algorithm aims to minimize the number of missed deadlines while keeping the level of energy consumption at the minimum.

scholarly journals Gathering Big Data in Wireless Sensor Networks by Drone

Sensors ◽  
2020 ◽  
Vol 20 (23) ◽  
pp. 6954
Author(s):  
Josiane da Costa Vieira Rezende ◽  
Rone Ilídio da Silva ◽  
Marcone Jamilson Freitas Souza
Keyword(s):  
Big Data ◽  
State Of The Art ◽  
Data Gathering ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Data Packets ◽  
Mobile Sinks ◽  
Radio Range ◽  
Limited Power

The benefits of using mobile sinks or data mules for data collection in Wireless Sensor Network (WSN) have been studied in several works. However, most of them consider only the WSN limitations and sensor nodes having no more than one data packet to transmit. This paper considers each sensor node having a relatively larger volume of data stored in its memory. That is, they have several data packets to send to sink. We also consider a drone with hovering capability, such as a quad-copter, as a mobile sink to gather this data. Hence, the mobile collector eventually has to hover to guarantee that all data will be received. Drones, however, have a limited power supply that restricts their flying time. Hence, the drone’s energy cost must also be considered to increase the amount of collected data from the WSN. This work investigates the problem of determining the best drone tour for big data gathering in a WSN. We focus on minimizing the overall drone flight time needed to collect all data from the WSN. We propose an algorithm to create a subset of sensor nodes to send data to the drone during its movement and, consequently, reduce its hovering time. The proposed algorithm guarantees that the drone will stay a minimum time inside every sensor node’s radio range. Our experimental results showed that the proposed algorithm surpasses, by up to 30%, the state-of-the-art heuristics’ performance in finding drone tours in this type of scenario.

Adaptive Optimization for Optimal Mobile Sink Placement in Wireless Sensor Networks

2021 ◽  
Vol 18 (5) ◽  
Author(s):  
Arikrishnaperumal Aravind ◽  
Rekha Chakravarthi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Research Work ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Optimal Placement ◽  
Delivery Ratio ◽  
Minimal Distance ◽  
Mobile Sinks

In recent years, Wireless Sensor Networks (WSN) with mobile sinks has attracted much attention as the mobile sink roams over the sensing field and collects sensing data from sensor nodes. Mobile sinks are mounted on moving objects, such as people, vehicles, robots, and so on. However, optimal placement of the sink for the effective management of the WSN is the major challenge. Hence, an adaptive Fractional Rider Optimization Algorithm (adaptive-FROA) is developed for the optimal placement of mobile sink in WSN environment for effective routing. The adaptive FROA, which is the integration of the adaptive concept in the FROA, operates based on the fitness measure based on distance, delay, and energy measure of the nodes in the network. The main objective of the research work is to compute the energy and distance. The proposed method is analyzed based on the metrics, such as energy, throughput, distance, and lifetime of the network. The simulation results reveal that the proposed method acquired a minimal distance of 24.87m, maximal network energy of 94.54 J, maximal alive nodes of 77, maximal throughput of 94.42 bps, minimum delay of 0.00918s, and maximum Packet delivery ratio (PDR) of 87.98%, when compared with the existing methods.

An Adaptive Location Updates and Propagation Scheme for Mobile Sinks

2010 ◽  
Vol 44-47 ◽  
pp. 772-776
Author(s):  
Shi Qiang Ma ◽  
Xiao Gang Qi
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Location Information ◽  
Delivery Ratio ◽  
Mobile Sinks ◽  
Location Updates

Mobile sink can be used to balance energy consumption of sensor nodes in Wireless Sensor Networks (WSNs). Sink is required to inform sensors about its new location information whenever necessary. However, frequent location updates of mobile sink can lead to both rapid energy consumption of sensor nodes and increased collisions in wireless transmissions. We propose ALUPS (A New Solution with Adaptive Location Update and Propagation Scheme) for mobile sinks to resolve this problem. When a sink moves, it only needs to broadcast its location information within a local adaptive area other than among the entire network. The overhearing feature of wireless transmission is employed when the adaptive location information is transferred. Compared with LURP (Local update-based routing protocol in wireless sensor networks with mobile sinks) and SLPS (Simple Location Propagation Scheme for Mobile Sink in Wireless Sensor Networks), ALUPS performs better both in low energy consumption and success delivery ratio.

scholarly journals Implimentation of Novel Framework For Efficient Data Gathering With Multiple Mobile Sink Sensor Nodes In WSN

2021 ◽  
Author(s):  
Saim Abassi ◽  
Irfan Anis ◽  
Muhammad Kashif ◽  
Usman Bashir Tayab
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Transmission ◽  
Data Gathering ◽  
Mobile Sink ◽  
Experimental Results ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Great Consideration ◽  
Efficient Data

Abstract In couple of years, the great research towards oceanographic data transmission and submerged impurity the Submerged Wireless Sensor Networks are getting great consideration. SWSN includes issues such as link sustainability, time to begin interaction, data loss due to real-time transmission attempts and transmission range. The aforementioned complications have been approached through different routing configurations, but none of these can handle transmission efficiently. In this paper we proposed a framework of network in depth based data acquisition system with simulation and experimental results. The system model has been efficiently transmit data (Turbidity, Temperature and PH) in a region (Indus River) using the smart cluster sensor nodes and acquires result of 6.5 to 31 N.T.U of turbidity. The experimental results proved that the projected work improves the performance of the data transmission in Submerged Wireless Sensor Networks.

scholarly journals Mobile Sink Based Data Assemblage in Wireless Sensor Networks

2019 ◽  
Vol 8 (4) ◽  
pp. 5543-5550
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Gathering ◽  
Mobile Sink ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Hole ◽  
Rendezvous Point ◽  
Rendezvous Points

A mobile sink, which is used to fetch data from various sensors to prevent the energy-hole problem or hotspot in WSN. To avoid the delay sustained by calling on the sensors a mobile sink is allowed to visit which is called as meeting points and the remaining nodes deliver their data to nearest rendezvous point. The improvement of sink’s data collecting method as well as the maximization of lifespan of the network is done by discovering a most favorable set of meeting points. However, it is very difficult to discover the assigned meeting points and moving way of mobile sink when the sensor produces data roughly. We propose an ultra-modern ACO based mobile sink data gathering in WSN. The important aims of the suggested algorithm are to elongate the existence of network and to reduce the delay in fetching data from sensor nodes. The algorithm also follows to again select the rendezvous points in order to stable the energy utilization of the sensor nodes.

scholarly journals Cooperative Data Collection Mechanism Using Multiple Mobile Sinks in Wireless Sensor Networks

Sensors ◽  
2018 ◽  
Vol 18 (8) ◽  
pp. 2627 ◽  
Author(s):  
Weimin Wen ◽  
Chih-Yung Chang ◽  
Shenghui Zhao ◽  
Cuijuan Shang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Network Lifetime ◽  
Efficiency Index ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Sinks ◽  
The Given

Data collection problems have received much attention in recent years. Many data collection algorithms that constructed a path and adopted one or more mobile sinks to collect data along the paths have been proposed in wireless sensor networks (WSNs). However, the efficiency of the established paths still can be improved. This paper proposes a cooperative data collection algorithm (CDCA), which aims to prolong the network lifetime of the given WSNs. The CDCA initially partitions the n sensor nodes into k groups and assigns each mobile sink acting as the local mobile sink to collect data generated by the sensors of each group. Then the CDCA selects an appropriate set of data collection points in each group and establishes a separate path passing through all the data collection points in each group. Finally, a global path is constructed and the rendezvous time points and the speed of each mobile sink are arranged for collecting data from k local mobile sinks to the global mobile sink. Performance evaluations reveal that the proposed CDCA outperforms the related works in terms of rendezvous time, network lifetime, fairness index as well as efficiency index.

Sign in / Sign up

Export Citation Format

Share Document