An adaptive mobility anchor point selection scheme in Hierarchical Mobile IPv6 networks

Sangheon Pack; Minji Nam; Taekyoung Kwon; Yanghee Choi

doi:10.1016/j.comcom.2005.11.004

An adaptive mobility anchor point selection scheme in Hierarchical Mobile IPv6 networks

Sangheon Pack, Minji Nam, Taekyoung Kwon, Yanghee Choi

Research output: Contribution to journal › Article › peer-review

43 Citations (Scopus)

Abstract

In Hierarchical Mobile IPv6 (HMIPv6) networks, the mobility anchor point (MAP) is introduced to localize binding update messages destined to the home agent. In a large-scale wireless/mobile network, multiple MAPs may be deployed in order to provide more scalable and robust mobile services. In this case, it is important for a mobile node (MN) to select the most appropriate MAP among them. In this paper, we propose an adaptive MAP selection scheme for HMIPv6 networks. In the adaptive MAP selection scheme, an MN first estimates its session-to-mobility ratio (SMR). Then, based on its SMR, the MN chooses a MAP that minimizes the total cost, consisting of the binding update cost and packet delivery cost. In addition, the MN calculates two threshold SMR values, which adaptively trigger a new MAP selection procedure. If the estimated SMR is larger (or smaller) than the upper (or lower) threshold SMR value, the MN recalculates the total cost and re-selects a MAP that minimizes the total cost. Simulation results indicate that the adaptive MAP selection scheme achieves a lower total cost and a better load balancing than the previous schemes.

Original language	English
Pages (from-to)	3066-3078
Number of pages	13
Journal	Computer Communications
Volume	29
Issue number	16
DOIs	https://doi.org/10.1016/j.comcom.2005.11.004
Publication status	Published - 2006 Oct 12
Externally published	Yes

Bibliographical note

Funding Information:
Sangheon Pack . He received B.S. (2000, magna cum laude) and Ph.D. (2005) degrees from Seoul National University, both in computer engineering. He is a post doctor fellow in the School of Computer Science and Engineering at the Seoul National University, Korea. He is a member of the IEEE and ACM. During 2002–2005, he was a recipient of the Korea Foundation for Advanced Studies (KFAS) Computer Science and Information Technology Scholarship. He has been also a member of Samsung Frontier Membership (SFM) from 1999. He received a student travel grant award for the IFIP Personal Wireless Conference (PWC) 2003. He was a visiting researcher to Fraunhofer FOKUS, German in 2003. His research interests include mobility management, wireless multimedia transmission, and QoS provision issues in the next-generation wireless/mobile networks.

Funding Information:
This work was supported in part by the Brain Korea 21 project of the Ministry of Education and in part by the National Research Laboratory project of the Ministry of Science and Technology, 2004, Korea.

Keywords

Hierarchical Mobile IPv6
MAP selection scheme
Mobility anchor point
Performance analysis

ASJC Scopus subject areas

Computer Networks and Communications

Access to Document

10.1016/j.comcom.2005.11.004

Cite this

@article{d1f0df62433c4384acb702cc6dc548a3,

title = "An adaptive mobility anchor point selection scheme in Hierarchical Mobile IPv6 networks",

abstract = "In Hierarchical Mobile IPv6 (HMIPv6) networks, the mobility anchor point (MAP) is introduced to localize binding update messages destined to the home agent. In a large-scale wireless/mobile network, multiple MAPs may be deployed in order to provide more scalable and robust mobile services. In this case, it is important for a mobile node (MN) to select the most appropriate MAP among them. In this paper, we propose an adaptive MAP selection scheme for HMIPv6 networks. In the adaptive MAP selection scheme, an MN first estimates its session-to-mobility ratio (SMR). Then, based on its SMR, the MN chooses a MAP that minimizes the total cost, consisting of the binding update cost and packet delivery cost. In addition, the MN calculates two threshold SMR values, which adaptively trigger a new MAP selection procedure. If the estimated SMR is larger (or smaller) than the upper (or lower) threshold SMR value, the MN recalculates the total cost and re-selects a MAP that minimizes the total cost. Simulation results indicate that the adaptive MAP selection scheme achieves a lower total cost and a better load balancing than the previous schemes.",

keywords = "Hierarchical Mobile IPv6, MAP selection scheme, Mobility anchor point, Performance analysis",

author = "Sangheon Pack and Minji Nam and Taekyoung Kwon and Yanghee Choi",

note = "Funding Information: Sangheon Pack . He received B.S. (2000, magna cum laude) and Ph.D. (2005) degrees from Seoul National University, both in computer engineering. He is a post doctor fellow in the School of Computer Science and Engineering at the Seoul National University, Korea. He is a member of the IEEE and ACM. During 2002–2005, he was a recipient of the Korea Foundation for Advanced Studies (KFAS) Computer Science and Information Technology Scholarship. He has been also a member of Samsung Frontier Membership (SFM) from 1999. He received a student travel grant award for the IFIP Personal Wireless Conference (PWC) 2003. He was a visiting researcher to Fraunhofer FOKUS, German in 2003. His research interests include mobility management, wireless multimedia transmission, and QoS provision issues in the next-generation wireless/mobile networks. Funding Information: This work was supported in part by the Brain Korea 21 project of the Ministry of Education and in part by the National Research Laboratory project of the Ministry of Science and Technology, 2004, Korea. ",

year = "2006",

month = oct,

day = "12",

doi = "10.1016/j.comcom.2005.11.004",

language = "English",

volume = "29",

pages = "3066--3078",

journal = "Computer Communications",

issn = "0140-3664",

publisher = "Elsevier B.V.",

number = "16",

}

