#### DMCA

## Scheduling in Multihop WiMAX Networks

Citations: | 6 - 0 self |

### Citations

175 | IEEE Standard 802.16: A technical overview of the WirelessMAN Air Interface for Broadband Wireless Access
- Eklund, Marks, et al.
- 2002
(Show Context)
Citation Context ... jitter Non RealTime Polling Service (nrtPS) Best Effort (BE) Data transfer, Web maxrate fines the physical layer (PHY) and the data link layer which are the bottommost layers of the protocol stack ( =-=[2]-=-, [3]). The physical layer of IEEE 802.16 consists of a number of air interfaces such as WirelessMANOFDM and WirelessMAN-OFDMA. Both frequencydivision duplex (FDD) and Time-Division Duplex (TDD) are s... |

46 | Algorithms for routing and centralized scheduling to provide QoS in IEEE 802.16 mesh networks
- Shetiya, Sharma
- 2005
(Show Context)
Citation Context ...a good route might lead to efficient scheduling. Shetiya and Sharma design routing and centralized scheduling algorithms that provide per flow QoS guarantees to real and interactive data applications =-=[4]-=- for IEEE 802.16 mesh networks. They use fixed routing based on a tree structure and adopt shortest path routing algorithms that work well for both type of applications. They propose separate scheduli... |

45 |
Modelling and Performance Analysis of the Distributed Scheduler
- Cao
(Show Context)
Citation Context ...rity to UGS, ertPS and rtPS flows. Fairness has to be implemented at the SS level as well as the user level. 4. Distributed scheduling: A performance analysis of the distributed scheduler was done by =-=[21]-=-. However, more research is required to determine slot assignment for data transfer and holdoff exponent values. Also, different distributed scheduling techniques need to be proposed that can do efffi... |

33 | Maximum Throughput and Fair Bandwidth Allocation
- Tang, Xue, et al.
- 2006
(Show Context)
Citation Context ...air rate allocation (OFRA) problem is then formulated and a fair uplink scheduling algorithm is proposed that solves the OFRA problem and finds the optimal rate allocation vector. Tang, Xue and Zhang =-=[15]-=- studied bandwidth allocation in multi-channel multihop wireless mesh networks. They tried to maximize network throughput and enhance fairness at the same time. They use a max-min fairness model to ac... |

32 | Designing Multi-hop Wireless Backhaul Networks with Delay Guarantees
- Narlikar, Wilfong, et al.
- 2006
(Show Context)
Citation Context ...unallocated capacity request. The drawback of this scheme is that the fairness among the SSs is not considered and SSs farther away from the BS may not get fair share of the resources. The authors in =-=[11]-=- propose a simple and generalized even-odd framework for link activation. Their main goal is to satisfy bandwidth and delay requirements of flows. Each node is alternately labeled even or odd; even no... |

30 | Efficient and fair scheduling of uplink and downlink
- Singh, Sharma
(Show Context)
Citation Context ..., they propose algorithms for resource allocation that achieve proportional fairness for users and short term rate guarantees for real-time applications subject to power and bandwidth constraints. In =-=[6]-=- the authors introduce and compare scheduling algorithms for 802.16d OFDMA/TDD based sysThe authors in [10] do joint routing and scheduling so as to maximize spatial use. The routing algorithm tems th... |

26 |
A Tractable Algorithm for Fair and Efficient Uplink Scheduling of Multi-Hop WiMax Mesh Networks
- Cao, Raghunathan, et al.
- 2006
(Show Context)
Citation Context ...creased by one. The algorithm then finds another non-interfering link that can be scheduled in the same timeslot. However, the channel utilization rate of this algorithm is very low. The objective of =-=[14]-=- is to formulate a scheduling problem which maximizes the system throughput under the fairness model defined by the authors. The fairness is considered at the granularity of a SS8 Mobile Computing and... |

16 |
Performance Evaluation of Scheduling in
- Han, Jia, et al.
- 2007
(Show Context)
Citation Context ...”schedule flow subchannel” algorithm outperforms the other algorithms. However, the authors do not consider fairness in their algorithms and also do not account for the overhead in the uplink map. In =-=[13]-=- a SS is assigned service tokens based on its traffic demand. In each timeslot a link is selected based on a certain criterion and the service token of the transmitter is decreased and the service tok... |

