AN INTEGRATED ROUTING AND DISTRIBUTED SCHEDULING APPROACH FOR HYBRID IEEE 802.16E MESH NETWORKS FOR VEHICULAR BROADBAND COMMUNICATIONS Rahul Amin Electrical.

Slides:



Advertisements
Similar presentations
February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
Advertisements

New NS-2 model developed for the IEEE specifications is now publicly available. This model was developed as part of the Seamless and Secure Mobility.
A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
CSE 6590 Department of Computer Science & Engineering York University 1 Introduction to Wireless Ad-hoc Networking 5/4/2015 2:17 PM.
Priority Queuing Achieving Flow ‘Fairness’ in Wireless Networks Thomas Shen Prof. K.C. Wang SURE 2005.
1 Throughput Enhancement in WiMax Mesh Network Using Concurrent Transmission Advisor: Dr. Kai-Wei Ke Speaker: Jaw-Woei Ma Date:03/28/2006.
Wireless Mesh Networks 1. Architecture 2 Wireless Mesh Network A wireless mesh network (WMN) is a multi-hop wireless network that consists of mesh clients.
Arsitektur Jaringan Terkini
1 Routing and Admission Control in IEEE Distributed Mesh Networks Tzu-Chieh Tsai Dept. of Computer Science National Chengchi University Taipei,
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
A serve flow management strategy for IEEE BWA system in TDD mode Hsin-Hsien Liu
1 Token Bucket Based CAC and Packet Scheduling for IEEE Broadband Wireless Access Networks Chi-Hung Chiang
Performance Analysis of the IEEE Wireless Metropolitan Area Network nmgmt.cs.nchu.edu.tw 系統暨網路管理實驗室 Systems & Network Management Lab Reporter :黃文帥.
1 在 IEEE 系統上提供 QoS 機 制之研究 Student:Hsin-Hsien Liu Advisor:Ho-Ting Wu Date:
1 A new QoS Architecture for IEEE and Spec. Instruction Speaker: Ming-Chia Hsieh Date:2005/05/03.
12006/11/28 Performance Analysis of Scheduling Algorithms for VoIP Services in IEEE e Systems Advisor: Dr. Kai-Wei Ke Speaker: Jaw-Woei Ma Date:11/28/2006.
Voice Traffic Performance over Wireless LAN using the Point Coordination Function Wei Supervisor: Prof. Sven-Gustav Häggman Instructor: Researcher Michael.
Investigating Depth-Fanout Trade-Off in WiMAX Mesh Networks Salim Nahle Luigi Iannone Benoit Donnet Timur Friedman Laboratoire LIP6 – CNRS Université Pierre.
1 IEEE Wireless MAN "Air Interface for Fixed Broadband Wireless Access Systems"
An Efficient QoS Scheduling Architecture for IEEE Wireless MANs Supriya Maheshwari Under the guidance of Prof. Sridhar Iyer and Prof. Krishna Paul.
1 Adaptive QoS Framework for Wireless Sensor Networks Lucy He Honeywell Technology & Solutions Lab No. 430 Guo Li Bin Road, Pudong New Area, Shanghai,
A Study of the Bandwidth Management Architecture over IEEE WiMAX Student :Sih-Han Chen Advisor : Ho-Ting Wu Date :
IEEE WirelessMAN For Broadband Wireless Metropolitan Area Networks.
Chia-Yu Yu 1, Sherali Zeadally 2, Naveen Chilamkurti 3, Ce-Kuen Shieh 1 1 Institute of Computer Communication Engineering and Department of Electrical.
1 Core-PC: A Class of Correlative Power Control Algorithms for Single Channel Mobile Ad Hoc Networks Jun Zhang and Brahim Bensaou The Hong Kong University.
WiMAX: IEEE Wireless MANs. Sridhar IyerIIT Bombay2 Wireless networks  Wireless PANs (Bluetooth – IEEE ) –very low range –wireless connection.
Improving Capacity and Flexibility of Wireless Mesh Networks by Interface Switching Yunxia Feng, Minglu Li and Min-You Wu Presented by: Yunxia Feng Dept.
Performance Analysis of an innovative scheduling algorithm for OFDMA based IEEE a systems E. Baccarelli, M.Biagi, C.Pelizzoni, N.Cordeschi This work.
2008/4/101 A DAPTIVE P OWER A LLOCATION AND C ALL A DMISSION C ONTROL IN M ULTISERVICE W IMAX A CCESS N ETWORKS IEEE Wireless Communications February 2007.
An Adaptive Deficit-based Scheduler for IEEE e Networks Nararat RUANGCHAIJATUPON and Yusheng JI The Graduate University for Advanced Studies National.
Fen Hou and Pin-Han Ho Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario Wireless Communications and Mobile.
WiMAX: IEEE Wireless MANs Sridhar Iyer K R School of Information Technology IIT Bombay
NS-2 NIST add-on IEEE model (MAC+PHY) Miray Kas 28 Jan 2008.
Energy-Saving Scheduling in IEEE e Networks Chia-Yen Lin, and Hsi-Lu Chao Department of Computer Science National Chiao Tung University.
Muhammad Mahmudul Islam Ronald Pose Carlo Kopp School of Computer Science & Software Engineering Monash University, Australia.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Providing End-to-End Delay Guarantees for Multi-hop Wireless Sensor Networks I-Hong Hou.
Uplink Scheduling with Quality of Service in IEEE Networks Juliana Freitag and Nelson L. S. da Fonseca State University of Campinas, Sao Paulo,
A Joint Bandwidth Allocation and Routing Scheme for the IEEE 802
1 The Design of the Power Saving Mechanisms in IEEE e Networks (Defense) Student: Lei Yan ( 嚴雷 ) Advisor: Dr. Ho-Ting Wu ( 吳和庭 ) Date: 2009/07/23.
A Multicast Mechanism in WiMax Mesh Network Jianfeng Chen, Wenhua Jiao, Pin Jiang, Qian Guo Asia-Pacific Conference on Communications, (APCC '06)
Opportunistic Fair Scheduling for the Downlink of Wireless Metropolitan Area Networks Mehri Mehrjoo, Mehrdad Dianati, Xuemin (Sherman) Shen, and.
Rate-Based Channel Assignment Algorithm for Multi-Channel Multi- Rate Wireless Mesh Networks Sok-Hyong Kim and Young-Joo Suh Department of Computer Science.
IEEE j Relay-Based Wireless Access Networks VASKEN GENC, SEAN MURPHY, YANG YU, AND JOHN MURPHY, UNIVERSITY COLLEGE DUBLIN SCHOOL OF COMPUTER SCIENCE.
Broadband Mobile Wireless Network Lab Quality of Service Scheduling for Broadband Wireless Access Systems Vehicular Technology Conference, 2006.
Exploiting Spectral Reuse in Resource Allocation, Scheduling,and Routing for IEEE Mesh Networks Lien-Wu Chen, Yu-Chee Tseng Department of Computer.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
Yuan-Cheng Lai and Yen-Hung Chen Department of Information Management National Taiwan University of Science and Technology AINA 2008 Accept rate: 2008.
Bandwidth Balancing in Multi- Channel IEEE Wireless Mesh networks Claudio Cicconetti, Ian F. Akyildiz School of Electrical and Computer Engineering.
Multicast Recipient Maximization in IEEE j WiMAX Relay Networks Wen-Hsing Kuo † ( 郭文興 ) & Jeng-Farn Lee ‡ ( 李正帆 ) † Department of Electrical Engineering,
HR/AB/VS, IIT-Bombay 1 Feb 8, 2006 An Opportunistic DRR (O-DRR) Uplink Scheduling Scheme for IEEE based Broadband Wireless Networks Hemant Kr Rath,
1 A Cross-Layer Scheduling Algorithm With QoS Support in Wireless Networks Qingwen Liu, Student Member, IEEE, Xin Wang, Member, IEEE, and Georgios B. Giannakis,
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
Algorithms for Routing and Centralized Scheduling in IEEE Mesh Networks Harish Shetiya and Vinod Sharma Department of Electrical Communication Engineering.
Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.
Distributed-Queue Access for Wireless Ad Hoc Networks Authors: V. Baiamonte, C. Casetti, C.-F. Chiasserini Dipartimento di Elettronica, Politecnico di.
On Multihop Communications For In-Vehicle Internet Access Based On a TDMA MAC Protocol Hassan Aboubakr Omar ∗, Weihua Zhuang ∗, and Li Li† ∗ Department.
Downlink Scheduling for Multimedia Multicast/Broadcast over Mobile WiMAX Connection-oriented Multi- state Adaptation Source:IEEE Wireless Communications.
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks Zhao, J.; Cao, G. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 鄭宇辰
Performance Evaluation of Scheduling in IEEE based Wireless Mesh Networks Bo Han, Weijia Jia,and Lidong Lin Computer Communications, 2007 Mei-zhen.
System Architecture for C2C Communications Based on Mobile WiMAX Michiyo ASHIDA VTT Technical Research Centre of Finland
Design and implementation of
Lecture 28 Mobile Ad hoc Network Dr. Ghalib A. Shah
Analysis and Evaluation of a New MAC Protocol
WiMAX: IEEE Wireless MANs
Presented by Jason L.Y. Lin
Dhruv Gupta EEC 273 class project Prof. Chen-Nee Chuah
Presentation transcript:

AN INTEGRATED ROUTING AND DISTRIBUTED SCHEDULING APPROACH FOR HYBRID IEEE E MESH NETWORKS FOR VEHICULAR BROADBAND COMMUNICATIONS Rahul Amin Electrical and Computer Engineering Clemson University M.S Thesis Defense, 11/25/2008 Advisor – Dr. Kuang-Ching Wang

Outline Background and Relevant Work Objective Network Model Routing and Scheduling Solution Analytical Model and Simulation studies Conclusions and Future Work

Background – WiMAX Operation Modes WiMAX – Worldwide Interoperability for Microwave Access – IEEE – IEEE e-2005 (Mobile WiMAX) extends mobility (handover) support Point-to-Multipoint (PMP) – Subscriber Stations (SS) connect via Base Station (BS) – BS in charge of coming up with a transmission schedule – Five Classes of Service defined to support QoS Mesh – SSs and BSs can communicate directly to other SSs and BSs – Scheduling solution can be centralized or distributed – QoS differentiation is on packet-by-packet basis

Background – PMP Mode Frame Structure Each frame divided into uplink and downlink sub-frame Uplink-to-downlink ratio adjusted according to traffic demand Sub-frame further divided into mini-slots to send data bursts

Background – Mesh Mode Frame Structure Each frame divided into control and data sub-frame No uplink or downlink sub-frame distinction Control sub-frame length depends on length of the mesh

Background – WiMAX Handover Support Standard Handover – Defined only for PMP mode in IEEE e-2005 – Each Mobile Station (MS) maintains an up-to-date CINR for target BSs – Either BS or MS can initiate the handover procedure – MS decides the target BS Two optional fast handover methods – Macro-Diversity Handover (Soft Handover) – Fast Base Station Switching (Hard Handover)

Background – Relevant Work WiMAX network architecture – Coverage: IEEE j workgroup (Relay Station Infrastructure) – Link-level performance: [Hartzog 2006] – Last mile Connectivity: [Bennett 2006], [Wongthavarawat 2003] – Mobile Ad Hoc Networks (MANET): [Sherman 2006], [Lebrun 2006] Scheduling schemes – PMP Mode: [Zhe 2007], [Jayaparvathy 2005], [Lera 2007], [Lin 2008] – Mesh Mode Centralized: [Wei 2005], [Chen 2006], [Qing 2006] Distributed: [Cao 2007]

Objective Challenge – WiMAX requires routing and scheduling packets for rapidly changing network topology due to fast moving vehicles Goals: – Develop Network Architecture – Routing and Scheduling solution – Throughput performance analysis

Network Model

Network Model Components Routing – Mobility-Aware Intra-Gateway Routing (MAIGR) – Ad Hoc Routing Protocols and Mobile IP Scheduling – PMP mode: between MS and MBS/MSS – Mesh mode: among MSS and MBS Handover – Scheduling options migrate from current BS to target BS

BS Protocol Architecture Base stations (MBS and MSS) support: – Dual radios (PMP mode, Mesh mode) – Routing: MAIGR MBS also supports: – Routing: IP and Mobile IP Mesh BS Mobile IP Home/foreign agents IP MAIGR PMP LINK + PHY Mesh SS Mesh LINK + PHY PMP LINK + PHY Mesh LINK + PHY MAIGR

MS Protocol Architecture Mobile Station (MS) supports: – Single radio (PMP mode) – Routing: IP – Transport layer protocols – Application specific protocols MS Application IP PMP LINK + PHY Transport (TCP, UDP)

Network Operation I.Base Station Setup 1. All MBSs use existing ad-hoc solutions to reach core network 2. All MSSs find closest path to MBS using MAIGR’s mesh topology discovery phase 3. All BSs (MSS and MBS) come up with initial mesh schedule using centralized mesh scheduler 4. All BSs maintain Mesh Link Capacity for PMP scheduler using the initially derived mesh schedule 5. All BSs use PMP scheduler to communicate with MS II.Mobile Station Setup 6.MS sets up routes to transmit/receive traffic to/from MBS using MAIGR 7.MS uses PMP scheduler to communicate with MSS/MBS III.Operational Phase 8. Depending on PMP traffic load at each BS, Mesh scheduler at each BS adapts its schedule 9. PMP scheduling options for a MS migrate to the target BS during the handover procedure 10. Mobile IP used by MBSs to assign care-of address to MS that switches routing zones

Base Station Route Setup I.Base Station Setup 1. All MBSs use existing ad-hoc solutions to reach core network 2. All MSSs find closest path to MBS using MAIGR’s mesh topology discovery phase 3. All BSs (MSS and MBS) come up with initial mesh schedule using centralized mesh scheduler 4. All BSs maintain Mesh Link Capacity for PMP scheduler using the initially derived mesh schedule 5. All BSs use PMP scheduler to communicate with MS II.Mobile Station Setup 6.MS sets up routes to transmit/receive traffic to/from MBS using MAIGR 7.MS uses PMP scheduler to communicate with MSS/MBS III.Operational Phase 8. Depending on PMP traffic load at each BS, Mesh scheduler at each BS adapts its schedule 9. PMP scheduling options for a MS migrate to the target BS during the handover procedure 10. Mobile IP used by MBSs to assign care-of address to MS that switches routing zones

Base Station Route Setup MSSMBS Zone 1Zone 2 MSSMBSMSS Core Network MSS MSS: Mesh SS MBS: Mesh BS MS: Mobile Station Traditional Ad Hoc Routing Solutions MSH_NCFG: Entry

Base Station Scheduler Setup I.Base Station Setup 1. All MBSs use existing ad-hoc solutions to reach core network 2. All MSSs find closest path to MBS using MAIGR’s mesh topology discovery phase 3. All BSs (MSS and MBS) come up with initial mesh schedule using centralized mesh scheduler 4. All BSs maintain Mesh Link Capacity for PMP scheduler using the initially derived mesh schedule 5. All BSs use PMP scheduler to communicate with MS II.Mobile Station Setup 6.MS sets up routes to transmit/receive traffic to/from MBS using MAIGR 7.MS uses PMP scheduler to communicate with MSS/MBS III.Operational Phase 8. Depending on PMP traffic load at each BS, Mesh scheduler at each BS adapts its schedule 9. PMP scheduling options for a MS migrate to the target BS during the handover procedure 10. Mobile IP used by MBSs to assign care-of address to MS that switches routing zones

Base Station Scheduler Setup Core Network MSSMBSMSS MSH_CSCH: Request MSH_CSCH: Request MSS: Mesh SS MBS: Mesh BS MS: Mobile Station MSH_CSCH: Grant x2x3x 2xx x xx xxx

Centralized Mesh Scheduling Solution Interference-aware solution achieving near-optimal throughput [Wei 2005, VTC] – Procedure: Transmission occurs in order of highest transmission demand Non-interfering links transmit simultaneously – Proposed changes: QoS considered – Constraints: Unidirectional traffic considered MSSMBSMSS x2x3x 2xx   Carrier Sense Range: 1 Tx RxTxRx

Mobile Station Setup I.Base Station Setup 1. All MBSs use existing ad-hoc solutions to reach core network 2. All MSSs find closest path to MBS using MAIGR’s mesh topology discovery phase 3. All BSs (MSS and MBS) come up with initial mesh schedule using centralized mesh scheduler 4. All BSs maintain Mesh Link Capacity for PMP scheduler using the initially derived mesh schedule 5. All BSs use PMP scheduler to communicate with MS II.Mobile Station Setup 6.MS sets up routes to transmit/receive traffic to/from MBS using MAIGR 7.MS uses PMP scheduler to communicate with MSS/MBS III.Operational Phase 8. Depending on PMP traffic load at each BS, Mesh scheduler at each BS adapts its schedule 9. PMP scheduling options for a MS migrate to the target BS during the handover procedure 10. Mobile IP used by MBSs to assign care-of address to MS that switches routing zones

Mobile Station Setup Core Network MSSMBSMSS MSS: Mesh SS MBS: Mesh BS MS: Mobile Station x2x3x 2xx x xx xxx MS DHCP REQ DHCP REP Service Flow: REQ Service Flow: REP

Operational Phase Scheduler Interaction I.Base Station Setup 1. All MBSs use existing ad-hoc solutions to reach core network 2. All MSSs find closest path to MBS using MAIGR’s mesh topology discovery phase 3. All BSs (MSS and MBS) come up with initial mesh schedule using centralized mesh scheduler 4. All BSs maintain Mesh Link Capacity for PMP scheduler using the initially derived mesh schedule 5. All BSs use PMP scheduler to communicate with MS II.Mobile Station Setup 6.MS sets up routes to transmit/receive traffic to/from MBS using MAIGR 7.MS uses PMP scheduler to communicate with MSS/MBS III.Operational Phase 8. Depending on PMP traffic load at each BS, Mesh scheduler at each BS adapts its schedule 9. PMP scheduling options for a MS migrate to the target BS during the handover procedure 10. Mobile IP used by MBSs to assign care-of address to MS that switches routing zones

PMP Mode Scheduler UGS ertPS rtPS nrtPS BE Enough Free Slots Available? New Flow Requests Active Connection Queue Mesh link limitation? Reject Flow Yes No Pending Connection Queue Pending Connection Queue Empty? Yes No Queue Size > Threshold? Yes PMP Scheduler Distributed Adaptation Centralized Scheduling Mesh Scheduler

Mesh Scheduler Distributed Adaptation (General Case) MSS MBSMSS x2x3x 2xx MSS MBSMSS 02x3x 2xx xxxxxx 0xxxx – Up to x slots can be borrowed in general

Mesh Scheduler Distributed Adaptation (Upper Bound) Case I: – Borrowing occurs from MSS away from MBS – 2x slots can be borrowed as an upper bound MSS MBSMSS x2x3x 2xx MSS MBSMSS 03x 2xx xxxxxx 3x00xxx

Mesh Scheduler Distributed Adaptation (Upper Bound) Case II: – Borrowing occurs from MSS closer to MBS – x/2 slots can be borrowed as upper bound MSS MBSMSS x2x3x 2xx MSS MBSMSS 1.5x 3x 2xx xxxxxx 1.5x0x x xx

Operational Phase Handover Scenario I.Base Station Setup 1. All MBSs use existing ad-hoc solutions to reach core network 2. All MSSs find closest path to MBS using MAIGR’s mesh topology discovery phase 3. All BSs (MSS and MBS) come up with initial mesh schedule using centralized mesh scheduler 4. All BSs maintain Mesh Link Capacity for PMP scheduler using the initially derived mesh schedule 5. All BSs use PMP scheduler to communicate with MS II.Mobile Station Setup 6.MS sets up routes to transmit/receive traffic to/from MBS using MAIGR 7.MS uses PMP scheduler to communicate with MSS/MBS III.Operational Phase 8. Depending on PMP traffic load at each BS, Mesh scheduler at each BS adapts its schedule 9. PMP scheduling options for a MS migrate to the target BS during the handover procedure 10. Mobile IP used by MBSs to assign care-of address to MS that switches routing zones

Operation Phase Handover Scenario MSSMBS Zone 1Zone 2 MSSMBSMSS MS MSS Tactical Network Gateway Tactical Network Gateway MSS MSS: Mesh SS MBS: Mesh BS MS: Mobile Station HO_IND Msg Care-of Address Mobile IP Msg

Analytical Model Throughput Comparison a)centralized only mesh scheduling algorithm b)centralized with distributed adaptation algorithm Topology considered – Symmetric Chain Topology – Single Intersection Topology Throughput bounds derived for – Dense Network – Sparse Network

Percentage Increase in Network Throughput per Routing Zone (Dense Network) MBS MSS 1’ MSS 1 MSS 2’ MSS 2 MSS 3 MSS 3’ Link 1Link 2Link 3 Link 1 ’ Link 2 ’ Link 3 ’ x2x3x 2xx Case I: Case II: x – q 3’ ParameterDescription qiqi Number of unused PMP data slots at base station i zTotal number of data slots per Mesh Frame n+n’Total number of MSS in routing zone kBorrowing MSS’s # of hops from MBS x – q 2’ x – q 1’ x – q 2 x – q 1 x – q 3

Percentage Increase in Network Throughput per Routing Zone (Sparse Network) MBS MSS 1’ MSS 1 MSS 2’ MSS 2 MSS 3 MSS 3’ Link 1Link 2Link 3 Link 1 ’ Link 2 ’ Link 3 ’ x2x3x 2xx 0 Case I: Case II: ParameterDescription qiqi Number of unused PMP data slots at base station i xPMP data slots per frame at Lender kBorrowing MSS’s # of hops from MBS x-q 2’ 0000

Simulation Studies Network Simulator ns-2 used – Based on NIST IEEE module (version pre-release2) Supports PMP mode, standard handover Scheduler functionality added Extension made to support: – TDD mesh links between base stations (emulated with wired links) – Dual radios at each base station – Chain topology presented – Carrier sensing range equal to communication range assumed – Analytical Model verified using simulation results

Mesh Mode Simulation Parameters ParameterValue Channel Bandwidth10 MHz Modulation SchemeOFDM_64QAM_3_4 Bits/Symbol856 Symbol/Slot1 Frame Duration10 ms Slots/Frame221 Control Sub-Frame7 * MSH_CTRL_LEN = 49 Data Sub-Frame221 – (7 * MSH_CTRL_LEN) = 172 Pending Queue Threshold0 Communication Range1 Carrier Sensing Range1 Maximum Routing Zone Rate18.91 Mbps (14.72 Mbps for Data)

Simulation Model – Dense Network Internet Sink Tactical Network Gateway MBS MSS 2 MSS 3 MSS 1 MSS 4 MSS 5 MSS MS * 0.64 Mbps UGS Flows per MS (16 Data Slots)

Simulation Results – Dense Network (Stationary) Centralized Scheduling Only Distributed Adaptation Scheduling CentralizedDistributed Throughput (Mbps)8.27 (13 flows)8.95 (14 flows) Pending Flows0/1/3/5/70/0/2/4/6

Simulation Model – Sparse Network Internet Sink Tactical Network Gateway MBS MSS 2 MSS 3 MSS 1 MSS 4 MSS 5 MSS 0 MS * 0.64 Mbps UGS Flow per MS (8 Data Slots)

Simulation Model – Sparse Network Internet Sink Tactical Network Gateway MBS MSS 2 MSS 3 MSS 1 MSS 4 MSS 5 MSS 0 MS * 0.64 Mbps UGS Flow per MS (8 Data Slots)

Simulation Results – Sparse Network (Stationary) Centralized Throughput (Mbps) Distributed Throughput (Mbps) % Increase 5 MSs1.92 (3 flows)3.19 (5 flows)66 10 MSs1.92 (3 flows)6.38 (10 flows)232

Conclusions The network architecture simplifies scheduling re- computation by only involving base-stations as opposed to a complete ad-hoc solution Distributed adaptation does not increase the throughput significantly under dense network conditions (~8.2 %) due to the inability of neighboring BSs to lend slots Distributed adaptation increases throughput significantly under sparse network conditions (~ 232 %)

Future Work Different topologies such as grid topology need to be studied Borrowing from 1-hop neighbor only is not optimal and studies needs to be expanded to determine the performance improvement if borrowing from multi-hop neighbors is allowed

Thank You

Backup - Routing Partitions

Mobility-Aware Intra-Gateway Routing Mesh Topology discovery – Each Mesh BS sends a flooding message at periodic intervals – Each Mesh SS records the next hop towards the closest Mesh BS Packet Forwarding from Mesh BS to MS – At serving BS, the next hop is the connection identifier (CID) of MS’s data connection established during network entry or handover – At non-serving BS, the next hop is a mesh link CID which is obtained in one of two ways When receiving a packet from neighboring BS forwarded by an unknown MS, record the neighboring BS as next hop to the unknown MS When notified of a handover of currently associated MS, record target BS as next hop to MS Packet Forwarding from MS to Mesh BS – At MS, the next hop is always the CID of currently serving BS’s data connection – At subsequent Mesh SS’s, the next hop is the mesh link CID towards the closest Mesh BS obtained during Mesh Topology discovery phase

Scheduling Solution PMP Mode Scheduling – Order determined according to service classes (UGS, ertPS, rtPS, nrtPS, BE) – Same service classes are serviced in FIFO order Mesh Mode Scheduling – Centralized interference-aware solution Transmission occurs in order of highest transmission demand [Wei] – Distributed Adaptation Need-based borrowing

Mesh Mode Scheduler Initial schedule using centralized algorithm – Upon network deployment – Every time BS is added to the mesh – Uses average traffic load information if available, else assumes uniform traffic distribution Distributed adaptation copes with changes in traffic loads – Whenever pending queue length exceeds predefined threshold – Slots borrowed from immediate (1-hop) neighbors – Three-way handshake technique used

Distributed Adaptation

Centralized Algorithm