Abstract
Recent research shows that significant energy saving can be achieved in wireless sensor networks by using mobile devices. A mobile device roams sensing fields and collects data from sensors through a short transmission range. Multihop communication is used to improve data gathering by reducing the tour length of the mobile device. In this paper we study the trade-off between energy saving and data gathering latency in wireless sensor networks. In particular, we examine the balance between the relay hop count and the tour length of a mobile Base Station (BS). We propose two heuristic algorithms, Adjacent Tree-Bounded Hop Algorithm (AT-BHA) and Farthest Node First-Bounded Hop Algorithm (FNF-BHA), to reduce energy consumption of sensor nodes. The proposed algorithms select groups of Collection Trees (CTs) and a subset of Collection Location (CL) sensor nodes to buffer and forward data to the mobile BS when it arrives. Each CL node receives sensing data from its CT nodes within bounded hop count. Extensive experiments by simulation are conducted to evaluate the performance of the proposed algorithms against another heuristic. We demonstrate that the proposed algorithms outperform the existing work with the mean of the length of mobile BS tour.
Highlights
Data gathering in Wireless Sensor Networks (WSNs) is one of the most frequent and fundamental operations, which requires the sensor nodes to monitor the sensing field for as long as possible
The algorithms find the tour of the mobile Base Station (BS) consisting of Collection Location (CL) which meet the following criteria: (i) the energy consumption among the sensor nodes is balanced in order to prolong nodes lifetime; (ii) the total traversal time of the mobile BS on the tour is minimized; and (iii) the hop count between any sensor node and the CL is bounded by a given value
We dealt with the problem of data gathering in the mobile BS environment
Summary
Data gathering in Wireless Sensor Networks (WSNs) is one of the most frequent and fundamental operations, which requires the sensor nodes to monitor the sensing field for as long as possible. We deal with the data gathering problem with bounded delay time in sensor network using a controlled mobile BS, by exploring a balance between the relay hop count required for data relay and tour length of the mobile BS such that the energy consumption is minimized. The algorithms find the tour of the mobile BS consisting of CLs which meet the following criteria: (i) the energy consumption among the sensor nodes is balanced in order to prolong nodes lifetime; (ii) the total traversal time of the mobile BS on the tour is minimized; and (iii) the hop count between any sensor node and the CL is bounded by a given value.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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
