CN102572791B - Routing optimization method for hierarchical mobile Internet protocol version 6 (IPv6) - Google Patents
Routing optimization method for hierarchical mobile Internet protocol version 6 (IPv6) Download PDFInfo
- Publication number
- CN102572791B CN102572791B CN201210074709.7A CN201210074709A CN102572791B CN 102572791 B CN102572791 B CN 102572791B CN 201210074709 A CN201210074709 A CN 201210074709A CN 102572791 B CN102572791 B CN 102572791B
- Authority
- CN
- China
- Prior art keywords
- binding update
- address
- mobile node
- mobile
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a routing optimization method for a hierarchical mobile Internet protocol version 6 (IPv6). The method comprises the following steps that: the packet transmission number M and binding update number N of transmission from a mobile node (MN) to a correspondent node within a binding update lifecycle are counted, and a ratio PBR=M/N is compared with a preset critical value Delta; in an intra-domain switching mode, the MN transmits a binding update message to the correspondent node to register own on-link care-of address if the ratio PBR is greater than the critical value Delta, and adopts the conventional binding update mode if the ratio PBR is lower than the critical value Delta; and in an inter-domain switching mode, the MN transmits the binding update message to the correspondent node to register own on-link care-of address if the ratio PBR is greater than the critical vale Delta, and transmits the binding update message to the correspondent node to register own regional care-of address if the ratio PBR is lower than the critical value Delta. By the method, switching frequency and communication frequency are combined, and the method can be adapted to the conditions of normal communication and frequent intra-domain switching of the MN.
Description
Technical field
The invention belongs to mobile IP technology field, specifically a kind of routing optimization method of hierarchy motion Ipv 6, provides the method for using routing optimality in the network configuration of hierarchy motion Ipv 6.
Background technology
Hierarchy motion Ipv 6 (Hierarchical Mobile IPv6, HMIPv6) is the expansion of mobile IPv 6 protocol, and network architecture as shown in Figure 1.This agreement is divided into different territories conventional Mobile IPv 6 Network, and has introduced mobile anchor point (Mobility Anchor Point, MAP) and managed these territories.Mobile node (Mobile Node, MN) use two Care-of Address: regional care-of address (Regional Care-of Address, RCoA) and on-link care-of address (On-Link Care-of Address, LCoA), switch to be divided in the territory in and switch between switching and territory.When mobile node is changed different access router in same mobile anchor point territory, such as moving to AR2 from AR1, be to switch in territory, only need to send local binding update messages (On-Link Binding Update to mobile anchor point, LBU), to register on-link care-of address, this process is called local position and upgrades; As mobile node (Mobile Node, MN) from AR2, move to AR3 while carrying out switching between territory, need to carry out local position renewal, and will be to home agent (Home Agent, HA) send binding update messages (Binding Update, BU) register new regional care-of address, then return to binding acknowledgement message (Binding Acknowledgement, BACK) by home agent.Mobile anchor point is equivalent to local home agent, and the Signalling exchange that the hierarchical structure of hierarchy motion Ipv 6 is upgraded mobile node and home agent position greatly reduces, and has effectively reduced Binding Update time delay when mobile node switches in Mobile IPv 6 Network.
Routing optimality packet communication techniques is mainly used in mobile IP v 6, when not using routing optimality packet communication techniques, Correspondent Node (Correspondent Node, CN) with mobile node between communicate by letter and will carry out in a conventional manner, be that the communication packet that Correspondent Node is sent to mobile node can be intercepted and captured by home agent, after encapsulation, by tunnel, issue mobile node; If adopt routing optimality packet communication techniques, Correspondent Node can carry out communicating by letter of a usual manner with mobile node, after knowing the address of Correspondent Node, mobile node sends binding update messages to Correspondent Node as required, the Care-of Address of oneself is informed to Correspondent Node, each supports the Correspondent Node of mobile IPv 6 protocol can safeguard that a buffering area binds the Care-of Address that mobile node is sent, mobile node utilizes its Care-of Address directly to communicate by letter with Correspondent Node, and data no longer need to forward by the bidirectional tunnel of home agent.Use routing optimality packet communication techniques, can avoid all data all to need the Single Point of Faliure problem through home agent, and reduce overhead and packet transfer delay.
Hierarchy motion Ipv 6 has been realized Binding Update and has been processed localization, but itself also has weak point: even MN(mobile node) and CN(Correspondent Node) between there is shorter route, the all communication packet of the two also must be passed through MAP(mobile anchor point) forward, increase to a certain extent packet transfer delay, also increased the burden of MAP simultaneously.For this reason, routing optimality packet communication techniques can be applied to HMIPv6(hierarchy motion Ipv 6) in, implementation method is that MN registers its LCoA(on-link care-of address to CN).Yet, because routing optimality has certain overhead, routing optimality packet communication techniques can not be directly applied in HMIPv6 and need not any constraint, need to consider the communication frequency such as MN and CN, the factors such as the switching frequency of MN.
Existing document (Ren Lanfang, Zhou Huachun, Qin Yajuan etc., the research [J] that self adaptation Mobile-Ipv6 handover delay is optimized. Beijing Jiaotong University's journal, 2006,30 (5): 63-67.) proposed routing optimization method to be applied to quick hierarchy motion Ipv 6 (Fast Handover for Hierarchical Mobile IPv6, FHMIPv6) handover scheme, and to take the mean residence time of MN in some MAP management domains be examination criteria, when mobile node is when the time of staying in this territory is greater than its mean residence time in this territory, MN registers its LCoA to CN.But the examination criteria that this existing document is formulated is not also suitable for such a case: MN stays in for a long time the management domain of some MAP and surpassed it at the mean residence time in this territory, but carries out continually switching territory in.In this case, MN just can register its new LCoA continually to CN, and along with MN converts couple in router continually, binding expense and Binding Update time delay in network can increase greatly with respect to conventional H MIPv6, apparently, this existing document is not considered the switching frequency problem of MN, and its adaptability is not strong, can not adapt to such a case: MN and stays in for a long time some MAP management domains and carry out continually switching in territory.
Summary of the invention
The object of the invention is provides a kind of routing optimization method with the hierarchy motion Ipv 6 of general applicability for overcoming the defect of above-mentioned prior art.
Realize technical scheme of the present invention and there are following steps: the Binding Update number N that the transmitted in packets number M that in (1) statistics Binding Update lifetime, mobile node sends to Correspondent Node and mobile node send, ratio calculated
pBR=m/N; By ratio
pBRwith pre-definite critical value Δ=
compare;
l p length for unit message;
l bU length for unit binding update messages information;
d(MAP, CN)for the jumping figure of mobile anchor point to Correspondent Node;
d(MN, MAP)for the jumping figure of mobile node to mobile anchor point;
d(MN, CN)for the jumping figure of mobile node to Correspondent Node; (2) in territory during switch mode, by mobile node, to mobile anchor point, send local binding update messages, mobile anchor point carries out duplicate address detection to on-link care-of address after receiving local binding update messages, if on-link care-of address is unique, mobile anchor point returns to local binding acknowledgement message to mobile node; If ratio
pBRbe greater than critical value
Δ, mobile node sends binding update messages to register its on-link care-of address, if ratio to Correspondent Node
pBRbe less than or equal to critical value
Δ,adopt the conventional Binding Update mode of switching in hierarchy motion Ipv 6 territory; (3) between territory during switch mode
,by mobile node, to mobile anchor point, send local binding update messages, mobile anchor point carries out duplicate address detection to regional care-of address after receiving local binding update messages, if regional care-of address is unique, mobile anchor point returns to local binding acknowledgement message to mobile node; Mobile node sends binding update messages to home agent after receiving local binding acknowledgement message, and home agent after receiving is bound home address and regional care-of address, if success is returned to binding acknowledgement message to mobile node; Mobile node is after receiving the binding acknowledgement message that home agent sends, if ratio
pBRbe greater than critical value
Δ, mobile node sends binding update messages to register its on-link care-of address, if ratio to Correspondent Node
pBRbe less than or equal to critical value
Δ, by mobile node, to Correspondent Node, send binding update messages and register its regional care-of address.
The invention has the beneficial effects as follows:
1, propose routing optimality packet communication techniques to be applied to the constraints of HMIPv6, take into account switching frequency and communication frequency, situation and the MN that can adapt to proper communication frequently carry out situation about switching in territory.
2, the Binding Update number that the transmitted in packets number that MN sends to CN and MN send easily obtains, and statistical work work is completed by MAP, is easy to network manager's management.
3, along with the development of mobile IP technology, this routing optimization method can with quick handoff technique, the technology combinations such as MPLS, have good autgmentability.
Accompanying drawing explanation
Fig. 1 is the network architecture of existing hierarchy motion Ipv 6;
Fig. 2 is flow chart of the present invention;
Fig. 3 switches local position to upgrade flow chart in territory of the present invention;
Fig. 4 switches Binding Update flow chart between territory of the present invention.
Embodiment
Referring to Fig. 2, HMIPv6 uses the constraints of routing optimality packet communication techniques to take into account switching frequency simultaneously and communication frequency just has general applicability, therefore needs a data variable reflection switching frequency of MN and the contrast situation of communication frequency.The present invention proposes a kind of critical value assessment method, first adds up interior MN of Binding Update lifetime to the transmitted in packets number M of CN transmission and the Binding Update number N of MN transmission, and the statistical work of transmitted in packets number M and Binding Update number N is carried out by MAP.The Binding Update lifetime is divided into the Binding Update lifetime under switch mode and the Binding Update lifetime under switch mode between territory in territory, wherein, in territory, the Binding Update lifetime under switch mode refers to from mobile node and sends a local binding update messages to receiving corresponding local binding acknowledgement message during this period of time; The Binding Update lifetime between territory under switch mode refers to from mobile node and sends a local binding update messages to receiving that binding acknowledgement message that home agent is sent during this period of time.
According to transmitted in packets number M and Binding Update number N, calculate both ratio
pBR,?
pBR=m/N, ratio
pBRcan represent well the contrast situation of communication frequency and the switching frequency of MN, therefore, ratio
pBRcan be used as the constraints of using routing optimality packet communication techniques.In addition, because the form of multilevel hierarchy can make to be grouped in the path of mailing to MN through repeatedly encapsulation, will reduce efficiency and the performance of HMIPv6 agreement, so the present invention builds in the network configuration of conventional H MIPv6, do not make an amendment, as Fig. 1.Specifically carry out following flow process:
1, switch mode in territory if, if the ratio of M and N
pBRbe greater than critical value
Δ,at the final step MN switching, need send binding update messages to register its on-link care-of address LCoA to CN.
Handoff procedure as shown in Figure 3, first sends local binding update messages by MN to MAP, and MAP carries out duplicate address detection to on-link care-of address LCoA after receiving local binding update messages, if LCoA is unique, MAP returns to local binding acknowledgement message to MN; If LCoA is not unique, MAP is the binding acknowledgement message of returning to MN containing error code, then returns, and MN sends local binding update messages to MAP again.If ratio
pBRbe greater than critical value
Δ, MN need send binding update messages to register its on-link care-of address LCoA, if ratio to CN
pBRbe less than or equal to critical value
Δ,adopt the conventional Binding Update mode of switching in hierarchy motion Ipv 6 territory.
2, switch mode between territory if
,if the ratio of M and N
pBRbe greater than critical value
Δ,at the final step MN switching, need send binding update messages to register its LCoA rather than RCoA to CN.
Handoff procedure as shown in Figure 4, first by MN, to MAP, send local binding update messages, MAP carries out duplicate address detection to regional care-of address RCoA after receiving local binding update messages, if RCoA is unique, MAP returns to local binding acknowledgement message (LBACK) to MN; If RCoA is not unique, MAP returns to the binding acknowledgement message of returning to MN containing error code again, by MN, again to MAP, sends local binding update messages.MN sends binding update messages to home agent after receiving local binding acknowledgement message LBACK, and then HA after receiving binds home address and regional care-of address, if success is returned to binding acknowledgement message to MN; MN is after receiving the binding acknowledgement message that HA sends, if the ratio of M and N
pBRbe greater than critical value
Δ, MN need send binding update messages to register its LCoA to CN, if the ratio of M and N
pBRbe less than or equal to critical value
Δ, by MN, to CN, send binding update messages and register its RCoA.
The Binding Update that mails under normal circumstances Correspondent Node do not need to confirm, therefore, after Binding Update finishes, communicating by letter between mobile node and Correspondent Node can realize routing optimality.
Pre-determined critical value in the present invention
Δdefinite be based on switch mode in territory, critical value
Δderivation thinking is: a, calculate in conventional hierarchy motion Ipv 6 territory binding expense and the transmitted in packets expense of Binding Update in the lifetime under switch mode, and sum of the two, i.e. and overhead, expense embodies with the form of message length and jumping figure product; B, calculate in a kind of in particular cases territory binding expense and the transmitted in packets expense of Binding Update in the lifetime under switch mode, and sum of the two, i.e. overhead.This situation is: as long as mobile node has changed couple in router, just must send a Binding Update to Correspondent Node and register his on-link care-of address; C. because situation described in step b has adopted routing optimality packet communication techniques, so transmitted in packets expense is less than situation described in step a; And described in step b situation because will send binding update messages to Correspondent Node, so have extra binding expense with respect to situation described in step a.Therefore the equal situation of overhead of the two certainly exists, and makes the overhead of the two equate, just can obtain critical value
Δ; Detailed process is as follows:
First define two kinds of situations:
Situation A:MN does not need to register new address to CN while carrying out in territory switching, and only need to register its LCoA to MAP, and MN mails to the transmitted in packets message of CN and need to pass through MAP.
Situation B: as long as MN has changed couple in router, just must send a BU(binding update messages to CN) register its LCoA.
Then, set up a model for the overhead of system in calculated case A and two kinds of situations of situation B, comprise the binding expense CBB of MN transmission and the transmitted in packets expense CPD that MN is sent to CN, expense embodies with the form of message length and jumping figure product, and model description is as follows:
D (a, b): a is to the jumping figure of b;
Lp: the length of unit message;
LBU: the length of the BU of unit information;
LBACK: the length of the BACK of unit information;
CPD (MN, MAP)=Lpd (MN, MAP) is the transport overhead of unit message from MN to MAP;
CPD (MAP, CN)=Lp d (MAP, CN) is the transport overhead of unit message from MAP to CN; CBU (MN, MAP)=LBUd (MN, MAP) is the expense of unit Binding Update message from MN to MAP;
CBACK (MAP, MN)=LBACKd (MAP, MN) is the expense of unit binding acknowledgement message from MAP to MN;
CBU (MAP, CN)=LBUd (MAP, CN) is the expense of unit Binding Update message from MAP to CN;
CPD (MN, CN)=Lpd (MN, CN), for unit message from MN directly to the transport overhead of CN;
What situation A and situation B represented respectively is that HMIPv6 of the present invention exists
pBR≤
Δwith
pBR>
Δtime territory in switch mode, wherein situation A is also switch mode in the territory of HMIPv6.When
pBR>
Δtime, HMIPv6 of the present invention is because will register new Care-of Address to CN, so have extra binding expense with respect to HMIPv6; And in the setting of this model, the present invention adopts routing optimality packet communication, its transmitted in packets expense is less than HMIPv6(, and this is also the object of using routing optimality packet communication), and transmitted in packets expense and binding expense are respectively with transmitted in packets number and the dynamic change of Binding Update number, so the system overhead of the two must have equal time, as long as therefore make the system overhead of situation A and situation B equate, just can obtain required critical value
Δ.
Situation A, binding expense and transmitted in packets expense are as follows:
C
=?N[CBU(MN，MAP)+?CBACK(MAP，MN)]?；
C
=?M[CPD(MN，MAP)+?CPD(MAP，CN)]?；
System overhead: C
=C
+ C
;
Situation B, the Binding Update that mails under normal circumstances CN does not need to confirm, so CBACK (CN, MN)=0, binding expense and transmitted in packets expense are as follows:
C
?=?N[CBU(MN，MAP)+?CBU(MAP，CN)+?CBU(MN，MAP)+?CBACK(MAP，MN)]?；
C
=M?CPD(MN，CN)；
System overhead: C
=C
+ C
;
Make C
=C
,
That is: C
+ C
=C
+ C
;
Obtain:
Δ=
=
, wherein:
l p length for unit message;
l bU length for unit binding update messages (BU) information;
d(MAP, CN)for the jumping figure of MAP to CN;
d(MN, MAP)for the jumping figure of MN to MAP;
d(MN, CN)for the jumping figure of MN to CN.
Claims (2)
1. a routing optimization method for hierarchy motion Ipv 6, is characterized in that having following steps:
(1) the Binding Update number N that the transmitted in packets number M that in the statistics Binding Update lifetime, mobile node sends to Correspondent Node and mobile node send, ratio calculated
pBR=m/N; By ratio
pBRwith pre-definite critical value Δ=
compare;
l p length for unit message;
l bU length for unit binding update messages information;
d(MAP, CN)for the jumping figure of mobile anchor point to Correspondent Node;
d(MN, MAP)for the jumping figure of mobile node to mobile anchor point;
d(MN, CN)for the jumping figure of mobile node to Correspondent Node;
(2) in territory during switch mode, by mobile node, to mobile anchor point, send local binding update messages, mobile anchor point carries out duplicate address detection to on-link care-of address after receiving local binding update messages, if on-link care-of address is unique, mobile anchor point returns to local binding acknowledgement message to mobile node; If ratio
pBRbe greater than critical value
Δ, mobile node sends binding update messages to register its on-link care-of address, if ratio to Correspondent Node
pBRbe less than or equal to critical value
Δ,adopt the conventional Binding Update mode of switching in hierarchy motion Ipv 6 territory;
(3) between territory during switch mode
,by mobile node, to mobile anchor point, send local binding update messages, mobile anchor point carries out duplicate address detection to regional care-of address after receiving local binding update messages, if regional care-of address is unique, mobile anchor point returns to local binding acknowledgement message to mobile node; Mobile node sends binding update messages to home agent after receiving local binding acknowledgement message, and home agent after receiving is bound home address and regional care-of address, if success is returned to binding acknowledgement message to mobile node; Mobile node is after receiving the binding acknowledgement message that home agent sends, if ratio
pBRbe greater than critical value
Δ, mobile node sends binding update messages to register its on-link care-of address, if ratio to Correspondent Node
pBRbe less than or equal to critical value
Δ, by mobile node, to Correspondent Node, send binding update messages and register its regional care-of address.
2. the routing optimization method of a kind of hierarchy motion Ipv 6 according to claim 1, it is characterized in that: the described Binding Update lifetime of step (1) is divided in territory, the Binding Update lifetime between territory under switch mode, and the Binding Update lifetime in territory under switch mode is to send a local binding update messages to the time of receiving corresponding local binding acknowledgement message from mobile node; The Binding Update lifetime under switch mode between territory is to send a local binding update messages to the time of receiving the binding acknowledgement message that home agent is sent from mobile node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210074709.7A CN102572791B (en) | 2012-03-21 | 2012-03-21 | Routing optimization method for hierarchical mobile Internet protocol version 6 (IPv6) |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210074709.7A CN102572791B (en) | 2012-03-21 | 2012-03-21 | Routing optimization method for hierarchical mobile Internet protocol version 6 (IPv6) |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102572791A CN102572791A (en) | 2012-07-11 |
| CN102572791B true CN102572791B (en) | 2014-08-20 |
Family
ID=46417003
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210074709.7A Expired - Fee Related CN102572791B (en) | 2012-03-21 | 2012-03-21 | Routing optimization method for hierarchical mobile Internet protocol version 6 (IPv6) |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102572791B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107018079A (en) * | 2016-01-27 | 2017-08-04 | 中兴通讯股份有限公司 | Routing aging processing method and processing device |
| CN106487692B (en) * | 2016-09-28 | 2019-07-26 | 中国人民解放军信息工程大学 | Exempt from the hierarchy motion Ipv 6 fast switch over method of duplicate address detection |
| CN109068316A (en) * | 2018-08-23 | 2018-12-21 | 句容市江电电器机械有限公司 | A kind of adaptive mobile anchor point selection method of multiple target cooperation |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20070064256A (en) * | 2005-12-15 | 2007-06-20 | 한국전자통신연구원 | Appartus and method of route optimization in nested network mobility environment |
| CN101072186A (en) * | 2007-06-15 | 2007-11-14 | 清华大学 | IPv6 mobile management selecting method for wireless Internet |
| CN101465811A (en) * | 2009-01-07 | 2009-06-24 | 上海大学 | Method for obligating resource based on layered mobile IPv6 protocol |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2010541304A (en) * | 2007-09-28 | 2010-12-24 | パナソニック株式会社 | System, method and apparatus for mobile node nested in mobile network for optimal path communication |
-
2012
- 2012-03-21 CN CN201210074709.7A patent/CN102572791B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20070064256A (en) * | 2005-12-15 | 2007-06-20 | 한국전자통신연구원 | Appartus and method of route optimization in nested network mobility environment |
| CN101072186A (en) * | 2007-06-15 | 2007-11-14 | 清华大学 | IPv6 mobile management selecting method for wireless Internet |
| CN101465811A (en) * | 2009-01-07 | 2009-06-24 | 上海大学 | Method for obligating resource based on layered mobile IPv6 protocol |
Non-Patent Citations (5)
| Title |
|---|
| H. Soliman ET AL..Protocol Operation.《Hierarchical Mobile IPv6 Mobility Management (HMIPv6)》.2005, * |
| 一种基于改进HMIPv6的移动网络路由优化方案;高天寒等;《东北大学学报(自然科学版)》;20120131;第33卷(第1期);全文 * |
| 任兰芳等.自适应移动IPv6切换时延优化的研究.《北京交通大学学报》.2006,第30卷(第5期), |
| 自适应移动IPv6切换时延优化的研究;任兰芳等;《北京交通大学学报》;20061031;第30卷(第5期);全文 * |
| 高天寒等.一种基于改进HMIPv6的移动网络路由优化方案.《东北大学学报(自然科学版)》.2012,第33卷(第1期), |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102572791A (en) | 2012-07-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100596095C (en) | Hierarchical mobility IPv6 rapid switching method and system | |
| CN101662804B (en) | Mobile terminal device and communication method thereof | |
| CN105246118A (en) | Wireless network communication realization method based on positioning information | |
| US8824353B2 (en) | Mobility route optimization in a network having distributed local mobility anchors | |
| Wang et al. | A routing scheme for connecting delay-sensitive urban vehicular networks to the IPv6-based internet | |
| CN102572791B (en) | Routing optimization method for hierarchical mobile Internet protocol version 6 (IPv6) | |
| Haseeb et al. | Handoff latency analysis of mobile IPv6 protocol variations | |
| JP2006211656A (en) | Method of registering mobile node in mobile ip environment and mobile ip network system using the same | |
| CN103458389A (en) | Mobile node registration method, mobile node mutual communication method, mobile node switching method and network element | |
| CN102958040B (en) | Mobility management network and mobile management inter-domain handover method | |
| Al-Surmi et al. | Hybrid intra/inter-domain handover mechanism for superior performance enhancement within/across ip-based wireless pmipv6 domains network | |
| Céspedes et al. | An efficient hybrid HIP-PMIPv6 scheme for seamless Internet access in urban vehicular scenarios | |
| Berguiga et al. | A fast handover scheme for proxy-based mobility in wireless sensor networks | |
| CN102572790A (en) | Distributed mobile IPV6 (Internet Protocol Version 6) method based on AR (Access Router) level | |
| CN102448190A (en) | Improved layered mobile IPv6 (Internet Protocol Version 6) communication method | |
| Ryu et al. | A Study on NEMO-partially DMM based E2E Seamless Data Integration Transmission Scheme in SOC Public Infrastructures | |
| Woo et al. | A tunnel compress scheme for multi-tunneling in PMIPv6-based nested NEMO | |
| Park et al. | The fast handover scheme for mobile nodes in NEMO-enabled PMIPv6 | |
| Gunasekaran et al. | An efficient handover prediction & initiation algorithm for vehicular communication in 4G wireless networks | |
| CN101742485B (en) | Method and device for transmitting data | |
| WO2009041024A3 (en) | System, method and apparatus for route-optimized communication for a mobile node nested in a mobile network | |
| Mazhar et al. | Cluster based handoff management technique in vanet using backup node | |
| Shima et al. | SHISA: The IPv6 Mobility Framework for BSD Operating Systems | |
| Mitra et al. | An Efficient Fast Handoff and Route Optimization Protocol for the Nested Mobile Networks | |
| Tripathi et al. | One Time Authentication Scheme (OTAS) for Reducing Handover Latency in Proxy Mobile IPv6 |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140820 Termination date: 20160321 |