Abstract

Data gathering is a key operator for applications in wireless sensor networks; yet it is also a challenging problem in mobile sensor networks when considering that all nodes are mobile and the communications among them are opportunistic. This paper proposes an efficient data gathering scheme called ADG that adopts speedy mobile elements as the mobile data collector and takes advantage of the movement patterns of the network. ADG first extracts the network meta-data at initial epochs, and calculates a set of proxy nodes based on the meta-data. Data gathering is then mapped into the Proxy node Time Slot Allocation (PTSA) problem that schedules the time slots and orders, according to which the data collector could gather the maximal amount of data within a limited period. Finally, the collector follows the schedule and picks up the sensed data from the proxy nodes through one hop of message transmissions. ADG learns the period when nodes are relatively stationary, so that the collector is able to pick up the data from them during the limited data gathering period. Moreover, proxy nodes and data gathering points could also be timely updated so that the collector could adapt to the change of node movements. Extensive experimental results show that the proposed scheme outperforms other data gathering schemes on the cost of message transmissions and the data gathering rate, especially under the constraint of limited data gathering period.

Highlights

  • Recent years there have been a lot of applications in Wireless Sensor Networks (WSNs), ranging from monitoring to event detection and target tracking

  • We study the problem of data gathering in mobile sensor networks with speedy mobile elements, especially when there is no predefined paths or tracks for the data collector

  • Unlike other data gathering mechanisms in stationary wireless sensor network, the data gathering latency is not treated as a key metric for our algorithm

Read more

Summary

Introduction

Recent years there have been a lot of applications in Wireless Sensor Networks (WSNs), ranging from monitoring to event detection and target tracking. One strategy of data gathering with mobile elements is to map the data gathering problem into the optimization of trajectories of the mobile collector, and various scheduling schemes are proposed to increase the network lifetime or to minimize the traveling distance of mobile elements [1,3,4,6,8,9,10] In these schemes, ordinary nodes should be stationary and there should be paths or tracks available among the nodes, which are not always true in network deployments.

Related Work
Network Model
Evaluation Metrics
Overview
Activity Meta-Data
Contact Meta-Data
Proxy Node Selection
Visiting Order Scheduling
Data Gathering from Proxy Nodes
Environment Setup
Overall Performance
Impact Factors Analysis
Network Density
Data Gathering Period
Impact Analysis for the ADG Scheme
Threshold for Proxy Node Selection
Change of Node Movement
Imbalance of Message Transmissions
Conclusions
Algorithm of ksd Extraction
Algorithm of Time Allocation for the Proxy Nodes
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.