Data Gathering by Mobile Sinks with Data-Centric Probe in Sensor Networks

2011 ◽  
Vol E94-B (7) ◽  
pp. 2133-2136 ◽  
Author(s):  
Dongook SEONG ◽  
Junho PARK ◽  
Jihee LEE ◽  
Myungho YEO ◽  
Jaesoo YOO
Keyword(s):  
Sensor Networks ◽  
Data Gathering ◽  
Mobile Sinks

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

Sign in / Sign up

Export Citation Format

Share Document