Optimizing Handovers in Wireless Networks Utilizing Extended MIIS - - PowerPoint PPT Presentation

Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

Muhammad Qasim Khan Department of Telematics NTNU

• 31. August 2012

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

2

Table of contents

Introduction Motivation Objectives Research Methods and Tools Thesis Structure Contribution MAC Layer Handovers IP Layer Handovers Heterogeneous Handovers Mobile Networks Conclusions and Future work

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

2

Table of contents

Introduction Motivation Objectives Research Methods and Tools Thesis Structure Contribution MAC Layer Handovers IP Layer Handovers Heterogeneous Handovers Mobile Networks Conclusions and Future work

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

2

Table of contents

Introduction Motivation Objectives Research Methods and Tools Thesis Structure Contribution MAC Layer Handovers IP Layer Handovers Heterogeneous Handovers Mobile Networks Conclusions and Future work

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

3

Introduction

— Mobility the most prevalent feature

• f modern networks.

— Being reachable on the move anywhere and any time. — Using a variety of services e.g. file download, voice calls, streaming videos, social networking. — Using a variety of network media Wi-Fi, WiMAX, CDMA, 3G, 4G.

Filling station Store Store Office Shopping plaza Airport

Pool

3G

WiMAX

Wi-Fi

3

Introduction

— Mobility the most prevalent feature

• f modern networks.

— Being reachable on the move anywhere and any time. — Using a variety of services e.g. file download, voice calls, streaming videos, social networking. — Using a variety of network media Wi-Fi, WiMAX, CDMA, 3G, 4G.

Filling station Store Store Office Shopping plaza Airport

Pool

3G

WiMAX

Wi-Fi

3

Introduction

— Mobility the most prevalent feature

• f modern networks.

— Being reachable on the move anywhere and any time. — Using a variety of services e.g. file download, voice calls, streaming videos, social networking. — Using a variety of network media Wi-Fi, WiMAX, CDMA, 3G, 4G.

Filling station Store Store Office Shopping plaza Airport

Pool

3G

WiMAX

Wi-Fi

3

Introduction

— Mobility the most prevalent feature

• f modern networks.

— Being reachable on the move anywhere and any time. — Using a variety of services e.g. file download, voice calls, streaming videos, social networking. — Using a variety of network media Wi-Fi, WiMAX, CDMA, 3G, 4G.

Filling station Store Store Office Shopping plaza Airport

Pool

3G

WiMAX

Wi-Fi

4

Introduction

— No mobility support in the Internet by design. — AAA servers, location tracking, network discovery & packet re-routing. — Special mobility management protocols were required. — For this purpose IETF proposed new protocols e.g.

• MIPv4, MIPv6, PMIP

, and NEMO.

— These protocols have the ability to maintain data connections for mobile users during handovers.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

4

Introduction

— No mobility support in the Internet by design. — AAA servers, location tracking, network discovery & packet re-routing. — Special mobility management protocols were required. — For this purpose IETF proposed new protocols e.g.

• MIPv4, MIPv6, PMIP

, and NEMO.

— These protocols have the ability to maintain data connections for mobile users during handovers.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

4

Introduction

— No mobility support in the Internet by design. — AAA servers, location tracking, network discovery & packet re-routing. — Special mobility management protocols were required. — For this purpose IETF proposed new protocols e.g.

• MIPv4, MIPv6, PMIP

, and NEMO.

— These protocols have the ability to maintain data connections for mobile users during handovers.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

4

Introduction

— No mobility support in the Internet by design. — AAA servers, location tracking, network discovery & packet re-routing. — Special mobility management protocols were required. — For this purpose IETF proposed new protocols e.g.

• MIPv4, MIPv6, PMIP

, and NEMO.

— These protocols have the ability to maintain data connections for mobile users during handovers.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

4

Introduction

— No mobility support in the Internet by design. — AAA servers, location tracking, network discovery & packet re-routing. — Special mobility management protocols were required. — For this purpose IETF proposed new protocols e.g.

• MIPv4, MIPv6, PMIP

, and NEMO.

— These protocols have the ability to maintain data connections for mobile users during handovers.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

4

Introduction

— No mobility support in the Internet by design. — AAA servers, location tracking, network discovery & packet re-routing. — Special mobility management protocols were required. — For this purpose IETF proposed new protocols e.g.

• MIPv4, MIPv6, PMIP

, and NEMO.

— These protocols have the ability to maintain data connections for mobile users during handovers.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

5

Motivation: Handover Efficiency

— In mobile networks handovers are inevitable. — MN may not be able to exchange data packets during a handover. — Therefore handover delay is critical in guaranteeing real-time applications their QoS. — ITU has specified that

• Handover delay should not be more than 50 ms to

avoid jitter in VoIP packets (ITU-TG.114).

• For class 0 QoS application jitter should not exceed

50 ms and a packet delay 100 ms (ITU recommendations Y.1541).

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

5

Motivation: Handover Efficiency

— In mobile networks handovers are inevitable. — MN may not be able to exchange data packets during a handover. — Therefore handover delay is critical in guaranteeing real-time applications their QoS. — ITU has specified that

• Handover delay should not be more than 50 ms to

avoid jitter in VoIP packets (ITU-TG.114).

• For class 0 QoS application jitter should not exceed

50 ms and a packet delay 100 ms (ITU recommendations Y.1541).

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

5

Motivation: Handover Efficiency

— In mobile networks handovers are inevitable. — MN may not be able to exchange data packets during a handover. — Therefore handover delay is critical in guaranteeing real-time applications their QoS. — ITU has specified that

• Handover delay should not be more than 50 ms to

avoid jitter in VoIP packets (ITU-TG.114).

• For class 0 QoS application jitter should not exceed

50 ms and a packet delay 100 ms (ITU recommendations Y.1541).

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

5

Motivation: Handover Efficiency

— In mobile networks handovers are inevitable. — MN may not be able to exchange data packets during a handover. — Therefore handover delay is critical in guaranteeing real-time applications their QoS. — ITU has specified that

• Handover delay should not be more than 50 ms to

avoid jitter in VoIP packets (ITU-TG.114).

• For class 0 QoS application jitter should not exceed

50 ms and a packet delay 100 ms (ITU recommendations Y.1541).

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

5

Motivation: Handover Efficiency

— In mobile networks handovers are inevitable. — MN may not be able to exchange data packets during a handover. — Therefore handover delay is critical in guaranteeing real-time applications their QoS. — ITU has specified that

• Handover delay should not be more than 50 ms to

avoid jitter in VoIP packets (ITU-TG.114).

• For class 0 QoS application jitter should not exceed

50 ms and a packet delay 100 ms (ITU recommendations Y.1541).

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

5

Motivation: Handover Efficiency

— In mobile networks handovers are inevitable. — MN may not be able to exchange data packets during a handover. — Therefore handover delay is critical in guaranteeing real-time applications their QoS. — ITU has specified that

• Handover delay should not be more than 50 ms to

avoid jitter in VoIP packets (ITU-TG.114).

• For class 0 QoS application jitter should not exceed

50 ms and a packet delay 100 ms (ITU recommendations Y.1541).

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

6

Two major Objectives

Objective 1/2:

Optimized handover solutions for MN’s. Key research questions addressed in this part are. How the facilities of the MIH framework can be utilized

1

for the mitigation of scanning delays in 802.11 networks during handovers?

2

at the IP layer and above, for seamless handovers and Access Point (AP) selection in homogeneous networks?

3

at the IP layer and above, for seamless handovers and efficient network selection in heterogeneous networks?

Objective 2/2

The analysis of handover signaling of different NEMO Route Optimization (RO) schemes. Question addressed is

4

What is the cost of the important Network Mobility (NEMO) route optimization solutions, in terms of changes required to the functionality of network components and to the architecture of mobile networks? What is the efficiency of these solutions in terms of reduction of the number of tunnels and their signaling complexity during handovers?

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

6

Two major Objectives

Objective 1/2:

Optimized handover solutions for MN’s. Key research questions addressed in this part are. How the facilities of the MIH framework can be utilized

1

for the mitigation of scanning delays in 802.11 networks during handovers?

2

at the IP layer and above, for seamless handovers and Access Point (AP) selection in homogeneous networks?

3

at the IP layer and above, for seamless handovers and efficient network selection in heterogeneous networks?

Objective 2/2

The analysis of handover signaling of different NEMO Route Optimization (RO) schemes. Question addressed is

4

What is the cost of the important Network Mobility (NEMO) route optimization solutions, in terms of changes required to the functionality of network components and to the architecture of mobile networks? What is the efficiency of these solutions in terms of reduction of the number of tunnels and their signaling complexity during handovers?

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

6

Two major Objectives

Objective 1/2:

Optimized handover solutions for MN’s. Key research questions addressed in this part are. How the facilities of the MIH framework can be utilized

1

for the mitigation of scanning delays in 802.11 networks during handovers?

2

at the IP layer and above, for seamless handovers and Access Point (AP) selection in homogeneous networks?

3

at the IP layer and above, for seamless handovers and efficient network selection in heterogeneous networks?

Objective 2/2

The analysis of handover signaling of different NEMO Route Optimization (RO) schemes. Question addressed is

4

What is the cost of the important Network Mobility (NEMO) route optimization solutions, in terms of changes required to the functionality of network components and to the architecture of mobile networks? What is the efficiency of these solutions in terms of reduction of the number of tunnels and their signaling complexity during handovers?

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

6

Two major Objectives

Objective 1/2:

Optimized handover solutions for MN’s. Key research questions addressed in this part are. How the facilities of the MIH framework can be utilized

1

for the mitigation of scanning delays in 802.11 networks during handovers?

2

at the IP layer and above, for seamless handovers and Access Point (AP) selection in homogeneous networks?

3

at the IP layer and above, for seamless handovers and efficient network selection in heterogeneous networks?

Objective 2/2

The analysis of handover signaling of different NEMO Route Optimization (RO) schemes. Question addressed is

4

What is the cost of the important Network Mobility (NEMO) route optimization solutions, in terms of changes required to the functionality of network components and to the architecture of mobile networks? What is the efficiency of these solutions in terms of reduction of the number of tunnels and their signaling complexity during handovers?

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

6

Two major Objectives

Objective 1/2:

Optimized handover solutions for MN’s. Key research questions addressed in this part are. How the facilities of the MIH framework can be utilized

1

for the mitigation of scanning delays in 802.11 networks during handovers?

2

at the IP layer and above, for seamless handovers and Access Point (AP) selection in homogeneous networks?

3

at the IP layer and above, for seamless handovers and efficient network selection in heterogeneous networks?

Objective 2/2

The analysis of handover signaling of different NEMO Route Optimization (RO) schemes. Question addressed is

4

What is the cost of the important Network Mobility (NEMO) route optimization solutions, in terms of changes required to the functionality of network components and to the architecture of mobile networks? What is the efficiency of these solutions in terms of reduction of the number of tunnels and their signaling complexity during handovers?

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

6

Two major Objectives

Objective 1/2:

Optimized handover solutions for MN’s. Key research questions addressed in this part are. How the facilities of the MIH framework can be utilized

1

for the mitigation of scanning delays in 802.11 networks during handovers?

2

at the IP layer and above, for seamless handovers and Access Point (AP) selection in homogeneous networks?

3

at the IP layer and above, for seamless handovers and efficient network selection in heterogeneous networks?

Objective 2/2

The analysis of handover signaling of different NEMO Route Optimization (RO) schemes. Question addressed is

4

What is the cost of the important Network Mobility (NEMO) route optimization solutions, in terms of changes required to the functionality of network components and to the architecture of mobile networks? What is the efficiency of these solutions in terms of reduction of the number of tunnels and their signaling complexity during handovers?

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

7

Research Methods and Tools

— For the first objective, a simulation module from NIST was utilized. — NIST module implements MIH draft version 3 for ns-2. — No support for Media Independent Information Service (MIIS) in NIST. — MIIS support, needed extensions and amendments were made to the NIST module during this research. — For the second objective different proposed NEMO route optimization solutions were studied using analytical modeling.

MAC layer TCP/IP Physical Layer MIHF Changes to the 802.11 MAC layer iimplementation for Intelligent Scanning Extra Functionality added to MN and BS for sending receiving messages to MIIS MIIS functionality added. MN Extended with The ability to query MIIS, share its GPS coordinates and preferences. Extension of MN to make use of intelligent sacn, PoA & network selection algorithms. Handover Target recomendation on MIIS and handover decision logic implementation

• n MN.

Application Layer

Figure 1: Changes to the NIST Module.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

7

Research Methods and Tools

— For the first objective, a simulation module from NIST was utilized. — NIST module implements MIH draft version 3 for ns-2. — No support for Media Independent Information Service (MIIS) in NIST. — MIIS support, needed extensions and amendments were made to the NIST module during this research. — For the second objective different proposed NEMO route optimization solutions were studied using analytical modeling.

MAC layer TCP/IP Physical Layer MIHF Changes to the 802.11 MAC layer iimplementation for Intelligent Scanning Extra Functionality added to MN and BS for sending receiving messages to MIIS MIIS functionality added. MN Extended with The ability to query MIIS, share its GPS coordinates and preferences. Extension of MN to make use of intelligent sacn, PoA & network selection algorithms. Handover Target recomendation on MIIS and handover decision logic implementation

• n MN.

Application Layer

Figure 1: Changes to the NIST Module.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

7

Research Methods and Tools

— For the first objective, a simulation module from NIST was utilized. — NIST module implements MIH draft version 3 for ns-2. — No support for Media Independent Information Service (MIIS) in NIST. — MIIS support, needed extensions and amendments were made to the NIST module during this research. — For the second objective different proposed NEMO route optimization solutions were studied using analytical modeling.

MAC layer TCP/IP Physical Layer MIHF Changes to the 802.11 MAC layer iimplementation for Intelligent Scanning Extra Functionality added to MN and BS for sending receiving messages to MIIS MIIS functionality added. MN Extended with The ability to query MIIS, share its GPS coordinates and preferences. Extension of MN to make use of intelligent sacn, PoA & network selection algorithms. Handover Target recomendation on MIIS and handover decision logic implementation

• n MN.

Application Layer

Figure 1: Changes to the NIST Module.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

7

Research Methods and Tools

— For the first objective, a simulation module from NIST was utilized. — NIST module implements MIH draft version 3 for ns-2. — No support for Media Independent Information Service (MIIS) in NIST. — MIIS support, needed extensions and amendments were made to the NIST module during this research. — For the second objective different proposed NEMO route optimization solutions were studied using analytical modeling.

