Joint Concurrent Routing and Multi-Pointer Packet Scheduling in IEEE 802.16 Mesh Networks

IEEE 802.16, also known as Worldwide Interoperability for Microwave Access (WiMAX), is a standardization effort carried out by the IEEE to provide last-mile broadband access to end users. The IEEE 802.16 standard supports two medium access control (MAC) modes - a mandatory point to multipoint (PMP) mode and an optional mesh mode. In this paper, we propose an asymmetric interference aware routing algorithm and a new multipointer approach in implementing scheduling algorithms for IEEE 802.16 mesh networks. We modify three different centralized scheduling algorithms, fixed scheduling, ordered scheduling and per-slot scheduling using multipointer approach to allow for spatial reuse (SR) in IEEE 802.16 mesh networks. Simulation results reveal that fixed scheduling with SR provides the best performance

Routing and Scheduling Using Column Generation in IEEE 802.16j Wireless Relay Networks

Worldwide Interoperability for Microwave Access (WiMAX) has become an important standard in wireless telecommunication networks in recent years due to the increasing bandwidth requirements, as well as to customer demand for having ubiquitous access to the network. One of the most recent versions of WiMAX is IEEE 802.16-2009, but in this thesis we work with its 802.16j amendment. This amendment includes the use of relay stations (RS) to improve the network's throughput, with the RSs becoming intermediaries between the base station (BS) and the subscriber stations (SS). In the literature, there have been several authors claiming to perform joint routing and scheduling in wireless networks using the column generation technique. Nevertheless, these papers are not performing scheduling since they do not specify how time slots are allocated to each transmitting node over time (they only count the time slots it takes to transmit data). That is why we developed an optimization model (that is solved using column generation) having in mind the fact of performing real scheduling, not only counting time slots but taking into account the allocation of resources over a period of time. The model we developed chooses among a set of possible configurations (a set of transmitting links over a predetermined period of time slots) to calculate the time it takes to transmit data from end to end. After obtaining some simulation results with our model, we compared them with those of a model that does not perform real scheduling. The results show only minor differences in the total number of time slots that a transmission lasts since we can only assign a small number of time slots per configuration