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.
|Number of pages||8|
|Journal||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Publication status||Published - 2004|
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)