Distributed Opportunistic Scheduling for MIMO Ad-Hoc Networks - Computer Science > Information TheoryReport as inadecuate




Distributed Opportunistic Scheduling for MIMO Ad-Hoc Networks - Computer Science > Information Theory - Download this document for free, or read online. Document in PDF available to download.

Abstract: Distributed opportunistic scheduling DOS protocols are proposed formultiple-input multiple-output MIMO ad-hoc networks with contention-basedmedium access. The proposed scheduling protocols distinguish themselves fromother existing works by their explicit design for system throughput improvementthrough exploiting spatial multiplexing and diversity in a {\em distributed}manner. As a result, multiple links can be scheduled to simultaneously transmitover the spatial channels formed by transmit-receiver antennas. Taking intoaccount the tradeoff between feedback requirements and system throughput, wepropose and compare protocols with different levels of feedback information.Furthermore, in contrast to the conventional random access protocols thatignore the physical channel conditions of contending links, the proposedprotocols implement a pure threshold policy derived from optimal stoppingtheory, i.e. only links with threshold-exceeding channel conditions are allowedfor data transmission. Simulation results confirm that the proposed protocolscan achieve impressive throughput performance by exploiting spatialmultiplexing and diversity.



Author: Man-On Pun, Weiyan Ge, Dong Zheng, Junshan Zhang, H. Vincent Poor

Source: https://arxiv.org/



DOWNLOAD PDF




Related documents