Improving the Data Delivery Latency in Sensor Networks with Controlled Mobility

  • Authors:

  • Ryo Sugihara;Rajesh K. Gupta

  • Affiliations:

  • Computer Science and Engineering Department, University of California, San Diego,;Computer Science and Engineering Department, University of California, San Diego,

  • Venue:
  • DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Unlike traditional multihop forwarding among homogeneous static sensor nodes, use of mobile devices for data collection in wireless sensor networks has recently been gathering more attention. It is known that the use of mobility significantly reduces the energy consumption at each sensor, elongating the functional lifetime of the network, in exchange for increased data delivery latency. However, in previous work, mobility and communication capabilities are often underutilized, resulting in suboptimal solutions incurring unnecessarily large latency. In this paper, we focus on the problem of finding an optimal path of a mobile device, which we call "data mule," to achieve the smallest data delivery latency in the case of minimum energy consumption at each sensor, i.e., each sensor only sends its data directly to the data mule. We formally define the path selection problem and show the problem is $\mathcal{NP}$-hard. Then we present an approximation algorithm and analyze its approximation factor. Numerical experiments demonstrate that our approximation algorithm successfully finds the paths that result in 10%-50% shorter latency compared to previously proposed methods, suggesting that controlled mobility can be exploited much more effectively.