TY - JOUR

T1 - An adaptive mobility anchor point selection scheme in Hierarchical Mobile IPv6 networks

AU - Pack, Sangheon

AU - Nam, Minji

AU - Kwon, Taekyoung

AU - Choi, Yanghee

N1 - Funding Information: Sangheon Pack . He received B.S. (2000, magna cum laude) and Ph.D. (2005) degrees from Seoul National University, both in computer engineering. He is a post doctor fellow in the School of Computer Science and Engineering at the Seoul National University, Korea. He is a member of the IEEE and ACM. During 2002–2005, he was a recipient of the Korea Foundation for Advanced Studies (KFAS) Computer Science and Information Technology Scholarship. He has been also a member of Samsung Frontier Membership (SFM) from 1999. He received a student travel grant award for the IFIP Personal Wireless Conference (PWC) 2003. He was a visiting researcher to Fraunhofer FOKUS, German in 2003. His research interests include mobility management, wireless multimedia transmission, and QoS provision issues in the next-generation wireless/mobile networks. Funding Information: This work was supported in part by the Brain Korea 21 project of the Ministry of Education and in part by the National Research Laboratory project of the Ministry of Science and Technology, 2004, Korea.

PY - 2006/10/12

Y1 - 2006/10/12

N2 - In Hierarchical Mobile IPv6 (HMIPv6) networks, the mobility anchor point (MAP) is introduced to localize binding update messages destined to the home agent. In a large-scale wireless/mobile network, multiple MAPs may be deployed in order to provide more scalable and robust mobile services. In this case, it is important for a mobile node (MN) to select the most appropriate MAP among them. In this paper, we propose an adaptive MAP selection scheme for HMIPv6 networks. In the adaptive MAP selection scheme, an MN first estimates its session-to-mobility ratio (SMR). Then, based on its SMR, the MN chooses a MAP that minimizes the total cost, consisting of the binding update cost and packet delivery cost. In addition, the MN calculates two threshold SMR values, which adaptively trigger a new MAP selection procedure. If the estimated SMR is larger (or smaller) than the upper (or lower) threshold SMR value, the MN recalculates the total cost and re-selects a MAP that minimizes the total cost. Simulation results indicate that the adaptive MAP selection scheme achieves a lower total cost and a better load balancing than the previous schemes.

AB - In Hierarchical Mobile IPv6 (HMIPv6) networks, the mobility anchor point (MAP) is introduced to localize binding update messages destined to the home agent. In a large-scale wireless/mobile network, multiple MAPs may be deployed in order to provide more scalable and robust mobile services. In this case, it is important for a mobile node (MN) to select the most appropriate MAP among them. In this paper, we propose an adaptive MAP selection scheme for HMIPv6 networks. In the adaptive MAP selection scheme, an MN first estimates its session-to-mobility ratio (SMR). Then, based on its SMR, the MN chooses a MAP that minimizes the total cost, consisting of the binding update cost and packet delivery cost. In addition, the MN calculates two threshold SMR values, which adaptively trigger a new MAP selection procedure. If the estimated SMR is larger (or smaller) than the upper (or lower) threshold SMR value, the MN recalculates the total cost and re-selects a MAP that minimizes the total cost. Simulation results indicate that the adaptive MAP selection scheme achieves a lower total cost and a better load balancing than the previous schemes.

KW - Hierarchical Mobile IPv6

KW - MAP selection scheme

KW - Mobility anchor point

KW - Performance analysis

UR - http://www.scopus.com/inward/record.url?scp=33748930232&partnerID=8YFLogxK

U2 - 10.1016/j.comcom.2005.11.004

DO - 10.1016/j.comcom.2005.11.004

M3 - Article

AN - SCOPUS:33748930232

SN - 0140-3664

VL - 29

SP - 3066

EP - 3078

JO - Computer Communications

JF - Computer Communications

IS - 16

ER -

An adaptive mobility anchor point selection scheme in Hierarchical Mobile IPv6 networks

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this