Maximizing Throughput in Wireless Networks With Finite Internal Buffers

In this paper, the authors consider the problem for maximizing the throughput of a discrete-time wireless network, where only certain sets of links can transmit simultaneously. It is well known that each set of such links can be represented by a configuration vector and the convex hull of the configuration vectors determines the capacity region of the wireless network. In the literature, packet scheduling polices that stabilize any admissible traffic in the capacity region are mostly related to the Maximum Weighted Matching algorithm (MWM) that identifies the most suitable configuration vector in every time slot.

Provided by: Institute of Electrical and Electronics Engineers Topic: Mobility Date Added: Mar 2011 Format: PDF

Find By Topic