1 / 22

Cheng- Kuan Hsieh, Jyh -Cheng Chen, Jeng-Feng Weng

Cooperative Adaptive Partner Selection for Real-Time Services in IEEE 802.16j Multihop Relay Networks. Cheng- Kuan Hsieh, Jyh -Cheng Chen, Jeng-Feng Weng Department of Computer Science, National Tsing Hua University , Hsinchu , Taiwan. IEEE WCNC 2010. Outline. Introduction Problem

landon
Download Presentation

Cheng- Kuan Hsieh, Jyh -Cheng Chen, Jeng-Feng Weng

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Cooperative Adaptive Partner Selection for Real-Time Services in IEEE 802.16j MultihopRelay Networks Cheng-KuanHsieh, Jyh-Cheng Chen, Jeng-FengWeng Department of Computer Science, National TsingHua University,Hsinchu, Taiwan IEEEWCNC2010

  2. Outline • Introduction • Problem • Goals & Assumptions • CAPS Algorithm • Simulations • Conclusions

  3. Introduction • IEEE 802.16e is a promising standard for mobile Broadband Wireless Access (BWA) • Base Station (BS) • Mobile Stations (MSs) • IEEE 802.16j is defined for Multihop Relay (MR) operations • Base Station (BS) • Mobile Stations (MSs) • Relay Stations (RSs)

  4. Introduction • IEEE 802.16j MR network architecture Relay link： between an MR-BS and an RS between two RSs Access link： between an RS and an MS between an MR-BS and an MS

  5. Introduction • IEEE 802.16j provides real-time services for multi-hop users • Bandwidth resource is allocated to each intermediate hop along the path between the MS and the MR-BS • Real-time services require the strict QoS requirement • UGS/rtPS/ertPS RS3 RS1 BS MS RS2

  6. Introduction • IEEE 802.16j provides real-time services for multi-hop users • The MS doesn’t need to request bandwidth for each packet in each hop. • Therefore overhead is eliminated and packet latency is reduced. RS3 RS1 BS MS RS2

  7. Problem • An MS suffers from bad channel and cannot transmit packets to its access RS correctly • all bandwidths allocated from the access RS to the MR-BS along the multihop path are wasted. • Existing researches all focus on how to select a best path from MR-BS to an MS. • How to maintain the multi-hop connection when an MS experiences bad channel ? RS3 RS1 BS MS RS2

  8. Goals • An MS is currently experiencing bad channel condition • The QoS of real-time services could still be maintained by a good cooperative partner with good channel condition • How to design an algorithm to select a cooperative partner with best capability in IEEE 802.16j networks ? • Cooperative Adaptive Partner Selection (CAPS) algorithm • Select a partner with the most effective path RS3 RS1 BS MS RS2

  9. Assumptions • MR-BS maintains the location information of MSs. • On experiencing bad channel condition and cannot transmit packets to its access RS correctly, an MS can communication with its neighboring MSs.

  10. CAPS Algorithm • Cooperative Adaptive Partner Selection algorithm • Candidate selection phase • Partner selection phase

  11. CAPS Algorithm_Candidateselection phase • Error Detection • Initialization • MS’s Operation • Scheduling in MR-BS • Candidate Selection C：Cooperative candidates set C：Cooperative candidates set C={MS2, MS3, MS4 } C={MS2, MS3, MS4 } RS2 RS4 RS5 RS1 RS3 MS4 MS2 MS3 MS1 MS1 erroneous MS erroneous MS MR-BS

  12. CAPS Algorithm_Partnerselection phase • De：end-to-end delay • Dc：delay in the cooperative link RS5 RS2 RS4 RS3 RS1 MS4 MS2 MS3 MS1 MS1 erroneous MS Dc MR-BS De

  13. CAPS Algorithm_Partnerselection phase • Weighted Moving Average (WMA) • maintain a database (many De’s for different paths and many Dc’s for different links) • flush old data • keep n samples (old data may not reflect instantaneous delay)

  14. CAPS Algorithm_Partnerselection phase • Weighted Moving Average (WMA) WMADe4=38 RS1 RS4 RS2 RS3 RS5 WMADe2=43 WMADc2 = 21.9 MS2 MS3 MS1 MS4 MR-BS WMADe1=51 WMADc4 = 20.3 Dp4 = 38 + 17.3 = 55.3 Dp2 = 43 + 21.9 = 64.9 Dp3 = 51 + 20.3 = 71.3

  15. CAPS Algorithm_Partnerselection phase • Weighted Moving Average (WMA) WMADe4=38 RS5 RS2 RS4 RS3 RS1 WMADe2=43 MS1 MS4 MS2 MS3 MR-BS WMADe1=51 Dp4 = 38 + 17.3 = 55.3 Dp2 = 43 + 21.9 = 64.9 Dp3 = 51 + 20.3 = 71.3

  16. Simulations • Simulator：NS2 • Map size：5 km * 5 km • Packet size：150bytes • Bandwidth is allocated evenly to MSs because they generate the same traffic.

  17. Simulations • Simulation topology • 1MR-BS • 15RSs • 35 MSs

  18. Simulations • Average packet delay versus different PERs

  19. Simulations • Average jitter versus different PERs

  20. Simulations • Average packet loss rate versus different PERs

  21. Simulations • Throughput versus different PERs

  22. Conclusions • The MR-BS will selectan MS with minimum delay to help the erroneous MS. Therefore, the erroneous MS can still use other path totransmit packets to the MR-BS. • The results show CAPScan improve the performance significantly interms of the packet delay, jitter, packet loss rate, andthroughput.

More Related