Presented by Jason L.Y. Lin

Slides:



Advertisements
Similar presentations
Design of a reliable communication system for grid-style traffic light networks Junghoon Lee Dept. of Computer science and statistics Jeju National University.
Advertisements

A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
Detecting MAC Layer Back-off Timer Violations in Mobile Ad Hoc Networks Venkata Nishanth Lolla, Lap Kong Law, Srikanth V. Krishnamurthy, Chinya Ravishankar,
Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.
Z-MAC: a Hybrid MAC for Wireless Sensor Networks Injong Rhee, Ajit Warrier, Mahesh Aia and Jeongki Min Dept. of Computer Science, North Carolina State.
Routing Protocols for Sensor Networks Presented by Siva Desaraju Computer Science WMU An Application Specific Protocol Architecture for Wireless Microsensor.
2005/12/06OPLAB, Dept. of IM, NTU1 Optimizing the ARQ Performance in Downlink Packet Data Systems With Scheduling Haitao Zheng, Member, IEEE Harish Viswanathan,
1 A Novel Topology-blind Fair Medium Access Control for Wireless LAN and Ad Hoc Networks Z. Y. Fang and B. Bensaou Computer Science Department Hong Kong.
Dynamic Tuning of the IEEE Protocol to Achieve a Theoretical Throughput Limit Frederico Calì, Marco Conti, and Enrico Gregori IEEE/ACM TRANSACTIONS.
1 Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
Efficient Hop ID based Routing for Sparse Ad Hoc Networks Yao Zhao 1, Bo Li 2, Qian Zhang 2, Yan Chen 1, Wenwu Zhu 3 1 Lab for Internet & Security Technology,
Performance Analysis of the IEEE Wireless Metropolitan Area Network nmgmt.cs.nchu.edu.tw 系統暨網路管理實驗室 Systems & Network Management Lab Reporter :黃文帥.
Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up For Wireless Sensor Networks Zhihui Chen; Ashfaq Khokhar ECE/CS Dept., University of.
On the Performance Behavior of IEEE Distributed Coordination Function M.K.Sidiropoulos, J.S.Vardakas and M.D.Logothetis Wire Communications Laboratory,
Delay Analysis of IEEE in Single-Hop Networks Marcel M. Carvalho, J.J.Garcia-Luna-Aceves.
1 Dynamic Adaption of DCF and PCF mode of IEEE WLAN Abhishek Goliya Guided By: Prof. Sridhar Iyer Dr. Leena-Chandran Wadia MTech Dissertation.
1 Adaptive QoS Framework for Wireless Sensor Networks Lucy He Honeywell Technology & Solutions Lab No. 430 Guo Li Bin Road, Pudong New Area, Shanghai,
Optimal Power Control, Rate Adaptation and Scheduling for UWB-Based Wireless Networked Control Systems Sinem Coleri Ergen (joint with Yalcin Sadi) Wireless.
A Simple Neighbor Discovery Procedure for Bluetooth Ad Hoc Networks Miklós Aurél Rónai and Eszter Kail GlobeCom 2003 Speaker: Chung-Hsien Hsu Presented.
Improving Capacity and Flexibility of Wireless Mesh Networks by Interface Switching Yunxia Feng, Minglu Li and Min-You Wu Presented by: Yunxia Feng Dept.
A Dedicated Multi-channel MAC Protocol Design for VANET with Adaptive Broadcasting Ning Lu 1, Yusheng Ji 2, Fuqiang Liu 1, and Xinhong Wang 1 1 Dept. of.
November 4, 2003APOC 2003 Wuhan, China 1/14 Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs Presented by Ruibiao Qiu Department of Computer.
Salah A. Aly,Moustafa Youssef, Hager S. Darwish,Mahmoud Zidan Distributed Flooding-based Storage Algorithms for Large-Scale Wireless Sensor Networks Communications,
/ 22 1 A Distributed and Efficient Flooding Scheme Using 1-hop Information in Mobile Ad Hoc Networks Hai Liu Xiaohua Jia Peng-Jun Wan Dept. of Comput.
1 Performance Analysis of the Distributed Coordination Function under Sporadic Traffic joint work with C.-F. Chiasserini (Politecnico di Torino)
Collision-free Time Slot Reuse in Multi-hop Wireless Sensor Networks
TOPOLOGY MANAGEMENT IN COGMESH: A CLUSTER-BASED COGNITIVE RADIO MESH NETWORK Tao Chen; Honggang Zhang; Maggio, G.M.; Chlamtac, I.; Communications, 2007.
A Reservation-based TDMA Protocol Using Directional Antennas (RTDMA-DA) For Wireless Mesh Networks Amitabha Das and Tingliang Zhu, Nanyang Technological.
Channel Access Delay Analysis of IEEE Best Effort Services Hossein Ghaffarian, Mahmood Fathy, Mohsen Soryani Dept. of Computer Engineering Iran.
SEEDEX: A MAC protocol for ad hoc networks R. Rozovsky and P. R. Kumar ACM ACM MobiHoc 2001 speaker: Chien-Wen.
A Multicast Mechanism in WiMax Mesh Network Jianfeng Chen, Wenhua Jiao, Pin Jiang, Qian Guo Asia-Pacific Conference on Communications, (APCC '06)
A Multi-Channel Cooperative MIMO MAC Protocol for Wireless Sensor Networks(MCCMIMO) MASS 2010.
Bandwidth Balancing in Multi- Channel IEEE Wireless Mesh networks Claudio Cicconetti, Ian F. Akyildiz School of Electrical and Computer Engineering.
Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
Localized Low-Power Topology Control Algorithms in IEEE based Sensor Networks Jian Ma *, Min Gao *, Qian Zhang +, L. M. Ni *, and Wenwu Zhu +
A Pseudo Random Coordinated Scheduling Algorithm for Bluetooth Scatternets MobiHoc 2001.
Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
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.
Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.
Fen Hou 、 Lin X. Cai, University of Waterloo Xuemin Shen, Rutgers University Jianwei Huang, Northwestern University IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY,
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
Distributed-Queue Access for Wireless Ad Hoc Networks Authors: V. Baiamonte, C. Casetti, C.-F. Chiasserini Dipartimento di Elettronica, Politecnico di.
A Bit-Map-Assisted Energy- Efficient MAC Scheme for Wireless Sensor Networks Jing Li and Georgios Y. Lazarou Department of Electrical and Computer Engineering,
2005/8/2NTU NSLAB1 Self Organization and Energy Efficient TDMA MAC Protocol by Wake Up for Wireless Sensor Networks Zhihui Chen and Ashfag Khokhar ECE/CS.
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
A Low Interference Channel Assignment Algorithm for Wireless Mesh Networks Can Que 1,2, Xinming Zhang 1, and Shifang Dai 1 1.Department of Computer Science.
Mobile Networks and Applications (January 2007) Presented by J.H. Su ( 蘇至浩 ) 2016/3/21 OPLab, IM, NTU 1 Joint Design of Routing and Medium Access Control.
LA-MAC: A Load Adaptive MAC Protocol for MANETs IEEE Global Telecommunications Conference(GLOBECOM )2009. Presented by Qiang YE Smart Grid Subgroup Meeting.
AN EFFICIENT TDMA SCHEME WITH DYNAMIC SLOT ASSIGNMENT IN CLUSTERED WIRELESS SENSOR NETWORKS Shafiq U. Hashmi, Jahangir H. Sarker, Hussein T. Mouftah and.
Performance Evaluation of Scheduling in IEEE based Wireless Mesh Networks Bo Han, Weijia Jia,and Lidong Lin Computer Communications, 2007 Mei-zhen.
Page 1 End-to-End Bandwidth Reservation in IEEE Mesh Networks Claudio Cicconetti, Vanessa Gardellin, Luciano Lenzini, Enzo Mingozzi IEEE International.
Towards Optimal Sleep Scheduling in Sensor Networks for Rare-Event Detection Qing Cao, Tarek Abdelzaher, Tian He, John Stankovic Department of Computer.
MAC Protocols for Sensor Networks
Lecture 28 Mobile Ad hoc Network Dr. Ghalib A. Shah
SENSYS Presented by Cheolki Lee
Scheduling Mechanism in IEEE e
Analysis and Evaluation of a New MAC Protocol
Dusit Niyato, Student Member, IEEE Ekram Hossain, Senior Member, IEEE
Analysis of IEEE Mesh Mode Scheduler Performance
Speaker: Po-Hung Chen Advisor: Dr. Ho-Ting Wu 2016/10/12
Performance Evaluation of an Integrated-service IEEE Network
Qingwen Liu, Student Member, IEEE Xin Wang, Member, IEEE,
Advisor: Frank Yeong-Sung Lin, Ph.D. Presented by Yu-Jen Hsieh 謝友仁
Dhruv Gupta EEC 273 class project Prof. Chen-Nee Chuah
Subject Name: Adhoc Networks Subject Code: 10CS841
Advisor: Yeong-Sung, Lin, Ph.D. Presented by Yu-Ren, Hsieh
Wireless MAN Neil Tang 10/03/2008
Presentation transcript:

Presented by Jason L.Y. Lin Modelling and Performance Analysis of the Distributed Scheduler in IEEE802.16 Mesh Mode Min Cao, Dept. Electrical & Computer Engineering University of Illinois, Urbana-Champaign Wenchao Ma, Microsoft Research Asia Qian Zhang, Microsoft Research Asia Xiaodong Wang, Dept. Electrical Engineering Columbia University Wenwu Zhu, Intel China Research Center Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing MobiHoc '05 Presented by Jason L.Y. Lin 2018/12/4 OPLab, Dept. of IM, NTU

Outline Introduction Background on IEEE 802.16 Mesh mode Modelling and Performance Analysis Simulation Results Conclusions and Future Work 2018/12/4 OPLab, Dept. of IM, NTU

Introduction (1/3) IEEE 802.16 MAC has two mode - point-to-multipoint (PMP) mode - multipoint-to-multipoint (mesh) mode In the mesh mode - nodes are organized in an ad-hoc fashion - there still be certain nodes that provide the BS function 2018/12/4 OPLab, Dept. of IM, NTU

Introduction (2/3) IEEE 802.16 has two mechanisms to schedule the data transmission in mesh mode - centralized scheduling - distributed scheduling In centralized scheduling - all the control and data packets need to go through the BS - the scheduling procedure is simple - but the connection setup delay is long 2018/12/4 OPLab, Dept. of IM, NTU

Introduction (3/3) In distributed scheduling - every node competes for channel access using a pseudo-random election algorithm based on the scheduling information of the two-hop neighbors - exhibits better flexibility and scalability - but distributed channel access control is more complex 2018/12/4 OPLab, Dept. of IM, NTU

Outline Introduction Background on IEEE 802.16 Mesh mode Modelling and Performance Analysis Simulation Results Conclusions and Future Work 2018/12/4 OPLab, Dept. of IM, NTU

Background on IEEE 802.16 Mesh mode the difference between 802.11 and 802.16 - 802.16 is a slotted system, and all transmissions must be synchronized - 802.16 uses a three-way handshaking to set up connection before data transmission - the control channel and data channel are separated in 802.16 - in 802.16, nodes can reserve multiple slots for the following packets without exchanging control message again 2018/12/4 OPLab, Dept. of IM, NTU

IEEE 802.16 Distributed Scheduling Algorithm (1/6) IEEE 802.16 distributed scheduling behavior - the control message and data packet are allocated in different time slots in a frame - there is no contention in the data time slots - employs a request/grant/confirm three-way handshaking procedure 2018/12/4 OPLab, Dept. of IM, NTU

IEEE 802.16 Distributed Scheduling Algorithm (2/6) 2018/12/4 OPLab, Dept. of IM, NTU

IEEE 802.16 Distributed Scheduling Algorithm (3/6) The Scheduling message, MSH-DSCH, contains the schedule and data subframe allocation information of the neighborhood. - NextXmtMx and XmtHoldoffExponent The transmission time for a station is an aggregate of some sequential transmission opportunities called eligibility interval The eligible interval length for a node is transmission opportunities. 2018/12/4 OPLab, Dept. of IM, NTU

IEEE 802.16 Distributed Scheduling Algorithm (4/6) After one eligibility interval, a station must hold off at least One station sets the first transmission slot after the holdoff time as the temporary next transmission opportunity 2018/12/4 OPLab, Dept. of IM, NTU

IEEE 802.16 Distributed Scheduling Algorithm (5/6) 2018/12/4 OPLab, Dept. of IM, NTU

IEEE 802.16 Distributed Scheduling Algorithm (6/6) Pseudo-random function mixing value : with the current node ID and the slot number as the inputs The channel contention result is correlated with the total node number, exponent value and network topology. Assumes the transmit time sequences of all the nodes in the control subframe form statistically independent renewal processes 2018/12/4 OPLab, Dept. of IM, NTU

Outline Introduction Background on IEEE 802.16 Mesh mode Modelling and Performance Analysis Simulation Results Conclusions and Future Work 2018/12/4 OPLab, Dept. of IM, NTU

Modelling and Performance Analysis Model and approach Two scenario - Collocated scenario * identical holdoff time * nonidentical holdoff exponents - General topology scenario Performance metrics estimation 2018/12/4 OPLab, Dept. of IM, NTU

Model and Approach (1/4) Assumptions (1) the counting process, , of each node eventually reaches its steady state and the intervals are i.i.d., that is, forms a stationary and ergodic renewal process (2) the renewal processes of different nodes are mutually independent at their steady states (3) when all the processes reach their steady states, we can assume that all the processes are initiated at t=-∞ and the time of renewal events of different processes are uncorrelated 2018/12/4 OPLab, Dept. of IM, NTU

Model and Approach (2/4) 2018/12/4 OPLab, Dept. of IM, NTU

Model and Approach (4/4) :the expected number of competing nodes in slot s for the node of interest The probability that this node wins the slot is So the p.m.f. of S is 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Indentical Holdoff Exponent (1/15) In collocated scenario - all nodes are one-hop neighbors of each other Identical Holdoff Exponent - assume equal holdoff exponents - hence when the node are collocated, the transmission interval has the same distribution 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Indentical Holdoff Exponent (2/15) 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Indentical Holdoff Exponent (3/15) LEMMA 1. (Limiting Distribution of Excess Time) Let τ be the renewal interval, the limiting distribution of the excess time is for fixed , where and is an indicator function. By the stationary and ergodic assumption, 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Indentical Holdoff Exponent (4/15) 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Indentical Holdoff Exponent (5/15) Figure 4:T he interval τ between two successive transmissions. 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Indentical Holdoff Exponent (6/15) By the assumption that the renewal process is stationary and that the distributions of are identical, we can simply denote as . 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Indentical Holdoff Exponent (7/15) 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Indentical Holdoff Exponent (8/15) 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Indentical Holdoff Exponent (9/15) 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Indentical Holdoff Exponent (10/15) denote as the number of nodes (among N-1 neighbors) which compete with node k in slot s. Denote as The expected number of nodes competing with node k in slot s is 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Indentical Holdoff Exponent (11/15) The competing nodes in slot s for node k is Substituting (9) into (1) we get 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Indentical Holdoff Exponent (12/15) we make a further approximation that 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Indentical Holdoff Exponent (13/15) 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Indentical Holdoff Exponent (14/15) 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Indentical Holdoff Exponent (15/15) Substitute and into (17) 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Nondentical Holdoff Exponents (1/9) 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Nondentical Holdoff Exponents (2/9) 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Nondentical Holdoff Exponents (3/9) 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Nondentical Holdoff Exponents (4/9) 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Nondentical Holdoff Exponents (5/9) Assume that are geometrical distributed, that is, assume 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Nondentical Holdoff Exponents (6/9) 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Nondentical Holdoff Exponents (7/9) 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Nondentical Holdoff Exponents (8/9) 2018/12/4 OPLab, Dept. of IM, NTU

Collocated Scenario - Nondentical Holdoff Exponents (9/9) 2018/12/4 OPLab, Dept. of IM, NTU

General topology scenario (1/3) 2018/12/4 OPLab, Dept. of IM, NTU

General topology scenario (2/3) 2018/12/4 OPLab, Dept. of IM, NTU

General topology scenario (3/3) 4 1 3 3 2 4 1 2 1 2 3 2018/12/4 OPLab, Dept. of IM, NTU

Performance metrics estimation Let denote the time node A need to accomplish a three-way handshaking with node B. 2018/12/4 OPLab, Dept. of IM, NTU

Performance metrics estimation Assumptions - the renewal process of node A and B have run for a long time - follows a limiting distribution as the excess time when , we can assume that 2018/12/4 OPLab, Dept. of IM, NTU

Performance metrics estimation where α is a compromising factor. is a good choice for the identical holdoff exponent case and for the nonidentical holdoff exponents case 2018/12/4 OPLab, Dept. of IM, NTU

Performance metrics estimation 2018/12/4 OPLab, Dept. of IM, NTU

Outline Introduction Background on IEEE 802.16 Mesh mode Modelling and Performance Analysis Simulation Results Conclusions and Future Work 2018/12/4 OPLab, Dept. of IM, NTU

Simulation Results ns-2 simulator - network controller - scheduling controller - data channel component The set of possible exponent values is {0,1,2,3,4} 2018/12/4 OPLab, Dept. of IM, NTU

Transmission interval Figure 9:Simulation and analytical results on the expected transmission intervals for the identical exponent 2018/12/4 OPLab, Dept. of IM, NTU

Transmission interval Figure 10:Simulation and analytical results on the expected transmission intervals for the nonidentical exponent 2018/12/4 OPLab, Dept. of IM, NTU

Three-way Handshaking Time Figure 11:Simulation and analytical results on the three-way handshaking time for the identical exponent case 2018/12/4 OPLab, Dept. of IM, NTU

Three-way Handshaking Time Figure 12:Simulation and analytical results on the three-way handshaking time for the nonidentical exponent case with N = 10 2018/12/4 OPLab, Dept. of IM, NTU

Three-way Handshaking Time Figure 13:Simulation and analytical results on the three-way handshaking time for the nonidentical exponent case with N = 100 2018/12/4 OPLab, Dept. of IM, NTU

General Topology Scenario Table 1:Simulation and analytical results on the expected transmission intervals for the general topology 2018/12/4 OPLab, Dept. of IM, NTU

Outline Introduction Background on IEEE 802.16 Mesh mode Modelling and Performance Analysis Simulation Results Conclusions and Future Work 2018/12/4 OPLab, Dept. of IM, NTU

Conclusions and Future Work (1/2) The channel contention result is correlated with the total node number, exponent value and network topology. developed methods for estimating the distributions of the node transmission interval and connection setup delay also shed some light on the data subframe reservation scheme 2018/12/4 OPLab, Dept. of IM, NTU

Conclusions and Future Work (2/2) - to propose such a reservation scheme taking into account the tradeoff between system resource utilization and the connection QoS requirements 2018/12/4 OPLab, Dept. of IM, NTU

Thanks for your listening 2018/12/4 OPLab, Dept. of IM, NTU