Asymptotically Optimal Data Dissemination in Multi-Channel Wireless Sensor Networks: Single Radios Suffice
Source: Boston University
The authors analyze the performance limits of data dissemination with multi-channel, single radio sensors under random packet loss. They formulate the problem of minimizing the average delay of data dissemination as a stochastic shortest path problem and show that, for an arbitrary topology network, an optimal control policy can be found in a finite number of steps, using value iteration or Dijkstra's algorithm. However, the computational complexity of this solution is generally prohibitive. They thus focus on two special classes of network topologies of practical interest, namely single-hop clusters and multi-hop cluster chains. For these topologies, they derive the structure of policies that achieve an asymptotically optimal average delay, in networks with large number of nodes.