Next Article in Journal
Web of Objects Based Ambient Assisted Living Framework for Emergency Psychiatric State Prediction
Next Article in Special Issue
Distributed Particle Filter for Target Tracking: With Reduced Sensor Communications
Previous Article in Journal
Modeling of Distributed Sensing of Elastic Waves by Fiber-Optic Interferometry
Previous Article in Special Issue
Queuing Theory Based Co-Channel Interference Analysis Approach for High-Density Wireless Local Area Networks
Article Menu

Export Article

Open AccessArticle
Sensors 2016, 16(9), 1432; doi:10.3390/s16091432

A Greedy Scanning Data Collection Strategy for Large-Scale Wireless Sensor Networks with a Mobile Sink

1
Department of Information and Communication Systems, Hohai University, Changzhou 213000, China
2
National Institute of Telecommunications (Inatel), Minas Gerais 30000-000, Brazil
3
The Instituto de Telecomunicações, Universidade da Beira Interior, Covilhã 6200-062, Portugal
4
The University ITMO, St. Petersburg 190000, Russia
*
Author to whom correspondence should be addressed.
Academic Editors: Mianxiong Dong, Zhi Liu, Anfeng Liu and Didier El Baz
Received: 15 July 2016 / Revised: 27 August 2016 / Accepted: 30 August 2016 / Published: 6 September 2016
(This article belongs to the Special Issue New Paradigms in Cyber-Physical Social Sensing)

Abstract

Mobile sink is widely used for data collection in wireless sensor networks. It can avoid ‘hot spot’ problems but energy consumption caused by multihop transmission is still inefficient in real-time application scenarios. In this paper, a greedy scanning data collection strategy (GSDCS) is proposed, and we focus on how to reduce routing energy consumption by shortening total length of routing paths. We propose that the mobile sink adjusts its trajectory dynamically according to the changes of network, instead of predetermined trajectory or random walk. Next, the mobile sink determines which area has more source nodes, then it moves toward this area. The benefit of GSDCS is that most source nodes are no longer needed to upload sensory data for long distances. Especially in event-driven application scenarios, when event area changes, the mobile sink could arrive at the new event area where most source nodes are located currently. Hence energy can be saved. Analytical and simulation results show that compared with existing work, our GSDCS has a better performance in specific application scenarios. View Full-Text
Keywords: wireless sensor networks; data collection; mobile sink; greedy scanning wireless sensor networks; data collection; mobile sink; greedy scanning
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

Zhu, C.; Zhang, S.; Han, G.; Jiang, J.; Rodrigues, J.J.P.C. A Greedy Scanning Data Collection Strategy for Large-Scale Wireless Sensor Networks with a Mobile Sink. Sensors 2016, 16, 1432.

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