Computer Science – Information Theory
Scientific paper
2008-02-28
Computer Science
Information Theory
Proceedings of the 2008 IEEE International Conference on Communications, Beijing, May 19-23, 2008
Scientific paper
Distributed opportunistic scheduling (DOS) protocols are proposed for multiple-input multiple-output (MIMO) ad-hoc networks with contention-based medium access. The proposed scheduling protocols distinguish themselves from other existing works by their explicit design for system throughput improvement through exploiting spatial multiplexing and diversity in a {\em distributed} manner. As a result, multiple links can be scheduled to simultaneously transmit over the spatial channels formed by transmit/receiver antennas. Taking into account the tradeoff between feedback requirements and system throughput, we propose and compare protocols with different levels of feedback information. Furthermore, in contrast to the conventional random access protocols that ignore the physical channel conditions of contending links, the proposed protocols implement a pure threshold policy derived from optimal stopping theory, i.e. only links with threshold-exceeding channel conditions are allowed for data transmission. Simulation results confirm that the proposed protocols can achieve impressive throughput performance by exploiting spatial multiplexing and diversity.
Ge Weiyan
Poor Harold Vincent
Pun Man-On
Zhang Junshan
Zheng Dong
No associations
LandOfFree
Distributed Opportunistic Scheduling for MIMO Ad-Hoc Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Distributed Opportunistic Scheduling for MIMO Ad-Hoc Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed Opportunistic Scheduling for MIMO Ad-Hoc Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-352092