MAC layer TCP/IP Physical Layer MIHF Changes to the 802.11 MAC layer iimplementation for Intelligent Scanning Extra Functionality added to MN and BS for sending receiving messages to MIIS MIIS functionality added. MN Extended with The ability to query MIIS, share its GPS coordinates and preferences. Extension of MN to make use of intelligent sacn, PoA & network selection algorithms. Handover Target recomendation on MIIS and handover decision logic implementation

• n MN.

Application Layer

Figure 1: Changes to the NIST Module.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

7

Research Methods and Tools

— For the first objective, a simulation module from NIST was utilized. — NIST module implements MIH draft version 3 for ns-2. — No support for Media Independent Information Service (MIIS) in NIST. — MIIS support, needed extensions and amendments were made to the NIST module during this research. — For the second objective different proposed NEMO route optimization solutions were studied using analytical modeling.

MAC layer TCP/IP Physical Layer MIHF Changes to the 802.11 MAC layer iimplementation for Intelligent Scanning Extra Functionality added to MN and BS for sending receiving messages to MIIS MIIS functionality added. MN Extended with The ability to query MIIS, share its GPS coordinates and preferences. Extension of MN to make use of intelligent sacn, PoA & network selection algorithms. Handover Target recomendation on MIIS and handover decision logic implementation

• n MN.

Application Layer

Figure 1: Changes to the NIST Module.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

8

Thesis Structure

Chapter 1 Introduction Papers A, B, C, D, E, F, G Chapter 2 Background Chapter 3 Contributions Appendix A Part I Introduction Part II Selected Papers Part III Appendix

Figure 2: Thesis Structure

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

8

Thesis Structure

Chapter 1 Introduction Papers A, B, C, D, E, F, G Chapter 2 Background Chapter 3 Contributions Appendix A Part I Introduction Part II Selected Papers Part III Appendix

Figure 2: Thesis Structure

Introduction to Thesis

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

8

Thesis Structure

Chapter 1 Introduction Papers A, B, C, D, E, F, G Chapter 2 Background Chapter 3 Contributions Appendix A Part I Introduction Part II Selected Papers Part III Appendix

Figure 2: Thesis Structure

Introduction to Thesis Definitions and Concepts

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

8

Thesis Structure

Chapter 1 Introduction Papers A, B, C, D, E, F, G Chapter 2 Background Chapter 3 Contributions Appendix A Part I Introduction Part II Selected Papers Part III Appendix

Figure 2: Thesis Structure

Introduction to Thesis Definitions and Concepts Paper wise Summary.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

8

Thesis Structure

Chapter 1 Introduction Papers A, B, C, D, E, F, G Chapter 2 Background Chapter 3 Contributions Appendix A Part I Introduction Part II Selected Papers Part III Appendix

Figure 2: Thesis Structure

Introduction to Thesis Definitions and Concepts Paper wise Summary. Full Papers

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

8

Thesis Structure

Chapter 1 Introduction Papers A, B, C, D, E, F, G Chapter 2 Background Chapter 3 Contributions Appendix A Part I Introduction Part II Selected Papers Part III Appendix

Figure 2: Thesis Structure

Introduction to Thesis Definitions and Concepts Paper wise Summary. Full Papers Preliminary version

• f Paper-G (NEMO).

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

9

Table of contents

Introduction Motivation Objectives Research Methods and Tools Thesis Structure Contribution MAC Layer Handovers IP Layer Handovers Heterogeneous Handovers Mobile Networks Conclusions and Future work

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

10

Papers

Authors

Muhammad Qasim Khan & Steinar Hidle Andresen

Table 1: Published Papers Papers Target Decision Problem Handover (HO) HO initiation Single MN or layer layer addressed scope & control mobile N/W A MAC App 802.11 Homog MIHO, MCHO MN scanning , NAHO B MAC App 802.11 Homog MIHO, MCHO MN scanning , NAHO C IP App MIP Homog All MN

• perations

D IP App layer 3 HO Homog MIHO, MCHO, MN delays NAHO E MAC App PoA Homog MIHO, MCHO MN selection , NAHO F All App N/W Heterog MIHO, MCHO MN selection , NAHO G IP IP HO delays, Homog or MIHO, MCHO Mobile routing Heterog & NAHO N/W & signaling

10

Papers

Authors

Muhammad Qasim Khan & Steinar Hidle Andresen

Table 1: Published Papers Papers Target Decision Problem Handover (HO) HO initiation Single MN or layer layer addressed scope & control mobile N/W A MAC App 802.11 Homog MIHO, MCHO MN scanning , NAHO B MAC App 802.11 Homog MIHO, MCHO MN scanning , NAHO C IP App MIP Homog All MN

• perations

D IP App layer 3 HO Homog MIHO, MCHO, MN delays NAHO E MAC App PoA Homog MIHO, MCHO MN selection , NAHO F All App N/W Heterog MIHO, MCHO MN selection , NAHO G IP IP HO delays, Homog or MIHO, MCHO Mobile routing Heterog & NAHO N/W & signaling

10

Papers

Authors

Muhammad Qasim Khan & Steinar Hidle Andresen

Table 1: Published Papers Papers Target Decision Problem Handover (HO) HO initiation Single MN or layer layer addressed scope & control mobile N/W A MAC App 802.11 Homog MIHO, MCHO MN scanning , NAHO B MAC App 802.11 Homog MIHO, MCHO MN scanning , NAHO C IP App MIP Homog All MN

• perations

D IP App layer 3 HO Homog MIHO, MCHO, MN delays NAHO E MAC App PoA Homog MIHO, MCHO MN selection , NAHO F All App N/W Heterog MIHO, MCHO MN selection , NAHO G IP IP HO delays, Homog or MIHO, MCHO Mobile routing Heterog & NAHO N/W & signaling

10

Papers

Authors

Muhammad Qasim Khan & Steinar Hidle Andresen

Table 1: Published Papers Papers Target Decision Problem Handover (HO) HO initiation Single MN or layer layer addressed scope & control mobile N/W A MAC App 802.11 Homog MIHO, MCHO MN scanning , NAHO B MAC App 802.11 Homog MIHO, MCHO MN scanning , NAHO C IP App MIP Homog All MN

• perations

D IP App layer 3 HO Homog MIHO, MCHO, MN delays NAHO E MAC App PoA Homog MIHO, MCHO MN selection , NAHO F All App N/W Heterog MIHO, MCHO MN selection , NAHO G IP IP HO delays, Homog or MIHO, MCHO Mobile routing Heterog & NAHO N/W & signaling

10

Papers

Authors

Muhammad Qasim Khan & Steinar Hidle Andresen

Table 1: Published Papers Papers Target Decision Problem Handover (HO) HO initiation Single MN or layer layer addressed scope & control mobile N/W A MAC App 802.11 Homog MIHO, MCHO MN scanning , NAHO B MAC App 802.11 Homog MIHO, MCHO MN scanning , NAHO C IP App MIP Homog All MN

• perations

D IP App layer 3 HO Homog MIHO, MCHO, MN delays NAHO E MAC App PoA Homog MIHO, MCHO MN selection , NAHO F All App N/W Heterog MIHO, MCHO MN selection , NAHO G IP IP HO delays, Homog or MIHO, MCHO Mobile routing Heterog & NAHO N/W & signaling

11

MAC Layer Handovers in 802.11

Paper A

An Intelligent Scan Mechanism For 802.11 Networks by Using Media Independent Information Server (MIIS)

Theme

Improving handover latency by scanning only active 802.11 channels.

Conference

25th IEEE International Conference on Advanced Information Networking and Applications Workshops (WAINA) March 2011 Biopolis Singapore.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

11

MAC Layer Handovers in 802.11

Paper A

An Intelligent Scan Mechanism For 802.11 Networks by Using Media Independent Information Server (MIIS)

Theme

Improving handover latency by scanning only active 802.11 channels.

Conference

25th IEEE International Conference on Advanced Information Networking and Applications Workshops (WAINA) March 2011 Biopolis Singapore.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

12

Paper-A Summary

— 802.11 networks scanning delays constitutes more than 90% of the overall MAC layer handover delay. — Handover delays can be reduced by scanning only active channels. Requesting channel information form MIIS

Figure 3: MIIS Query

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

12

Paper-A Summary

— 802.11 networks scanning delays constitutes more than 90% of the overall MAC layer handover delay. — Handover delays can be reduced by scanning only active channels. Requesting channel information form MIIS

Figure 3: MIIS Query

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

13

Paper-A Summary

Four scanning strategies are proposed.

1

ScanALL : Like 802.11 standard scanning, scans both empty and active channels.

2

ScanAll-StopFirst: Scans all channels but stops on the first active channel for low handover latency.

3

Intelligent-ScanAll: Scans only active channels received from the MIIS.

4

Intelligent-StopFirst. The MN stops scanning at the first AP detected in the active channel list received from the MIIS.

Simulation

— Area of 300 X 300 m. — Channel number 3, 5, 7, 9. — MN speed 5 m/s.

Figure 4: Simulation Scenario

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

13

Paper-A Summary

Four scanning strategies are proposed.

1

ScanALL : Like 802.11 standard scanning, scans both empty and active channels.

2

ScanAll-StopFirst: Scans all channels but stops on the first active channel for low handover latency.

3

Intelligent-ScanAll: Scans only active channels received from the MIIS.

4

Intelligent-StopFirst. The MN stops scanning at the first AP detected in the active channel list received from the MIIS.

Simulation

— Area of 300 X 300 m. — Channel number 3, 5, 7, 9. — MN speed 5 m/s.

Figure 4: Simulation Scenario

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

13

Paper-A Summary

Four scanning strategies are proposed.

1

ScanALL : Like 802.11 standard scanning, scans both empty and active channels.

2

ScanAll-StopFirst: Scans all channels but stops on the first active channel for low handover latency.

3

Intelligent-ScanAll: Scans only active channels received from the MIIS.

4

Intelligent-StopFirst. The MN stops scanning at the first AP detected in the active channel list received from the MIIS.

Simulation

— Area of 300 X 300 m. — Channel number 3, 5, 7, 9. — MN speed 5 m/s.

Figure 4: Simulation Scenario

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

13

Paper-A Summary

Four scanning strategies are proposed.

1

ScanALL : Like 802.11 standard scanning, scans both empty and active channels.

2

ScanAll-StopFirst: Scans all channels but stops on the first active channel for low handover latency.

3

Intelligent-ScanAll: Scans only active channels received from the MIIS.

4

Intelligent-StopFirst. The MN stops scanning at the first AP detected in the active channel list received from the MIIS.

Simulation

— Area of 300 X 300 m. — Channel number 3, 5, 7, 9. — MN speed 5 m/s.

Figure 4: Simulation Scenario

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

13

Paper-A Summary

Four scanning strategies are proposed.

1

ScanALL : Like 802.11 standard scanning, scans both empty and active channels.

2

ScanAll-StopFirst: Scans all channels but stops on the first active channel for low handover latency.

3

Intelligent-ScanAll: Scans only active channels received from the MIIS.

4

Intelligent-StopFirst. The MN stops scanning at the first AP detected in the active channel list received from the MIIS.

Simulation

— Area of 300 X 300 m. — Channel number 3, 5, 7, 9. — MN speed 5 m/s.

Figure 4: Simulation Scenario

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

13

Paper-A Summary

Four scanning strategies are proposed.

1

ScanALL : Like 802.11 standard scanning, scans both empty and active channels.

2

ScanAll-StopFirst: Scans all channels but stops on the first active channel for low handover latency.

3

Intelligent-ScanAll: Scans only active channels received from the MIIS.

4

Intelligent-StopFirst. The MN stops scanning at the first AP detected in the active channel list received from the MIIS.

Simulation

— Area of 300 X 300 m. — Channel number 3, 5, 7, 9. — MN speed 5 m/s.

Figure 4: Simulation Scenario

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

13

Paper-A Summary

Four scanning strategies are proposed.

1

ScanALL : Like 802.11 standard scanning, scans both empty and active channels.

2

ScanAll-StopFirst: Scans all channels but stops on the first active channel for low handover latency.

3

Intelligent-ScanAll: Scans only active channels received from the MIIS.

4

Intelligent-StopFirst. The MN stops scanning at the first AP detected in the active channel list received from the MIIS.

Simulation

— Area of 300 X 300 m. — Channel number 3, 5, 7, 9. — MN speed 5 m/s.

Figure 4: Simulation Scenario

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

14

Paper-A Summary

Table 2: Mac Layer Handover Delays for different Scanning Strategies

HO Scanning Strategies delays (ms) ScanAll ScanAll Gain Intelligent Gain Intelligent Gain StopFirst ScanAll StopFirst 1 101,66 101,66 101,66 101,66 2 264,04 140,97 121,23 81,267 3 261,47 183,25 122,79 101,81 4 260,88 223,17 122,63 121,81 5 261,09 181,19 121,29 101,53 6 261,61 141,65 123,03 81,59 7 262,81 102,65 122,71 63,09 Avg 261,98 162,15 38% 122,28 53% 91,85 65%

Figure 5: Handover Delays Graph

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

14

Paper-A Summary

Table 2: Mac Layer Handover Delays for different Scanning Strategies

HO Scanning Strategies delays (ms) ScanAll ScanAll Gain Intelligent Gain Intelligent Gain StopFirst ScanAll StopFirst 1 101,66 101,66 101,66 101,66 2 264,04 140,97 121,23 81,267 3 261,47 183,25 122,79 101,81 4 260,88 223,17 122,63 121,81 5 261,09 181,19 121,29 101,53 6 261,61 141,65 123,03 81,59 7 262,81 102,65 122,71 63,09 Avg 261,98 162,15 38% 122,28 53% 91,85 65%

Figure 5: Handover Delays Graph

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

14

Paper-A Summary

Table 2: Mac Layer Handover Delays for different Scanning Strategies

HO Scanning Strategies delays (ms) ScanAll ScanAll Gain Intelligent Gain Intelligent Gain StopFirst ScanAll StopFirst 1 101,66 101,66 101,66 101,66 2 264,04 140,97 121,23 81,267 3 261,47 183,25 122,79 101,81 4 260,88 223,17 122,63 121,81 5 261,09 181,19 121,29 101,53 6 261,61 141,65 123,03 81,59 7 262,81 102,65 122,71 63,09 Avg 261,98 162,15 38% 122,28 53% 91,85 65%

Figure 5: Handover Delays Graph

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

14

Paper-A Summary

Table 2: Mac Layer Handover Delays for different Scanning Strategies

HO Scanning Strategies delays (ms) ScanAll ScanAll Gain Intelligent Gain Intelligent Gain StopFirst ScanAll StopFirst 1 101,66 101,66 101,66 101,66 2 264,04 140,97 121,23 81,267 3 261,47 183,25 122,79 101,81 4 260,88 223,17 122,63 121,81 5 261,09 181,19 121,29 101,53 6 261,61 141,65 123,03 81,59 7 262,81 102,65 122,71 63,09 Avg 261,98 162,15 38% 122,28 53% 91,85 65%

