Show simple item record

dc.contributor.authorChen, Hua
dc.contributor.authorBaras, Johnen_us
dc.date.accessioned2013-04-04T18:48:29Z
dc.date.available2013-04-04T18:48:29Z
dc.date.issued2013
dc.identifier.urihttp://hdl.handle.net/1903/13857
dc.description.abstractIn this paper, we study a distributed opportunistic scheduling problem to exploit the channel fluctuations in wireless ad-hoc networks. In this problem, channel probing is followed by a transmission scheduling procedure executed independently within each link in the network. We study this problem for the popular block-fading channel model, where channel dependencies are inevitable between different time instances during the channel probing phase. Different from existing works, we explicitly consider this type of channel dependencies and its impact on the transmission scheduling and hence the system performance. We use optimal stopping theory to formulate this problem, but at carefully chosen time instances at which effective decisions are made. The problem can then be solved by a new stopping rule problem where the observations are independent between different time instances. Since the stopping rule problem has an implicit horizon determined by the network size, we first characterize the system performance using backward induction. We develop one recursive approach to solve the problem and show that the computational complexity is linear with respect to network size. Due to its computational complexity, we present an approximated approach for performance analysis and develop a metric to check how good the approximation is. We characterize the achievable system performance if we ignore the finite horizon constraint and design stopping rules based on the infinite horizon analysis nevertheless. We present an improved protocol to reduce the probing costs which requires no additional cost. We characterize the performance improvement and the energy savings in terms of the probing signals. We show numerical results based on our mathematical analysis with various settings of parameters.en_US
dc.description.sponsorshipThis research is partially supported by the NSF under grant CNS-1018346, by the U.S. AFOSR under MURI grant award FA9550-09-1-0538, and by DARPA under grant award SA00007007 for the Multi-Scale Systems Center (MuSyC), through the FCRP of SRC and DARPA.en_US
dc.language.isoen_USen_US
dc.relation.ispartofseriesTR_2013-10
dc.subjectOpportunistic schedulingen_US
dc.subjectmedia access controlen_US
dc.subjectad hoc networksen_US
dc.subjectchannel probingen_US
dc.subjectblock fadingen_US
dc.subjectoptimal stoppingen_US
dc.subjectbackward inductionen_US
dc.titleDistributed Opportunistic Scheduling for Wireless Ad-Hoc Networks with Block-Fading Modelen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtInstitute for Systems Researchen_us
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_us
dc.relation.isAvailableAtUniversity of Maryland (College Park, MD)en_us


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record