.png){kind=icon}
.png){kind=icon}
Return
Genetic Algorithm based Multi-step Paging in HMIPv6 Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/WICOM.2007.438.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Mobile IP (MIP) and Hierarchical MIP (HMIP) are proposed by the IETF (Internet Engineering Task Force) to support IP mobility. Noting that allowing mobile nodes (MNs) to be in idle state can effectively save MNs' battery power and also decrease signaling overhead, we, based on HMIPv6, embed paging functions into MAPs (Mobile Anchor Points) and present three paging schemes: P-MIPv6, Pn-MIPv6, and D-Pn-MIPv6, which make use of MNs' subnet residence probabilities (SRPs) to produce paging sequence including subnets in non-increasing SRP order. The costs of the proposed paging schemes are analyzed, and besides, the experimental results are given by using genetic algorithms to compare the proposed schemes.
Keywords:
Mobile IP (MIP)
HMIPv6
IP paging
genetic algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
0
Papers:
19
Citations:
0