Figure 5: Handover Delays Graph

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

14

Paper-A Summary

Table 2: Mac Layer Handover Delays for different Scanning Strategies

HO Scanning Strategies delays (ms) ScanAll ScanAll Gain Intelligent Gain Intelligent Gain StopFirst ScanAll StopFirst 1 101,66 101,66 101,66 101,66 2 264,04 140,97 121,23 81,267 3 261,47 183,25 122,79 101,81 4 260,88 223,17 122,63 121,81 5 261,09 181,19 121,29 101,53 6 261,61 141,65 123,03 81,59 7 262,81 102,65 122,71 63,09 Avg 261,98 162,15 38% 122,28 53% 91,85 65%

Figure 5: Handover Delays Graph

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

15

MAC Layer Handovers in 802.11

Paper B

Zero Scanning Time for 802.11 Networks by Using Media Independent Information Server (MIIS)

Theme

Improving handover latency in 802.11 by skipping scanning stage or scan one channel.

Conference

26th IEEE International Conference on Advanced Information Networking and Applications (AINA) March 2012 Fukouka Japan.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

15

MAC Layer Handovers in 802.11

Paper B

Zero Scanning Time for 802.11 Networks by Using Media Independent Information Server (MIIS)

Theme

Improving handover latency in 802.11 by skipping scanning stage or scan one channel.

Conference

26th IEEE International Conference on Advanced Information Networking and Applications (AINA) March 2012 Fukouka Japan.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

16

Paper-B Summary

— Paper-A is extended to achieve zero scanning time. — The MIIS is extended to locate the MN on a virtual map by using GPS coordinates of MN’s and BS’s. — The MIIS returns the channel configuration information of the target AP to the MN.

Two intelligent scanning strategies are defined

1

Intelligent-ScanOne. The MN scans only one channel received from the MIIS.

2

Intelligent-ScanNone. No scanning is performed and the MN goes directly into the association phase.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

16

Paper-B Summary

— Paper-A is extended to achieve zero scanning time. — The MIIS is extended to locate the MN on a virtual map by using GPS coordinates of MN’s and BS’s. — The MIIS returns the channel configuration information of the target AP to the MN.

Two intelligent scanning strategies are defined

1

Intelligent-ScanOne. The MN scans only one channel received from the MIIS.

2

Intelligent-ScanNone. No scanning is performed and the MN goes directly into the association phase.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

16

Paper-B Summary

— Paper-A is extended to achieve zero scanning time. — The MIIS is extended to locate the MN on a virtual map by using GPS coordinates of MN’s and BS’s. — The MIIS returns the channel configuration information of the target AP to the MN.

Two intelligent scanning strategies are defined

1

Intelligent-ScanOne. The MN scans only one channel received from the MIIS.

2

Intelligent-ScanNone. No scanning is performed and the MN goes directly into the association phase.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

16

Paper-B Summary

— Paper-A is extended to achieve zero scanning time. — The MIIS is extended to locate the MN on a virtual map by using GPS coordinates of MN’s and BS’s. — The MIIS returns the channel configuration information of the target AP to the MN.

Two intelligent scanning strategies are defined

1

Intelligent-ScanOne. The MN scans only one channel received from the MIIS.

2

Intelligent-ScanNone. No scanning is performed and the MN goes directly into the association phase.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

16

Paper-B Summary

— Paper-A is extended to achieve zero scanning time. — The MIIS is extended to locate the MN on a virtual map by using GPS coordinates of MN’s and BS’s. — The MIIS returns the channel configuration information of the target AP to the MN.

Two intelligent scanning strategies are defined

1

Intelligent-ScanOne. The MN scans only one channel received from the MIIS.

2

Intelligent-ScanNone. No scanning is performed and the MN goes directly into the association phase.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

17

Paper-B Summary

Simulation

— Parameters similar to Paper-A — CBR traffic with intensity 0.01 sec and 1500 bytes packet size.

Figure 6: Simulation Scenario

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

17

Paper-B Summary

Simulation

— Parameters similar to Paper-A — CBR traffic with intensity 0.01 sec and 1500 bytes packet size.

Figure 6: Simulation Scenario

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

18

Paper-B Summary

Table 3: Mac Layer Handover Delays (ms) for different Scanning Strategies

HandOvers Scan-All Intelligent Improvement Intelligent Improvement ScanOne ScanNone 1 101.66 101.66 NA 101.66 NA 2 301.77 21.35 93% 1.6068 99% 3 301.45 21.35 93% 1.3468 99% 4 301.33 21.83 93% 1.6068 99% 6 301.59 21.63 93% 0.8668 99% 7 301.03 21.19 93% 1.7668 99% Average 301.47 21.50 93% 1.46 99%

Figure 7: Handover Delays Graph

18

Paper-B Summary

Table 3: Mac Layer Handover Delays (ms) for different Scanning Strategies

HandOvers Scan-All Intelligent Improvement Intelligent Improvement ScanOne ScanNone 1 101.66 101.66 NA 101.66 NA 2 301.77 21.35 93% 1.6068 99% 3 301.45 21.35 93% 1.3468 99% 4 301.33 21.83 93% 1.6068 99% 6 301.59 21.63 93% 0.8668 99% 7 301.03 21.19 93% 1.7668 99% Average 301.47 21.50 93% 1.46 99%

Figure 7: Handover Delays Graph

18

Paper-B Summary

Table 3: Mac Layer Handover Delays (ms) for different Scanning Strategies

HandOvers Scan-All Intelligent Improvement Intelligent Improvement ScanOne ScanNone 1 101.66 101.66 NA 101.66 NA 2 301.77 21.35 93% 1.6068 99% 3 301.45 21.35 93% 1.3468 99% 4 301.33 21.83 93% 1.6068 99% 6 301.59 21.63 93% 0.8668 99% 7 301.03 21.19 93% 1.7668 99% Average 301.47 21.50 93% 1.46 99%

Figure 7: Handover Delays Graph

18

Paper-B Summary

Table 3: Mac Layer Handover Delays (ms) for different Scanning Strategies

HandOvers Scan-All Intelligent Improvement Intelligent Improvement ScanOne ScanNone 1 101.66 101.66 NA 101.66 NA 2 301.77 21.35 93% 1.6068 99% 3 301.45 21.35 93% 1.3468 99% 4 301.33 21.83 93% 1.6068 99% 6 301.59 21.63 93% 0.8668 99% 7 301.03 21.19 93% 1.7668 99% Average 301.47 21.50 93% 1.46 99%

Figure 7: Handover Delays Graph

19

Paper-B Summary

Packet Loss

Figure 8: Packet Loss

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

20

IP Layer Handovers

Paper C

Application of Media Independent Handover (MIH) for Intra Technology Handover.

Theme

Layer-3 horizontal handover support using MIH.

Conference

Mosharaka International Conference on Communications, Networking and Information Technology Dec 2009 Amman Jordan.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

20

IP Layer Handovers

Paper C

Application of Media Independent Handover (MIH) for Intra Technology Handover.

Theme

Layer-3 horizontal handover support using MIH.

Conference

Mosharaka International Conference on Communications, Networking and Information Technology Dec 2009 Amman Jordan.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

21

Paper-C Summary

— Propose MIH framework for optimizing horizontal handovers. — Time consuming discovery procedures are carried out pro-actively. — Pre-configuration and pre-authentication can be achieved with the MIH framework. — Link_Going_Down and Link_Up along with MIH function ID can be used for movement detection and can replace IP layer network discovery. — MIPv6 can use Link_Going_Down, to redirect packets in parallel with other handover control messages for low handover latency. — Upper layers can use Link_Handover_Complete event to check if the IP configuration of the MN needs to be updated. — MIH commands can be used to reserve resources and carry out security procedures at target network. — PoA specific information stored in MIIS can be used for horizontal proactive handovers. — Information about the surrounding subnets can be obtained from the MIIS to replace time consuming discovery operations. — MIIS primitives might be even more beneficial for Proxy MIP .

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

21

Paper-C Summary

— Propose MIH framework for optimizing horizontal handovers. — Time consuming discovery procedures are carried out pro-actively. — Pre-configuration and pre-authentication can be achieved with the MIH framework. — Link_Going_Down and Link_Up along with MIH function ID can be used for movement detection and can replace IP layer network discovery. — MIPv6 can use Link_Going_Down, to redirect packets in parallel with other handover control messages for low handover latency. — Upper layers can use Link_Handover_Complete event to check if the IP configuration of the MN needs to be updated. — MIH commands can be used to reserve resources and carry out security procedures at target network. — PoA specific information stored in MIIS can be used for horizontal proactive handovers. — Information about the surrounding subnets can be obtained from the MIIS to replace time consuming discovery operations. — MIIS primitives might be even more beneficial for Proxy MIP .

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

21

Paper-C Summary

— Propose MIH framework for optimizing horizontal handovers. — Time consuming discovery procedures are carried out pro-actively. — Pre-configuration and pre-authentication can be achieved with the MIH framework. — Link_Going_Down and Link_Up along with MIH function ID can be used for movement detection and can replace IP layer network discovery. — MIPv6 can use Link_Going_Down, to redirect packets in parallel with other handover control messages for low handover latency. — Upper layers can use Link_Handover_Complete event to check if the IP configuration of the MN needs to be updated. — MIH commands can be used to reserve resources and carry out security procedures at target network. — PoA specific information stored in MIIS can be used for horizontal proactive handovers. — Information about the surrounding subnets can be obtained from the MIIS to replace time consuming discovery operations. — MIIS primitives might be even more beneficial for Proxy MIP .

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

21

Paper-C Summary

— Propose MIH framework for optimizing horizontal handovers. — Time consuming discovery procedures are carried out pro-actively. — Pre-configuration and pre-authentication can be achieved with the MIH framework. — Link_Going_Down and Link_Up along with MIH function ID can be used for movement detection and can replace IP layer network discovery. — MIPv6 can use Link_Going_Down, to redirect packets in parallel with other handover control messages for low handover latency. — Upper layers can use Link_Handover_Complete event to check if the IP configuration of the MN needs to be updated. — MIH commands can be used to reserve resources and carry out security procedures at target network. — PoA specific information stored in MIIS can be used for horizontal proactive handovers. — Information about the surrounding subnets can be obtained from the MIIS to replace time consuming discovery operations. — MIIS primitives might be even more beneficial for Proxy MIP .

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

21

Paper-C Summary

— Propose MIH framework for optimizing horizontal handovers. — Time consuming discovery procedures are carried out pro-actively. — Pre-configuration and pre-authentication can be achieved with the MIH framework. — Link_Going_Down and Link_Up along with MIH function ID can be used for movement detection and can replace IP layer network discovery. — MIPv6 can use Link_Going_Down, to redirect packets in parallel with other handover control messages for low handover latency. — Upper layers can use Link_Handover_Complete event to check if the IP configuration of the MN needs to be updated. — MIH commands can be used to reserve resources and carry out security procedures at target network. — PoA specific information stored in MIIS can be used for horizontal proactive handovers. — Information about the surrounding subnets can be obtained from the MIIS to replace time consuming discovery operations. — MIIS primitives might be even more beneficial for Proxy MIP .

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

21

Paper-C Summary

— Propose MIH framework for optimizing horizontal handovers. — Time consuming discovery procedures are carried out pro-actively. — Pre-configuration and pre-authentication can be achieved with the MIH framework. — Link_Going_Down and Link_Up along with MIH function ID can be used for movement detection and can replace IP layer network discovery. — MIPv6 can use Link_Going_Down, to redirect packets in parallel with other handover control messages for low handover latency. — Upper layers can use Link_Handover_Complete event to check if the IP configuration of the MN needs to be updated. — MIH commands can be used to reserve resources and carry out security procedures at target network. — PoA specific information stored in MIIS can be used for horizontal proactive handovers. — Information about the surrounding subnets can be obtained from the MIIS to replace time consuming discovery operations. — MIIS primitives might be even more beneficial for Proxy MIP .

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

21

Paper-C Summary

— Propose MIH framework for optimizing horizontal handovers. — Time consuming discovery procedures are carried out pro-actively. — Pre-configuration and pre-authentication can be achieved with the MIH framework. — Link_Going_Down and Link_Up along with MIH function ID can be used for movement detection and can replace IP layer network discovery. — MIPv6 can use Link_Going_Down, to redirect packets in parallel with other handover control messages for low handover latency. — Upper layers can use Link_Handover_Complete event to check if the IP configuration of the MN needs to be updated. — MIH commands can be used to reserve resources and carry out security procedures at target network. — PoA specific information stored in MIIS can be used for horizontal proactive handovers. — Information about the surrounding subnets can be obtained from the MIIS to replace time consuming discovery operations. — MIIS primitives might be even more beneficial for Proxy MIP .

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

21

Paper-C Summary

— Propose MIH framework for optimizing horizontal handovers. — Time consuming discovery procedures are carried out pro-actively. — Pre-configuration and pre-authentication can be achieved with the MIH framework. — Link_Going_Down and Link_Up along with MIH function ID can be used for movement detection and can replace IP layer network discovery. — MIPv6 can use Link_Going_Down, to redirect packets in parallel with other handover control messages for low handover latency. — Upper layers can use Link_Handover_Complete event to check if the IP configuration of the MN needs to be updated. — MIH commands can be used to reserve resources and carry out security procedures at target network. — PoA specific information stored in MIIS can be used for horizontal proactive handovers. — Information about the surrounding subnets can be obtained from the MIIS to replace time consuming discovery operations. — MIIS primitives might be even more beneficial for Proxy MIP .

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

21

Paper-C Summary

— Propose MIH framework for optimizing horizontal handovers. — Time consuming discovery procedures are carried out pro-actively. — Pre-configuration and pre-authentication can be achieved with the MIH framework. — Link_Going_Down and Link_Up along with MIH function ID can be used for movement detection and can replace IP layer network discovery. — MIPv6 can use Link_Going_Down, to redirect packets in parallel with other handover control messages for low handover latency. — Upper layers can use Link_Handover_Complete event to check if the IP configuration of the MN needs to be updated. — MIH commands can be used to reserve resources and carry out security procedures at target network. — PoA specific information stored in MIIS can be used for horizontal proactive handovers. — Information about the surrounding subnets can be obtained from the MIIS to replace time consuming discovery operations. — MIIS primitives might be even more beneficial for Proxy MIP .

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

21

Paper-C Summary

— Propose MIH framework for optimizing horizontal handovers. — Time consuming discovery procedures are carried out pro-actively. — Pre-configuration and pre-authentication can be achieved with the MIH framework. — Link_Going_Down and Link_Up along with MIH function ID can be used for movement detection and can replace IP layer network discovery. — MIPv6 can use Link_Going_Down, to redirect packets in parallel with other handover control messages for low handover latency. — Upper layers can use Link_Handover_Complete event to check if the IP configuration of the MN needs to be updated. — MIH commands can be used to reserve resources and carry out security procedures at target network. — PoA specific information stored in MIIS can be used for horizontal proactive handovers. — Information about the surrounding subnets can be obtained from the MIIS to replace time consuming discovery operations. — MIIS primitives might be even more beneficial for Proxy MIP .

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

22

IP Layer Handovers

Paper D

The Implications of Zero Scanning Time on MIPv6 Handover Delays by Using Media Independent Information Server (MIIS)

Theme

IP layer handovers using intelligent scanning of paper B.

Conference

17th Asia-Pacific Conference on Communications (APCC) Kota Kinabalu October 2011 Malaysia.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

22

IP Layer Handovers

Paper D

The Implications of Zero Scanning Time on MIPv6 Handover Delays by Using Media Independent Information Server (MIIS)

Theme

IP layer handovers using intelligent scanning of paper B.

Conference

17th Asia-Pacific Conference on Communications (APCC) Kota Kinabalu October 2011 Malaysia.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

23

Paper-D Summary

— MIPv6 handover delays are analyzed using UDP and TCP traffic in terms of

1

Handover delay

2

Packet loss

3

Throughput

— Performance evaluation is carried out at the IP layer. — No Duplicate Address Detection (DAD) is performed. — Two important observation.

1

More variance in MIPv6 handover delays due to remote interaction with the CN.

2

Different handover delays with TCP and UDP

— Simulation scenario and parameters similar to Paper-B. — Each handover delay observation is an average of four values.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

23

Paper-D Summary

— MIPv6 handover delays are analyzed using UDP and TCP traffic in terms of

1

Handover delay

2

Packet loss

3

Throughput

— Performance evaluation is carried out at the IP layer. — No Duplicate Address Detection (DAD) is performed. — Two important observation.

1

More variance in MIPv6 handover delays due to remote interaction with the CN.

2

Different handover delays with TCP and UDP

— Simulation scenario and parameters similar to Paper-B. — Each handover delay observation is an average of four values.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

23

Paper-D Summary

— MIPv6 handover delays are analyzed using UDP and TCP traffic in terms of

1

Handover delay

2

Packet loss

3

Throughput

— Performance evaluation is carried out at the IP layer. — No Duplicate Address Detection (DAD) is performed. — Two important observation.

1

More variance in MIPv6 handover delays due to remote interaction with the CN.

2

Different handover delays with TCP and UDP

— Simulation scenario and parameters similar to Paper-B. — Each handover delay observation is an average of four values.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

23

Paper-D Summary

— MIPv6 handover delays are analyzed using UDP and TCP traffic in terms of

1

Handover delay

2

Packet loss

3

Throughput

— Performance evaluation is carried out at the IP layer. — No Duplicate Address Detection (DAD) is performed. — Two important observation.

1

More variance in MIPv6 handover delays due to remote interaction with the CN.

2

Different handover delays with TCP and UDP

— Simulation scenario and parameters similar to Paper-B. — Each handover delay observation is an average of four values.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

23

Paper-D Summary

— MIPv6 handover delays are analyzed using UDP and TCP traffic in terms of

1

Handover delay

2

Packet loss

3

Throughput

— Performance evaluation is carried out at the IP layer. — No Duplicate Address Detection (DAD) is performed. — Two important observation.

1

More variance in MIPv6 handover delays due to remote interaction with the CN.

2

Different handover delays with TCP and UDP

— Simulation scenario and parameters similar to Paper-B. — Each handover delay observation is an average of four values.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

23

Paper-D Summary

— MIPv6 handover delays are analyzed using UDP and TCP traffic in terms of

1

Handover delay

2

Packet loss

3

Throughput

— Performance evaluation is carried out at the IP layer. — No Duplicate Address Detection (DAD) is performed. — Two important observation.

1

More variance in MIPv6 handover delays due to remote interaction with the CN.

2

Different handover delays with TCP and UDP

— Simulation scenario and parameters similar to Paper-B. — Each handover delay observation is an average of four values.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

23

Paper-D Summary

— MIPv6 handover delays are analyzed using UDP and TCP traffic in terms of

1

Handover delay

2

Packet loss

3

Throughput

— Performance evaluation is carried out at the IP layer. — No Duplicate Address Detection (DAD) is performed. — Two important observation.

1

More variance in MIPv6 handover delays due to remote interaction with the CN.

2

Different handover delays with TCP and UDP

— Simulation scenario and parameters similar to Paper-B. — Each handover delay observation is an average of four values.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

23

Paper-D Summary

— MIPv6 handover delays are analyzed using UDP and TCP traffic in terms of

1

Handover delay

2

Packet loss

3

Throughput

— Performance evaluation is carried out at the IP layer. — No Duplicate Address Detection (DAD) is performed. — Two important observation.

1

More variance in MIPv6 handover delays due to remote interaction with the CN.

2

Different handover delays with TCP and UDP

— Simulation scenario and parameters similar to Paper-B. — Each handover delay observation is an average of four values.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

23

Paper-D Summary

— MIPv6 handover delays are analyzed using UDP and TCP traffic in terms of

1

Handover delay

2

Packet loss

3

Throughput

— Performance evaluation is carried out at the IP layer. — No Duplicate Address Detection (DAD) is performed. — Two important observation.

1

More variance in MIPv6 handover delays due to remote interaction with the CN.

2

Different handover delays with TCP and UDP

— Simulation scenario and parameters similar to Paper-B. — Each handover delay observation is an average of four values.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

23

Paper-D Summary

— MIPv6 handover delays are analyzed using UDP and TCP traffic in terms of

1

Handover delay

2

Packet loss

3

Throughput

— Performance evaluation is carried out at the IP layer. — No Duplicate Address Detection (DAD) is performed. — Two important observation.

1

More variance in MIPv6 handover delays due to remote interaction with the CN.

2

Different handover delays with TCP and UDP

— Simulation scenario and parameters similar to Paper-B. — Each handover delay observation is an average of four values.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

23

Paper-D Summary

— MIPv6 handover delays are analyzed using UDP and TCP traffic in terms of

1

Handover delay

2

Packet loss

3

Throughput

— Performance evaluation is carried out at the IP layer. — No Duplicate Address Detection (DAD) is performed. — Two important observation.

1

More variance in MIPv6 handover delays due to remote interaction with the CN.

2

Different handover delays with TCP and UDP

— Simulation scenario and parameters similar to Paper-B. — Each handover delay observation is an average of four values.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

24

Paper-D Summary

Table 4: Layer Three Handover Delays (ms) for different Scanning Strategies

Handovers Scan-All Intel-ScanOne Intel-ScanNone L2 L3 Total L2 L3 Total Gain L2 L3 Total Gain 1 102.02 12.21 114,23 102.02 12.21 114,23 NA 102.02 12.21 114,23 NA 2 261.36 37.62 298,98 21.27 15.62 36,89 88% 1.77 40.54 42,31 86% 3 261.31 29.91 291,30 21.41 52.10 73,51 75% 1.63 26.30 27,93 90% 4 261.20 29.60 290,80 21.40 15.20 36,6 87% 1.66 35.77 37,43 87% 5 261.40 43.96 305,36 21.50 39.50 61 80% 1.70 34.40 36,10 88% 6 261.40 34.02 295,42 21.47 48.88 70,30 76% 1.50 21.98 23,48 92% 7 261.52 39.85 301,37 21.35 12.84 34,19 89% 1.59 31.75 33,34 89% Average 297,2 52,08 82% 33,43 89%

Figure 9: Handover Delays

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

24

Paper-D Summary

Table 4: Layer Three Handover Delays (ms) for different Scanning Strategies

Handovers Scan-All Intel-ScanOne Intel-ScanNone L2 L3 Total L2 L3 Total Gain L2 L3 Total Gain 1 102.02 12.21 114,23 102.02 12.21 114,23 NA 102.02 12.21 114,23 NA 2 261.36 37.62 298,98 21.27 15.62 36,89 88% 1.77 40.54 42,31 86% 3 261.31 29.91 291,30 21.41 52.10 73,51 75% 1.63 26.30 27,93 90% 4 261.20 29.60 290,80 21.40 15.20 36,6 87% 1.66 35.77 37,43 87% 5 261.40 43.96 305,36 21.50 39.50 61 80% 1.70 34.40 36,10 88% 6 261.40 34.02 295,42 21.47 48.88 70,30 76% 1.50 21.98 23,48 92% 7 261.52 39.85 301,37 21.35 12.84 34,19 89% 1.59 31.75 33,34 89% Average 297,2 52,08 82% 33,43 89%

Figure 9: Handover Delays

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

24

Paper-D Summary

Table 4: Layer Three Handover Delays (ms) for different Scanning Strategies

Handovers Scan-All Intel-ScanOne Intel-ScanNone L2 L3 Total L2 L3 Total Gain L2 L3 Total Gain 1 102.02 12.21 114,23 102.02 12.21 114,23 NA 102.02 12.21 114,23 NA 2 261.36 37.62 298,98 21.27 15.62 36,89 88% 1.77 40.54 42,31 86% 3 261.31 29.91 291,30 21.41 52.10 73,51 75% 1.63 26.30 27,93 90% 4 261.20 29.60 290,80 21.40 15.20 36,6 87% 1.66 35.77 37,43 87% 5 261.40 43.96 305,36 21.50 39.50 61 80% 1.70 34.40 36,10 88% 6 261.40 34.02 295,42 21.47 48.88 70,30 76% 1.50 21.98 23,48 92% 7 261.52 39.85 301,37 21.35 12.84 34,19 89% 1.59 31.75 33,34 89% Average 297,2 52,08 82% 33,43 89%

Figure 9: Handover Delays

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

24

Paper-D Summary

Table 4: Layer Three Handover Delays (ms) for different Scanning Strategies

Handovers Scan-All Intel-ScanOne Intel-ScanNone L2 L3 Total L2 L3 Total Gain L2 L3 Total Gain 1 102.02 12.21 114,23 102.02 12.21 114,23 NA 102.02 12.21 114,23 NA 2 261.36 37.62 298,98 21.27 15.62 36,89 88% 1.77 40.54 42,31 86% 3 261.31 29.91 291,30 21.41 52.10 73,51 75% 1.63 26.30 27,93 90% 4 261.20 29.60 290,80 21.40 15.20 36,6 87% 1.66 35.77 37,43 87% 5 261.40 43.96 305,36 21.50 39.50 61 80% 1.70 34.40 36,10 88% 6 261.40 34.02 295,42 21.47 48.88 70,30 76% 1.50 21.98 23,48 92% 7 261.52 39.85 301,37 21.35 12.84 34,19 89% 1.59 31.75 33,34 89% Average 297,2 52,08 82% 33,43 89%

Figure 9: Handover Delays

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

25

Paper-D Summary

Packet Loss

Figure 10: UDP Packet Loss

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

26

Paper-D Summary

TCP Throughput

Figure 11: TCP Throughput (kbps).

TCP window Vs Time.

Figure 12: TCP window Vs Time.

27

IP Layer Handovers

Paper E

PoA selection in 802.11 Networks using Media Independent Information Server (MIIS).

Theme

Consider more parameters than just RSS for efficient 802.11 PoA selection.

Conference

25th IEEE International Conference on Advanced Information Networking and Applications Workshops (WAINA) March 2012 Fukuoka Japan.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

27

IP Layer Handovers

Paper E

PoA selection in 802.11 Networks using Media Independent Information Server (MIIS).

Theme

Consider more parameters than just RSS for efficient 802.11 PoA selection.

Conference

25th IEEE International Conference on Advanced Information Networking and Applications Workshops (WAINA) March 2012 Fukuoka Japan.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

28

Paper-E Summary

— Proposal to consider four parameters for 802.11 PoA selection and security ranking of 802.11 AP’s. — Distance & fitness function computation. Dj =

• (Xj − Xi)2 + (Yj − Yi)2

Fj = 1 4

k=1 Wk

• W1

B.Aj B.Tj − W2 Dj Rj + W3 Sj Sm − W4 Cj Cm

• MN

S-PoA MIIS

Virtual MAP lookup and calculate Dj &

Fj

MIH_Get_Information_Req MIH_Get_Information_Res

Update parameters Update parameters

Store at MIIS

Target N/W POA-2 max FJ

C-PoA-1 C-PoA-2

Update parameters

MIH_Link_Going_Down.indication or MIH_Link_Detected

Handover Execution to PoA-2

Table 5: Security Protocols Ranking Protocol Security Level WPA2 AES-CCMP only 4 (Sm) WPA2 AES-CCMP + TKIP 3 WPA TKIP 2 WEP 1 OPEN

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

28

Paper-E Summary

— Proposal to consider four parameters for 802.11 PoA selection and security ranking of 802.11 AP’s. — Distance & fitness function computation. Dj =

• (Xj − Xi)2 + (Yj − Yi)2

Distance Fj = 1 4

k=1 Wk

• W1

B.Aj B.Tj − W2 Dj Rj + W3 Sj Sm − W4 Cj Cm

• MN

S-PoA MIIS

Virtual MAP lookup and calculate Dj &

Fj

MIH_Get_Information_Req MIH_Get_Information_Res

Update parameters Update parameters

Store at MIIS

Target N/W POA-2 max FJ

C-PoA-1 C-PoA-2

Update parameters

MIH_Link_Going_Down.indication or MIH_Link_Detected

Handover Execution to PoA-2

Table 5: Security Protocols Ranking Protocol Security Level WPA2 AES-CCMP only 4 (Sm) WPA2 AES-CCMP + TKIP 3 WPA TKIP 2 WEP 1 OPEN

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

28

Paper-E Summary

— Proposal to consider four parameters for 802.11 PoA selection and security ranking of 802.11 AP’s. — Distance & fitness function computation. Dj =

• (Xj − Xi)2 + (Yj − Yi)2

BS Coordinates Fj = 1 4

k=1 Wk

• W1

B.Aj B.Tj − W2 Dj Rj + W3 Sj Sm − W4 Cj Cm

• MN

S-PoA MIIS

Virtual MAP lookup and calculate Dj &

Fj

MIH_Get_Information_Req MIH_Get_Information_Res

Update parameters Update parameters

Store at MIIS

Target N/W POA-2 max FJ

C-PoA-1 C-PoA-2

Update parameters

MIH_Link_Going_Down.indication or MIH_Link_Detected

Handover Execution to PoA-2

Table 5: Security Protocols Ranking Protocol Security Level WPA2 AES-CCMP only 4 (Sm) WPA2 AES-CCMP + TKIP 3 WPA TKIP 2 WEP 1 OPEN

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

28

