Modeles et algorithmes pour la gestion de la localisation dans les reseaux a composantes mobiles multiservices (French text)

In most current networks, location management techniques consist of dividing the coverage area into many LAs (Location Areas) where a LA is a set of adjacent cells.; In this thesis we propose new models to improve the efficiency of location management in mobile networks. We propose a built-in memory model for reducing the signaling and database access traffic due to users' mobility in wireless networks. This model requires a small built-in memory in the MU (Mobile Unit) that stores the same location data (MU's location area address) as in the HLR (Home Location Register). When the MU changes its LA (Location Area), it queries the LA whose address is stored in the MU built-in memory to create a pointer between that LA and the MU's current LA. Hence, no location update operation is performed in the HLR. When the MU is called, its HLR is queried to determine its LA. If the MU no longer resides in that LA, then its current LA is reached by traversing a single pointer. Preliminary results show that the proposed model may result in significant reductions in location update costs and outperforms the IS-41 scheme whenever the higher level elements of the network constitute the performance bottleneck.; We propose also a global location management scheme for improving the basic location strategy proposed in the IS-41 standard. This scheme essentially consists of adding to the current network architecture a pointer table and a location data table. A pointer table is provided for each location area where it tracks the mobile units that have moved out of this location area. The location data table located on a LSTP node contains the data location of the mobile units frequently called from the location areas connected to this LSTP. These two tables contribute to reduce significantly the cost of both location update and call delivery procedures. Computation results indicate that the amount of reduction obtained depends on the value of the call to mobility ratio of the mobile units.; We propose also a new hybrid architecture to improve the performance of location management procedures. Computation results favor the use of the new hybrid architecture in many situations. (Abstract shortened by UMI.)...