11 |
Computational analysis and efficient algorithms for micro and macro OFDMA downlink scheduling
- Cohen, Katzir
(Show Context)
Citation Context ...t requirement. They present algorithms that determine the proportional constant value. Fairness is not applied when scheduling UGS flows as the bandwidth demand for UGS flows is low. Cohen and Katzir =-=[7]-=- divide the OFDMA scheduling problem into a macro and a micro scheduling problem. The authors assume that the association between PDUs and their Phy-pofiles has been already been determined. The macro... |

11 |
Admission control and interference-aware scheduling in multi-hop WiMAX networks
- Ghosh, Gupta, et al.
- 2007
(Show Context)
Citation Context ...irement of each link must not exceed half of the total capacity of the link. Flow based heuristic admission control and scheduling algorithms for multi-hop WiMAX networks are proposed and compared in =-=[12]-=-. Flows are scheduled by service class priority and within each service class by arrival time first. The deadline of a flow is computed from its arrival time, latency and number of hops. A flow is sch... |

7 | Optimal Scheduling for OFDMA Systems
- Agrawal, Berry, et al.
(Show Context)
Citation Context ...vide an LP that maximizes the minimum bandwidth allocation. The authors also propose a heuristic to solve the lexicographical max-min bandwidth allocation problem in polynomial time. Agrawal et al in =-=[16]-=- discuss scheduling and resource allocation for an OFDMA-based wireless network. They address the problem of subcarrier allocation to selected users while determining the transmission power and modula... |

7 |
Link Scheduling for Minimum Delay
- Djukic, Valaee
- 2007
(Show Context)
Citation Context ... than the other links. Based on the ranks, a link is allowed to transmit in the first transmission opportunity that does not overlap with any conflicting links. The third algorithm, which is based on =-=[20]-=-, finds a ranking with good TDMA delay properties. A bandwidth optimal ranking is found using branch-andbound search techniques. A ranking is bandwidth optimal if link bandwidths resulting from its sc... |

5 |
Scheduling algorithms for 802.16 mesh networks
- Djukic, Valaee
- 2007
(Show Context)
Citation Context ...s a challenging problem. Some of the key issues involved are: as the number of timeslots needed to complete all the 1. Routing: In a mesh network, multiple routes data transmissions. Djukic and Valee =-=[18]-=- discuss three centralized may exist between two nodes. Hence algorithms should evaluate different routing strategies like scheduling algorithms for 802.16 networks. All the algorithms take the number... |

3 |
Tutorial:802.16 mac layer mesh extensions overview
- Bayer, Waes, et al.
(Show Context)
Citation Context ...networks without the need to deploy expensive base stations. A multihop WiMAX network may also lead to increased user throughput as more efficient modulation techniques can be used over shorter links =-=[1]-=-. The first IEEE 802.16 standard, published in April 2002, defined the Medium Access Control (MAC) and Physical (PHY) layers, operating in licensed spectrum between 10 and 66 GHz. It requires Line of ... |

3 |
Centralized Scheduling and
- Du, Jia, et al.
- 2007
(Show Context)
Citation Context ...e solution using a dual formulation. VIII. Research Issues and Challenges Another centralized scheduling scheme using multiple channels and single transceivers in a WiMAX Mesh Network is discussed in =-=[17]-=-. The goal in this paper is to minimize the length of scheduling defined It can be inferred from the above discussion that scheduling in WiMAX networks is a challenging problem. Some of the key issues... |

2 | Practical Resource Allocation Algorithms for QoS
- Girici, Zhu, et al.
- 2008
(Show Context)
Citation Context ...and can transmit simultaneously separated in the frequency domain. First an algorithm that allocates subcarriers is used, then a greedy approach for bit and power loading is applied for each link. In =-=[9]-=- the authors address resource allocation for QoS traffic in OFDMA based wireless networks. The considered network comprises of a base station transmitting to a number of mobile users. The authors prop... |

2 |
and efficient multihop scheduling for
- Kim, Ganz, et al.
- 2007
(Show Context)
Citation Context ... into account Service Level Agreements between the service providers and Mobile Computing and Communications Review, Volume 12, Number 2 9 ing version of the node load-balancing algorithm proposed in =-=[19]-=- works in iterations. At the beginning of each iteration, a link is ranked based on its satisfaction with the schedule in the previous iteration. The satisfaction sj of a link ej can be defined as:cu... |