Paper-E Summary

— Proposal to consider four parameters for 802.11 PoA selection and security ranking of 802.11 AP’s. — Distance & fitness function computation. Dj =

• (Xj − Xi)2 + (Yj − Yi)2

MN Coordinates Fj = 1 4

k=1 Wk

• W1

B.Aj B.Tj − W2 Dj Rj + W3 Sj Sm − W4 Cj Cm

• MN

S-PoA MIIS

Virtual MAP lookup and calculate Dj &

Fj

MIH_Get_Information_Req MIH_Get_Information_Res

Update parameters Update parameters

Store at MIIS

Target N/W POA-2 max FJ

C-PoA-1 C-PoA-2

Update parameters

MIH_Link_Going_Down.indication or MIH_Link_Detected

Handover Execution to PoA-2

Table 5: Security Protocols Ranking Protocol Security Level WPA2 AES-CCMP only 4 (Sm) WPA2 AES-CCMP + TKIP 3 WPA TKIP 2 WEP 1 OPEN

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

28

Paper-E Summary

— Proposal to consider four parameters for 802.11 PoA selection and security ranking of 802.11 AP’s. — Distance & fitness function computation. Dj =

• (Xj − Xi)2 + (Yj − Yi)2

Fj = 1 4

k=1 Wk

• W1

B.Aj B.Tj − W2 Dj Rj + W3 Sj Sm − W4 Cj Cm

• Fitness Rank

MN S-PoA MIIS

Virtual MAP lookup and calculate Dj &

Fj

MIH_Get_Information_Req MIH_Get_Information_Res

Update parameters Update parameters

Store at MIIS

Target N/W POA-2 max FJ

C-PoA-1 C-PoA-2

Update parameters

MIH_Link_Going_Down.indication or MIH_Link_Detected

Handover Execution to PoA-2

Table 5: Security Protocols Ranking Protocol Security Level WPA2 AES-CCMP only 4 (Sm) WPA2 AES-CCMP + TKIP 3 WPA TKIP 2 WEP 1 OPEN

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

28

Paper-E Summary

— Proposal to consider four parameters for 802.11 PoA selection and security ranking of 802.11 AP’s. — Distance & fitness function computation. Dj =

• (Xj − Xi)2 + (Yj − Yi)2

Fj = 1 4

k=1 Wk

• W1

B.Aj B.Tj − W2 Dj Rj + W3 Sj Sm − W4 Cj Cm

• AvailableBW/TotalBW

MN S-PoA MIIS

Virtual MAP lookup and calculate Dj &

Fj

MIH_Get_Information_Req MIH_Get_Information_Res

Update parameters Update parameters

Store at MIIS

Target N/W POA-2 max FJ

C-PoA-1 C-PoA-2

Update parameters

MIH_Link_Going_Down.indication or MIH_Link_Detected

Handover Execution to PoA-2

Table 5: Security Protocols Ranking Protocol Security Level WPA2 AES-CCMP only 4 (Sm) WPA2 AES-CCMP + TKIP 3 WPA TKIP 2 WEP 1 OPEN

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

28

Paper-E Summary

— Proposal to consider four parameters for 802.11 PoA selection and security ranking of 802.11 AP’s. — Distance & fitness function computation. Dj =

• (Xj − Xi)2 + (Yj − Yi)2

Fj = 1 4

k=1 Wk

• W1

B.Aj B.Tj − W2 Dj Rj + W3 Sj Sm − W4 Cj Cm

• Distance/RadioCoverage

MN S-PoA MIIS

Virtual MAP lookup and calculate Dj &

Fj

MIH_Get_Information_Req MIH_Get_Information_Res

Update parameters Update parameters

Store at MIIS

Target N/W POA-2 max FJ

C-PoA-1 C-PoA-2

Update parameters

MIH_Link_Going_Down.indication or MIH_Link_Detected

Handover Execution to PoA-2

Table 5: Security Protocols Ranking Protocol Security Level WPA2 AES-CCMP only 4 (Sm) WPA2 AES-CCMP + TKIP 3 WPA TKIP 2 WEP 1 OPEN

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

28

Paper-E Summary

— Proposal to consider four parameters for 802.11 PoA selection and security ranking of 802.11 AP’s. — Distance & fitness function computation. Dj =

• (Xj − Xi)2 + (Yj − Yi)2

Fj = 1 4

k=1 Wk

• W1

B.Aj B.Tj − W2 Dj Rj + W3 Sj Sm − W4 Cj Cm

• SecurityLevel/MaxSecurity

MN S-PoA MIIS

Virtual MAP lookup and calculate Dj &

Fj

MIH_Get_Information_Req MIH_Get_Information_Res

Update parameters Update parameters

Store at MIIS

Target N/W POA-2 max FJ

C-PoA-1 C-PoA-2

Update parameters

MIH_Link_Going_Down.indication or MIH_Link_Detected

Handover Execution to PoA-2

Table 5: Security Protocols Ranking Protocol Security Level WPA2 AES-CCMP only 4 (Sm) WPA2 AES-CCMP + TKIP 3 WPA TKIP 2 WEP 1 OPEN

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

28

Paper-E Summary

— Proposal to consider four parameters for 802.11 PoA selection and security ranking of 802.11 AP’s. — Distance & fitness function computation. Dj =

• (Xj − Xi)2 + (Yj − Yi)2

Fj = 1 4

k=1 Wk

• W1

B.Aj B.Tj − W2 Dj Rj + W3 Sj Sm − W4 Cj Cm

• Cost/MaxCost

MN S-PoA MIIS

Virtual MAP lookup and calculate Dj &

Fj

MIH_Get_Information_Req MIH_Get_Information_Res

Update parameters Update parameters

Store at MIIS

Target N/W POA-2 max FJ

C-PoA-1 C-PoA-2

Update parameters

MIH_Link_Going_Down.indication or MIH_Link_Detected

Handover Execution to PoA-2

Table 5: Security Protocols Ranking Protocol Security Level WPA2 AES-CCMP only 4 (Sm) WPA2 AES-CCMP + TKIP 3 WPA TKIP 2 WEP 1 OPEN

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

28

Paper-E Summary

— Proposal to consider four parameters for 802.11 PoA selection and security ranking of 802.11 AP’s. — Distance & fitness function computation. Dj =

• (Xj − Xi)2 + (Yj − Yi)2

Fj = 1 4

k=1 Wk

• W1

B.Aj B.Tj − W2 Dj Rj + W3 Sj Sm − W4 Cj Cm

• Parameter Weights (AHP scale 1-9)

MN S-PoA MIIS

Virtual MAP lookup and calculate Dj &

Fj

MIH_Get_Information_Req MIH_Get_Information_Res

Update parameters Update parameters

Store at MIIS

Target N/W POA-2 max FJ

C-PoA-1 C-PoA-2

Update parameters

MIH_Link_Going_Down.indication or MIH_Link_Detected

Handover Execution to PoA-2

Table 5: Security Protocols Ranking Protocol Security Level WPA2 AES-CCMP only 4 (Sm) WPA2 AES-CCMP + TKIP 3 WPA TKIP 2 WEP 1 OPEN

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

28

Paper-E Summary

— Proposal to consider four parameters for 802.11 PoA selection and security ranking of 802.11 AP’s. — Distance & fitness function computation. Dj =

• (Xj − Xi)2 + (Yj − Yi)2

Fj = 1 4

k=1 Wk

• W1

B.Aj B.Tj − W2 Dj Rj + W3 Sj Sm − W4 Cj Cm

• MN

S-PoA MIIS

Virtual MAP lookup and calculate Dj &

Fj

MIH_Get_Information_Req MIH_Get_Information_Res

Update parameters Update parameters

Store at MIIS

Target N/W POA-2 max FJ

C-PoA-1 C-PoA-2

Update parameters

MIH_Link_Going_Down.indication or MIH_Link_Detected

Handover Execution to PoA-2

Table 5: Security Protocols Ranking Protocol Security Level WPA2 AES-CCMP only 4 (Sm) WPA2 AES-CCMP + TKIP 3 WPA TKIP 2 WEP 1 OPEN

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

29

Paper-E Summary

Simulation

— Area 300 X 300 m. — MN speed 5 m/s. — Background traffic UDP with rate 300 kbps. — MN traffic type TCP &UDP with packet size 1500 bytes.

Figure 14: Simulation Scenario

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

29

Paper-E Summary

Simulation

— Area 300 X 300 m. — MN speed 5 m/s. — Background traffic UDP with rate 300 kbps. — MN traffic type TCP &UDP with packet size 1500 bytes.

Figure 14: Simulation Scenario

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

29

Paper-E Summary

Simulation

— Area 300 X 300 m. — MN speed 5 m/s. — Background traffic UDP with rate 300 kbps. — MN traffic type TCP &UDP with packet size 1500 bytes.

Figure 14: Simulation Scenario

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

29

Paper-E Summary

Simulation

— Area 300 X 300 m. — MN speed 5 m/s. — Background traffic UDP with rate 300 kbps. — MN traffic type TCP &UDP with packet size 1500 bytes.

Figure 14: Simulation Scenario

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

30

Paper-E Summary

TCP Throughput

Figure 15: TCP Throughput

TCP Window

Figure 16: TCP Window

— Performance gain depends upon the difference in traffic intensities across C-PoA’s.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

31

Heterogeneous Handovers

Paper F

A Semi and Fully Distributed Handover Algorithm for Heterogeneous Networks using MIIS.

Theme

Efficiency and accuracy of heterogeneous handover algorithms with different distribution levels.

Conference

17th IEEE Symposium on Computers and Communication (ISCC) July 2012 Cappadocia Turkey.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

31

Heterogeneous Handovers

Paper F

A Semi and Fully Distributed Handover Algorithm for Heterogeneous Networks using MIIS.

Theme

Efficiency and accuracy of heterogeneous handover algorithms with different distribution levels.

Conference

17th IEEE Symposium on Computers and Communication (ISCC) July 2012 Cappadocia Turkey.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

32

Paper-F Summary

1

Each BS calculate its own QoS rank based on the following equations. QoSik = Wbk B.Ai B.Ti + Wjk Ji + Wdk Di + Wlk Li Wbk + Wjk + Wdk + Wlk = 1

2

Final rank of a BS considering specific user needs is calculated as follows. Fik = WQoS ∗ QoSik + Wc Ci WQoS + Wc = 1

Table 6: Considered Service Types and their Weights Service Type (k) Wb Wj Wd Wl UGS 0.20 0.35 0.35 0.10 rtPS 0.30 0.30 0.30 0.10 nrtPS 0.70 0.10 0.10 0.10 BE 0.70 0.10 0.10 0.10 Table 7: Considered SLA Types and their Weights

SLA Type WQoS Wc Description SLA QoS 0.90 0.10 QoS most important, price least. SLA Budget 0.70 0.30 A compromise between price and QoS. SLA LowCost 0.10 0.90 QoS least important, price most

32

Paper-F Summary

1

Each BS calculate its own QoS rank based on the following equations. QoSik = Wbk B.Ai B.Ti + Wjk Ji + Wdk Di + Wlk Li QoS Rank Wbk + Wjk + Wdk + Wlk = 1

2

Final rank of a BS considering specific user needs is calculated as follows. Fik = WQoS ∗ QoSik + Wc Ci WQoS + Wc = 1

Table 6: Considered Service Types and their Weights Service Type (k) Wb Wj Wd Wl UGS 0.20 0.35 0.35 0.10 rtPS 0.30 0.30 0.30 0.10 nrtPS 0.70 0.10 0.10 0.10 BE 0.70 0.10 0.10 0.10 Table 7: Considered SLA Types and their Weights

SLA Type WQoS Wc Description SLA QoS 0.90 0.10 QoS most important, price least. SLA Budget 0.70 0.30 A compromise between price and QoS. SLA LowCost 0.10 0.90 QoS least important, price most

32

Paper-F Summary

1

Each BS calculate its own QoS rank based on the following equations. QoSik = Wbk B.Ai B.Ti + Wjk Ji + Wdk Di + Wlk Li Bandwidth Wbk + Wjk + Wdk + Wlk = 1

2

Final rank of a BS considering specific user needs is calculated as follows. Fik = WQoS ∗ QoSik + Wc Ci WQoS + Wc = 1

Table 6: Considered Service Types and their Weights Service Type (k) Wb Wj Wd Wl UGS 0.20 0.35 0.35 0.10 rtPS 0.30 0.30 0.30 0.10 nrtPS 0.70 0.10 0.10 0.10 BE 0.70 0.10 0.10 0.10 Table 7: Considered SLA Types and their Weights

SLA Type WQoS Wc Description SLA QoS 0.90 0.10 QoS most important, price least. SLA Budget 0.70 0.30 A compromise between price and QoS. SLA LowCost 0.10 0.90 QoS least important, price most

32

Paper-F Summary

1

Each BS calculate its own QoS rank based on the following equations. QoSik = Wbk B.Ai B.Ti + Wjk Ji + Wdk Di + Wlk Li Jitter Wbk + Wjk + Wdk + Wlk = 1

2

Final rank of a BS considering specific user needs is calculated as follows. Fik = WQoS ∗ QoSik + Wc Ci WQoS + Wc = 1

Table 6: Considered Service Types and their Weights Service Type (k) Wb Wj Wd Wl UGS 0.20 0.35 0.35 0.10 rtPS 0.30 0.30 0.30 0.10 nrtPS 0.70 0.10 0.10 0.10 BE 0.70 0.10 0.10 0.10 Table 7: Considered SLA Types and their Weights

SLA Type WQoS Wc Description SLA QoS 0.90 0.10 QoS most important, price least. SLA Budget 0.70 0.30 A compromise between price and QoS. SLA LowCost 0.10 0.90 QoS least important, price most

32

Paper-F Summary

1

Each BS calculate its own QoS rank based on the following equations. QoSik = Wbk B.Ai B.Ti + Wjk Ji + Wdk Di + Wlk Li Delay Wbk + Wjk + Wdk + Wlk = 1

2

Final rank of a BS considering specific user needs is calculated as follows. Fik = WQoS ∗ QoSik + Wc Ci WQoS + Wc = 1

Table 6: Considered Service Types and their Weights Service Type (k) Wb Wj Wd Wl UGS 0.20 0.35 0.35 0.10 rtPS 0.30 0.30 0.30 0.10 nrtPS 0.70 0.10 0.10 0.10 BE 0.70 0.10 0.10 0.10 Table 7: Considered SLA Types and their Weights

SLA Type WQoS Wc Description SLA QoS 0.90 0.10 QoS most important, price least. SLA Budget 0.70 0.30 A compromise between price and QoS. SLA LowCost 0.10 0.90 QoS least important, price most

32

Paper-F Summary

1

