Abstract:
A method of managing a mobility profile of a mobile node that uses a local mobility agent for managing a local mobility domain. The method includes obtaining and recording local temporary addresses, connection link temporary addresses and binding update times of the respective mobile nodes in a cacheable memory of the local mobility agent, calculating stay times of the respective mobile nodes on the presently linked subnet using information recorded in the cacheable memory and recording the stay times of the respective mobile nodes in a storage device of the local mobility agent, calculating an average stay time of the respective mobile nodes on the presently linked subnet by accumulating the stay times recorded in the storage device and recording the average stay time in the storage device of the local mobility agent.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
     This application claims the benefit of Korean Patent Application No. 2003-27313 filed Apr. 29, 2003, in the Korean Intellectual Property Office, the disclosure of which is incorporated herein by reference. 
     BACKGROUND 
     1. Field of the Invention 
     The present invention relates to a method of managing a mobility profile of a mobile node under an IPv6 (Internet-Protocol version 6)-based localized mobility management, and more particularly, to a method of managing a mobility profile of a mobile node under IPv6-based localized mobility management which calculates and stores information to be included in the mobility profile of the mobile node, and manages a local mobility domain using the stored mobility profile. 
     2. Description of the Related Art 
     Recently, with the rapid spread of the Internet, the development of a wireless communication technology, and the performance improvement of mobile terminals such as a portable computer, PDA (Personal Digital Assistant), etc., wireless Internet users are increasing. Accordingly, diverse methods have been proposed in order to provide high-quality communication services with respect to a mobile node that is a mobile terminal moving its position at all times under a wireless Internet environment. Recently, IPv6 which is extended from IPv4 has been proposed, and a mobile IPv6 technology based on this proposal, has been developed. 
     According to the mobile IPv6 technology, the mobile node, even if it moves to an external network, communicates with a CN (corresponding node) using its own HA (home address) obtained from a home agent that is a router having registration information of the mobile node. For this, the mobile node is allocated with a CoA (Care of Address) that is a temporary address from an access router of the linked external network, and registers the allocated CoA in the home agent along with the HA, which is called a binding. 
     The mobile node should periodically update such a binding, which is called a binding update, in order to inform its position to the home agent. Also, if the mobile node moves to another network, the mobile node should perform the binding update and the confirming thereof in association with the home agent whenever it moves to another network, and this causes the load of the home network and the traffic on the Internet to increase. Especially, if the mobile node is far away from the corresponding node or the home network, this problem becomes severe, and it may take a long time, more than one second, for the binding update and the confirming thereof. 
     A LMM (Localized Mobility Management) technique has been proposed to solve the above-described problem. According to this LMM, even if the mobile node moves from one subnet to another subnet in a local mobility domain, the CoA of the mobile node in the local mobility domain is not changed, a new position of the mobile node is informed only to a local mobility agent, and packets coming to the mobile node are forwarded to the present position of the mobile node through the local mobility agent. Accordingly, a handoff can promptly occur since the binding update for the home network is reduced and the binding update for the local mobility agent is requested only in the local mobility domain. The CoA which is not changed in the local mobility domain and is not informed to an outside of the local mobility domain is called a RCoA (Regional CoA), and the CoA which is not informed to the outside of the local mobility domain and is registered in the local mobility agent is called a LCoA (on-Link CoA). 
     According to the localized mobility management technique, it is somewhat possible to solve the problem caused by the increase of the load of the home agent and the increase of the traffic on the Internet. However, since the binding update for the local mobility agent is required, the localized mobility management technique cannot completely overcome the problems such as a signaling delay and so on. 
     In the existing cellular mobile communications, a discriminative billing or service providing is performed using the mobility profile. Also, in the mobile IPv6 which is the basis of the next-generation mobile communications, it is expected to provide high-quality services by introducing the mobility profile to the mobility management technique. According to the present mobility management technique that adopts the mobile IPv6, and is related to an intellectual mobility management technique, extraction of statistical mobility patterns and position-based services of the mobile node has not been proposed. 
     In practice, most mobile nodes show a periodic mobility in accordance with time, day of the week, etc., and show a mobility pattern of a high-probability in the statistics. Accordingly, if it is possible to statistically extract the mobility pattern in the localized mobility domain of the mobile node and estimate the present position or mobility of the mobile node, the localized mobility management can be performed more efficiently, and the cost can be greatly reduced, so that a high-quality QoS can be provided to users. 
     However, as described above, since management information and a method of obtaining the management information, which are required for the detailed mobility profile management, have not yet been proposed, there has been a demand for the management information, and the methods of obtaining and maintaining the information. 
     SUMMARY 
     An object of the invention is to solve at least the above-identified problems and/or disadvantages and to provide at least the advantages described hereinafter. 
     Another object of the present invention is to provide a method of managing a mobility profile of a mobile node under an IPv6-based localized mobility management which calculates and stores information to be included in the mobility profile of the mobile node, and manages a local area network using the mobility profile. 
     Still another object of the present invention is to provide a method of managing a mobility profile of a mobile node using an LMA (Local Mobility Agent) for managing a local mobility domain that includes a plurality of subnets among which a plurality of mobile nodes move in a mobile communication environment. 
     To achieve the above objects and/or other features of the present invention, there is provided a method of managing a mobility profile of a mobile node using a local mobility agent for managing a local mobility domain that includes a plurality of subnets among which a plurality of mobile nodes move in a mobile communication environment, comprising the steps of obtaining and recording local temporary addresses, connection link temporary addresses and binding update times of the respective mobile nodes in a cacheable memory of the local mobility agent, calculating stay times of the respective mobile nodes on the presently linked subnet using information recorded in the cacheable memory and recording the stay times of the respective mobile nodes in a storage device of the local mobility agent, calculating average stay time of the respective mobile nodes on the presently linked subnet by accumulating the stay times recorded in the storage device and recording the average stay times in the storage device of the local mobility agent, and the local mobility agent managing the local mobility domain using the information recorded in the storage device. 
     Preferably, the stay time is calculated as a value obtained by subtracting the binding update time first sent by the mobile node when the mobile node is linked to the present subnet from the binding update time first sent by the mobile node when the mobile node moves to another subnet, and if the mobile node does not perform the binding update on the present subnet within a predetermined limited time, the stay time is calculated as a value obtained by subtracting the binding update time first sent by the mobile node when the mobile node is linked to the present subnet from the binding update time lastly sent by the mobile node on the present subnet. 
     It is preferable that the stay time is calculated as a value obtained by dividing a value obtained by accumulating the stay values of the mobile node calculated with respect to the present subnet by the total number of link times to the present subnet. 
     The method of managing a mobility profile of a mobile node further includes the steps of calculating an average stay time of all the mobile nodes on the respective subnet by accumulating the average stay times recorded in the storage device, and calculating an average stay time of all the mobile nodes on all the subnets by accumulating the average stay times of all the mobile nodes and recording the average stay time in the storage device of the local mobility agent. 
     It is preferable that the average stay time of all the mobile modes on the respective subnet is a value obtained by dividing a sum of the average stay times of the respective mobile nodes on the respective subnet by a sum of the number of all the mobile nodes. 
     It is preferable that the average stay time of all the mobile modes on all the subnets is a value obtained by dividing a sum of the average stay times of all the mobile nodes on the respective subnets by a sum of the number of all the subnets. 
     In another aspect of the present invention, there is provided a method of managing a mobility profile of a mobile node using a local mobility agent for managing a local mobility domain that includes a plurality of subnets among which a plurality of mobile nodes move in a mobile communication environment, comprising the steps of obtaining and recording local temporary addresses, connection link temporary addresses and binding update times of the respective mobile nodes in a cacheable memory of the local mobility agent, calculating moving vectors that indicate paths and times for which the respective mobile node moves from a certain subnet (i) to another subnet (j) using information recorded in the cacheable memory and recording the moving vectors of the respective mobile node in a storage device of the local mobility agent, and managing a local mobility domain using the information recorded in the storage device of the local mobility agent. 
     The moving vector is represented by (i, j, t), where i denotes the subnet (i), j denotes the subnet (j), and t denotes a binding update time first sent by the mobile node when the mobile node is linked to the subnet (j). 
     It is preferable that the method of managing a mobility profile of a mobile node further includes the step of calculating a subnet moving matrix having a moving rate, which indicates a probability that the respective mobile node moves from a certain subnet (k) to another subnet (l), as its (k, l)-th element, with respect to different natural numbers k and l which are smaller than or identical to a total number of subnets, and recording the subnet moving matrix in the storage device of the local mobility agent. 
     It is preferable that the (k, l)-th element of the subnet moving matrix is calculated as a value obtained by dividing a sum of the number of moving vectors from the subnet (k) to the subnet (l) by a sum of the number of all accumulated moving vectors of the mobile node. 
     It is preferable that the method of managing a mobility profile of a mobile node further includes the step of calculating an average subnet moving matrix for all the mobile nodes by accumulating the subnet moving matrices recorded in the storage device, and recording the average subnet moving matrix in the storage device of the local mobility agent. 
     It is preferable that a (k, l)-th element of the average subnet moving matrix is calculated as a value obtained by dividing a sum of the (k, l)-th elements of the subnet moving matrices of all the mobile nodes recorded in the storage device by a sum of the number of all the subnet moving matrices. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       The above objects and other advantages of the present invention will become more apparent by describing in detail a preferred embodiment thereof with reference to the attached drawings in which: 
         FIG. 1  is a view illustrating an example of a local mobility domain having a plurality of subnets; 
         FIG. 2  is a flowchart illustrating a process of calculating and managing mobility profile information of a mobile node according to the present invention; 
         FIG. 3  is a flowchart illustrating a process of calculating and managing other mobility profile information of a mobile node according to the present invention; 
         FIG. 4  is a flowchart illustrating a process of calculating and managing mobility profile information common to a plurality of mobile nodes according to the present invention; 
         FIG. 5  is a flowchart illustrating a process of calculating and managing other mobility profile information common to a plurality of mobile nodes according to the present invention; and 
         FIG. 6  is a view illustrating an example of a moving matrix according to the present invention. 
     
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     Now, a method of managing a mobility profile of a mobile node according to the present invention will be described in detail with reference to the appended drawings in which like reference numerals refer to like elements. 
       FIG. 1  is a view illustrating an example of a local mobility domain having a plurality of subnets. Referring to  FIG. 1 , one local mobility domain  100  is composed of a plurality of subnets  301  to  311 . The local mobility domain  100  has a local mobility agent  200 , and the subnets  301  to  311  have routers  401  to  411 , respectively. Also, the local mobility domain  100  is connected to the Internet, and a mobile node  500  is linked to the present subnet  306 . 
       FIG. 2  is a flowchart illustrating a process of calculating and managing mobility profile information of a mobile node according to the present invention. 
     The local mobility agent  200  lists an RCoA, LCoA, life cycle, binding update time, information on a recent use of the corresponding list, etc., and stores the list in a binding cache, i.e., in its own memory, to manage the information list (step S 600 ). This information list is updated whenever the local mobility agent  200  receives an initial binding update, which is sent by the mobile node  500  when the mobile node moves to a new subnet, and also when a following binding update, which is periodically sent in the same subnet, is received. Meanwhile, if the mobile node  500  escapes from the local mobility domain  100 , the corresponding list stored in the memory is deleted. 
     Also, the local mobility agent  200  calculates a stay time (S_time(i, k, t)) of the respective mobile node  500  in the respective subnet (i), an average stay time AS_time(i), a moving vector (&lt;i, j, t&gt;) from a certain subnet (i) to another subnet (j), and a moving matrix (SM), and stores them in its own or a separate storage device as a database. This information is updated when the mobile node  500  moves through a subnet in the local mobility domain  100 , and is also updated when the mobile node escapes from the local mobility domain  100  without being deleted. 
     The stay time (S_time(i, k, t)) of the mobile node  500  in a certain subnet (i) is calculated using an initial binding update time (i_time) sent by the mobile node when the mobile node is linked to the corresponding subnet (i). Also, the stay time is calculated using an initial binding update time j_time) sent by the mobile node when the mobile node moves from the corresponding subnet (i) to another subnet (j). From the difference between the two time points, the subnet stay time (S_time(i, k, t)) is calculated (step S 605 ). The subnet stay time (S_time(i, k, t)) calculated as above is stored along with the ID(i) of the corresponding subnet, the number (k) of times that the mobile node  500  visits the corresponding subnet, and the time (t=i_time) that the mobile mode  500  is linked to the corresponding subnet (i). The subnet stay time (S_time(i, k, t)) is expressed by the following equation.
 
 S _time( i,k,t )= j _time− i _time  [Equation 1]
 
     However, if the time limit for the binding update elapses while the mobile node  500  does not send the following binding update, the above-described method cannot be used. For example, this happens when the power supply to the mobile node  500  is turned off, and it can be recognized that the link to the corresponding subnet (i) is disconnected after the time limit. Accordingly, in this case, the subnet stay time (S_time(i, k, t)) is calculated by the difference between the time (i 2 _time) when the mobile node  500  last sends the following binding update at the corresponding subnet (i) and the time (i_time) when the mobile node sends the initial binding update. 
     The average stay time (AS_time(i)) of the mobile node  500  in the subnet (i) is calculated as an average value of the respective stay times (S_time (i, k, t)) of the mobile node  500  in the subnet (i), and updated whenever the mobile node  500  moves from the subnet (i) to another subnet (step S 610 ). The average stay time (AS_time(i)) of the mobile node  500  in the subnet (i) can be expressed by the following equation. 
     
       
         
           
             
               
                 
                   
                     AS_time 
                     ⁢ 
                     
                       ( 
                       i 
                       ) 
                     
                   
                   = 
                   
                     
                       ∑ 
                       k 
                     
                     ⁢ 
                     
                       S_time 
                       ⁢ 
                       
                         
                           ( 
                           
                             i 
                             , 
                             k 
                             , 
                             t 
                           
                           ) 
                         
                         / 
                         K 
                       
                     
                   
                 
               
               
                 
                   [ 
                   
                     Equation 
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     2 
                   
                   ] 
                 
               
             
           
         
       
     
     Here, k denotes the number of times that the mobile node visits the subnet (i), and K denotes the total number of times that the mobile node visits the subnet (i). 
       FIG. 3  is a flowchart illustrating a process of calculating and managing other mobility profile information of a mobile node according to the present invention. 
     Whenever the mobile node  500  moves from a certain subnet (i) to another subnet (j) (“Y” at step S 705 ), a moving vector (&lt;i, j, t&gt;) is calculated (step S 710 ). Here, “i” and “j” denotes different subnets, and are natural numbers which are smaller than or equal to the total number “N” of subnets. The moving vector (&lt;i, j, t&gt;) indicates that the mobile node  500  moved from the subnet (i) to the subnet (j) at a time (t). The time (t) is the initial binding update time (j_time) sent by the mobile node  500  when the mobile node is linked to the subnet (j). With reference to the moving vectors &lt;i, j, t 1 &gt;, &lt;j, k, t 2 &gt; and &lt;k, l, t 3 &gt; arranged in the order of their time, the subnet to which the mobile node  500  moved, the order of movement, and the moving time can be known. The mobile node  500  moved from the subnet (i) to the subnet (j) at the time (T 1 ), moved from the subnet (j) to the subnet (k) at the time (T 2 ), and moved from the subnet (k) to the subnet (l) at the time (T 3 ). Here, if the times (t 1 , t 2 , and t 3 ) are in an ascending series, the mobile node moves in the order of the subnet (i), subnet (j), subnet (k) and subnet (l). 
     Using the moving vector of the mobile node, the moving matrix is calculated (step S 715 ). The moving matrix SM of the mobile node  500  represents the probability that the mobile node  500  moves from a certain subnet to another subnet. If the number of subnets in the local mobility domain managed by the local mobility agent  200  is “N”, the moving matrix SM becomes an “N×N” matrix having “N” rows and “N” columns. The (i, j)-th element of the moving matrix SM represents the moving rate (P&lt;i, j&gt;) of the mobile node  500  from the subnet (i) to the subnet (j). 
     The moving rate (P&lt;i, j&gt;) of the mobile node  500  from the subnet (i) to the subnet (j) is calculated using all of the moving vectors (&lt;i, j, t&gt;) accumulated until the stored information is updated. That is, the moving rate (P&lt;i, j&gt;) is calculated by dividing the number of moving vectors (&lt;i, j, t&gt;) corresponding to the movement of the mobile node  500  from the subnet (i) to the subnet (j) by the number of all of the moving vectors of the mobile node  500 . For example, if the accumulated moving vectors according to the recent update are &lt;i, j, t 1 &gt;, &lt;j, i, t 2 &gt;, &lt;j, k, t 3 &gt;, &lt;k, l, t 4 &gt;, &lt;l, k, t 5 &gt;, &lt;k, j, t 6 &gt;, &lt;j, i, t 7 &gt;, &lt;i, j, t 8 &gt;, &lt;j, k, t 9 &gt;, and &lt;k, j, t 10 &gt;, the moving rate (P&lt;i, j&gt;) becomes “2/10=0.2” which is obtained by dividing the number “2” of moving vectors (&lt;i, j, t&gt;) by all of the moving vectors “10”. 
       FIG. 6  is a view illustrating an example of the moving matrix SM of the mobile node  500  according to the present invention. Referring to  FIG. 6 , the moving rate (P&lt;3, 2&gt;) becomes “0.27” which is the ( 3 , 2 )-th element of the moving matrix SM. 
     The stay time (S_time(i, k, t)) of the respective mobile node  500  in the respective subnet (i) is calculated as shown above, the average stay time (AS_time(i)), the moving vector (&lt;i, j, t&gt;) from a certain subnet (i) to another subnet (j), and the moving matrix SM are stored as profile information of the respective mobile node  500 , and used for the local mobility agent  200  to manage the mobility profile of the local mobility domain  100  (steps S 615  and S 720 ). 
     Hereinafter, a method of calculating and managing the profile information commonly managed with respect to a plurality of mobile nodes. 
       FIG. 4  is a flowchart illustrating a process of calculating and managing mobility profile information common to a plurality of mobile nodes according to the present invention. The local mobility agent  200  calculates the average stay time (S_avg_time(i)) of all the mobile nodes in the respective subnet (i), the average stay time (S_total_avg_time) in all the subnets, and the average moving matrix (SM_avg), and stores them in its own or a separate storage device. This information is maintained without being deleted even when the mobile node escapes from the local mobility domain  100 . 
     With respect to a certain subnet (i) in the local mobility domain  100 , the average stay time (S_avg_time(i)) of all the mobile nodes in the subnet (i), which exist in the local mobility domain  100 , is calculated (step S 800 ). It is assumed that a set of all mobile nodes existing in the local mobility domain  100  is “U”. The average stay time (S_avg_time(i)) of all the mobile nodes can be calculated by the following equation using the average stay time (AS_time(i)) of the respective mobile nodes. 
     
       
         
           
             
               
                 
                   
                     S_avg 
                     ⁢ 
                     _time 
                     ⁢ 
                     
                       ( 
                       i 
                       ) 
                     
                   
                   = 
                   
                     
                       ∑ 
                       
                         m 
                         ∈ 
                         U 
                       
                     
                     ⁢ 
                     
                       AS_time 
                       ⁢ 
                       
                         ( 
                         i 
                         ) 
                       
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       of 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       
                         m 
                         / 
                         
                           N 
                           ⁡ 
                           
                             ( 
                             U 
                             ) 
                           
                         
                       
                     
                   
                 
               
               
                 
                   [ 
                   
                     Equation 
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     3 
                   
                   ] 
                 
               
             
           
         
       
     
     Here, “m” denotes a respective mobile node in the local mobility domain  100 , and “N(U)” denotes the number of elements of a set “U”, i.e., the whole number of mobile nodes existing in the local mobility domain  100 . Thus, the average stay time (S_avg_time(i)) of all the mobile nodes is calculated as an average value obtained by dividing the sum of the average stay time (AS_time(i)) of the respective mobile nodes by the number of all mobile nodes. 
     Then, the average stay time (S_total_avg_time) of all the mobile nodes in the whole subnets, which exist in the local mobility domain  100 , is calculated using the average stay time (S_avg_time(i)) of all the mobile nodes in the respective subnet (i), which was calculated at the previous step (step S 805 ). It is assumed that a set of all subnets existing in the local mobility domain  100  is “SU”. The average stay time (S_total_avg_time(i)) of all the mobile nodes in the whole subnets can be calculated by the following equation. 
     
       
         
           
             
               
                 
                   
                     S_total 
                     ⁢ 
                     _avg 
                     ⁢ 
                     _time 
                   
                   = 
                   
                     
                       ∑ 
                       j 
                     
                     ⁢ 
                     
                       S_avg 
                       ⁢ 
                       _time 
                       ⁢ 
                       
                         
                           ( 
                           i 
                           ) 
                         
                         / 
                         
                           N 
                           ⁡ 
                           
                             ( 
                             SU 
                             ) 
                           
                         
                       
                     
                   
                 
               
               
                 
                   [ 
                   
                     Equation 
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     4 
                   
                   ] 
                 
               
             
           
         
       
     
     Here, “N(SU)” denotes the number of elements of a set “SU”, i.e., the whole number of subnets existing in the local mobility domain  100 . That is, the average stay time (S_total_avg_time) of all the mobile nodes in the whole subnets is calculated as a value obtained by dividing the sum of the average stay time (S_avg_time(i)) of all the mobile nodes in the respective subnet (i) by the whole number of subnets. 
       FIG. 5  is a flowchart illustrating a process of calculating and managing other mobility profile information common to a plurality of mobile nodes according to the present invention. Referring to  FIG. 5 , a method of calculating the average moving matrix (SM_avg) of all the mobile nodes existing in the local mobility domain will be explained. 
     Whenever a certain mobile node in the local mobility domain  100  moves (“Y” at step S 900 ), or whenever a predetermined time elapses, the average moving matrix (SM_avg) of all the mobile nodes is calculated using the moving matrix calculated for the respective mobile node (step S 905 ). As described above, if the number of subnets in the local mobility domain  100  is “N”, the moving matrix SM becomes an “N×N” matrix having “N” rows and “N” columns. The (i, j)-th element of the moving matrix SM represents the moving rate (P&lt;i, j&gt;) of the mobile node  500  from the subnet (i) to the subnet (j). 
     The average moving matrix SM_avg of all the mobile nodes is the “N×N” matrix having the same number of rows and columns as the respective moving matrix SM. The (i, j)-th element (P_avg&lt;i, j&gt;) of the average moving matrix (SM_avg) of all the mobile nodes can be calculated by the following equation using the (i, j)-th element (P&lt;i, j&gt;) of the moving matrix SM of the respective mobile node. 
     
       
         
           
             
               
                 
                   
                     p_avg 
                     &lt; 
                     i 
                   
                   , 
                   
                     j 
                     &gt;= 
                     
                       
                         ∑ 
                         
                           m 
                           ∈ 
                           U 
                         
                       
                       ⁢ 
                       
                         &lt; 
                         i 
                       
                     
                   
                   , 
                   
                     j 
                     &gt; 
                     
                         
                     
                     ⁢ 
                     
                       of 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       
                         m 
                         / 
                         
                           N 
                           ⁡ 
                           
                             ( 
                             U 
                             ) 
                           
                         
                       
                     
                   
                 
               
               
                 
                   [ 
                   
                     Equation 
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     5 
                   
                   ] 
                 
               
             
           
         
       
     
     Here, “m” denotes a respective mobile node, “U” a set of all mobile nodes, and “N(U)” the whole number of mobile nodes. Thus, the (i, j)-th element (P_avg&lt;i, j&gt;) of the average moving matrix (SM_avg) is calculated as a value obtained by dividing the sum of the (i, j)-th elements (P&lt;i, j&gt;) of the moving matrix SM of the mobile nodes by the whole number of mobile nodes. 
     The local mobility agent  200  stores the average stay time (S_avg_time(i)) of all the mobile nodes in the respective subnet (i), the average stay time (S_total_avg_time) in all the subnets, and the average moving matrix (SM_avg) from a certain subnet (i) to another subnet (j) as the profile information common to a plurality of mobile nodes, and uses the profile information to manage the mobility profile of the local mobility domain  100 . The profile information common to all the mobile nodes may be profiled and managed separately or along with the profile information common to the respective mobile node. 
     As described above, according to the present invention, the local mobility domain can be managed more efficiently by obtaining the mobility information of the respective mobile node in the local mobility domain, calculating a mobility profile using the obtained mobility information, and maintaining and updating the calculated mobility profile. 
     Also, the present invention makes it possible to develop an intelligent mobility management technique for the local mobility domain, and provides a method of managing a mobility profile of a mobile node for position-based services by extracting a statistical mobility pattern of the mobile node. 
     While the present invention has been described in detail, it should be understood that various changes, substitutions and alterations can be made hereto without departing from the spirit and scope of the invention as defined by the appended claims.