Computer Science – Information Theory
Scientific paper
2011-07-08
Computer Science
Information Theory
35 pages, 5 figures, 1 table
Scientific paper
Opportunistic scheduling and routing can in principle greatly increase the throughput of decentralized wireless networks, but to be practical they must do so with small amounts of timely side information. In this paper, we propose three techniques for low-overhead distributed opportunistic scheduling (DOS) and precisely determine their affect on the overall network outage probability and transmission capacity (TC). The first is distributed channel-aware scheduling (DCAS), the second is distributed interferer-aware scheduling (DIAS), and the third generalizes and combines those two and is called distributed interferer-channel-aware scheduling (DICAS). One contribution is determining the optimum channel and interference thresholds that a given isolated transmitter should estimate and apply when scheduling their own transmissions. Using this threshold, the precise network-wide gain of each technique is quantified and compared. We conclude by considering interference cancellation at the receivers, and finding how much it improves the outage probability.
Andrews Jeffrey G.
Liu Chun-Hung
No associations
LandOfFree
Distributed SIR-Aware Scheduling in Large-Scale Wireless 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 SIR-Aware Scheduling in Large-Scale Wireless Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed SIR-Aware Scheduling in Large-Scale Wireless Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-674619