From Sleeping to Stockpiling: Energy Conservation via Stochastic Scheduling in Wireless Networks.
dc.contributor.author | Shuman, David I | en_US |
dc.date.accessioned | 2010-08-27T15:17:55Z | |
dc.date.available | NO_RESTRICTION | en_US |
dc.date.available | 2010-08-27T15:17:55Z | |
dc.date.issued | 2010 | en_US |
dc.date.submitted | en_US | |
dc.identifier.uri | https://hdl.handle.net/2027.42/77839 | |
dc.description.abstract | Motivated by the need to conserve energy in wireless networks, we study three stochastic dynamic scheduling problems. In the first problem, we consider a wireless sensor node that can turn its radio off for fixed durations of time in order to conserve energy. We formulate finite horizon expected cost and infinite horizon average expected cost problems to model the fundamental tradeoff between packet delay and energy consumption. Through analysis of the dynamic programming equations, we derive structural results on the optimal policies for both formulations. For the infinite horizon problem, we identify a threshold decision rule to determine the optimal control action when the queue is empty. In the second problem, we consider a sensor node with an inaccurate timer in the ultra-low power sleep mode. The loss in timing accuracy in the sleep mode can result in unnecessary energy consumption from two unsynchronized devices trying to communicate. We develop a novel method for the node to calibrate its timer: occasionally waking up to measure the ambient temperature, upon which the timer speed depends. The objective is to dynamically schedule a limited number of temperature measurements in a manner most useful to improving the accuracy of the timer. We formulate optimization problems with both continuous and discrete underlying time scales, and implement a numerical solution to an equivalent reduction of the second formulation. In the third problem, we consider a single source transmitting data to one or more receivers over a shared wireless channel. Each receiver has a buffer to store received packets before they are drained. The transmitter's goal is to minimize total power consumption by exploiting the temporal and spatial variation of the channel, while preventing the receivers' buffers from emptying. In the case of a single receiver, we show that modified base-stock and finite generalized base-stock policies are optimal when the power-rate curves are linear and piecewise-linear convex, respectively. We also present the sequences of critical numbers that complete the characterizations of the optimal policies when additional technical conditions are satisfied. We then analyze the structure of the optimal policy for the case of two receivers. | en_US |
dc.format.extent | 1667529 bytes | |
dc.format.extent | 1373 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | en_US |
dc.subject | Energy Conservation | en_US |
dc.subject | Wireless Networks | en_US |
dc.subject | Resource Allocation | en_US |
dc.subject | Opportunistic Scheduling | en_US |
dc.subject | Markov Decision Process | en_US |
dc.subject | Inventory Theory | en_US |
dc.title | From Sleeping to Stockpiling: Energy Conservation via Stochastic Scheduling in Wireless Networks. | en_US |
dc.type | Thesis | en_US |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Electrical Engineering: Systems | en_US |
dc.description.thesisdegreegrantor | University of Michigan, Horace H. Rackham School of Graduate Studies | en_US |
dc.contributor.committeemember | Liu, Mingyan | en_US |
dc.contributor.committeemember | Anastasopoulos, Achilleas | en_US |
dc.contributor.committeemember | Teneketzis, Demosthenis | en_US |
dc.contributor.committeemember | Wu, Owen | en_US |
dc.subject.hlbsecondlevel | Electrical Engineering | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/77839/1/dishuman_1.pdf | |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.