Optimal backpressure routing for wireless networks with multi-receiver diversity |
| |
Authors: | Michael J. Neely Rahul Urgaonkar |
| |
Affiliation: | 1. Department of Physics, Institute of Basic Science, Daegu University, Gyeongsan 712-714, Republic of Korea;2. MECHA-4U, Suwon 441-400, Republic of Korea;1. Department of Computer Engineering, Gachon University, Seongnam, Gyeonggi 461-701, Republic of Korea;2. Department of Computer Science, University of Southern California, Los Angeles, CA 90089, USA |
| |
Abstract: | We consider the problem of optimal scheduling and routing in an ad-hoc wireless network with multiple traffic streams and time varying channel reliability. Each packet transmission can be overheard by a subset of receiver nodes, with a transmission success probability that may vary from receiver to receiver and may also vary with time. We develop a simple backpressure routing algorithm that maximizes network throughput and expends an average power that can be pushed arbitrarily close to the minimum average power required for network stability, with a corresponding tradeoff in network delay. When channels are orthogonal, the algorithm can be implemented in a distributed manner using only local link error probability information, and supports a “blind transmission” mode (where error probabilities are not required) in special cases when the power metric is neglected and when there is only a single destination for all traffic streams. For networks with general inter-channel interference, we present a distributed algorithm with constant-factor optimality guarantees. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|