Low-Complexity Distributed Multibase Transmission and Scheduling
نویسندگان
چکیده
منابع مشابه
Low-Complexity Distributed Multibase Transmission and Scheduling
This paper addresses the problem of base station coordination and cooperation in wireless networks with multiple base stations. We present a distributed approach to downlink multibase beamforming, which allows for the multiplexing of M user terminals, randomly located in a network with N base stations. In particular, we detail a low-complexity scheduling algorithm, which can be employed with di...
متن کاملLow-complexity distributed fair scheduling for wireless multi-hop networks
Max-min fair bandwidth allocation is a meaningful objective whenever the level of user satisfaction cannot be clearly expressed as a function of the allocated bandwidth. In this work, we address the issue of approximating max-min fairness in a wireless network without the requirement for network-wide node coordination and we present a low-overhead greedy distributed algorithm for reaching this ...
متن کاملLow-Complexity Multiantenna Downlink Scheduling
This paper proposes a low-complexity scheduling algorithm with opportunistic channel state feedback using zero-forcing dirty paper coding (ZF-DPC) or zero-forcing (ZF). Whereas some existing schemes suffer a delay to update the serving users, the proposed algorithm continues to update the serving users immediately at each opportunistic channel feedback. Due to this dynamic serving user adaptati...
متن کاملDistributed Transmission Scheduling Using Code-Division Channelization
We present the Hybrid Activation Multiple Access scheduling protocol (HAMA) for wireless ad hoc networks. Unlike previous channel access scheduling protocols that activate either nodes or links only, HAMA is a node-activation oriented channel access scheduling protocol that also maximizes the chance of link activations. According to HAMA, the only required information for scheduling channel acc...
متن کاملDistributed Fair Scheduling with Variable Transmission Lengths
The fairness of 802.11 wireless networks is hard to predict and control because of the randomness and complexity of the MAC contentions and dynamics. Moreover, asymmetric channel conditions such as those caused by capture and channel errors often lead to severe unfairness among stations. In this paper we propose a novel distributed scheduling algorithm that we call VLS, for “variable-length sch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2007
ISSN: 1687-6180
DOI: 10.1155/2008/741593