Each BS calculate its own QoS rank based on the following equations. QoSik = Wbk B.Ai B.Ti + Wjk Ji + Wdk Di + Wlk Li Packet Loss Wbk + Wjk + Wdk + Wlk = 1

2

Final rank of a BS considering specific user needs is calculated as follows. Fik = WQoS ∗ QoSik + Wc Ci WQoS + Wc = 1

Table 6: Considered Service Types and their Weights Service Type (k) Wb Wj Wd Wl UGS 0.20 0.35 0.35 0.10 rtPS 0.30 0.30 0.30 0.10 nrtPS 0.70 0.10 0.10 0.10 BE 0.70 0.10 0.10 0.10 Table 7: Considered SLA Types and their Weights

SLA Type WQoS Wc Description SLA QoS 0.90 0.10 QoS most important, price least. SLA Budget 0.70 0.30 A compromise between price and QoS. SLA LowCost 0.10 0.90 QoS least important, price most

32

Paper-F Summary

1

Each BS calculate its own QoS rank based on the following equations. QoSik = Wbk B.Ai B.Ti + Wjk Ji + Wdk Di + Wlk Li Wbk + Wjk + Wdk + Wlk = 1 Weights

2

Final rank of a BS considering specific user needs is calculated as follows. Fik = WQoS ∗ QoSik + Wc Ci WQoS + Wc = 1

Table 6: Considered Service Types and their Weights Service Type (k) Wb Wj Wd Wl UGS 0.20 0.35 0.35 0.10 rtPS 0.30 0.30 0.30 0.10 nrtPS 0.70 0.10 0.10 0.10 BE 0.70 0.10 0.10 0.10 Table 7: Considered SLA Types and their Weights

SLA Type WQoS Wc Description SLA QoS 0.90 0.10 QoS most important, price least. SLA Budget 0.70 0.30 A compromise between price and QoS. SLA LowCost 0.10 0.90 QoS least important, price most

32

Paper-F Summary

1

Each BS calculate its own QoS rank based on the following equations. QoSik = Wbk B.Ai B.Ti + Wjk Ji + Wdk Di + Wlk Li Wbk + Wjk + Wdk + Wlk = 1

2

Final rank of a BS considering specific user needs is calculated as follows. Fik = WQoS ∗ QoSik + Wc Ci Final Rank WQoS + Wc = 1

Table 6: Considered Service Types and their Weights Service Type (k) Wb Wj Wd Wl UGS 0.20 0.35 0.35 0.10 rtPS 0.30 0.30 0.30 0.10 nrtPS 0.70 0.10 0.10 0.10 BE 0.70 0.10 0.10 0.10 Table 7: Considered SLA Types and their Weights

SLA Type WQoS Wc Description SLA QoS 0.90 0.10 QoS most important, price least. SLA Budget 0.70 0.30 A compromise between price and QoS. SLA LowCost 0.10 0.90 QoS least important, price most

32

Paper-F Summary

1

Each BS calculate its own QoS rank based on the following equations. QoSik = Wbk B.Ai B.Ti + Wjk Ji + Wdk Di + Wlk Li Wbk + Wjk + Wdk + Wlk = 1

2

Final rank of a BS considering specific user needs is calculated as follows. Fik = WQoS ∗ QoSik + Wc Ci QoS Rank WQoS + Wc = 1

Table 6: Considered Service Types and their Weights Service Type (k) Wb Wj Wd Wl UGS 0.20 0.35 0.35 0.10 rtPS 0.30 0.30 0.30 0.10 nrtPS 0.70 0.10 0.10 0.10 BE 0.70 0.10 0.10 0.10 Table 7: Considered SLA Types and their Weights

SLA Type WQoS Wc Description SLA QoS 0.90 0.10 QoS most important, price least. SLA Budget 0.70 0.30 A compromise between price and QoS. SLA LowCost 0.10 0.90 QoS least important, price most

32

Paper-F Summary

1

Each BS calculate its own QoS rank based on the following equations. QoSik = Wbk B.Ai B.Ti + Wjk Ji + Wdk Di + Wlk Li Wbk + Wjk + Wdk + Wlk = 1

2

Final rank of a BS considering specific user needs is calculated as follows. Fik = WQoS ∗ QoSik + Wc Ci Cost WQoS + Wc = 1

Table 6: Considered Service Types and their Weights Service Type (k) Wb Wj Wd Wl UGS 0.20 0.35 0.35 0.10 rtPS 0.30 0.30 0.30 0.10 nrtPS 0.70 0.10 0.10 0.10 BE 0.70 0.10 0.10 0.10 Table 7: Considered SLA Types and their Weights

SLA Type WQoS Wc Description SLA QoS 0.90 0.10 QoS most important, price least. SLA Budget 0.70 0.30 A compromise between price and QoS. SLA LowCost 0.10 0.90 QoS least important, price most

32

Paper-F Summary

1

Each BS calculate its own QoS rank based on the following equations. QoSik = Wbk B.Ai B.Ti + Wjk Ji + Wdk Di + Wlk Li Wbk + Wjk + Wdk + Wlk = 1

2

Final rank of a BS considering specific user needs is calculated as follows. Fik = WQoS ∗ QoSik + Wc Ci WQoS + Wc = 1 Weights

Table 6: Considered Service Types and their Weights Service Type (k) Wb Wj Wd Wl UGS 0.20 0.35 0.35 0.10 rtPS 0.30 0.30 0.30 0.10 nrtPS 0.70 0.10 0.10 0.10 BE 0.70 0.10 0.10 0.10 Table 7: Considered SLA Types and their Weights

SLA Type WQoS Wc Description SLA QoS 0.90 0.10 QoS most important, price least. SLA Budget 0.70 0.30 A compromise between price and QoS. SLA LowCost 0.10 0.90 QoS least important, price most

33

Paper-F Summary

MN S-PoA MIIS

Setp2: Virtual MAP lookup and calculate Fik

MIH_Get_Information_Req MIH_Get_Information_Res MIH_N2N_HO_Commit_Req MIH_MN_HO_Commit_Req MIH_MN_HO_Commit_Res MIH_N2N_HO_Commit_Res Layer-2 and Layer 3 Connection Establishment

Setp1: QoS1k Setp1: QoS2k

Store at MIIS

Target N/W POA-2

C-PoA-1 C-PoA-2

Setp1: QoS1k

MIH_Link_Going_Down.indication or MIH_Link_Detected

Figure 17: Semi Distributed

MN S-PoA MIIS

Candidate List Generation C-POA-1 C-POA-2

MIH_Get_Information_Req MIH_Get_Information_Res

Setp1: QoS1k Setp1: QoS2k

Store Locally

Candidate list

C-PoA-1 C-PoA-2

Setp1: QoS1k

MIH_Link_Going_Down.indication or MIH_Link_Detected

Store Locally Store Locally

MIH_MN_Candid_Query_Req

Setp2:Fik

MIH_N2N_HO_Query_Resources req MIH_N2N_HO_Query_Resources res MIH_N2N_HO_Query_Resources req MIH_N2N_HO_Query_Resources res MIH_MN_Candid_Query_Res

Select max rank BS. C-POA-2

MIH_N2N_HO_Commit_Req MIH_MN_HO_Commit_Req MIH_MN_HO_Commit_Res MIH_N2N_HO_Commit_Res Layer-2 and Layer 3 Connection Establishment

Setp2:Fik

Figure 18: Fully Distributed

33

Paper-F Summary

MN S-PoA MIIS

Setp2: Virtual MAP lookup and calculate Fik

MIH_Get_Information_Req MIH_Get_Information_Res MIH_N2N_HO_Commit_Req MIH_MN_HO_Commit_Req MIH_MN_HO_Commit_Res MIH_N2N_HO_Commit_Res Layer-2 and Layer 3 Connection Establishment

Setp1: QoS1k Setp1: QoS2k

Store at MIIS

Target N/W POA-2

C-PoA-1 C-PoA-2

Setp1: QoS1k

MIH_Link_Going_Down.indication or MIH_Link_Detected

Figure 17: Semi Distributed

MN S-PoA MIIS

Candidate List Generation C-POA-1 C-POA-2

MIH_Get_Information_Req MIH_Get_Information_Res

Setp1: QoS1k Setp1: QoS2k

Store Locally

Candidate list

C-PoA-1 C-PoA-2

Setp1: QoS1k

MIH_Link_Going_Down.indication or MIH_Link_Detected

Store Locally Store Locally

MIH_MN_Candid_Query_Req

Setp2:Fik

MIH_N2N_HO_Query_Resources req MIH_N2N_HO_Query_Resources res MIH_N2N_HO_Query_Resources req MIH_N2N_HO_Query_Resources res MIH_MN_Candid_Query_Res

Select max rank BS. C-POA-2

MIH_N2N_HO_Commit_Req MIH_MN_HO_Commit_Req MIH_MN_HO_Commit_Res MIH_N2N_HO_Commit_Res Layer-2 and Layer 3 Connection Establishment

Setp2:Fik

Figure 18: Fully Distributed

QoS Ranks

33

Paper-F Summary

MN S-PoA MIIS

Setp2: Virtual MAP lookup and calculate Fik

MIH_Get_Information_Req MIH_Get_Information_Res MIH_N2N_HO_Commit_Req MIH_MN_HO_Commit_Req MIH_MN_HO_Commit_Res MIH_N2N_HO_Commit_Res Layer-2 and Layer 3 Connection Establishment

Setp1: QoS1k Setp1: QoS2k

Store at MIIS

Target N/W POA-2

C-PoA-1 C-PoA-2

Setp1: QoS1k

MIH_Link_Going_Down.indication or MIH_Link_Detected

Figure 17: Semi Distributed

MN S-PoA MIIS

Candidate List Generation C-POA-1 C-POA-2

MIH_Get_Information_Req MIH_Get_Information_Res

Setp1: QoS1k Setp1: QoS2k

Store Locally

Candidate list

C-PoA-1 C-PoA-2

Setp1: QoS1k

MIH_Link_Going_Down.indication or MIH_Link_Detected

Store Locally Store Locally

MIH_MN_Candid_Query_Req

Setp2:Fik

MIH_N2N_HO_Query_Resources req MIH_N2N_HO_Query_Resources res MIH_N2N_HO_Query_Resources req MIH_N2N_HO_Query_Resources res MIH_MN_Candid_Query_Res

Select max rank BS. C-POA-2

MIH_N2N_HO_Commit_Req MIH_MN_HO_Commit_Req MIH_MN_HO_Commit_Res MIH_N2N_HO_Commit_Res Layer-2 and Layer 3 Connection Establishment

Setp2:Fik

Figure 18: Fully Distributed

Final Ranks

33

Paper-F Summary

MN S-PoA MIIS

Setp2: Virtual MAP lookup and calculate Fik

MIH_Get_Information_Req MIH_Get_Information_Res MIH_N2N_HO_Commit_Req MIH_MN_HO_Commit_Req MIH_MN_HO_Commit_Res MIH_N2N_HO_Commit_Res Layer-2 and Layer 3 Connection Establishment

Setp1: QoS1k Setp1: QoS2k

Store at MIIS

Target N/W POA-2

C-PoA-1 C-PoA-2

Setp1: QoS1k

MIH_Link_Going_Down.indication or MIH_Link_Detected

Figure 17: Semi Distributed

MN S-PoA MIIS

Candidate List Generation C-POA-1 C-POA-2

MIH_Get_Information_Req MIH_Get_Information_Res

Setp1: QoS1k Setp1: QoS2k

Store Locally

Candidate list

C-PoA-1 C-PoA-2

Setp1: QoS1k

MIH_Link_Going_Down.indication or MIH_Link_Detected

Store Locally Store Locally

MIH_MN_Candid_Query_Req

Setp2:Fik

MIH_N2N_HO_Query_Resources req MIH_N2N_HO_Query_Resources res MIH_N2N_HO_Query_Resources req MIH_N2N_HO_Query_Resources res MIH_MN_Candid_Query_Res

Select max rank BS. C-POA-2

MIH_N2N_HO_Commit_Req MIH_MN_HO_Commit_Req MIH_MN_HO_Commit_Res MIH_N2N_HO_Commit_Res Layer-2 and Layer 3 Connection Establishment

Setp2:Fik

Figure 18: Fully Distributed

Max Rank

34

Paper-F Summary

Simulation scenario and Parameters. — Area 3000 X 3000 meter. — CBR traffic with a packet size 1000 bytes & different traffic rates. — MN speed of 8m/s. — WiMAX better for real time services and Wi-Fi for non real time services. — WiMAX more expensive and Wi-Fi cheaper.

Figure 19: Simulation Topology

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

34

Paper-F Summary

Simulation scenario and Parameters. — Area 3000 X 3000 meter. — CBR traffic with a packet size 1000 bytes & different traffic rates. — MN speed of 8m/s. — WiMAX better for real time services and Wi-Fi for non real time services. — WiMAX more expensive and Wi-Fi cheaper.

Figure 19: Simulation Topology

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

34

Paper-F Summary

Simulation scenario and Parameters. — Area 3000 X 3000 meter. — CBR traffic with a packet size 1000 bytes & different traffic rates. — MN speed of 8m/s. — WiMAX better for real time services and Wi-Fi for non real time services. — WiMAX more expensive and Wi-Fi cheaper.

Figure 19: Simulation Topology

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

34

Paper-F Summary

Simulation scenario and Parameters. — Area 3000 X 3000 meter. — CBR traffic with a packet size 1000 bytes & different traffic rates. — MN speed of 8m/s. — WiMAX better for real time services and Wi-Fi for non real time services. — WiMAX more expensive and Wi-Fi cheaper.

Figure 19: Simulation Topology

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

34

Paper-F Summary

Simulation scenario and Parameters. — Area 3000 X 3000 meter. — CBR traffic with a packet size 1000 bytes & different traffic rates. — MN speed of 8m/s. — WiMAX better for real time services and Wi-Fi for non real time services. — WiMAX more expensive and Wi-Fi cheaper.

Figure 19: Simulation Topology

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

35

Paper-F Summary

Figure 20: Network Selection of different service types with SLA_QoS Figure 21: Network Selection of different SLA types with UGS.

35

Paper-F Summary

Figure 20: Network Selection of different service types with SLA_QoS

rtps and UGS use WiMAX only.

Figure 21: Network Selection of different SLA types with UGS.

35

Paper-F Summary

Figure 20: Network Selection of different service types with SLA_QoS

BE uses Wi-Fi to the max

Figure 21: Network Selection of different SLA types with UGS.

35

Paper-F Summary

Figure 20: Network Selection of different service types with SLA_QoS Figure 21: Network Selection of different SLA types with UGS.

35

Paper-F Summary

Figure 20: Network Selection of different service types with SLA_QoS Figure 21: Network Selection of different SLA types with UGS.

SLA QoS uses WiMAX only

35

Paper-F Summary

Figure 20: Network Selection of different service types with SLA_QoS Figure 21: Network Selection of different SLA types with UGS.

SLA lowcost uses Wi-Fi to the max.

35

Paper-F Summary

Figure 20: Network Selection of different service types with SLA_QoS Figure 21: Network Selection of different SLA types with UGS.

SLA budget uses Wi-Fi but only its QoS is fulfilled

35

Paper-F Summary

Figure 20: Network Selection of different service types with SLA_QoS Figure 21: Network Selection of different SLA types with UGS.

36

Paper-F Summary

Handover Efficiency

Figure 22: Handover Performance of distributed schemes Vs 802.11 preferred.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

37

Handovers in Mobile Networks

Paper-G

Pros and Cons of Route Optimization Schemes for Network Mobility (NEMO) and Their Implications on Handovers

Theme

Handover signalling overhead of different NEMO RO schemes.

Journal

Transactions on Electrical and Electronic Engineering (IEEJ) Vol. 7 / No. 6 (November 2012 issue).

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

37

Handovers in Mobile Networks

Paper-G

Pros and Cons of Route Optimization Schemes for Network Mobility (NEMO) and Their Implications on Handovers

Theme

Handover signalling overhead of different NEMO RO schemes.

Journal

Transactions on Electrical and Electronic Engineering (IEEJ) Vol. 7 / No. 6 (November 2012 issue).

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

38

Paper-G Summary

— Surveys, analyze and characterize all considered RO mechanisms using an IETF categorization. — Every scheme is analyzed from two important aspects.

1

Pros and cons of the RO scheme.

2

Signaling ovehead during handovers.

— NEMO signaling overhead given by the following equation, is taken as a reference. NEMOsig = LNMR[BUHA + BAHA] NEMOtun = m

Table 8: Protocols and their IETF Categorization

Protocol IETF Category Optimized Route Cache (ORC) Infrastructure Based Path Control Headers (PCH) Infrastructure Based Prefix Delegation (PD) Infrastructure Based Reverse Routing Headher (RRH) Nested Tunnel Optimization Access Router Option (ARO) Nested Tunnel Optimization Hierarchical Mobile IP (HMIP) Nested Tunnel Optimization MIP Route Optimization for NEMO (MIRON) MR-to-CN Adhoc Intradomain Route Optimization www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

38

Paper-G Summary

— Surveys, analyze and characterize all considered RO mechanisms using an IETF categorization. — Every scheme is analyzed from two important aspects.

1

Pros and cons of the RO scheme.

2

Signaling ovehead during handovers.

— NEMO signaling overhead given by the following equation, is taken as a reference. NEMOsig = LNMR[BUHA + BAHA] NEMOtun = m

Table 8: Protocols and their IETF Categorization

Protocol IETF Category Optimized Route Cache (ORC) Infrastructure Based Path Control Headers (PCH) Infrastructure Based Prefix Delegation (PD) Infrastructure Based Reverse Routing Headher (RRH) Nested Tunnel Optimization Access Router Option (ARO) Nested Tunnel Optimization Hierarchical Mobile IP (HMIP) Nested Tunnel Optimization MIP Route Optimization for NEMO (MIRON) MR-to-CN Adhoc Intradomain Route Optimization www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

38

Paper-G Summary

— Surveys, analyze and characterize all considered RO mechanisms using an IETF categorization. — Every scheme is analyzed from two important aspects.

1

Pros and cons of the RO scheme.

2

Signaling ovehead during handovers.

— NEMO signaling overhead given by the following equation, is taken as a reference. NEMOsig = LNMR[BUHA + BAHA] NEMOtun = m

Table 8: Protocols and their IETF Categorization

Protocol IETF Category Optimized Route Cache (ORC) Infrastructure Based Path Control Headers (PCH) Infrastructure Based Prefix Delegation (PD) Infrastructure Based Reverse Routing Headher (RRH) Nested Tunnel Optimization Access Router Option (ARO) Nested Tunnel Optimization Hierarchical Mobile IP (HMIP) Nested Tunnel Optimization MIP Route Optimization for NEMO (MIRON) MR-to-CN Adhoc Intradomain Route Optimization www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

38

Paper-G Summary

— Surveys, analyze and characterize all considered RO mechanisms using an IETF categorization. — Every scheme is analyzed from two important aspects.

1

Pros and cons of the RO scheme.

2

Signaling ovehead during handovers.

— NEMO signaling overhead given by the following equation, is taken as a reference. NEMOsig = LNMR[BUHA + BAHA] NEMOtun = m

Table 8: Protocols and their IETF Categorization

Protocol IETF Category Optimized Route Cache (ORC) Infrastructure Based Path Control Headers (PCH) Infrastructure Based Prefix Delegation (PD) Infrastructure Based Reverse Routing Headher (RRH) Nested Tunnel Optimization Access Router Option (ARO) Nested Tunnel Optimization Hierarchical Mobile IP (HMIP) Nested Tunnel Optimization MIP Route Optimization for NEMO (MIRON) MR-to-CN Adhoc Intradomain Route Optimization www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

38

Paper-G Summary

— Surveys, analyze and characterize all considered RO mechanisms using an IETF categorization. — Every scheme is analyzed from two important aspects.

1

Pros and cons of the RO scheme.

2

Signaling ovehead during handovers.

— NEMO signaling overhead given by the following equation, is taken as a reference. NEMOsig = LNMR[BUHA + BAHA] NEMOtun = m

Table 8: Protocols and their IETF Categorization

Protocol IETF Category Optimized Route Cache (ORC) Infrastructure Based Path Control Headers (PCH) Infrastructure Based Prefix Delegation (PD) Infrastructure Based Reverse Routing Headher (RRH) Nested Tunnel Optimization Access Router Option (ARO) Nested Tunnel Optimization Hierarchical Mobile IP (HMIP) Nested Tunnel Optimization MIP Route Optimization for NEMO (MIRON) MR-to-CN Adhoc Intradomain Route Optimization www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

38

Paper-G Summary

— Surveys, analyze and characterize all considered RO mechanisms using an IETF categorization. — Every scheme is analyzed from two important aspects.

1

Pros and cons of the RO scheme.

2

Signaling ovehead during handovers.

— NEMO signaling overhead given by the following equation, is taken as a reference. NEMOsig = LNMR[BUHA + BAHA] NEMO Overhead NEMOtun = m

Table 8: Protocols and their IETF Categorization

Protocol IETF Category Optimized Route Cache (ORC) Infrastructure Based Path Control Headers (PCH) Infrastructure Based Prefix Delegation (PD) Infrastructure Based Reverse Routing Headher (RRH) Nested Tunnel Optimization Access Router Option (ARO) Nested Tunnel Optimization Hierarchical Mobile IP (HMIP) Nested Tunnel Optimization MIP Route Optimization for NEMO (MIRON) MR-to-CN Adhoc Intradomain Route Optimization www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

38

Paper-G Summary

— Surveys, analyze and characterize all considered RO mechanisms using an IETF categorization. — Every scheme is analyzed from two important aspects.

1

Pros and cons of the RO scheme.

2

Signaling ovehead during handovers.

— NEMO signaling overhead given by the following equation, is taken as a reference. NEMOsig = LNMR[BUHA + BAHA] Number of handovers NEMOtun = m

Table 8: Protocols and their IETF Categorization

Protocol IETF Category Optimized Route Cache (ORC) Infrastructure Based Path Control Headers (PCH) Infrastructure Based Prefix Delegation (PD) Infrastructure Based Reverse Routing Headher (RRH) Nested Tunnel Optimization Access Router Option (ARO) Nested Tunnel Optimization Hierarchical Mobile IP (HMIP) Nested Tunnel Optimization MIP Route Optimization for NEMO (MIRON) MR-to-CN Adhoc Intradomain Route Optimization www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

38

Paper-G Summary

— Surveys, analyze and characterize all considered RO mechanisms using an IETF categorization. — Every scheme is analyzed from two important aspects.

1

Pros and cons of the RO scheme.

2

Signaling ovehead during handovers.

— NEMO signaling overhead given by the following equation, is taken as a reference. NEMOsig = LNMR[BUHA + BAHA] Number of MR’s NEMOtun = m

Table 8: Protocols and their IETF Categorization

Protocol IETF Category Optimized Route Cache (ORC) Infrastructure Based Path Control Headers (PCH) Infrastructure Based Prefix Delegation (PD) Infrastructure Based Reverse Routing Headher (RRH) Nested Tunnel Optimization Access Router Option (ARO) Nested Tunnel Optimization Hierarchical Mobile IP (HMIP) Nested Tunnel Optimization MIP Route Optimization for NEMO (MIRON) MR-to-CN Adhoc Intradomain Route Optimization www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

38

Paper-G Summary

— Surveys, analyze and characterize all considered RO mechanisms using an IETF categorization. — Every scheme is analyzed from two important aspects.

1

Pros and cons of the RO scheme.

2

Signaling ovehead during handovers.

— NEMO signaling overhead given by the following equation, is taken as a reference. NEMOsig = LNMR[BUHA + BAHA] BU to HA NEMOtun = m

Table 8: Protocols and their IETF Categorization

Protocol IETF Category Optimized Route Cache (ORC) Infrastructure Based Path Control Headers (PCH) Infrastructure Based Prefix Delegation (PD) Infrastructure Based Reverse Routing Headher (RRH) Nested Tunnel Optimization Access Router Option (ARO) Nested Tunnel Optimization Hierarchical Mobile IP (HMIP) Nested Tunnel Optimization MIP Route Optimization for NEMO (MIRON) MR-to-CN Adhoc Intradomain Route Optimization www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

38

Paper-G Summary

— Surveys, analyze and characterize all considered RO mechanisms using an IETF categorization. — Every scheme is analyzed from two important aspects.

1

Pros and cons of the RO scheme.

2

Signaling ovehead during handovers.

— NEMO signaling overhead given by the following equation, is taken as a reference. NEMOsig = LNMR[BUHA + BAHA] BA from HA NEMOtun = m

Table 8: Protocols and their IETF Categorization

Protocol IETF Category Optimized Route Cache (ORC) Infrastructure Based Path Control Headers (PCH) Infrastructure Based Prefix Delegation (PD) Infrastructure Based Reverse Routing Headher (RRH) Nested Tunnel Optimization Access Router Option (ARO) Nested Tunnel Optimization Hierarchical Mobile IP (HMIP) Nested Tunnel Optimization MIP Route Optimization for NEMO (MIRON) MR-to-CN Adhoc Intradomain Route Optimization www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

38

Paper-G Summary

— Surveys, analyze and characterize all considered RO mechanisms using an IETF categorization. — Every scheme is analyzed from two important aspects.

1

Pros and cons of the RO scheme.

2

Signaling ovehead during handovers.

— NEMO signaling overhead given by the following equation, is taken as a reference. NEMOsig = LNMR[BUHA + BAHA] NEMOtun = m NEMO tunnels

Table 8: Protocols and their IETF Categorization

Protocol IETF Category Optimized Route Cache (ORC) Infrastructure Based Path Control Headers (PCH) Infrastructure Based Prefix Delegation (PD) Infrastructure Based Reverse Routing Headher (RRH) Nested Tunnel Optimization Access Router Option (ARO) Nested Tunnel Optimization Hierarchical Mobile IP (HMIP) Nested Tunnel Optimization MIP Route Optimization for NEMO (MIRON) MR-to-CN Adhoc Intradomain Route Optimization www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

38

Paper-G Summary

— Surveys, analyze and characterize all considered RO mechanisms using an IETF categorization. — Every scheme is analyzed from two important aspects.

1

Pros and cons of the RO scheme.

2

Signaling ovehead during handovers.

— NEMO signaling overhead given by the following equation, is taken as a reference. NEMOsig = LNMR[BUHA + BAHA] NEMOtun = m Nesting Depth or tunnels.

Table 8: Protocols and their IETF Categorization

Protocol IETF Category Optimized Route Cache (ORC) Infrastructure Based Path Control Headers (PCH) Infrastructure Based Prefix Delegation (PD) Infrastructure Based Reverse Routing Headher (RRH) Nested Tunnel Optimization Access Router Option (ARO) Nested Tunnel Optimization Hierarchical Mobile IP (HMIP) Nested Tunnel Optimization MIP Route Optimization for NEMO (MIRON) MR-to-CN Adhoc Intradomain Route Optimization www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

38

Paper-G Summary

— Surveys, analyze and characterize all considered RO mechanisms using an IETF categorization. — Every scheme is analyzed from two important aspects.

1

Pros and cons of the RO scheme.

2

Signaling ovehead during handovers.

— NEMO signaling overhead given by the following equation, is taken as a reference. NEMOsig = LNMR[BUHA + BAHA] NEMOtun = m

Table 8: Protocols and their IETF Categorization

Protocol IETF Category Optimized Route Cache (ORC) Infrastructure Based Path Control Headers (PCH) Infrastructure Based Prefix Delegation (PD) Infrastructure Based Reverse Routing Headher (RRH) Nested Tunnel Optimization Access Router Option (ARO) Nested Tunnel Optimization Hierarchical Mobile IP (HMIP) Nested Tunnel Optimization MIP Route Optimization for NEMO (MIRON) MR-to-CN Adhoc Intradomain Route Optimization www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

38

Paper-G Summary

— Surveys, analyze and characterize all considered RO mechanisms using an IETF categorization. — Every scheme is analyzed from two important aspects.

1

Pros and cons of the RO scheme.

2

Signaling ovehead during handovers.

— NEMO signaling overhead given by the following equation, is taken as a reference. NEMOsig = LNMR[BUHA + BAHA] NEMOtun = m

Table 8: Protocols and their IETF Categorization

Protocol IETF Category Optimized Route Cache (ORC) Infrastructure Based Path Control Headers (PCH) Infrastructure Based Prefix Delegation (PD) Infrastructure Based Reverse Routing Headher (RRH) Nested Tunnel Optimization Access Router Option (ARO) Nested Tunnel Optimization Hierarchical Mobile IP (HMIP) Nested Tunnel Optimization MIP Route Optimization for NEMO (MIRON) MR-to-CN Adhoc Intradomain Route Optimization www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

38

Paper-G Summary

— Surveys, analyze and characterize all considered RO mechanisms using an IETF categorization. — Every scheme is analyzed from two important aspects.

1

Pros and cons of the RO scheme.

2

Signaling ovehead during handovers.

— NEMO signaling overhead given by the following equation, is taken as a reference. NEMOsig = LNMR[BUHA + BAHA] NEMOtun = m

Table 8: Protocols and their IETF Categorization

