IEEE 802.16 is a recent IEEE standard for broadband wireless access networks. In IEEE 802.16 networks, the Medium Access Control ( MAC) protocol is centralized and explicitly supports quality of service ( QoS). That is to say, access to the medium by a number of Subscriber Stations ( SSs) is centrally controlled by one Base Station ( BS), which is responsible for allocating bandwidth to several MAC connections in order to provide them with the negotiated QoS guarantees. However, although the network can be operated in Frequency Division Duplex ( FDD) mode ( that is, transmissions from the BS ( downlink) and SSs ( uplink) occur on separate frequency channels), the standard supports SSs with half- duplex capabilities. This means that they are equipped with a single radio transceiver which can be used either to transmit in the uplink direction or to receive in the downlink direction. This may severely hamper the capacity to support QoS. Therefore, in order to allocate bandwidth, an IEEE 802.16 BS has to solve two related issues: 1) how it can schedule bandwidth grants to SSs in order to meet the QoS requirements of their connections and 2) how it can coordinate the uplink and downlink scheduled grants so as to support half- duplex capabilities. In this paper, we derive sufficient conditions for a set of scheduled grants to be allocated so that the transmission of each half- duplex SS does not overlap with its reception. Based on this, we propose a grant allocation algorithm, namely, the Half- Duplex Allocation ( HDA) algorithm, which always produces a feasible grant allocation provided that the sufficient conditions are met. HDA has a computation complexity of O(n), where n is the number of grants to be allocated. Finally, we show that the definition of HDA allows us to address the two issues mentioned above by following a pipeline approach. This is when scheduling and allocation are implemented by separate and independently running algorithms, which are just loosely coupled with each other. We show via extensive simulations that the performance of SSs with half- duplex capabilities, in terms of the delay of real- time and non- real- time interactive traffic, using HDA almost perfectly matches that of full- duplex SSs, whereas an alternative approach, based on the static partitioning of half- duplex SSs into separate groups, which are allocated alternately, is shown to degrade the performance.
Bandwidth Allocation with Half-Duplex Stations in IEEE 802.16 Wireless Networks
CICCONETTI, CLAUDIO;LENZINI, LUCIANO;MINGOZZI, ENZO
2007-01-01
Abstract
IEEE 802.16 is a recent IEEE standard for broadband wireless access networks. In IEEE 802.16 networks, the Medium Access Control ( MAC) protocol is centralized and explicitly supports quality of service ( QoS). That is to say, access to the medium by a number of Subscriber Stations ( SSs) is centrally controlled by one Base Station ( BS), which is responsible for allocating bandwidth to several MAC connections in order to provide them with the negotiated QoS guarantees. However, although the network can be operated in Frequency Division Duplex ( FDD) mode ( that is, transmissions from the BS ( downlink) and SSs ( uplink) occur on separate frequency channels), the standard supports SSs with half- duplex capabilities. This means that they are equipped with a single radio transceiver which can be used either to transmit in the uplink direction or to receive in the downlink direction. This may severely hamper the capacity to support QoS. Therefore, in order to allocate bandwidth, an IEEE 802.16 BS has to solve two related issues: 1) how it can schedule bandwidth grants to SSs in order to meet the QoS requirements of their connections and 2) how it can coordinate the uplink and downlink scheduled grants so as to support half- duplex capabilities. In this paper, we derive sufficient conditions for a set of scheduled grants to be allocated so that the transmission of each half- duplex SS does not overlap with its reception. Based on this, we propose a grant allocation algorithm, namely, the Half- Duplex Allocation ( HDA) algorithm, which always produces a feasible grant allocation provided that the sufficient conditions are met. HDA has a computation complexity of O(n), where n is the number of grants to be allocated. Finally, we show that the definition of HDA allows us to address the two issues mentioned above by following a pipeline approach. This is when scheduling and allocation are implemented by separate and independently running algorithms, which are just loosely coupled with each other. We show via extensive simulations that the performance of SSs with half- duplex capabilities, in terms of the delay of real- time and non- real- time interactive traffic, using HDA almost perfectly matches that of full- duplex SSs, whereas an alternative approach, based on the static partitioning of half- duplex SSs into separate groups, which are allocated alternately, is shown to degrade the performance.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
