Loading...
Please wait, while we are loading the content...
Similar Documents
International Journal of Electrical and Computer Engineering 4:16 2009 An Efficient MIPv6 Return Routability Scheme Based on Geometric Computing
| Content Provider | CiteSeerX |
|---|---|
| Author | Yang, Fu-Chen Chen, Yen-Cheng |
| Abstract | allow nodes to remain reachable while moving around in the IPv6 internet. When a node moves and visits a foreign network, it is still reachable through the indirect packet forwarding from its home network. This triangular routing feature provides node mobility but increases the communication latency between nodes. This deficiency can be overcome by using a Binding Update (BU) scheme, which let nodes keep up-to-date IP addresses and communicate with each other through direct IP routing. To further protect the security of BU, a Return Routability (RR) procedure was developed. However, it has been found that RR procedure is vulnerable to many attacks. In this paper, we will propose a lightweight RR procedure based on geometric computing. In consideration of the inherent limitation of computing resources in mobile node, the proposed scheme is developed to minimize the cost of computations and to eliminate the overhead of state maintenance during binding updates. Compared with other CGA-based BU schemes, our scheme is more efficient and doesn’t need nonce tables in nodes. Keywords—Mobile IPv6, Binding update, Geometric computing. I. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Return Routability Node Move Rr Procedure Direct Ip Routing Inherent Limitation Binding Update Lightweight Rr Procedure State Maintenance Home Network Triangular Routing Feature Keywords Mobile Ipv6 Communication Latency Indirect Packet Cga-based Bu Scheme Mobile Node Efficient Mipv6 Return Routability Scheme Many Attack Node Mobility International Journal Foreign Network Nonce Table Up-to-date Ip Address Computer Engineering Ipv6 Internet |
| Content Type | Text |
