| Paper: | SPCOM-L7.1 | ||
| Session: | Wireless Sensor Networks | ||
| Time: | Friday, May 19, 14:00 - 14:20 | ||
| Presentation: | Lecture | ||
| Topic: | Signal Processing for Communication: Scheduling and queuing protocols | ||
| Title: | Transmission Scheduling for Sensor Network Lifetime Maximization: A Shortest Path Bandit Formulation | ||
| Authors: | Yunxia Chen, Qing Zhao, University of California, Davis, United States; Vikram Krishnamurthy, Dejan Djonin, University of British Columbia, Canada | ||
| Abstract: | This paper addresses optimal sensor scheduling for maximizing network lifetime. We formulate this problem as a non-standard multi-armed bandit process with non-discounted reward and finite stopping time. We find that the optimal strategy should choose the sensor that has the largest Gittins' index. Exploiting the underlying structure of sensor scheduling problem, we reduce the computational complexity of the Gittins' index from $O(N^3)$ to $O(N)$ with respect to the network size $N$. Moreover, we derive closed-form expression for the Gittins' index. We also show that choosing the sensor with the most residual energy is an optimal strategy when the channel fading is independently and identically distributed across sensors. | ||
©2018 Conference Management Services, Inc. -||- email: webmaster@icassp2006.org -||- Last updated Friday, August 17, 2012