Association for Computing Machinery
The authors consider wireless sensor networks with nodes switching ON (awake) and OFF (sleeping) to preserve energy and transmitting data over channels with varying quality. The objective is to determine the best path from each node to a single gateway. Performance metrics of interest are: the expected energy consumption and the probability that the latency exceeds a certain threshold. Under Markovian assumptions on the sleeping schedules and the channel conditions, they obtain the expected energy consumption of transmitting a packet on any path to the gateway. They also provide an upper (Cherno) bound and a tight large deviations asymptotic for the latency probability on each path.