Mobility

Predictive QoS Routing to Mobile Sinks in Wireless Sensor Networks

Free registration required

Executive Summary

The paper presents an algorithm for data delivery to mobile sinks in wireless sensor networks. The algorithm is based on information potentials, which one extends to account for mobility. The paper shows that for local movement along edges in the communication graph, the information potentials can be adapted using a simple iterative distributed computation. However, for non-local movement, the potential field might change significantly, and iterative computation leads to packet loss and packet delivery delays. The paper addresses this problem by introducing the mobility graph, which encodes knowledge about likely mobility patterns within the network. The mobility graph can be extracted from training data and is used to predict future relay nodes for the mobile node.

  • Format: PDF
  • Size: 1746.6 KB