1 A Throughput Enhancement Handover Algorithm for WiMAX Network Architecture Hao-Ming Chang and Gwo-Jong Yu Graduate School of Mathematical Sciences, Aletheia.

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

Design of a reliable communication system for grid-style traffic light networks Junghoon Lee Dept. of Computer science and statistics Jeju National University.
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
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.
An Energy Efficient Routing Protocol for Cluster-Based Wireless Sensor Networks Using Ant Colony Optimization Ali-Asghar Salehpour, Babak Mirmobin, Ali.
SELECT: Self-Learning Collision Avoidance for Wireless Networks Chun-Cheng Chen, Eunsoo, Seo, Hwangnam Kim, and Haiyun Luo Department of Computer Science,
Madhavi W. SubbaraoWCTG - NIST Dynamic Power-Conscious Routing for Mobile Ad-Hoc Networks Madhavi W. Subbarao Wireless Communications Technology Group.
College of Engineering Optimal Access Point Selection and Channel Assignment in IEEE Networks Sangtae Park Advisor: Dr. Robert Akl Department of.
On the Construction of Energy- Efficient Broadcast Tree with Hitch-hiking in Wireless Networks Source: 2004 International Performance Computing and Communications.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
MAXIMIZING SPECTRUM UTILIZATION OF COGNITIVE RADIO NETWORKS USING CHANNEL ALLOCATION AND POWER CONTROL Anh Tuan Hoang and Ying-Chang Liang Vehicular Technology.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
Modularized Two Step Vertical Handoff Scheme In Integrated WWAN and WLAN Shimin Li Ying Wang.
1 11 Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks Gautam Kulkarni, Sachin Adlakha, Mani Srivastava UCLA IEEE Transactions.
Multicast Scheduling in Cellular Data Networks Katherine Guo, Arun Netravali, Krishan Sabnani Bell-Labs Research Hyungsuk Won, Han Cai, Do Young Eun, Injong.
Inter-Mobility Support in Controlled 6LoWPAN Networks Zinonos, Z. and Vassiliou, V., GLOBECOM Workshops, 2010 IEEE.
Optimal Power Control, Rate Adaptation and Scheduling for UWB-Based Wireless Networked Control Systems Sinem Coleri Ergen (joint with Yalcin Sadi) Wireless.
College of Engineering WiFi and WCDMA Network Design Robert Akl, D.Sc. Department of Computer Science and Engineering Robert Akl, D.Sc. Department of Computer.
David Lynn Presents… HANDOVER IN MOBILE WIMAX NETWORKS: THE STATE OF ART AND RESEARCH ISSUES Sayan Kumar Ray Krzysztof Pawlikowski Harsha Sirisena.
Fen Hou and Pin-Han Ho Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario Wireless Communications and Mobile.
1 EnviroStore: A Cooperative Storage System for Disconnected Operation in Sensor Networks Liqian Luo, Chengdu Huang, Tarek Abdelzaher John Stankovic INFOCOM.
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
November 4, 2003APOC 2003 Wuhan, China 1/14 Demand Based Bandwidth Assignment MAC Protocol for Wireless LANs Presented by Ruibiao Qiu Department of Computer.
Vertical Optimization Of Data Transmission For Mobile Wireless Terminals MICHAEL METHFESSEL, KAI F. DOMBROWSKI, PETER LANGENDORFER, HORST FRANKENFELDT,
A Downlink Data Region Allocation Algorithm for IEEE e OFDMA
Probabilistic Coverage in Wireless Sensor Networks Authors : Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha Presenter : Hyeon, Seung-Il.
QoS-guaranteed Transmission Scheme Selection for OFDMA Multi-hop Cellular Networks Jemin Lee, Sungsoo Park, Hano Wang, and Daesik Hong, ICC 2007.
Full auto rate MAC protocol for wireless ad hoc networks Z. Li, A. Das, A.K. Gupta and S. Nandi School of Computer Engineering Nanyang Technological University.
Efficient Energy Management Protocol for Target Tracking Sensor Networks X. Du, F. Lin Department of Computer Science North Dakota State University Fargo,
Jenhui Chen, Chih-Chieh Wang and Jiann-Der Lee International Conference on Wireless Broadband and Ultra Wideband Communications, 2007 AusWireless, 2007.
1 Validation of an improved location-based handover algorithm using GSM measurement data Hsin-Piao Lin; Rong-Terng Juang; Ding-Bing Lin IEEE Transactions.
X. Li, W. LiuICC May 11, 2003A Joint Layer Design Smart Contention Resolution Random Access Wireless Networks With Unknown Multiple Users: A Joint.
A Multicast Mechanism in WiMax Mesh Network Jianfeng Chen, Wenhua Jiao, Pin Jiang, Qian Guo Asia-Pacific Conference on Communications, (APCC '06)
1 Power Control for CDMA Macro-Micro Cellular System Date: 27 Aug 2000 Advisor: Dr. Wang Speaker: Chih-Wen Chang.
STUMP: Exploiting Position Diversity in the Staggered TDMA Underwater MAC Protocol Kurtis Kredo II, Petar Djukic, Prasant Mohapatra IEEE INFOCOM 2009.
MMAC: A Mobility- Adaptive, Collision-Free MAC Protocol for Wireless Sensor Networks Muneeb Ali, Tashfeen Suleman, and Zartash Afzal Uzmi IEEE Performance,
Hangguan Shan, Member, IEEE, Ho Ting Cheng, Student Member, IEEE, and Weihua Zhuang, Fellow, IEEE Cross-Layer Cooperative MAC Protocol in Distributed Wireless.
Rate-Based Channel Assignment Algorithm for Multi-Channel Multi- Rate Wireless Mesh Networks Sok-Hyong Kim and Young-Joo Suh Department of Computer Science.
Fast and Reliable Route Discovery Protocol Considering Mobility in Multihop Cellular Networks Hyun-Ho Choi and Dong-Ho Cho Wireless Pervasive Computing,
Multiple Frequency Reuse Schemes in the Two-hop IEEE j Wireless Relay Networks with Asymmetrical Topology Weiwei Wang a, Zihua Guo b, Jun Cai c,
Variable Bandwidth Allocation Scheme for Energy Efficient Wireless Sensor Network SeongHwan Cho, Kee-Eung Kim Korea Advanced Institute of Science and Technology.
A Multi-Channel Cooperative MIMO MAC Protocol for Wireless Sensor Networks(MCCMIMO) MASS 2010.
1 A Multi-Rate Routing Protocol with Connection Entropy for MANETs Cao Trong Hieu, Young Cheol Bang, Jin Ho Kim, Young An Kim, and Choong Seon Hong Presenter:
Hard Handoff Scheme Exploiting Uplink and Downlink Signals in IEEE e Systems Sunghyun Cho, Jonghyung Kwun, Chihyun Park, Jung-Hoon Cheon, Ok-Seon.
Multicast Recipient Maximization in IEEE j WiMAX Relay Networks Wen-Hsing Kuo † ( 郭文興 ) & Jeng-Farn Lee ‡ ( 李正帆 ) † Department of Electrical Engineering,
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
On Mitigating the Broadcast Storm Problem with Directional Antennas Sheng-Shih Wang July 14, 2003 Chunyu Hu, Yifei Hong, and Jennifer Hou Dept. of Electrical.
Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.
Wireless Cache Invalidation Schemes with Link Adaptation and Downlink Traffic Presented by Ying Jin.
Scalable Video Multicast with Adaptive Modulation and Coding in Broadband Wireless Data Systems Peilong Li *, Honghai Zhang *, Baohua Zhao +, Sampath Rangarajan.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
Multicast Polling and Efficient VoIP Connections in IEEE Networks Olli Alanen Telecommunication Laboratory Department of Mathematical Information.
Efficient Geographic Routing in Multihop Wireless Networks Seungjoon Lee*, Bobby Bhattacharjee*, and Suman Banerjee** *Department of Computer Science University.
1 Effectiveness of Physical and Virtual Carrier Sensing in IEEE Wireless Ad Hoc Networks Fu-Yi Hung and Ivan Marsic WCNC 2007.
Multi-carrier Handover Method IEEE Presentation Submission Template (Rev. 9) Document Number: IEEE C802.16m-08/1007 Date Submitted: Source:
LA-MAC: A Load Adaptive MAC Protocol for MANETs IEEE Global Telecommunications Conference(GLOBECOM )2009. Presented by Qiang YE Smart Grid Subgroup Meeting.
Ben-Gurion University of the Negev Department of Communication Systems Engineering.
Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.
Supervisors:Dr. Yehuda Ben-Shimol Mr. Itzik Kitroser Alon Tzulang &Tseela Matsry Present:
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
Mingze Zhang, Mun Choon Chan and A. L. Ananda School of Computing
2010 IEEE Global Telecommunications Conference (GLOBECOM 2010)
Wonkwang Shin, Byoung-Yoon Min and Dong Ku Kim
Qingwen Liu, Student Member, IEEE Xin Wang, Member, IEEE,
Maximizing MAC Throughputs by Dynamic RTS-CTS Threshold
Muhammad Niswar Graduate School of Information Science
Presentation transcript:

1 A Throughput Enhancement Handover Algorithm for WiMAX Network Architecture Hao-Ming Chang and Gwo-Jong Yu Graduate School of Mathematical Sciences, Aletheia University

2 Outline Introduction Network Architecture Handover Algorithm in Details Simulation Conclusion

3 Outline Introduction Network Architecture Handover Algorithm in Details Simulation Conclusion

4 Introduction While the technology of wireless network and the development of mobile station (MS) advance significantly User requirements for transmission quality is difficult to satisfy. IEEE is the most common wireless connection Restrictions of transmission ranges and low mobility.

5 Introduction -Cont. To support the mobile application of MS, IEEE e provides a handover process to satisfy the needs of users. BS still faces problems such as the restrictions on the range of MS and transmission quality variations. Due to signal strength variations when MS is moving. A more reliable handover process is required. Maintaining the transmission quality. Avoiding disconnection. Maximize the total throughput.

6 Motivation Most handover algorithms consider signal strength, handover process, or handover delay, and improve efficiency of handover processes to some degree. Little works take all signal strength, handover delay, and base station load balance into consideration. Suggest a handover algorithm Consider all factors in an overall uniform view to choose the best target station. Signal strength Handover time costs Workload of base station

7 Outline Introduction Network Architecture Handover Algorithm in Details Simulation Conclusion

8 ASN-GW1 Internet ASN-GW3 CSN1 CSN2 CSN3 BS2 BS1 BS3 BS4 BS7 BS8 BS9 ASN-GW2 BS5 BS6

9 Outline Introduction Network Architecture Handover Algorithm in Details Simulation Conclusion

10 Handover Algorithm in Details Utilizes the signal strength measured by MS, moving speed of MS and the environment of BS to calculate the remaining service time. Take into account the workload of BS to balance the load in each BS. Signal Strength Compute the remaining service time Handover decision Handover Time Cost In same ASN-GW In different ASN-GW In different CSN The workload of each base station Concluding handover algorithm and process

11 Signal Strength Affecting the Throughput Depending on the signal strength, the handover processes are discussed as follows. To decide the necessity of handover processes The amount of accumulated throughput and the remaining service time. The triggering time Depends on the signal strength received by the MS and the velocity of the MS.

12 Calculation Distance between MS and BS The signal strength P r received by MS can be calculated through Pr and Pt: receiver and transmission power Gt and Gr: antenna gain of the base station and the mobile station D(MS, BS): the Distances between the mobile station and the base station PL(D(MS,BS)): path-loss in D(MS, BS) L: system loss

13 Calculation Distance between MS and BS -Cont. The path-loss model PL(D(MS,BS)) can be calculated as d 0 : the environment variables γ: the path-loss exponent, which varies with the environment around base stations. X σ denotes shadowing effect and Gaussian distribution variable. X f is frequency correction variable, and f is frequency. X H is the mobile equipment’s antenna height.

14 Calculation Distance between MS and BS -Cont. From Eq. (1) and (2), if a MS measure the signal strength from BS, the distance between the MS and BS can be calculated in

15 The remaining service time can be computed by T move : the remaining service time. V: the maximum moving speed. The Remaining Service Time D(MS, BS) Case 1: Case 2:

16 Handover Time Cost Affecting the Throughput In the neighboring BS, the remaining service time should take out the time cost of handover process. Introduce the time cost between MAC layers Different ASN-GWs Different CSNs

17 MAC Layer Handover Time Cost Tcont: the time required for contention based ranging process of the MS. Trng: the average time required for the ranging of the MS. Tsync: the average time required for downlink synchronization of the MS. Tauth and Treg: the average time needed for the re-authorization and re-registration for the MS. T(SBS, MS): the time needed to transmit message between SBS and MS. T(SBS, nBS): the time to transmit message between SBS and nBS. Trendezvous: the time needed for the mobile equipment to wait for the noncompetitive frame time that the neighboring stations distribute specifically for the serving BS.

18 ASN-GWs Handover Time Cost T(BS, ASN-GW): the time required to transmit message between BS and ASN-GW. T(AnchorASN, TargetASN): the time required to transmit message between two ASN-GW.

19 CSNs Handover Time Cost Case 1: If time cost of binding update, is larger, the time cost of handover process will be TBU Case 2: If time cost of binding update, is smaller, the time cost of handover processes will be T pre +T L2 +T FNA TL2 : the time needed for the handover process in MAC layers when executing handover processes. TBU : the time needed for the PAR and home agent/ corresponding node to perform binding update. TFNA : the time needed to execute fast neighbor advertisement. Tpre : the time for mobile equipment to disconnect from the PAR when the mobile equipment is not receiving data transmissions.

20 Workload of BS Affecting Throughput For each BS, the required resources and resources distribution will affect the system throughput. The required information need to calculate is the workload of the base station after handover processes of MS to TBSs. To calculate this information, the allocated symbol and subcarriers within one second can be used as an workload indicator.

21 Usable Symbols of BS The total symbols that can be used for the base stations within one second can be calculate as C : the amount of subcarriers. C H : the amount used by the pilot and guard subcarriers. S : the amount of symbol within one frame. k : the number of symbols in each slot. Every frame has a length of T.

22 Increased Workload When considering how much workload the mobile equipment is providing to the base stations The signal strength and the amount of data transmission is considered. The increased workload which produce on MS to TBSs can be calculate as D : the amount of throughput of the mobile equipment. b : the amount of data transmitted for each symbol.

23 Concluding Handover Algorithm and Process The three factors discussed above are combined to a integrated handover algorithm. The equation used for choosing the TBS will be The handover algorithm will choose the maximize value to be TBS.

24 T rate Calculation T rate is the transmission rate calculated after sensing the signal strength between MS and BS. The transmission rate of MS, which is variation due to the distance between BS and MS, and then find the corresponding value in table.

25 T time Calculation T time is the time which is calculated based on the difference between remaining service time and handover time cost, which can be T hocost : he time cost of handover process.

26 BS expectedvalue Calculation BS expectedvalue is the expected value for handover process on the station. It can be calculated by BS expectdvalue : the is the expected value for handover process on the station. BS workload : the workload of the base station after handover processes with mobile equipment,

27 Outline Introduction Network Architecture Handover Algorithm in Details Simulation Conclusion

28 Simulation Environment

29 Time Parameter

30 Compare with Handover Probability (S) (%) 1

31 Total throughput Increase Rate (S)

32 Outline Introduction Network Architecture Handover Algorithm in Details Simulation Conclusion

33 Conclusion Proposed a higher throughput handover algorithm Considers signal strength, handover time costs, and workload of base station. Experimental results reveal that the proposed handover algorithm is more efficient. When MS is moving into a new network range. The times of handover process and total throughput are both improved, too.

34 Any Question? Thank You.