In IEEE 802.16j MMR (Mobile Multi-hop Relay) networks, bandwidth is divided into two zones, access zone to mobile stations and relay zone to relay stations. To satisfy the requirements of Quality of Services (QoS) for different types of traffic between access zone and relay zone, we propose Bandwidth-Negotiation Scheduling (BNS) for BS and RS to adequately allocate bandwidth. For the purpose of satisfying higher-priority rtPS traffic, BNS can negotiate bandwidth between two zones if the allocated bandwidth is insufficient to meet its QoS requirement. Besides, BNS can satisfy bandwidth requirement for nrtPS as much as possible and it will also do negotiation to allocate at least minimum bandwidth if resource is not sufficient. At last, BNS may reduce the allocated bandwidth for nrtPS if PLR (Packet Loss Ratio) of BE is too high. Therefore, the starvation probability of BE can be decreased by earning this extra bandwidth from nrtPS. In short, the proposed BNS can adjust the boundary between access zone and relay zone dynamically and it can improve bandwidth utilization effectively. Through Markov-chain model, we evaluated the performance of BNS and compared its performance to a mechanism with fixed-boundary. Analytical results have shown that BNS can decrease the probability of exceeding delay constraint for rtPS, increase the throughput, and decrease the PLR for nrtPS when rtPS delay constraint is increased. Moreover, BNS can significantly reduce the possibility of starvation for BE traffic.
Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0808111-214706 |
Date | 08 August 2011 |
Creators | Lin, I-Chieh |
Contributors | Ren-Hung Hwang, Chung-Ming Huang, Cheng-Shong Wu, Tsang-Ling Sheu, Sheau-Ru Tong |
Publisher | NSYSU |
Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
Language | Cholon |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0808111-214706 |
Rights | unrestricted, Copyright information available at source archive |
Page generated in 0.0023 seconds