Handover mechanisms in next generation heterogeneous wireless ...

More documents

Recommendations

Info

PROXY BASED AUTHENTICATION LOCALISATION SCHEME FOR HANDOVER 1 K hp 2 K hp i K hp 11 K pa m K pa 1 - 118 - 12 K pa Khm Figure 6.3 An overview of trust associations for fast authentication The trust association between a FAP and each associated AN is enabled using a pairwise key pa K . The pairwise key K pa is mutually agreed upon by the owner of the FAP and the operator of the AN. By doing do, an AN can confirm that a FAP is legitimate for authenticating a certain group of mobile users. As an independent authority for taking authentication requests, a FAP may be associated with many access networks for fast authentication as shown in Figure 6.3. Meanwhile, an access network can establish trust associations with different FAPs through shared keys at the same time, since the mobile users with different realm portions of Network Access Identifiers (NAI) [64] may require different AAA routing paths. The case of an AN being associated with multiple FAPs has not been shown in Figure 6.3 for the sake of simplicity. The explicit trust association between a mobile user MH and its HAAA can be established through another key K hm. Table 6.1 lists all the related keys for the PBAL trust association model for fast authentication. The three pre-established keys K hp , K pa ,
PROXY BASED AUTHENTICATION LOCALISATION SCHEME FOR HANDOVER K hm are used to build the two types of explicit trust associations required in the handover attachment. Although their updates can be agreed upon by the involved parties, these keys are mostly regarded as “permanent” in contrast to the two derived temporary keys: Local Authentication Key (LAK) and Pairwise Master Key (PMK). The LAK is a session-related key generated by the HAAA. It is employed by the FAP to perform mutual authentication with the MH and establish the necessary security context associated with the AN. The LAK is used to derive the PMK, which is specified in IEEE 802.11i [42] for wireless link protection. Table 6.1 A list of the PBAL trust association model related keys Abbr. Description Temporary key K hp Pairwise key shared between HAAA and FAP N K pa Pairwise key shared between FAP and AN N K hm Pre-Shared Key (PSK) between HAAA and MH N LAK Local authentication key shared among HAAA, FAP and MH Y PMK Pairwise master key shared among FAP, AN and MH Y 6.3.2 Fast Authentication Ticket Generation Method After completing the attachment to a network, the MH can request a Fast Authentication Ticket (FAT) for every nearby access network from its HAAA. The nearby access networks can be either pre-determined using the pre-stored network location information, or determined using the network trust information retrieval scheme presented in Chapter 4. The location based approach requires that a network has accurate location information of its neighbouring networks. Since all the location data have to be pre-loaded, this approach is static and can not cope with changes to networks. With the method proposed in Chapter 4, the serving Access Network (sAN) that has obtained its neighbour network trust pattern can provide the MH’s HAAA with an identifier list of its neighbouring access networks. Note that the determination of the access networks in vicinity is outside the scope of this discussion. It is assumed here that the sAN has the knowledge of its surrounding access - 119 -
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 47 and 48:
Page 49 and 50:
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
Page 57 and 58:
Page 59 and 60:
Page 61 and 62:
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Page 69 and 70:
DYNAMIC NEIGHBOUR TRUST INFORMATION
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
Page 77 and 78:
Page 79 and 80: 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 129: PROXY BASED AUTHENTICATION LOCALISA
Page 147 and 148: MULTI-INTERFACE MOBILE MODEL FOR ME
Page 169 and 170: CONCLUSIONS AND FUTURE RESEARCH WOR
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?