CN105430703B - Implementation method of the low consumption FMIPv6 switching method in Android terminal - Google Patents
Implementation method of the low consumption FMIPv6 switching method in Android terminal Download PDFInfo
- Publication number
- CN105430703B CN105430703B CN201510741479.9A CN201510741479A CN105430703B CN 105430703 B CN105430703 B CN 105430703B CN 201510741479 A CN201510741479 A CN 201510741479A CN 105430703 B CN105430703 B CN 105430703B
- Authority
- CN
- China
- Prior art keywords
- mobile node
- router
- couple
- new
- address
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W36/00—Hand-off or reselection arrangements
- H04W36/16—Performing reselection for specific purposes
- H04W36/18—Performing reselection for specific purposes for allowing seamless reselection, e.g. soft reselection
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
- H04W52/02—Power saving arrangements
- H04W52/0209—Power saving arrangements in terminal devices
- H04W52/0212—Power saving arrangements in terminal devices managed by the network, e.g. network or access point is master and terminal is slave
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The present invention relates to a kind of implementation method of low consumption FMIPv6 switching method in Android terminal, it is predicted using motion track of the low consumption Apriori method to mobile node, to replace the layer two in FMIPv6 to trigger handover mechanism, to the triggering switching bring negative effect of eliminating layer two, the time attribute of mobile node motion track is used as together with space attribute simultaneously and excavates object data, fully consider time and the space double attribute of motion track, and during generating frequent item set by candidate frequent item set, reduce mobile trajectory data collection scanning range, reduce the time for obtaining candidate, to reach low consumed purpose.Compared to traditional FMIPv6 switching method, low consumption FMIPv6 switching method provided by the invention is more suitable for being realized on the limited mobile terminal of resource.
Description
Technical field
The present invention relates to a kind of implementation method of low consumption FMIPv6 switching method in Android terminal.
Background technique
The booming construction upsurge for also promoting WIFI in the world and accessing hot spot of mobile Internet.However mobile node
Handover delay between two wireless aps is unable to satisfy the performance requirement similar to the high real-time requirementss such as networking telephone App.
In order to realize the seamless switching of mobile device, better wireless networking experience is provided the user with, IETF has formulated one kind and can solve
The certainly network transmission protocol of IP mobility problem --- mobile IP v 6 (MobileIPv6) agreement, it can make mobile device without
It punishes in IPv6 network where, can continuously be communicated with communication node always.Related generally in mobile IPv 6 protocol with
It lower technical term and writes a Chinese character in simplified form:
(1), mobile node (MobileNode, hereinafter referred to as MN)
Refer to mobile IP v 6 host, is to have no need to change its address IPv6 in the case where access point changes, rely on
Its home agent still can be communicated with other nodes；
(2), communication node (CorrespondentNode, hereinafter referred to as CN)
Any node that can be communicated with MN in network；
(3), home agent (HomeAgent, hereinafter referred to as HA)
For recording the router of mobile node registration information and IP address on MN home link；When switching occurs
When, home agent intercepts the data grouping for being sent to moving nodes local address, and is transferring it to MN using tunneling mechanism
The address used；
(4), Care-of Address (Care-ofAddress, hereinafter referred to as CoA)
Refer to that foreign link distributes to mobile node by the interface identifier and foreign subnet prefix information of mobile node
Global unicast routable address, to identify the current location information of mobile node；
(5), home address (HomeAddress, hereinafter referred to as HoA)
The permanent unicast address that mobile node distributes on home link before switching；
(6), couple in router (AccessRouter, hereinafter referred to as AR)
The router that MN is connected in IPv6 network.
In mobile IPv 6 protocol, MN distinguishes identity and station location marker using two different addresses IPv6.When
Its home address (HoA) just is only used as common IPv6 when MN is in link-local；When MN is moved to foreign link
When, then its identity is identified using HoA, its current location is identified with CoA；Mobile IP v 6 is realized by network layer, to upper and lower
Layer is transparent, therefore application layer and transport layer protocol not will receive the influence of node location and address configuration variation.Mobile IP v 6 association
View is on IPv6 network foundation to the supplement of node mobility management.
On the whole, the principle of standard mobile IPv 6 protocol can be summarized as follows:
(1), router notifies whether each node can serve as home agent by broadcast message；
(2), MN selects a home agent router to be registered according to local proxy information；
(3), after registering, this router just becomes the home agent HA of MN, safeguards a MN home address HoA and delivers
The table of comparisons of address CoA, for being sent to the message of MN home address HoA, HA is sent to actual Care-of Address according to the table of comparisons
CoA, this communication process that upper layer application is seen is transparent, therefore this process is referred to as " Triangle routing " process；
(4), can be using Care-of Address CoA as source address when MN is replied to CN, while being attached to home address HoA.It
The message destination address of counterparting communications node CN uses Care-of Address CoA afterwards, but the routing that subsidiary content is home address HoA is selected
Head is selected, guarantees that success can also be sent if MN is mobile.This process dispenses " Triangle routing " process, therefore is referred to as " road
By optimizing "；
(5), it when MN switches, can allow it to be picked up by sending redirection message to original base station.
The original intention of mobile IPv 6 protocol design is exactly to reduce produced by mobile node switches between access routers
Time delay, realization smoothly switches, therefore handoff procedure part is the most important thing of entire agreement.And mobile IPv 6 protocol is entirely cut
The process of changing can be divided into layer two and switch (L2Handover) and the switching of layer three two parts (L3Handover).Wherein, layer two
Switching is also referred to as link layer switching, refers to the process of that mobile node disconnects from former link and is linked to new link；And layer three switches
It is then also known as network layer handoff, router can be received when mobile node enters the coverage area of new couple in router by, which referring to, leads to
Accuse message, then mobile node using in message subnet prefix information carry out Address Autoconfiguration process generate one newly
CoA finally sends BU message to HA and CN.
Three handover delay of layer account for the largest percentage in entire handoff delay, it includes following four parts again: (1) mobile
Detection (MovementDetection, hereinafter referred to as MD): more whether mobile detection refer to link where MN detects itself
Change.In standard mobile IPv 6 protocol, mobile node uses IPv6 neighbor discovery mechanisms
(NeighborDiscoveryProtocol) mobile detection process is realized.This mechanism makes mobile node both can be initiatively
Router request message (RouterSolicitation, hereinafter referred to as RS) is sent to router to determine whether to be additionally attached to work as
On preceding router, it can also be come by router advertisement (RouterAdvertisement, the hereinafter referred to as RA) message received
Judge whether to come into new router coverage area；(2) care-of address configuration: discovery mobile node has been detected by mobile
After moving, mobile IPv 6 protocol require mobile node can be generated by autoconf new CoA come
Indicate the current location of itself.Autoconf in mobile IPv 6 protocol can be divided into stateless and stateful two again
Kind situation, wherein shaftless driving refers to that mobile node connects according to subnet prefix information where itself and network
Mouth mark is to directly generate Care-of Address；(3) duplicate address detection: after new Care-of Address generates, in order to judge in current net
Whether have other nodes in network using the address, needs to carry out uniqueness detection to new Care-of Address before the use, this
Process is referred to as duplicate address detection；During DAD, mobile node is with new Care-of Address address as a purpose, to current chain
Road sends neighbor request message (NeighborSolicitation, hereinafter referred to as NS), if the address be currently it is unique,
Mobile node not will receive any response message；If mobile node receives the response message from other nodes, illustrate this
Address has been used, and needs to redistribute Care-of Address and then carries out DAD process again.It is able to use in new Care-of Address
Before, the communication between mobile node and Correspondent Node can be interrupted, therefore DAD process will cause biggish handoff delay；(4) it binds
Renewal process (BindingUpdate, hereinafter referred to as BU): after new Care-of Address is detected by uniqueness, mobile node to HA with
CN sends BU message.HA, which is received, updates its banding cache list after BU message, complete MN home address and new Care-of Address it
Between binding；Later, for being sent to the message of MN home address, HA is sent to actual Care-of Address according to banding cache list
CoA。
On the other hand, CN equally also will be updated banding cache list after receiving BU message, and reply BAck message to MN.
The message destination address of communication node CN directly uses the Care-of Address CoA of MN later, realizes the routing communicated between MN and CN
Optimization process.
Fast mobile IPv6 agreement (hereinafter referred to as FMIPv6 agreement) is a kind of based on the triggering of layer two (hereinafter referred to as L2)
Pre-switch technology.When L2 triggering, which predicts switching, to be occurred, in the case where keeping MN to communicate with current network, mentioned for it
For new access-in point information and corresponding subnet information, to carry out care-of address configuration and DAD process in advance, MN reaches new
The CoA newly configured can be used directly after network to be communicated, to reduce three handover delay of layer, improve the real-time of communication.
The handoff procedure of FMIPv6 agreement can be summarized as three phases:
First stage is handoff predictions and switching initialization process based on link layer；In the process, MN is detected
It will switch, and be previously-completed the configuration of new Care-of Address using RtSolPr message and PrRtAdv message and DAD is detected
Process, new Care-of Address can directly use after MN enters the region NAR；
Second stage is preceding couple in router (PreviousAccessRouter, hereinafter referred to as PAR) and new access road
The process that binding updates is established and executed by tunnel between device (NewAccessRouter, hereinafter referred to as NAR)；When MN is switched to
After new network, execute binding renewal process first with FBU message, then by HI and Hack message PAR and NAR it
Between establish a bidirectional tunnel, be sent to the data packet of MN for forwarding in binding renewal process, FBA message is complete finally by sending
At binding renewal process；
The last stage is then the process of the data grouping of forwarding cache；MN is current by sending FNA message informing PAR
It is already attached to NAR, PAR starts the data grouping of caching being forwarded to NAR later.
Android terminal is a kind of intelligent mobile terminal very widely used at present, how to be cut low consumption FMIPv6
Method is changed to realize in Android terminal and the technical issues of current urgent need to resolve.
Summary of the invention
The technical problem to be solved by the present invention is to provide a kind of switching side low consumption FMIPv6 for the above-mentioned prior art
Implementation method of the method in Android terminal, wherein low consumed FMIPv6 switching method can effectively eliminate the triggering switching of layer two
Bring negative effect, while lower power consumption, and low consumption FMIPv6 switching method can be real in Android terminal
It is existing.
The technical scheme of the invention to solve the technical problem is: low consumption FMIPv6 switching method exists
Implementation method in Android terminal, it is characterised in that: the low consumption FMIPv6 switching method increases following type of message
With data structure: (1), access route advertisement message (AR_Notify), by mobile node (MN) couple in router (PAR) forward
It sends, and is transmitted to new couple in router (NAR) by preceding couple in router (PAR), working as comprising mobile node (MN) in message
The new couple in router that preceding Care-of Address (PCoa) and home address prefix and low consumption Apriori method are predicted
(NAR) information；(2), access routing notification acknowledgement (AR_Notify_Ack): as receiving access route advertisement message
(AR_Notify) response, access route in notification acknowledgement (AR_Notify_Ack) and contain new couple in router
(NAR) obtained new Care-of Address (NCoa) is configured for mobile node (MN)；(3), Care-of Address list (NCoa_ is predicted
List), safeguarded by mobile node (MN), there is low consumption Apriori method inside and each of predicts new couple in router
(NAR) it receives after the access route advertisement message (AR_Notify) of mobile node (MN) as the new Care-of Address of its configuration
(NCoa)；
The low consumption FMIPv6 switching method includes the following steps
Step 1, mobile node (MN) are predicted to obtain n new access routings before the handover by low consumption Apriori method
Device (NAR), pre-switch starts rear mobile node (MN), and couple in router (PAR) sends access route advertisement message (AR_ forward
Notify)
Step 2, preceding couple in router will access route advertisement message (AR_Notify) and be forwarded to n new couple in routers
(NAR) after, each new couple in router (NAR) is according to mobile node (MN) family in route advertisement message (AR_Notify)
Township's address prefix and the link information of itself be mobile node (MN) complete the distribution of new Care-of Address (NCoa) with repeatedly
Location detection process, finally couple in router (PAR) responds access routing notification acknowledgement (AR_Notify_Ack) forward；
Step 3, preceding couple in router (PAR), which receive, carrys out all access routing notices from new couple in router (NAR)
After confirmation message (AR_Notify_Ack), the bidirectional tunnel establishment process between each new couple in router (NAR) is completed,
And be forwarded to access routing notification acknowledgement (AR_Notify_Ack) message mobile node (MN), mobile node (MN) mentions
It is added it in prediction Care-of Address list (NCoa_list) after taking out new Care-of Address (NCoa), pre-switch process is completed；
After step 4, the triggering switching of layer two start, preceding couple in router (PAR) will by the bidirectional tunnel established in step 3
The data grouping for being sent to mobile node (MN) is forwarded to n new couple in routers (NAR) of prediction, each new couple in router
(NAR) caching is sent to the packet data of the new Care-of Address (NCoa) of mobile node (MN)；
Step 5, mobile node (MN) receive the access routing notification acknowledgement of new couple in router (NAR) broadcast
(AR_Notify_Ack), show that mobile node (MN) comes into currently practical new couple in router (NARtrue) covering model
It encloses, layer three (L3) switching starts, and mobile node (MN) takes out currently practical new from prediction Care-of Address list (NCoa_list)
Couple in router (NARtrue) tied up for the new Care-of Address (NCoa) of its distribution to home agent (HA)/communication node (CN) transmission
Fixed to update request, the data in deletion prediction Care-of Address list (NCoa_list) are therewith to save mobile node (MN) resource；
Last mobile node (MN) sends fast neighbor advertisement message (FNA) to currently practical new couple in router (NARtrue)；
Step 6, currently practical new couple in router (NARtrue) will steps after receiving fast neighbor advertisement message (FNA)
The data grouping cached in rapid 4 is forwarded to the new Care-of Address of mobile node (MN), and then couple in router (PAR) is sent forward
Quickly binding updates message (FBU), and new couple in router (NARtrue) currently practical later does not have to cache again to be sent to mobile node
(MN) data grouping of new Care-of Address；
After step 7, preceding couple in router (PAR) receive quick binding acknowledgement message (FBA), cancel and remaining n-1
Bidirectional tunnel between the new couple in router (NAR) of prediction, the data grouping for being sent to mobile node (MN) still need tunnel
It is forwarded to currently practical new couple in router (NARtrue), until mobile node (MN) receives home agent (HA)/communication section
The binding acknowledgement message of point (CN)；
Step 8, mobile node (MN) receive binding acknowledgement message, and expression layer three (L3) switching has been completed, Zhi Houjia
Data grouping is directly sent to the new Care-of Address (NCoa) of mobile node (MN) by township agency (HA)/communication node (CN), no longer
Need the participation of preceding couple in router (PAR)；
The low consumption Apriori method is used to excavate the association movement rule of mobile node motion track, and
Predict the next motion track of mobile node, it includes following steps:
Step 1: concentrating all frequent item sets using the mobile trajectory data that alternative manner excavates mobile node, and record
The date of each frequent item set calculates the support of each frequent item set；
In this step, the time attribute of the motion track of mobile node is used as together with space attribute and excavates number of objects
According to, indicate that the mobile trajectory data collection of mobile node, every transaction entries motion track record are indicated with affairs database D,
Every motion track record is then formed with multiple track datas, track data p1, p2... pn-2, pn-1, pnIt indicates, wherein Pn=
{(cn, tn)|cn∈ C, tn∈ T }, mobile node is represented in time point tnRouter c is accessedn, set C represents mobile node day
All couple in routers often passed through, T represent the X period set divided daily, X=12 or 24 or 48 or 72；And it introduces
ID number is recorded to identify the motion track of each mobile node；The step 1 is specifically realized by such as under type:
(1-1), entire transaction database D acquisition 1- candidate C is traversed first1, then calculate 1- candidate C1In it is every
The support of a candidate item, while all record ID numbers comprising the candidate item are identified, finally delete 1- candidate C1In
Support is less than the candidate item of minimum support threshold value, has just obtained 1- frequent item set L1；
(1-2), 1- frequent item set L is utilized1Connection operation calculates 2- candidate C in carrying out2, calculate 2- candidate
C2In the support of each candidate item be by by 2- candidate C2In each 2- candidate item split into several individual 1- frequencies
Numerous item；
(1-3), the smallest 1- frequent episode of support in the 1- frequent episode that all (1-2) are split out is found out, while finds out institute
There is the record ID number comprising the 1- frequent episode；
The motion track of record ID number obtained in (1-4), traversal (1-3) records to calculate the branch of every candidate frequent episode
Degree of holding finally deletes 2- candidate C2The candidate item that middle support is less than minimum support threshold value has just obtained 2- frequent item set
L2；
(1-5), 3- frequent item set L3Acquisition be equally need to split into 3- frequent episode into several individual 1- it is frequent
, remaining calculating process and 2- frequent item set L2It is identical, and so on, calculate k- frequent item set Lk, until that can not regenerate frequently
Until；
Step 2: the frequent item set obtained using step 1, generates all possible association movement rule of mobile node, and
Calculate the confidence level of every movement rule；
Step 3: every association of date and calculating of mobile node every association movement rule is moved in recording step two
The far and near of regular date changes the factor；Meanwhile the factor is changed according to the date distance of the date of record and calculating, calculate every pass
The date weighted value TWeight (R) for joining movement rule, to obtain High relevancy movement rule；Wherein, the mobile rule of every association
Then date corresponding remote variation factor m and nearly variation factor of n calculation formula are as follows:
Date weighted value TWeight (R) calculation formula of every association movement rule is as follows:
Wherein, RuleDate, MaxDate and MinData respectively indicate the date of movement rule, mobile trajectory data collection
In nearest record date and farthest record date；M is the change for the nearest record date MaxDate that mobile trajectory data is concentrated
Reason, i.e., far change the factor；N is the variation factor for the farthest record date MinData that mobile trajectory data is concentrated, i.e., close to become
Reason；K is total number of days of the moon where movement rule date RuleDate, RuleDatekIndicate the date of the middle of the month kth day
Value；
Step 4: predicting mobile node according to the strong association movement rule that mobile node current track and step 3 generate
Next motion track:
It is assumed that the motion track of current mobile node is T:(cn,tn)→(cm,tm), the relevant movement rule of traversal institute, such as
Fruit association movement rule R includes that motion track T then illustrates that being associated with movement rule R is matched movement rule, then according to the following formula
The matching degree of association movement rule R is calculated, matching degree gets over Gao Zeyue and is likely to be the next motion track of mobile node:
Score (R)=Confidence (R)+TWeight (R)
Wherein, Score (R) is the matching degree for being associated with movement rule R, and Confidence (R) is to be associated with setting for movement rule R
Reliability, TWeight (R) are the date weighted value for being associated with movement rule R；
Record the number of new couple in router (NAR) in the next motion track of mobile node；
Mobile node (MN) with android system is known as Android terminal；
In terms of implementation method of the FMIPv6 switching method in Android terminal, including following three:
The first, mobile trajectory data collection is stored in the miniature relevant database SQLite carried in Android terminal；
The second, it is non-to be placed on Android terminal for the operating process of step 1 and step 2 in the described low consumption Apriori method
Switching time section is completed, and step 3 is then executed when Android terminal switches and starts in the low consumption Apriori method；
Third, the FMIPv6 switching method are realized in Android terminal inner nuclear layer；The consumption side Apriori
Method uses C Plus Plus in the form of library file in the system class libraries layer realization of Android terminal or the consumption side Apriori
Method is realized in Android terminal in the form of application program with Java language.
Compared with the prior art, the advantages of the present invention are as follows: the movement using low consumption Apriori method to mobile node
Track is predicted, to replace the layer two in FMIPv6 to trigger handover mechanism, so that it is negative to eliminate the triggering switching bring of layer two
Face is rung, while the time attribute of mobile node motion track being used as together with space attribute and excavates object data, is sufficiently examined
Time and the space double attribute of motion track are considered, and during generating frequent item set by candidate frequent item set, contracting
Small mobile trajectory data collection scanning range reduces the time for obtaining candidate, to reach low consumed purpose.It compares
In traditional FMIPv6 switching method, FMIPv6 switching method provided by the invention is more suitable in the limited mobile terminal of resource
On realized.
Detailed description of the invention
Fig. 1 is the switching flow figure of the FMIPv6 switching method based on moving projection in the embodiment of the present invention；
Fig. 2 is low consumption Apriori method flow diagram in the embodiment of the present invention.
Specific embodiment
The present invention will be described in further detail below with reference to the embodiments of the drawings.
The handoff delay of mobile node is to influence one of most important reason of real-time performance.FMIPv6 switching method is utilized
Layer two trigger (hereinafter referred to as L2) handoff predictions mechanism, on the one hand can fulfil the Care-of Address of network layer handoff process ahead of schedule
Configuration and duplicate address detection, to be effectively reduced handover delay；On the other hand but due to the inaccuracy of predicted time and
False L2 occurs and triggers phenomenon, generates additional handover delay expense, influences switching efficiency.In fact, the movement of mobile node
Track data often has periodicity, and the low consumption Apriori algorithm proposed in the present embodiment is especially suitable for this kind of relevance
Stronger data can concentrate the shifting excavated high relevance movement rule, and then carry out high accuracy from mobile trajectory data
Dynamic prediction.The low-power consumption FMIPv6 switching method based on moving projection proposed in the present embodiment utilizes the Apriori of low-power consumption
Method predicts the motion track of mobile node, trigger mechanism is predicted instead of the L2 in FMIPv6 switching method, to disappear
In addition to L2 triggering bring negative effect.
Low consumption Apriori method as shown in Figure 2 is carried out for the association movement rule to mobile node motion track
It excavates, and predicts the next motion track of mobile node, it includes following steps:
Step 1: excavating all frequent item sets of object dataset using alternative manner, and record each frequent item set
Date calculates the support of each frequent item set；In the step, by the time attribute of the motion track of intelligent mobile terminal and sky
Between attribute together as object data is excavated, indicate the mobile trajectory data collection of intelligent mobile terminal with affairs database D, every
Transaction entries motion track record indicates that every motion track record is then formed with multiple track datas, track data p1,
p2... pn-2, pn-1, pnIt indicates, wherein pn={ (cn,tn)|cn∈C,tn∈ T }, mobile node is represented in time point tnRoad is accessed
By device cn, set C represents all couple in routers of the daily process of mobile node, and T represents the X period collection divided daily
It closes, X=12 or 24 or 48 or 72；And record ID number is introduced to identify the motion track of each intelligent mobile terminal；The step
Rapid one is specifically realized by such as under type:
(1), entire transaction database D is traversed first obtains 1- candidate C1, then calculate 1- candidate C1In it is each
The support of candidate item, while all record ID numbers comprising the candidate item are identified, finally delete 1- candidate C1Middle branch
Degree of holding is less than the candidate item of minimum support threshold value, has just obtained 1- frequent item set L1；
(2), 1- frequent item set L is utilized1Connection operation calculates 2- candidate C in carrying out2, calculate 2- candidate C2
In the support of each candidate item be by by 2- candidate C2In each 2- candidate item split into several individual 1- frequencies
Numerous item；Here connection operation is existing conventional techniques in；
(3), the smallest 1- frequent episode of support in the 1- frequent episode that all (2) are split out is found out, while finding out all packets
Record ID number containing the 1- frequent episode；
(4), the motion track record of record ID number obtained in (3) is traversed to calculate the support of every candidate frequent episode
Degree finally deletes 2- candidate C2The candidate item that middle support is less than minimum support threshold value has just obtained 2- frequent item set L2；
(5), 3- frequent item set L3Acquisition be equally to need to split into 3- frequent episode several individual 1- frequent episodes,
Remaining calculating process and 2- frequent item set L2It is identical, and so on, calculate k- frequent item set Lk, until frequent episode can not be regenerated
Until；
Step 2: the frequent item set obtained using step 1, generates all possible association movement rule of mobile node, and
Calculate the confidence level of every movement rule；The all possible association movement rule process of mobile node and tradition are generated in the step
Apriori method is identical, and the method for calculating the confidence level of every movement rule is also identical as traditional Apriori method, as existing
There is routine techniques, is not described in detail existing conventional techniques herein；
And in the step, while recording the date of mobile node every association movement rule and calculating every association movement
The far and near of regular date changes the factor；Meanwhile the factor is changed according to the date distance of the date of record and calculating, calculate every pass
The date weighted value TWeight (R) for joining movement rule, to obtain High relevancy movement rule；Wherein, the mobile rule of every association
Then date corresponding remote variation factor m and nearly variation factor of n calculation formula are as follows:
Date weighted value TWeight (R) calculation formula of every association movement rule is as follows:
Wherein, RuleDate, MaxDate and MinData respectively indicate the date of movement rule, mobile trajectory data collection
In nearest record date and farthest record date；M is the change for the nearest record date MaxDate that mobile trajectory data is concentrated
Reason, i.e., far change the factor；N is the variation factor for the farthest record date MinData that mobile trajectory data is concentrated, i.e., close to become
Reason；K is total number of days of the moon where movement rule date RuleDate, RuleDatekIndicate the date of the middle of the month kth day
Value；For example, the movement rule date RuleDate is 27 days 2 months, then K=28；RuleDate25=25；For another example, the movement rule
Date RuleDate is March 1, then K=31, RuleDate26=26；It is corresponding by introducing every association movement rule date
It is remote to change factor m and nearly variation factor of n, accurate positionin can be made to the date where every association movement rule, to eliminate day
Phase changes to subsequent calculation date weighted value bring influence of fluctuations, improves the counting accuracy of date weighted value
Step 3: being predicted under mobile node according to the association movement rule that mobile node current track and step 2 generate
One motion track:
It is assumed that the motion track of current mobile node is T:(cx,tx)→(cy,ty), the relevant movement rule of traversal institute, such as
Fruit association movement rule R includes that motion track T then illustrates that being associated with movement rule R is matched movement rule, then according to the following formula
The matching degree of association movement rule R is calculated, matching degree gets over Gao Zeyue and is likely to be the next motion track of mobile node:
Score (R)=Confidence (R)+TWeight (R)
Wherein, Score (R) is the matching degree for being associated with movement rule R, and Confidence (R) is to be associated with setting for movement rule R
Reliability, TWeight (R) are the date weighted value for being associated with movement rule R.
Alternative manner excavation object data is used to specifically describe step 1 in the embodiment of the present invention with an example below
The implementation procedure of all frequent item sets is concentrated, algorithm input is mobile trajectory data collection shown in following table, and internal data is simultaneously
It is recorded with the motion track of time and space attribute, minimum support threshold value is then set as 3, X=48:
Mobile trajectory data collection D
| Record ID | Motion track record |
| T1 | (1,t1),(2,t2)(5,t5) |
| T2 | (2,t2),(4,t4) |
| T3 | (2,t2),(4,t4) |
| T4 | (1,t1),(2,t2),(4,t4) |
| T5 | (1,t1),(3,t3) |
| T6 | (2,t2),(3,t3) |
| T7 | (1,t1),(3,t3) |
| T8 | (1,t1),(2,t2),(3,t3),(5,t5) |
| T9 | (1,t1),(2,t2),(3,t3) |
Entire mobile trajectory data collection D is traversed first obtains 1- candidate C1, then calculate 1- candidate C1In it is each
The support of candidate item, while all record ID numbers comprising the candidate item are identified, finally delete 1- candidate C1Middle branch
The candidate item that degree of holding is less than minimum support threshold value has just obtained 1- frequent item set L1, it is as shown in the table:
1- frequent item set L1
| Frequent episode | Support | Record ID s | |
| (1,t1) | 6 | T1,T4,T5,T7,T8,T9 | |
| (2,t2) | 7 | T1,T2,T3,T4,T6,T8,T9 | |
| (3,t3) | 5 | T5,T6,T7,T8,T9 | |
| (4,t4) | 3 | T2,T3,T4 | |
| (5,t5) | 2 | T1,T8 | It deletes |
Following step be by 1- frequent item set connect operation in the way of calculate 2- candidate C2, calculate C2
In the support of each candidate item be by by 2- candidate C2In each 2- candidate item to split into two individual 1- frequent
, then scanning records comprising all motion tracks of the lesser frequent episode of support in two 1- frequent episodes and no longer passes through
Entire mobile trajectory data collection D is traversed to obtain.Such as the 2- candidate item (1, t in following table1),(2,t2) two can be split into
Frequent episode (1, t1) and (2, t2), by inquiring 1- frequent item set L1It is known that (1, t1) support be less than (2, t2), therefore
Calculate (1, t1),(2,t2) support just only need to scan record ID number be T1、T4、T5、T7、T8、T9Motion track record, most
2- candidate C is deleted afterwards2The candidate item that middle support is less than minimum support threshold value has just obtained 2- frequent item set L2, as follows
Shown in table:
2- frequent item set L2
| 2- candidate item | Support | 1- frequent episode | Record ID s | |
| (1, t1), (2, t2) | 4 | (1, t1) | T1, T4, T5, T7, T8, T9 | |
| (1, t1), (3, t3) | 4 | (3, t3) | T5, T6, T7, T8, T9 | |
| (1, t1), (4, t4) | 1 | (4, t4) | T2, T3, T4 | It deletes |
| (2, t2), (3, t3) | 3 | (3, t3) | T5, T6, T7, T8, T9 | |
| (2, t2), (4, t4) | 3 | (4, t4) | T2, T3, T4 | |
| (3, t3), (4, t4) | 0 | (4, t4) | T2, T3, T4 | It deletes |
3- frequent item set L3Acquisition be then to need to split into 3- frequent episode three individual 1- frequent episodes, remaining calculating
Process and 2- frequent item set L2It is identical, and so on go out k- frequent item set Lk, until can not regenerate frequent episode, following table is
3- frequent item set L3:
3- frequent item set L3
| 3- candidate item | Support | 1- frequent episode | Record ID s | |
| (1, t1), (2, t2), (3, t3) | 2 | (3, t3) | T5, T6, T7, T8, T9 | It deletes |
| (1, t1), (2, t2), (4, t4) | 1 | (4, t4) | T2, T3, T4 | It deletes |
| (1, t1), (3, t3), (4, t4) | 0 | (4, t4) | T2, T3, T4 | It deletes |
| (2, t2), (3, t3), (4, t4) | 0 | (4, t4) | T2, T3, T4 | It deletes |
In existing Apriori method, entire shifting is needed to be traversed for during generating frequent item set by candidate frequent item set
Dynamic rail mark data set D calculates the support of every candidate frequent episode；And mode provided in this embodiment, reduce motion track
Data set scanning range reduces the time for obtaining candidate, so as to reach low consumed purpose.
Specifically describe the execution of Apriori method in the embodiment of the present invention with another specific example again below
Journey, following table are specific transaction database a D, X=48:
All frequent item sets in transaction database D are excavated using the method that the step one in the present embodiment describes, as a result
It is as shown in the table:
| Frequent item set | Support | Date |
| (2, t4), (8, t18) | x | 2.28 |
| (2, t4), (4, t24) | y | 3.1 |
| (2, t4), (8, t18), (4, t24) | z | 3.2 |
| (8, t18), (4, t24) | w | 3.3 |
| …… | …… | …… |
| …Pn-2, Pn-1, Pn | > min_supp | date |
The all possible association movement rule of mobile node is generated using frequent item set, and calculates setting for every movement rule
Reliability, as a result as shown in the table:
| Date | It is associated with movement rule | Confidence level |
| 2.28 | (2, t4) → (8, t18) | 95% |
| 3.1 | (2, t4) → (4, t24) | 91% |
| 3.2 | (2, t4), (8, t18) → (4, t24) | 87% |
| 3.3 | (8, t18) → (4, t24) | 90% |
| …… | …… | …… |
| date | rn-1→rn | > min_conf |
The date of mobile node every association movement rule of record and the distance for calculating every association movement rule date
Change the factor；Meanwhile the factor is changed according to the date distance of the date of record and calculating, calculate the day of every association movement rule
Phase weighted value TWeight (R), to obtain High relevancy movement rule, wherein every association movement rule date is corresponding remote
It changes factor m and nearly variation factor of n calculation formula is as follows:
Date weighted value TWeight (R) calculation formula of every association movement rule is as follows:
Wherein, RuleDate, MaxDate and MinData respectively indicate the date of movement rule, mobile trajectory data collection
In nearest record date and farthest record date；M is the change for the nearest record date MaxDate that mobile trajectory data is concentrated
Reason, i.e., far change the factor；N is the variation factor for the farthest record date MinData that mobile trajectory data is concentrated, i.e., close to become
Reason；K is total number of days of the moon where movement rule date RuleDate, and RuleDatek indicates the date of the middle of the month kth day
Value, as a result as shown in the table:
| Date | It is associated with movement rule | Confidence level | Date weight |
| 2.28 | (2, t4) → (8, t1s) | 95% | w1 |
| 3.1 | (2, t4) → (4, t24) | 91% | w2 |
| 3.2 | (2, t4), (8, t18) → (4, t24) | 87% | w3 |
| 3.3 | (8, t18) → (4, t24) | 90% | w4 |
| …… | …… | …… | …… |
| date | rn-1→rn | > min_conf | wn |
According to mobile node current track and association movement rule, the next motion track of mobile node is predicted:
It is assumed that the motion track of current mobile node is T:(2, t4) → (8, t18), the relevant movement rule of traversal institute, such as
Fruit association movement rule R includes that motion track T then illustrates that being associated with movement rule R is matched movement rule, then according to the following formula
The matching degree of association movement rule R is calculated, matching degree gets over Gao Zeyue and is likely to be the next motion track of mobile node:
Score (R)=Confidence (R)+TWeight (R)
Wherein, Score (R) is the matching degree for being associated with movement rule R, and Confidence (R) is to be associated with setting for movement rule R
Reliability, TWeight (R) are the date weighted value for being associated with movement rule R；
As a result as shown in the table:
| Prediction output | Matching degree |
| (2, t4), (8, t18) → (4, t24) | …… |
| …… | …… |
Finally prediction output (4, t24), i.e., mobile node is most likely at time point t24No. 4 routers are accessed.
The low consumption FMIPv6 switching method based on moving projection in the present embodiment, increases following type of message and data
Structure: (1), accessing route advertisement message (AR_Notify), and by mobile node (MN), couple in router (PAR) is sent forward, and
It is transmitted to new couple in router (NAR) by preceding couple in router (PAR), currently delivers ground comprising mobile node (MN) in message
New couple in router (NAR) information that location (PCoa) and home address prefix and low consumption Apriori method are predicted；
(2), access routing notification acknowledgement (AR_Notify_Ack): route advertisement message (AR_Notify) is accessed as receiving
Response, access routing notification acknowledgement (AR_Notify_Ack) in contains new couple in router (NAR) be mobile node
(MN) obtained new Care-of Address (NCoa) is configured；(3), Care-of Address list (NCoa_list) is predicted, by mobile node (MN)
There is low consumption Apriori method maintenance, inside and each of predicts that new couple in router (NAR) receives mobile node
It (MN) is the new Care-of Address (NCoa) of its configuration after access route advertisement message (AR_Notify)；
The low consumption FMIPv6 switching method includes the following steps, shown in Figure 1:
Step 1, mobile node (MN) are predicted to obtain n new access routings before the handover by low consumption Apriori method
Device (NAR), pre-switch starts rear mobile node (MN), and couple in router (PAR) sends access route advertisement message (AR_ forward
Notify)
Step 2, preceding couple in router will access route advertisement message (AR_Notify) and be forwarded to n new couple in routers
(NAR) after, each new couple in router (NAR) is according to mobile node (MN) family in route advertisement message (AR_Notify)
Township's address prefix and the link information of itself be mobile node (MN) complete the distribution of new Care-of Address (NCoa) with repeatedly
Location detection process, finally couple in router (PAR) responds access routing notification acknowledgement (AR_Notify_Ack) forward；
Step 3, preceding couple in router (PAR), which receive, carrys out all access routing notices from new couple in router (NAR)
After confirmation message (AR_Notify_Ack), the bidirectional tunnel establishment process between each new couple in router (NAR) is completed,
And be forwarded to access routing notification acknowledgement (AR_Notify_Ack) message mobile node (MN), mobile node (MN) mentions
It is added it in prediction Care-of Address list (NCoa_list) after taking out new Care-of Address (NCoa), pre-switch process is completed；
After step 4, the triggering switching of layer two start, preceding couple in router (PAR) will by the bidirectional tunnel established in step 3
The data grouping for being sent to mobile node (MN) is forwarded to n new couple in routers (NAR) of prediction, each new couple in router
(NAR) caching is sent to the packet data of the new Care-of Address (NCoa) of mobile node (MN)；
Step 5, mobile node (MN) receive the access routing notification acknowledgement of new couple in router (NAR) broadcast
(AR_Notify_Ack), show that mobile node (MN) comes into currently practical new couple in router (NARtrue) covering model
It encloses, layer three (L3) switching starts, and mobile node (MN) takes out currently practical new from prediction Care-of Address list (NCoa_list)
Couple in router (NARtrue) tied up for the new Care-of Address (NCoa) of its distribution to home agent (HA)/communication node (CN) transmission
Fixed to update request, the data in deletion prediction Care-of Address list (NCoa_list) are therewith to save mobile node (MN) resource；
Last mobile node (MN) sends fast neighbor advertisement message (FNA) to currently practical new couple in router (NARtrue)；
Step 6, currently practical new couple in router (NARtrue) will steps after receiving fast neighbor advertisement message (FNA)
The data grouping cached in rapid 4 is forwarded to the new Care-of Address of mobile node (MN), and then couple in router (PAR) is sent forward
Quickly binding updates message (FBU), and new couple in router (NARtrue) currently practical later does not have to cache again to be sent to mobile node
(MN) data grouping of new Care-of Address；
After step 7, preceding couple in router (PAR) receive quick binding acknowledgement message (FBA), cancel and remaining n-1
Bidirectional tunnel between the new couple in router (NAR) of prediction, the data grouping for being sent to mobile node (MN) still need tunnel
It is forwarded to currently practical new couple in router (NARtrue), until mobile node (MN) receives home agent (HA)/communication section
The binding acknowledgement message of point (CN)；
Step 8, mobile node (MN) receive binding acknowledgement message, and expression layer three (L3) switching has been completed, Zhi Houjia
Data grouping is directly sent to the new Care-of Address (NCoa) of mobile node (MN) by township agency (HA)/communication node (CN), no longer
Need the participation of preceding couple in router (PAR).
Low consumption Apriori method needs to carry out data mining to a large amount of mobile trajectory datas, it is contemplated that mobile node
Resource is limited, and time-consuming can be relatively long, therefore the FMIPv6 switching method proposed by the present invention based on moving projection consumes height
Data mining part resource idle period complete；
Mobile node (MN) with android system is known as Android terminal；
In terms of implementation method of the low consumption FMIPv6 switching method in Android terminal, including following three:
The first, mobile trajectory data collection is stored in the miniature relevant database SQLite carried in Android terminal；
The second, it is non-to be placed on Android terminal for the operating process of step 1 and step 2 in the described low consumption Apriori method
Switching time section is completed, and step 3 is then executed when Android terminal switches and starts in the low consumption Apriori method；
Third, the low consumption FMIPv6 switching method are realized in Android terminal inner nuclear layer；The consumption
Apriori method uses C Plus Plus in the form of library file in the system class libraries layer realization of Android terminal or the consumption
Apriori method is realized in Android terminal in the form of application program with Java language.
Claims (1)
1. implementation method of the low consumption FMIPv6 switching method in Android terminal, it is characterised in that: the low consumption
FMIPv6 switching method increases following type of message and data structure: (1), access route advertisement message (AR_Notify), by
Couple in router (PAR) is sent mobile node (MN) forward, and is transmitted to new couple in router by preceding couple in router (PAR)
(NAR), the current care of address (PCoa) in message comprising mobile node (MN) and home address prefix and low consumption
New couple in router (NAR) information that Apriori method is predicted；(2), access routing notification acknowledgement (AR_
Notify_Ack): as the response for receiving access route advertisement message (AR_Notify), access routing notification acknowledgement
(AR_Notify_Ack) it is that mobile node (MN) configures obtained new Care-of Address that new couple in router (NAR) is contained in
(NCoa)；(3), it predicts Care-of Address list (NCoa_list), safeguards that there is low consumption inside by mobile node (MN)
Apriori method each of predicts that new couple in router (NAR) receives the access routing notice of mobile node (MN) and disappears
It is the new Care-of Address (NCoa) of its configuration after breath (AR_Notify)；
The low consumption FMIPv6 switching method includes the following steps:
Step 1, mobile node (MN) are predicted to obtain n new couple in routers before the handover by low consumption Apriori method
(NAR), pre-switch starts rear mobile node (MN) couple in router (PAR) transmission access route advertisement message (AR_ forward
Notify)；
Step 2, preceding couple in router will access route advertisement message (AR_Notify) and be forwarded to n new couple in routers (NAR)
Later, each new couple in router (NAR) is according to mobile node (MN) home address in route advertisement message (AR_Notify)
Prefix and the link information of itself are the distribution and duplicate address detection that mobile node (MN) completes new Care-of Address (NCoa)
Process, finally couple in router (PAR) responds access routing notification acknowledgement (AR_Notify_Ack) forward；
Step 3, preceding couple in router (PAR), which receive, carrys out all access routing Notification Validations from new couple in router (NAR)
After message (AR_Notify_Ack), the bidirectional tunnel establishment process between each new couple in router (NAR) is completed, and will
Access routing notification acknowledgement (AR_Notify_Ack) message is forwarded to mobile node (MN), and mobile node (MN) extracts
It is added it in prediction Care-of Address list (NCoa_list) after new Care-of Address (NCoa), pre-switch process is completed；
After step 4, the triggering switching of layer two start, preceding couple in router (PAR) will be sent to by the bidirectional tunnel established in step 3
The data grouping of mobile node (MN) is forwarded to n new couple in routers (NAR) of prediction, each new couple in router (NAR)
Caching is sent to the packet data of the new Care-of Address (NCoa) of mobile node (MN)；
Step 5, mobile node (MN) receive the access routing notification acknowledgement (AR_ of new couple in router (NAR) broadcast
Notify_Ack), show that mobile node (MN) comes into currently practical new couple in router (NARtrue) coverage area, layer
Three (L3) switching starts, and mobile node (MN) takes out currently practical new access from prediction Care-of Address list (NCoa_list)
Router (NARtrue) bound more for the new Care-of Address (NCoa) of its distribution to home agent (HA)/communication node (CN) transmission
New request, the data in deletion prediction Care-of Address list (NCoa_list) are therewith to save mobile node (MN) resource；Finally
Mobile node (MN) sends fast neighbor advertisement message (FNA) to currently practical new couple in router (NARtrue)；
Step 6, currently practical new couple in router (NARtrue) will be in steps 4 after receiving fast neighbor advertisement message (FNA)
The data grouping of caching is forwarded to the new Care-of Address of mobile node (MN), and then couple in router (PAR) is sent quickly forward
Binding updates message (FBU), and new couple in router (NARtrue) currently practical later does not have to cache again to be sent to mobile node (MN)
The data grouping of new Care-of Address；
After step 7, preceding couple in router (PAR) receive quick binding acknowledgement message (FBA), cancel and remaining n-1 prediction
New couple in router (NAR) between bidirectional tunnel, being sent to the data grouping of mobile node (MN), there is still a need for tunnel forwardings
To currently practical new couple in router (NARtrue), until mobile node (MN) receives home agent (HA)/communication node
(CN) binding acknowledgement message；
Step 8, mobile node (MN) receive binding acknowledgement message, and expression layer three (L3) switching has been completed, later local generation
Data grouping is directly sent to the new Care-of Address (NCoa) of mobile node (MN) by reason (HA)/communication node (CN), it is no longer necessary to
The participation of preceding couple in router (PAR)；
The low consumption Apriori method is predicted for excavating to the association movement rule of mobile node motion track
The next motion track of mobile node, it includes following steps:
Step 1: concentrating all frequent item sets using the mobile trajectory data that alternative manner excavates mobile node, and record each
The date of frequent item set calculates the support of each frequent item set；
In this step, the time attribute of the motion track of mobile node is used as together with space attribute and excavates object data,
Indicate that the mobile trajectory data collection of mobile node, every transaction entries motion track record are indicated with affairs database D, every
Motion track record is then formed with multiple track datas, track data p1,p2,…pn-2,pn-1,pnIt indicates, wherein pn={ (cn,
tn)|cn∈C,tn∈ T }, mobile node is represented in time point tnRouter c is accessedn, set C represents the daily process of mobile node
All couple in routers, T represents X period dividing daily and gathers, X=12 or 24 or 48 or 72；And introduce Record ID
Number identify the motion track of each mobile node；The step 1 is specifically realized by such as under type:
(1-1), entire transaction database D acquisition 1- candidate C is traversed first1, then calculate 1- candidate C1In each time
The support of option, while all record ID numbers comprising the candidate item are identified, finally delete 1- candidate C1Middle support
Degree is less than the candidate item of minimum support threshold value, has just obtained 1- frequent item set L1；
(1-2), 1- frequent item set L is utilized1Connection operation calculates 2- candidate C in carrying out2, calculate 2- candidate C2In
The support of each candidate item is by by 2- candidate C2In each 2- candidate item to split into several individual 1- frequent
?；
(1-3), the smallest 1- frequent episode of support in the 1- frequent episode that all (1-2) are split out is found out, while finds out all packets
Record ID number containing the 1- frequent episode；
The motion track of record ID number obtained in (1-4), traversal (1-3) records to calculate the support of every candidate frequent episode
Degree finally deletes 2- candidate C2The candidate item that middle support is less than minimum support threshold value has just obtained 2- frequent item set L2；
(1-5), 3- frequent item set L3Acquisition be equally to need to split into 3- frequent episode several individual 1- frequent episodes,
Remaining calculating process and 2- frequent item set L2It is identical, and so on, calculate k- frequent item set Lk, it is until frequent episode can not be regenerated
Only；
Step 2: the frequent item set obtained using step 1, generates all possible association movement rule of mobile node, and calculate
The confidence level of every movement rule；
Step 3: the mobile node every date for being associated with movement rule and every association movement rule of calculating in recording step two
The far and near of date changes the factor；Meanwhile the factor is changed according to the date distance of the date of record and calculating, it calculates every association and moves
The date weighted value TWeight (R) for moving rule, to obtain High relevancy movement rule；Wherein, every association movement rule day
Phase corresponding remote variation factor m and nearly variation factor of n calculation formula are as follows:
Date weighted value TWeight (R) calculation formula of every association movement rule is as follows:
Wherein, RuleDate, MaxDate and MinData respectively indicate the date of movement rule, mobile trajectory data is concentrated most
Close record date and farthest record date；M be mobile trajectory data concentrate nearest record date MaxDate variation because
Son far changes the factor；N is the variation factor for the farthest record date MinData that mobile trajectory data is concentrated, i.e., it is close change because
Son；K is total number of days of the moon where movement rule date RuleDate, RuleDatekIndicate the date value of the middle of the month kth day；
Step 4: being predicted one under mobile node according to the strong association movement rule that mobile node current track and step 3 generate
A motion track:
It is assumed that the motion track of current mobile node is T:(cn,tn)→(cm,tm), the relevant movement rule of traversal institute, if closed
Connection movement rule R includes that motion track T then illustrates that being associated with movement rule R is matched movement rule, then calculates according to the following formula
It is associated with the matching degree of movement rule R, matching degree gets over Gao Zeyue and is likely to be the next motion track of mobile node:
Score (R)=Confidence (R)+TWeight (R)
Wherein, Score (R) is the matching degree for being associated with movement rule R, and Confidence (R) is the confidence for being associated with movement rule R
Degree, TWeight (R) are the date weighted value for being associated with movement rule R；
Record the number of new couple in router (NAR) in the next motion track of mobile node；
Mobile node (MN) with android system is known as Android terminal；
In terms of implementation method of the low consumption FMIPv6 switching method in Android terminal, including following three:
The first, mobile trajectory data collection is stored in the miniature relevant database SQLite carried in Android terminal；
The second, it is non-switching to be placed on Android terminal for the operating process of step 1 and step 2 in the described low consumption Apriori method
Period completes, and step 3 is then executed when Android terminal switches and starts in the low consumption Apriori method；
Third, the FMIPv6 switching method are realized in Android terminal inner nuclear layer；The consumption Apriori method is adopted
It is realized in the form of library file in the system class libraries layer of Android terminal with C Plus Plus or the consumption Apriori method is used
Java language is realized in Android terminal in the form of application program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510741479.9A CN105430703B (en) | 2015-11-04 | 2015-11-04 | Implementation method of the low consumption FMIPv6 switching method in Android terminal |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510741479.9A CN105430703B (en) | 2015-11-04 | 2015-11-04 | Implementation method of the low consumption FMIPv6 switching method in Android terminal |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105430703A CN105430703A (en) | 2016-03-23 |
| CN105430703B true CN105430703B (en) | 2019-02-12 |
Family
ID=55508568
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510741479.9A Active CN105430703B (en) | 2015-11-04 | 2015-11-04 | Implementation method of the low consumption FMIPv6 switching method in Android terminal |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105430703B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004015143A (en) * | 2002-06-04 | 2004-01-15 | Fujitsu Ltd | Hand-over method in mobile communication system and router used for the mobile communication system |
| CN101945453A (en) * | 2010-08-09 | 2011-01-12 | 中国电子科技集团公司第五十四研究所 | Mobile IPv6 access method based on orbit information prediction |
| CN103118098A (en) * | 2013-01-25 | 2013-05-22 | 清华大学 | Forecast based multi-connection mobile terminal interface switching method |
| CN103841610A (en) * | 2014-03-18 | 2014-06-04 | 山东大学 | Quick and efficient agent mobile IPv6 switching method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20050057704A (en) * | 2003-12-10 | 2005-06-16 | 삼성전자주식회사 | Handover methods and handover apparatuses |
-
2015
- 2015-11-04 CN CN201510741479.9A patent/CN105430703B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004015143A (en) * | 2002-06-04 | 2004-01-15 | Fujitsu Ltd | Hand-over method in mobile communication system and router used for the mobile communication system |
| CN101945453A (en) * | 2010-08-09 | 2011-01-12 | 中国电子科技集团公司第五十四研究所 | Mobile IPv6 access method based on orbit information prediction |
| CN103118098A (en) * | 2013-01-25 | 2013-05-22 | 清华大学 | Forecast based multi-connection mobile terminal interface switching method |
| CN103841610A (en) * | 2014-03-18 | 2014-06-04 | 山东大学 | Quick and efficient agent mobile IPv6 switching method |
Non-Patent Citations (2)
| Title |
|---|
| 基于LMA缓存的PMIPv6域内切换算法;金涛等;《无线通信技术》;20150215(第1期);第43-47页 |
| 基于时间加权数据挖掘的FMIPv6切换算法;金涛等;《数据通信》;20141028(第5期);第2213-2217页 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105430703A (en) | 2016-03-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101127758B (en) | IP address acquisition method and acquisition system for mobile nodes | |
| CN102405628A (en) | Handover in core-edge separation technology in wireless communications | |
| CN105744577B (en) | A kind of mobile roaming switching method suitable for multi-hop underwater sound local area network | |
| KR20040039486A (en) | Mobility control system, mobile node used in the system, mobility control method, mobility control program, and mobility control node | |
| Langar et al. | A comprehensive analysis of mobility management in MPLS-based wireless access networks | |
| CN101516082B (en) | Method for hierarchical mobile IPv6 to avoid inter-domain handover | |
| Dutta et al. | Multilayer hierarchical model for mobility management in IPv6: a mathematical exploration | |
| CN105592415B (en) | Low consumption FMIPv6 switching method based on moving projection | |
| Wang et al. | A routing scheme for connecting delay-sensitive urban vehicular networks to the IPv6-based internet | |
| CN103024720B (en) | Network mobility management method of internet protocol version 6 over low power wireless personal area network (6LoWPAN) | |
| EP2844024A1 (en) | Mobile node registration method, intercommunication method, switching method and network element | |
| CN102158845B (en) | Method for optimizing HMIPv6 switching performance | |
| CN105263115B (en) | FMIPv6 switching methods based on moving projection | |
| CN103974226B (en) | Distributed location management method and system in a kind of heterogeneous network | |
| CN102883298B (en) | The method and Mobile Access Gateway of mobile management | |
| CN105430703B (en) | Implementation method of the low consumption FMIPv6 switching method in Android terminal | |
| CN102868991B (en) | message forwarding path management method, system and network element | |
| Gohar et al. | A distributed mobility control scheme in LISP networks | |
| Im et al. | Cost-effective and fast handoff scheme in Proxy Mobile IPv6 networks with multicasting support | |
| Yoo et al. | ES-FHMIPv6: An efficient scheme for fast handover over HMIPv6 networks | |
| KR101066955B1 (en) | IPv6-based user-defined network system and mobility management method thereof | |
| Jabir et al. | Fast handoff scheme for cluster-based proxy mobile Ipv6 protocol | |
| KR101406329B1 (en) | Access router and method for providing mobility thereof, proxy router and method of handover thereof | |
| CN101742485B (en) | Method and device for transmitting data | |
| Wang et al. | Fast inter-MAP handover in HMIPv6 |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |