Presentation is loading. Please wait.

Presentation is loading. Please wait.

Algorithms for Routing and Centralized Scheduling in IEEE 802.16 Mesh Networks Harish Shetiya and Vinod Sharma Department of Electrical Communication Engineering.

Published bySybil Warner Modified over 8 years ago

Similar presentations

Presentation on theme: "Algorithms for Routing and Centralized Scheduling in IEEE 802.16 Mesh Networks Harish Shetiya and Vinod Sharma Department of Electrical Communication Engineering."— Presentation transcript:

1 Algorithms for Routing and Centralized Scheduling in IEEE 802.16 Mesh Networks Harish Shetiya and Vinod Sharma Department of Electrical Communication Engineering Indian Institute of Science WCNC 2006

2 Outline  Introduction  System Model  Routing  Scheduling Algorithm  Simulation  Conclusion

3 Introduction  The IEEE 802.16d specifies a centralized scheduling scheme for mesh networks  The MSSs notify the MBS Data transfer requirements The quality of their links to their neighbors  The MBS uses the topology information along with the requirements of each MSS to decide the routing and the scheduling

4 System Model  MSSs are labeled 1,2,3 …… M need not be directly connected to the MBS  MBS is labeled by 0  Each node has infinite buffer to store the packets

5 Routing 1 M 2 BS a frames consisting of N time slots I 點的資料經過 J 點的 平均速率 P 2,1 P 2,0

6 Scheduling Algorithm  Tree Dynamic Programming Framework Maximum Transmission Scheme Per Slot Maximum Transmission Scheme Maximum Work Scheme Fixed Allocation Scheme Adaptive Fixed Allocation Scheme Order scheme  Downlink Scheduling Algorithm

7 Tree Dynamic Programming Framework_ Tree Structure BS A frame has N slots

8 Tree Dynamic Programming Framework_ Uplink Scheduling denote the maximum data extracted from node i in k slots denote the maximum reward obtained from node i in k slots

9 Tree Dynamic Programming Framework_ Maximum Transmission Scheme Construct a table : (1)First get: (2)then get: A B C rbrb rara rcrc

10 Tree Dynamic Programming Framework_ Example (schedule b, c) BS A A frame has N slots, One slot 1 s B C 6 M 2 M/S 2 M 1 M/S 3 2 k 值 {node} 0 1 2 3 4 5..N {} 0 0 0 0 0 0 0 {B} 0246666 {B,C} 0246788 (1,0)(2,0)(3,0)(3,1)(3,2)

11 Tree Dynamic Programming Framework _ Example (schedule a, b, c) Construct a table : B,c 在 (k-n) 個 slots 所傳的資料 量 min{A 點 queue 中的資料量 +(b,c 傳進的資料量 ), A 能傳送的資料量 } A B C rbrb rara rcrc

12 Tree Dynamic Programming Framework_ Example (schedule a, b, c) A frame has N slots, One slot 1 s k 值 {node} 0 1 2 3 4 5..N {B,C} 0 (0,0) 2 (1,0) 4 (2,0) 6 (3,0) 7 (3,1) 8 (3,2) 8 {A,B C} 0 (0,0) 4 (1,0) 8 (2,0) 10 (2,1) 12 (2,2) 16 (3,2) BS A B C 6 M 2 M/S 2 M 1 M/S 3 2 8M 4M/S

13 Tree Dynamic Programming Framework_ Example (schedule b, c) A frame has N slots, One slot 8 s BS A B C 6 M 2 M/S 8 M 1 M/S k 值 {node} 0 1 2.. N {B, C} 0 (0,0) 8 (0,1) 14 (1,1) 14

14 Tree Dynamic Programming Framework_ Per Slot Maximum Scheme Suboptimal version of Maximum transmission scheme i 點的傳 輸 rate i 點的 queue 資 料量 A3M4M/s B5M2M/s C25M/S

15 Tree Dynamic Programming Framework_ Maximum Work Scheme Total work in the system at the beginning of the jth frame (work is the time to extract entire data from the network ): 1 M 2 BS P 2,1 P 2,0

16 Tree Dynamic Programming Framework_ Maximum Work Scheme b,c 所需 的時間 a 所須的 時間 A B C rbrb rara rcrc 7 M 3 M/S 1M 1M/S 1 3 Slot Full Slot

17 Tree Dynamic Programming Framework_ Fixed Allocation Scheme 其他點經過 I 的 資料量

18 Tree Dynamic Programming Framework_ Adaptive Fixed Allocation Scheme(1) denote the set of good and bad links Ex. First round: is the upper bound of accumulated credit

19 Tree Dynamic Programming Framework_ Adaptive Fixed Allocation Scheme(2) second round: Slots to assign good link

20 Tree Dynamic Programming Framework_ Order Scheme To get the order: The slot is assigned to node :, i has higher rate of data delivery to MBS + E點:E點: ++ = 1

21 Tree Dynamic Programming Framework_ Downlink Scheduling Algorithm  there are M possible destinations in the downlink. Hence we need to track the data as it passes through the network.  Since all the traffic originates at the MBS. Hence, using schemes for the downlink in a manner that is analogous to the uplink.

22 Simulation Mesh network of 10 nodes

23 Simulation_ Physical Layer Parameter

24 Simulation_ Burst Profile

25 Simulation_ comparison of uplink scheduling scheme

26 Simulation_ Comparison between different Fixed Allocation Scheme

27 Simulation_ Comparison between different Maximum Transmission Scheme

28 Simulation_ Comparison of downlink scheduling scheme

29 Conclusion  To develop efficient routing and scheduling algorithm for multihop wireless networks as formed by IEEE 802.16 standard

Download ppt "Algorithms for Routing and Centralized Scheduling in IEEE 802.16 Mesh Networks Harish Shetiya and Vinod Sharma Department of Electrical Communication Engineering."

Similar presentations

A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.

A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks Le Zou, Mi Lu, Zixiang Xiong, Department of Electrical Engineering,

A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks Le Zou, Mi Lu, Zixiang Xiong, Department of Electrical Engineering,
TDMA Scheduling in Wireless Sensor Networks

TDMA Scheduling in Wireless Sensor Networks
An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.

An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.
DYNAMIC POWER ALLOCATION AND ROUTING FOR TIME-VARYING WIRELESS NETWORKS Michael J. Neely, Eytan Modiano and Charles E.Rohrs Presented by Ruogu Li Department.

DYNAMIC POWER ALLOCATION AND ROUTING FOR TIME-VARYING WIRELESS NETWORKS Michael J. Neely, Eytan Modiano and Charles E.Rohrs Presented by Ruogu Li Department.
Ranveer Chandra , Kenneth P. Birman Department of Computer Science

Ranveer Chandra , Kenneth P. Birman Department of Computer Science
Dynamic Routing and Wavelength Assignment Scheme for Protection against Node Failure Ying Wang1, Tee Hiang Cheng1,2 and Biswanath Mukherjee3 1School of.

Dynamic Routing and Wavelength Assignment Scheme for Protection against Node Failure Ying Wang1, Tee Hiang Cheng1,2 and Biswanath Mukherjee3 1School of.
A serve flow management strategy for IEEE 802.16 BWA system in TDD mode Hsin-Hsien Liu 2005 11 15.

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 802.16 Broadband Wireless Access Networks Chi-Hung Chiang

1 Token Bucket Based CAC and Packet Scheduling for IEEE Broadband Wireless Access Networks Chi-Hung Chiang
LCN 2007, Dublin 1 Non-bifurcated Routing in Wireless Multi- hop Mesh Networks by Abdullah-Al Mahmood and Ehab S. Elmallah Department of Computing Science.

LCN 2007, Dublin 1 Non-bifurcated Routing in Wireless Multi- hop Mesh Networks by Abdullah-Al Mahmood and Ehab S. Elmallah Department of Computing Science.
In-Band Flow Establishment for End-to-End QoS in RDRN Saravanan Radhakrishnan.

In-Band Flow Establishment for End-to-End QoS in RDRN Saravanan Radhakrishnan.
A Preferred Link Based Multicast Protocol for Wireless Mobile Ad hoc Networks R. S. Sisodia, Karthigeyan. I, B. S. Manoj, and C. Siva Ram Murthy ICC 2003.

A Preferred Link Based Multicast Protocol for Wireless Mobile Ad hoc Networks R. S. Sisodia, Karthigeyan. I, B. S. Manoj, and C. Siva Ram Murthy ICC 2003.
Delay-aware Routing in Low Duty-Cycle Wireless Sensor Networks Guodong Sun and Bin Xu Computer Science and Technology Department Tsinghua University, Beijing,

Delay-aware Routing in Low Duty-Cycle Wireless Sensor Networks Guodong Sun and Bin Xu Computer Science and Technology Department Tsinghua University, Beijing,
Opportunistic Routing Based Scheme with Multi-layer Relay Sets in Cognitive Radio Networks Ying Dai and Jie Wu Department of Computer and Information Sciences.

Opportunistic Routing Based Scheme with Multi-layer Relay Sets in Cognitive Radio Networks Ying Dai and Jie Wu Department of Computer and Information Sciences.
1 Minimizing End-to-End Delay: A Novel Routing Metric for Multi- Radio Wireless Mesh Networks Hongkun Li, Yu Cheng, Chi Zhou Department of Electrical and.

1 Minimizing End-to-End Delay: A Novel Routing Metric for Multi- Radio Wireless Mesh Networks Hongkun Li, Yu Cheng, Chi Zhou Department of Electrical and.
Analysis of RIP, OSPF, and EIGRP Routing Protocols using OPNET Group 5: Kiavash Mirzahossein Michael Nguyen Sarah Elmasry www.sfu.ca/~mtn9/Group5.html.

Analysis of RIP, OSPF, and EIGRP Routing Protocols using OPNET Group 5: Kiavash Mirzahossein Michael Nguyen Sarah Elmasry
Joint Channel Assignment and Routing in Real Time Wireless Mesh Network Xiaoguang Li †, Changqiao Xu ‡ † College of Software Engineering, Southeast University,

Joint Channel Assignment and Routing in Real Time Wireless Mesh Network Xiaoguang Li †, Changqiao Xu ‡ † College of Software Engineering, Southeast University,
A Distributed Scheduling Algorithm for Real-time (D-SAR) Industrial Wireless Sensor and Actuator Networks By Kiana Karimpour.

A Distributed Scheduling Algorithm for Real-time (D-SAR) Industrial Wireless Sensor and Actuator Networks By Kiana Karimpour.
A Hierarchical Model for Bandwidth Management and Admission Control in Integrated IEEE 802.16&802.11 Wireless Networks Dusit Niyato and Ekram Hossain IEEE.

A Hierarchical Model for Bandwidth Management and Admission Control in Integrated IEEE & Wireless Networks Dusit Niyato and Ekram Hossain IEEE.
Rate-based Data Propagation in Sensor Networks Gurdip Singh and Sandeep Pujar Computing and Information Sciences Sanjoy Das Electrical and Computer Engineering.

Rate-based Data Propagation in Sensor Networks Gurdip Singh and Sandeep Pujar Computing and Information Sciences Sanjoy Das Electrical and Computer Engineering.

Similar presentations

Ads by Google