Protocol IETF Category Optimized Route Cache (ORC) Infrastructure Based Path Control Headers (PCH) Infrastructure Based Prefix Delegation (PD) Infrastructure Based Reverse Routing Headher (RRH) Nested Tunnel Optimization Access Router Option (ARO) Nested Tunnel Optimization Hierarchical Mobile IP (HMIP) Nested Tunnel Optimization MIP Route Optimization for NEMO (MIRON) MR-to-CN Adhoc Intradomain Route Optimization www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

38

Paper-G Summary

— Surveys, analyze and characterize all considered RO mechanisms using an IETF categorization. — Every scheme is analyzed from two important aspects.

1

Pros and cons of the RO scheme.

2

Signaling ovehead during handovers.

— NEMO signaling overhead given by the following equation, is taken as a reference. NEMOsig = LNMR[BUHA + BAHA] NEMOtun = m

Table 8: Protocols and their IETF Categorization

Protocol IETF Category Optimized Route Cache (ORC) Infrastructure Based Path Control Headers (PCH) Infrastructure Based Prefix Delegation (PD) Infrastructure Based Reverse Routing Headher (RRH) Nested Tunnel Optimization Access Router Option (ARO) Nested Tunnel Optimization Hierarchical Mobile IP (HMIP) Nested Tunnel Optimization MIP Route Optimization for NEMO (MIRON) MR-to-CN Adhoc Intradomain Route Optimization www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

39

Paper-G Summary

Table 9: Summary

Criteria Protocols ORC PCH PD RRH ARO HMIP MIRON Ad-hoc Security Equal to Weak AAA Weak Equal Equal Equal Ad-hoc MIPv6 Server than MIPv6 to MIPv6 to HMIP to MIPv6 protocol Problem Addressed Both Both Both Pin-ball Pin-ball Both Both Pin-ball (Indirect/Pin-ball) RO Type Both Inter Inter Inter Inter Both Both Intra (Inter/Intra) Required New ORC CR, Changes Changes Changes MAP ,Changes MAR,Changes Changes Components/Changes Changes to MR to MR to MR & HA to MR, HA to MR to MR to MR Min Tunnels(m) 1 1 1 1 2 or 1 m or 0 Scalability V.Good V.Good Limited Limited Limited Limited Limited Limited Components CR,HA CR,HA CN’s,HA HA HA CN’S, MAP , CN’s,HA HA to Update HA Deployment Difficult Difficult Easy/Difficult1 Easy Easy Easy Easy Easy Location Transparency Yes Yes No Yes Yes No No No Signaling Moderate Low High Moderate Low High High low/Ad-hoc Protocol Degree of RO Near-Max Near-Max Max Moderate Moderate Moderate Max Max www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

39

Paper-G Summary

Table 9: Summary

Criteria Protocols ORC PCH PD RRH ARO HMIP MIRON Ad-hoc Security Equal to Weak AAA Weak Equal Equal Equal Ad-hoc MIPv6 Server than MIPv6 to MIPv6 to HMIP to MIPv6 protocol Problem Addressed Both Both Both Pin-ball Pin-ball Both Both Pin-ball (Indirect/Pin-ball) RO Type Both Inter Inter Inter Inter Both Both Intra (Inter/Intra) Required New ORC CR, Changes Changes Changes MAP ,Changes MAR,Changes Changes Components/Changes Changes to MR to MR to MR & HA to MR, HA to MR to MR to MR Min Tunnels(m) 1 1 1 1 2 or 1 m or 0 Scalability V.Good V.Good Limited Limited Limited Limited Limited Limited Components CR,HA CR,HA CN’s,HA HA HA CN’S, MAP , CN’s,HA HA to Update HA Deployment Difficult Difficult Easy/Difficult1 Easy Easy Easy Easy Easy Location Transparency Yes Yes No Yes Yes No No No Signaling Moderate Low High Moderate Low High High low/Ad-hoc Protocol Degree of RO Near-Max Near-Max Max Moderate Moderate Moderate Max Max www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

39

Paper-G Summary

Table 9: Summary

Criteria Protocols ORC PCH PD RRH ARO HMIP MIRON Ad-hoc Security Equal to Weak AAA Weak Equal Equal Equal Ad-hoc MIPv6 Server than MIPv6 to MIPv6 to HMIP to MIPv6 protocol Problem Addressed Both Both Both Pin-ball Pin-ball Both Both Pin-ball (Indirect/Pin-ball) RO Type Both Inter Inter Inter Inter Both Both Intra (Inter/Intra) Required New ORC CR, Changes Changes Changes MAP ,Changes MAR,Changes Changes Components/Changes Changes to MR to MR to MR & HA to MR, HA to MR to MR to MR Min Tunnels(m) 1 1 1 1 2 or 1 m or 0 Scalability V.Good V.Good Limited Limited Limited Limited Limited Limited Components CR,HA CR,HA CN’s,HA HA HA CN’S, MAP , CN’s,HA HA to Update HA Deployment Difficult Difficult Easy/Difficult1 Easy Easy Easy Easy Easy Location Transparency Yes Yes No Yes Yes No No No Signaling Moderate Low High Moderate Low High High low/Ad-hoc Protocol Degree of RO Near-Max Near-Max Max Moderate Moderate Moderate Max Max www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

39

Paper-G Summary

Table 9: Summary

Criteria Protocols ORC PCH PD RRH ARO HMIP MIRON Ad-hoc Security Equal to Weak AAA Weak Equal Equal Equal Ad-hoc MIPv6 Server than MIPv6 to MIPv6 to HMIP to MIPv6 protocol Problem Addressed Both Both Both Pin-ball Pin-ball Both Both Pin-ball (Indirect/Pin-ball) RO Type Both Inter Inter Inter Inter Both Both Intra (Inter/Intra) Required New ORC CR, Changes Changes Changes MAP ,Changes MAR,Changes Changes Components/Changes Changes to MR to MR to MR & HA to MR, HA to MR to MR to MR Min Tunnels(m) 1 1 1 1 2 or 1 m or 0 Scalability V.Good V.Good Limited Limited Limited Limited Limited Limited Components CR,HA CR,HA CN’s,HA HA HA CN’S, MAP , CN’s,HA HA to Update HA Deployment Difficult Difficult Easy/Difficult1 Easy Easy Easy Easy Easy Location Transparency Yes Yes No Yes Yes No No No Signaling Moderate Low High Moderate Low High High low/Ad-hoc Protocol Degree of RO Near-Max Near-Max Max Moderate Moderate Moderate Max Max www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

39

Paper-G Summary

Table 9: Summary

Criteria Protocols ORC PCH PD RRH ARO HMIP MIRON Ad-hoc Security Equal to Weak AAA Weak Equal Equal Equal Ad-hoc MIPv6 Server than MIPv6 to MIPv6 to HMIP to MIPv6 protocol Problem Addressed Both Both Both Pin-ball Pin-ball Both Both Pin-ball (Indirect/Pin-ball) RO Type Both Inter Inter Inter Inter Both Both Intra (Inter/Intra) Required New ORC CR, Changes Changes Changes MAP ,Changes MAR,Changes Changes Components/Changes Changes to MR to MR to MR & HA to MR, HA to MR to MR to MR Min Tunnels(m) 1 1 1 1 2 or 1 m or 0 Scalability V.Good V.Good Limited Limited Limited Limited Limited Limited Components CR,HA CR,HA CN’s,HA HA HA CN’S, MAP , CN’s,HA HA to Update HA Deployment Difficult Difficult Easy/Difficult1 Easy Easy Easy Easy Easy Location Transparency Yes Yes No Yes Yes No No No Signaling Moderate Low High Moderate Low High High low/Ad-hoc Protocol Degree of RO Near-Max Near-Max Max Moderate Moderate Moderate Max Max www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

40

Table of contents

Introduction Motivation Objectives Research Methods and Tools Thesis Structure Contribution MAC Layer Handovers IP Layer Handovers Heterogeneous Handovers Mobile Networks Conclusions and Future work

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

41

Conclusions and Future Research

— MIH framework can indeed be very useful for improving handover efficiency, at all layers

• f the TCP/IP protocol stack in both homogeneous and heterogeneous networks.

— Centralized, decentralized, device driven and hybrid mobility management architectures can be realized. — However signaling costs of MIH framework should be considered. — New efficient and general handover solutions are needed. — Traditional handover performance matrices are no longer enough. — No NEMO RO solution is scalable, achieves maximum RO possible, provides perfect security and applies to all kind of scenarios. — In future this work can be further extended following two tracks.

1

Compare MIH, architecture wise and efficiency wise to other similar frameworks e.g. Communications Access for Land Mobiles (CALM).

2

Analyze centralized, distributed and hybrid mobility management handover architectures with MIH.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

41

Conclusions and Future Research

— MIH framework can indeed be very useful for improving handover efficiency, at all layers

• f the TCP/IP protocol stack in both homogeneous and heterogeneous networks.

— Centralized, decentralized, device driven and hybrid mobility management architectures can be realized. — However signaling costs of MIH framework should be considered. — New efficient and general handover solutions are needed. — Traditional handover performance matrices are no longer enough. — No NEMO RO solution is scalable, achieves maximum RO possible, provides perfect security and applies to all kind of scenarios. — In future this work can be further extended following two tracks.

1

Compare MIH, architecture wise and efficiency wise to other similar frameworks e.g. Communications Access for Land Mobiles (CALM).

2

Analyze centralized, distributed and hybrid mobility management handover architectures with MIH.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

41

Conclusions and Future Research

— MIH framework can indeed be very useful for improving handover efficiency, at all layers

• f the TCP/IP protocol stack in both homogeneous and heterogeneous networks.

— Centralized, decentralized, device driven and hybrid mobility management architectures can be realized. — However signaling costs of MIH framework should be considered. — New efficient and general handover solutions are needed. — Traditional handover performance matrices are no longer enough. — No NEMO RO solution is scalable, achieves maximum RO possible, provides perfect security and applies to all kind of scenarios. — In future this work can be further extended following two tracks.

1

Compare MIH, architecture wise and efficiency wise to other similar frameworks e.g. Communications Access for Land Mobiles (CALM).

2

Analyze centralized, distributed and hybrid mobility management handover architectures with MIH.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

41

Conclusions and Future Research

— MIH framework can indeed be very useful for improving handover efficiency, at all layers

• f the TCP/IP protocol stack in both homogeneous and heterogeneous networks.

— Centralized, decentralized, device driven and hybrid mobility management architectures can be realized. — However signaling costs of MIH framework should be considered. — New efficient and general handover solutions are needed. — Traditional handover performance matrices are no longer enough. — No NEMO RO solution is scalable, achieves maximum RO possible, provides perfect security and applies to all kind of scenarios. — In future this work can be further extended following two tracks.

1

Compare MIH, architecture wise and efficiency wise to other similar frameworks e.g. Communications Access for Land Mobiles (CALM).

2

Analyze centralized, distributed and hybrid mobility management handover architectures with MIH.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

41

Conclusions and Future Research

— MIH framework can indeed be very useful for improving handover efficiency, at all layers

• f the TCP/IP protocol stack in both homogeneous and heterogeneous networks.

— Centralized, decentralized, device driven and hybrid mobility management architectures can be realized. — However signaling costs of MIH framework should be considered. — New efficient and general handover solutions are needed. — Traditional handover performance matrices are no longer enough. — No NEMO RO solution is scalable, achieves maximum RO possible, provides perfect security and applies to all kind of scenarios. — In future this work can be further extended following two tracks.

1

Compare MIH, architecture wise and efficiency wise to other similar frameworks e.g. Communications Access for Land Mobiles (CALM).

2

Analyze centralized, distributed and hybrid mobility management handover architectures with MIH.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

41

Conclusions and Future Research

— MIH framework can indeed be very useful for improving handover efficiency, at all layers

• f the TCP/IP protocol stack in both homogeneous and heterogeneous networks.

— Centralized, decentralized, device driven and hybrid mobility management architectures can be realized. — However signaling costs of MIH framework should be considered. — New efficient and general handover solutions are needed. — Traditional handover performance matrices are no longer enough. — No NEMO RO solution is scalable, achieves maximum RO possible, provides perfect security and applies to all kind of scenarios. — In future this work can be further extended following two tracks.

1

Compare MIH, architecture wise and efficiency wise to other similar frameworks e.g. Communications Access for Land Mobiles (CALM).

2

Analyze centralized, distributed and hybrid mobility management handover architectures with MIH.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

41

Conclusions and Future Research

— MIH framework can indeed be very useful for improving handover efficiency, at all layers

• f the TCP/IP protocol stack in both homogeneous and heterogeneous networks.

— Centralized, decentralized, device driven and hybrid mobility management architectures can be realized. — However signaling costs of MIH framework should be considered. — New efficient and general handover solutions are needed. — Traditional handover performance matrices are no longer enough. — No NEMO RO solution is scalable, achieves maximum RO possible, provides perfect security and applies to all kind of scenarios. — In future this work can be further extended following two tracks.

1

Compare MIH, architecture wise and efficiency wise to other similar frameworks e.g. Communications Access for Land Mobiles (CALM).

2

Analyze centralized, distributed and hybrid mobility management handover architectures with MIH.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

41

Conclusions and Future Research

— MIH framework can indeed be very useful for improving handover efficiency, at all layers

• f the TCP/IP protocol stack in both homogeneous and heterogeneous networks.

— Centralized, decentralized, device driven and hybrid mobility management architectures can be realized. — However signaling costs of MIH framework should be considered. — New efficient and general handover solutions are needed. — Traditional handover performance matrices are no longer enough. — No NEMO RO solution is scalable, achieves maximum RO possible, provides perfect security and applies to all kind of scenarios. — In future this work can be further extended following two tracks.

1

Compare MIH, architecture wise and efficiency wise to other similar frameworks e.g. Communications Access for Land Mobiles (CALM).

2

Analyze centralized, distributed and hybrid mobility management handover architectures with MIH.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

41

Conclusions and Future Research

— MIH framework can indeed be very useful for improving handover efficiency, at all layers

• f the TCP/IP protocol stack in both homogeneous and heterogeneous networks.

— Centralized, decentralized, device driven and hybrid mobility management architectures can be realized. — However signaling costs of MIH framework should be considered. — New efficient and general handover solutions are needed. — Traditional handover performance matrices are no longer enough. — No NEMO RO solution is scalable, achieves maximum RO possible, provides perfect security and applies to all kind of scenarios. — In future this work can be further extended following two tracks.

1

Compare MIH, architecture wise and efficiency wise to other similar frameworks e.g. Communications Access for Land Mobiles (CALM).

2

Analyze centralized, distributed and hybrid mobility management handover architectures with MIH.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities

Thank you for your attention.

www.ntnu.no Muhammad Qasim Khan, Optimizing Handovers in Wireless Networks Utilizing Extended MIIS Facilities