Energy-efficient message management algorithms in HMIPv6

Sun Ok Yang, Sungsuk Kim, Chong Sun Hwang, Sang-Geun Lee

Research output: Contribution to journalArticle

Abstract

Mobile IPv6 enables nodes to move within the Internet topology while maintaining reachability and on-going connections between mobile node and correspondent nodes. Binding update and binding request messages are used for this purpose. However, highly frequent occurrence of those messages incurs high overhead in several ways. To solve the problem, we propose new binding update message management algorithms that consider each user's mobility pattern. If each user maintains a profile locally based on mobility pattern logs, it helps to determine a proper lifetime for binding updates. In addition, we devise another lifetime determination scheme considering arrival time by expanding the first one. Through the extensive experiments, we focus and measure the bandwidth usage for binding update messages by comparing the proposed algorithms with that in Hierarchical MIPv6.

Original languageEnglish
Pages (from-to)286-293
Number of pages8
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3043
Publication statusPublished - 2004 Dec 1

Fingerprint

Energy Efficient
Update
Internet
Topology
Lifetime
Bandwidth
Vertex of a graph
Mobile IPv6
Arrival Time
Reachability
Experiments
Experiment

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Energy-efficient message management algorithms in HMIPv6. / Yang, Sun Ok; Kim, Sungsuk; Hwang, Chong Sun; Lee, Sang-Geun.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 3043, 01.12.2004, p. 286-293.

Research output: Contribution to journalArticle

@article{797ea4cad25b4a219523abdc9fc8e029,
title = "Energy-efficient message management algorithms in HMIPv6",
abstract = "Mobile IPv6 enables nodes to move within the Internet topology while maintaining reachability and on-going connections between mobile node and correspondent nodes. Binding update and binding request messages are used for this purpose. However, highly frequent occurrence of those messages incurs high overhead in several ways. To solve the problem, we propose new binding update message management algorithms that consider each user's mobility pattern. If each user maintains a profile locally based on mobility pattern logs, it helps to determine a proper lifetime for binding updates. In addition, we devise another lifetime determination scheme considering arrival time by expanding the first one. Through the extensive experiments, we focus and measure the bandwidth usage for binding update messages by comparing the proposed algorithms with that in Hierarchical MIPv6.",
author = "Yang, {Sun Ok} and Sungsuk Kim and Hwang, {Chong Sun} and Sang-Geun Lee",
year = "2004",
month = "12",
day = "1",
language = "English",
volume = "3043",
pages = "286--293",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Energy-efficient message management algorithms in HMIPv6

AU - Yang, Sun Ok

AU - Kim, Sungsuk

AU - Hwang, Chong Sun

AU - Lee, Sang-Geun

PY - 2004/12/1

Y1 - 2004/12/1

N2 - Mobile IPv6 enables nodes to move within the Internet topology while maintaining reachability and on-going connections between mobile node and correspondent nodes. Binding update and binding request messages are used for this purpose. However, highly frequent occurrence of those messages incurs high overhead in several ways. To solve the problem, we propose new binding update message management algorithms that consider each user's mobility pattern. If each user maintains a profile locally based on mobility pattern logs, it helps to determine a proper lifetime for binding updates. In addition, we devise another lifetime determination scheme considering arrival time by expanding the first one. Through the extensive experiments, we focus and measure the bandwidth usage for binding update messages by comparing the proposed algorithms with that in Hierarchical MIPv6.

AB - Mobile IPv6 enables nodes to move within the Internet topology while maintaining reachability and on-going connections between mobile node and correspondent nodes. Binding update and binding request messages are used for this purpose. However, highly frequent occurrence of those messages incurs high overhead in several ways. To solve the problem, we propose new binding update message management algorithms that consider each user's mobility pattern. If each user maintains a profile locally based on mobility pattern logs, it helps to determine a proper lifetime for binding updates. In addition, we devise another lifetime determination scheme considering arrival time by expanding the first one. Through the extensive experiments, we focus and measure the bandwidth usage for binding update messages by comparing the proposed algorithms with that in Hierarchical MIPv6.

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

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

M3 - Article

AN - SCOPUS:35048864471

VL - 3043

SP - 286

EP - 293

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -