Handover mechanisms in next generation heterogeneous wireless ...

More documents

Recommendations

Info

DYNAMIC NEIGHBOUR TRUST INFORMATION RETRIEVAL FOR GLOBAL ROAMING size of the simulated region was changed from 4 to 18 rings. Figure 4.13 shows the simulation results. Basically, when a region grows in size, less mobile users would be needed on a cell basis. For example, a region consisting of 6 rings needs a minimum of 2.5 mobile users per cell to establish complete network trust pattern. In contrast, when a region includes more than 12 rings of cells, a mobile user per cell would be sufficient. This demonstrates that the overheads of making use of mobile users for building network trust information can be easily controlled when the networks are expanded in scale. Figure 4.13 Size of rings vs. Number of mobile users required per cell [MCRT=30mins] Since the proposed NTC distribution needs additional transmissions of data packets from the HAAA to access networks, its signalling costs are a great concern. In the simulation, the signalling cost of the handover plus the NTC distribution (NTC HO) was compared with that of the standard handover process (Std HO). It is assumed that a standard handover involves the re-authentication procedure as described in [74]. The NTC distribution is performed during every handover. Alternatively, the intelligence can be introduced: the NTC distribution is executed when no valid NTC data is - 76 -
DYNAMIC NEIGHBOUR TRUST INFORMATION RETRIEVAL FOR GLOBAL ROAMING available to avoid repetition. This intelligent method is referred to as the NTC distribution with enhancement (NTC with EN). Figure 4.14 shows that the NTC distribution along with handover generates 15.2% more signalling overhead than the standard handover. However, with an enhancement of checking-before-distributing NTC data, the signalling cost of the NTC distribution can be much reduced. Comparing with the standard handover, the enhanced NTC distribution incurs a 3.7% additional signalling overhead. The low-cost approach of the proposed scheme makes sure that its large scale deployment would not generate excessive signalling flooding networks. Figure 4.14 Cumulative signalling cost vs. time [MCRT=30mins] Another concern in a real deployment is how long the proposed scheme would take to build up a complete network trust pattern, particularly when new access networks are added. For such a purpose, a new parameter called NTC Pattern Construction Time (PCT) is introduced. The NTC PCT is defined as the time taken from retrieving the first NTC data to having the NTC data of every network in the region retrieved and distributed between the networks in the region. The number of mobile users per cell was varied from 2 to 5 in the region of 6 rings, and from 1 to 5 in the region of 10 rings in - 77 -
Page 1 and 2:
Handover Mechanisms in Next Generat
Page 3 and 4:
ACKNOWLEDGMENT First of all, I woul
Page 5 and 6:
TABLE OF CONTENTS 4.4.2 Power Save
Page 7 and 8:
LIST OF FIGURES LIST OF FIGURES Fig
Page 9 and 10:
LIST OF FIGURES Figure 7.2 A generi
Page 11 and 12:
ABSTRACT New access technologies su
Page 13 and 14:
Chapter 1 INTRODUCTION New access t
Page 15 and 16:
INTRODUCTION becomes available. Han
Page 17 and 18:
INTRODUCTION The above multipliciti
Page 19 and 20:
INTRODUCTION network trust pattern
Page 21 and 22:
INTRODUCTION 1.3 Related Publicatio
Page 23 and 24:
INTRODUCTION TECHNICAL REPORTS XIII
Page 25 and 26:
HANDOVER MANAGEMENT horizontally. H
Page 27 and 28:
HANDOVER MANAGEMENT The objective o
Page 29 and 30:
HANDOVER MANAGEMENT air interface,
Page 31 and 32:
HANDOVER MANAGEMENT proposed archit
Page 33 and 34:
HANDOVER MANAGEMENT Access point (A
Page 35 and 36:
HANDOVER MANAGEMENT users. Moreover
Page 37 and 38: HANDOVER MANAGEMENT For IEEE 802.11
Page 39 and 40: HANDOVER MANAGEMENT The two schemes
Page 41 and 42: HANDOVER MANAGEMENT When a MH is mo
Page 43 and 44: 3.1 Introduction Chapter 3 HANDOVER
Page 45 and 46: SECURITY FOR HANDOVER ACROSS HETERO
Page 69 and 70: DYNAMIC NEIGHBOUR TRUST INFORMATION
Page 87: DYNAMIC NEIGHBOUR TRUST INFORMATION
Page 93 and 94: Chapter 5 TRUST ASSISTED HANDOVER A
Page 95 and 96: TRUST ASSISTED HANDOVER ALGORITHM F
Page 123 and 124: Chapter 6 PROXY BASED AUTHENTICATIO
Page 125 and 126: PROXY BASED AUTHENTICATION LOCALISA
Page 139 and 140:
PROXY BASED AUTHENTICATION LOCALISA
Page 141 and 142:
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
MULTI-INTERFACE MOBILE MODEL FOR ME
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
Page 155 and 156:
Page 157 and 158:
Page 159 and 160:
Page 161 and 162:
Page 163 and 164:
Page 165 and 166:
Page 167 and 168:
Page 169 and 170:
CONCLUSIONS AND FUTURE RESEARCH WOR
Page 171 and 172:
Page 173 and 174:
Page 175 and 176:
ABBREVIATIONS 3G 3rd Generation Wir
Page 177 and 178:
ABBREVIATIONS LS Location Server MH
Page 179 and 180:
ABBREVIATIONS THOA Trust Assisted H
Page 181 and 182:
REFERENCES [12] C. Politis, T. Oda,
Page 183 and 184:
REFERENCES [37] Wi-Fi Alliance, "Wi
Page 185 and 186:
REFERENCES presented at IEEE Intern
Page 187 and 188:
REFERENCES [90] R. Verdone and A. Z
Page 189:
REFERENCES [116] K. E. Malki and H.
show all

Handover mechanisms in next generation heterogeneous wireless ...

Create successful ePaper yourself

Delete template?

Save as template?