This poster is aimed at solving the problem of maximizing the energy margin of a solar-powered sensor network at a fixed time horizon, to maximize the network performance during an event to monitor. Using a game theoretic approach, the optimal routing maximizing the energy margin of the network at a given time under solar power forcing can be computed in a decentralized way and solved exactly through dynamic programming with a low overall complexity. We also show that this decentralized algorithm is simple enough to be implemented on practical sensor nodes. Such an algorithm would be very useful whenever the energy margin of a solar-powered sensor network has to be maximized at a specific time. © 2014 IEEE.
|Original language||English (US)|
|Title of host publication||IPSN-14 Proceedings of the 13th International Symposium on Information Processing in Sensor Networks|
|Publisher||Institute of Electrical and Electronics Engineers (IEEE)|
|Number of pages||2|
|State||Published - Apr 2014|