Delay Tolerance and Energy Saving in Wireless Sensor Networks with a Mobile Base Station

الملخص EN

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.