Next Article in Journal
Long Term Amperometric Recordings in the Brain Extracellular Fluid of Freely Moving Immunocompromised NOD SCID Mice
Next Article in Special Issue
A Mobility-Aware Adaptive Duty Cycling Mechanism for Tracking Objects during Tunnel Excavation
Previous Article in Journal
A Soft Sensor-Based Three-Dimensional (3-D) Finger Motion Measurement System
Previous Article in Special Issue
RiPPAS: A Ring-Based Privacy-Preserving Aggregation Scheme in Wireless Sensor Networks
Article Menu
Issue 2 (February) cover image

Export Article

Open AccessArticle
Sensors 2017, 17(2), 421; doi:10.3390/s17020421

Efficient Data Collection in Widely Distributed Wireless Sensor Networks with Time Window and Precedence Constraints

Key Laboratory of Complex Systems Modeling and Simulation, School of Computer Science, Hangzhou Dianzi University, Hangzhou 310018, China
*
Author to whom correspondence should be addressed.
Academic Editors: Dongkyun Kim, Houbing Song, Juan-Carlos Cano, Wei Wang, Waleed Ejaz and Qinghe Du
Received: 15 December 2016 / Revised: 6 February 2017 / Accepted: 7 February 2017 / Published: 22 February 2017
View Full-Text   |   Download PDF [2172 KB, uploaded 22 February 2017]   |  

Abstract

In addition to the traditional densely deployed cases, widely distributed wireless sensor networks (WDWSNs) have begun to emerge. In these networks, sensors are far away from each other and have no network connections. In this paper, a special application of data collection for WDWSNs is considered where each sensor (Unmanned Ground Vehicle, UGV) moves in a hazardous and complex terrain with many obstacles. They have their own work cycles and can be accessed only at a few locations. A mobile sink cruises on the ground to collect data gathered from these UGVs. Considerable delay is inevitable if the UGV and the mobile sink miss the meeting window or wait idly at the meeting spot. The unique challenge here is that, for each cycle of an UGV, there is only a limited time window for it to appear in front of the mobile sink. Therefore, we propose scheduling the path of a single mobile sink, targeted at visiting a maximum number of UGVs in a timely manner with the shortest path, according to the timing constraints bound by the cycles of UGVs. We then propose a bipartite matching based algorithm to reduce the number of mobile sinks. Simulation results show that the proposed algorithm can achieve performance close to the theoretical maximum determined by the duty cycle instance. View Full-Text
Keywords: data collection; widely distributed sensor networks; Unmanned Ground Vehicle; mobile sink; precedence constraints; trajectory planning data collection; widely distributed sensor networks; Unmanned Ground Vehicle; mobile sink; precedence constraints; trajectory planning
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Liu, P.; Fu, T.; Xu, J.; Ding, Y. Efficient Data Collection in Widely Distributed Wireless Sensor Networks with Time Window and Precedence Constraints. Sensors 2017, 17, 421.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top