Location Management in Cellular Networks

1. By Priyanka Patel (7481432) (ppate038@uottawa.ca) Instructor: Prof. Ivan Stojmenovic Location Management in Cellular Networks

2. Agenda • Introduction of terms like Base station, Mobile terminal, MSC, Location Area used in cellular network. • What is Location Management in Cellular Networks? • Basic operations involved in Location Management • Static and dynamic Location Management addressing schemes • Paging addressing schemes • Conclusion

3. CellularNetworks Mobile Terminal : Mobile phone which can roam anywhere in mobile subscriber network. Cell: Collection of mobile terminals with one base station to handle it. Base Station: Unique for each cell, and manages the communication between mobile terminals of same or different cells. Location Area: Group of cells Mobile Switching Centre: MSC manages all base stations which falls under same location area.

4. What is Location management in Cellular networks? • It deals with the tracking of mobile terminals irrespective of its present location in Cellular networks. • In Wireless networks, mobile terminals does not have fix connection as in case of telephone connection. • Mobile terminal’s location should be known in order to have communication between mobile terminals. Problem: How to know mobile terminal’s location at time of call arrival?

5. Location Management Operations • There are two basic operations of Location Management in Cellular networks • Location Update: It is done by the Mobile terminal to communicate its present cell location to the Base station in order to route the incoming call correctly. • Paging: It is the process to identify the current cell location of mobile terminal when an incoming call is received

6. Issue Cost involved for updating the mobile terminal location: 1. Paging cost – Number of cells paged when call arrives 2. Update cost – Number of times location update done by mobile terminal • Trade off – More the paging cost less the location update cost and vice versa. Solution: • Page each cell in the network to reduce update cost. • Update each time mobile terminal crosses the cell to reduce paging cost. • Requires optimal scheme which involves less information update along with less paging.

7. Assumptions • Efficient Location Management in cellular networks depends on the common performance evaluation assumptions • Network Topology: One – dimensional , two - dimensional • Mobility Patterns: It is used to describe the mobility of a mobile terminal or sometimes used to know the aggregate mobility pattern of all subscribers. • Call Arrival probability: If call arrival time is known to the mobile terminal then it can update its location just before the call arrives.

8. Network Topology Network Topology is either one- dimensional or two-dimensional. In One- dimensional topology each cell has two neighboring cell and it is useful when mobility of mobile terminals in a particular service area is restricted in either forward or backward direction. Examples are includes highways and railroads. Two – dimensional model provides more general service area in which mobile terminals can move in any direction.

9. Mobility Patterns

10. Mobility Patterns

11. Mobility Patterns

12. Location Updating Schemes

13. Static Location Updating schemes • Location Update on Cell Crossing: Location information is updated each time a mobile terminal enters into a new cell. The exact location of a mobile terminal is known and hence no paging is required. • Location Update on Location Area: The Mobile terminal updates its location information when enters in a new location area and thus necessities the paging of all cells within the location area.

14. Location Area updating is static in the sense that all location areas and its cells are stationary in the network. Disadvantage: • Mobile terminal located near the boundaries of LA or cell, offently travel back and forth among different cells and LA resulting in redundant location updating. • Incurring more location updating cost.

15. Two Location Algorithm Steps: • Mobile terminal stores two IDs (say ID1 and ID2) of recently visited location area. • If Mobile terminal enters new location area (ID3), it compares its ID with ID1 and ID2 • If match is not found then ID2 is removed from list and new list will be (ID3, ID1) • And if match is found in the list no location update occurs. • It works best when subscriber moves more frequently than calls are received and location updating cost is high.

16. Static Location updating schemes 3. Location updating on Reporting cells: It is a location management strategy in which few selected cells are represented as reporting cells and remaining are non reporting cells of a location area. • Base station of each cell broadcast a signal to indicate whether the cell is reporting cell or not • Mobile terminal enters a reporting cell then it has to perform location updating. • At the time of call arrival, paging is done first in the reporting cell and then neighboring cells (vicinity) of reporting cell.

17. Static location updating schemes 4. Periodic update method: Mobile terminal perform location updating at specific interval time irrespective of movement. It is useful when a fixed location update cost is desirable. Disadvantage of Static Techniques: • Static location updating techniques causes overwhelming cell crossing load to the network when call arrival probability of Mobile terminal is low. • Reporting cells technique is a good trade off between location updating and paging cost.

18. Dynamic Location updating schemes 1. Threshold based dynamic schemes: Location information is updated only when a threshold value exceeds to its limits set.

19. Inspections of threshold based techniques • Time based strategy is easy to implement with minimum computational cost involved. And best suited for users having moderate mobility patterns. • Distance based strategy is the best but requires more computational cost and little difficult to implement as it involves proper distance calculation by giving ordered Cell Ids to every cell. • Movement based strategy is in the middle providing good balance between the performance and implementation complexity.

20. Dynamic location updating schemes 2. State based : Mobile terminal perform Location updating based on the state threshold. The state threshold includes information like current location, time elapsed since last update, number of cell crossing and distance between the two last reported cells. 3. Pointer Based: Instead of updating new location information, Mobile terminal’s old VLR pointer points to new VLR at time of incoming call is initiated. 4. Replication based: User profiles is replicated at local database to avoid signaling till HLR to get location information of a mobile terminal when incoming call received on roaming.

21. Dynamic location updating schemes 5. Profile based scheme: • Cellular system keeps individual users mobility patterns information to save the cost of location update. • A profile is created for individual subscriber and for each time period system maintains a list of location areas and probabilities to find the mobile terminal’s exact location. Algorithm: For time period t, the location area and its probability list is (LA1, P1), (LA2, P2),….. (Lak, Pk). This list is maintained in decreasing order P1 > P2 > … >Pk.

22. The mobile terminal does need to perform location update if mobile terminal enters in any one of the Location area LA1, LA2, … LAk mention in list during the corresponding time period t. • Thus at call arrival time paging starts from LA1, P1 and goes on until mobile terminal is found. • Reduces the location updation cost to a great extent and also minimizes the paging cost.

23. Paging Schemes Paging is one of the basic operation involved in location management. It examines all possible cells of a location area to find the cell in which mobile terminal is actually located. Sends query message to all cells of location area. Mobile terminal monitors common control channel periodically to check whether it is paged or not If Mobile terminal finds paging signal for itself , it sends acknowledgement signal.

24. Paging Schemes • Simultaneous paging : • All the cells are paged simultaneously in location area to find the exact location of a mobile terminal. • This approach ensures minimum delay in location Mobile terminal but incurs high degree of paging traffic. • Unmanageable when large number of users needs to be deal.

25. Paging Schemes Shortest distance first: Paging is done first in the last reported cell and thereafter moving in shortest distance first order as shown in figure. When there is no paging delay constraints these Paging areas can be paged one by one Make a group of paging areas and then each group is paged one by one in order to minimize the paging delay.

26. Paging Schemes 3. Sequential Paging: The current location of a mobile terminal is based on its location probability distribution and signals are sent only to predicted locations. • Paging cost is minimized when sequentially searching location areas in decreasing order of probability of containing the mobile terminal.

27. Paging Schemes 4. Intelligent Paging scheme: • Sequential paging can be made more preferable by computing some Paging orders of different Pages based on pre established probability metrics. • Main aim to find the correct paging area at first attempt • Entails more computational overhead.

28. Conclusion • As per the discussed location based location management addressing schemes designed based on the individual mobile terminal’s profile information (profile based) have shown good performance and had also reduced the location update cost to great extent. • Moreover the distance based location addressing scheme is best to locate mobile terminal but involves many complex computations and so it is very difficult to implement real time.

29. Question1 Consider the figure shown with route 1->2->3->4->5->6->7->8->9 of a Mobile terminal. Apply Distance based Updating scheme having threshold value D=3 Km. Also assume distance between each cell is 1km. And last updated cell area is 1. Find out the cell number in which location update will occur by following the route shown in figure? Answer: Mobile terminal route shown in figure is always within 3Km distance from cell1 so location update does not occurs.

30. Question 2 Consider the mobile terminal route as shown in figure from cell1 to cell14. Apply Time based updating scheme with threshold value T = 4 hour. The timer is 0 hr when mobile terminal is in Cell1 and when enters cell 14 , timer t = 4 hour and remains in same cell for another 15 minutes. Find out in which cell, location update occur ? Answer: Location update occurs in cell 14. Explanation: When Mobile terminal enters in cell 14 , timer t = 4 hr which is equal to threshold value T = 4hr so while entering in cell 14 location update is not performed. But as it remains in same cell for another 15 min, it exceeds the threshold value T = 4hr and so location update occurs in cell 14 and timer becomes t = 0 hr.

31. Question3 Consider a location area as shown in figure. Cell 1 is the last updated cell. Mobile terminal route is shown in figure with black lines, 1, 7, 8, 20, 37, 36, 35. Apply Movement based dynamic location update strategy having distance threshold value 3. Find out in which cell number, mobile terminal performs location updation when travelling the above shown route ? Answer: As per the threshold value M=3, when mobile terminal enters in cell number 37 updates its new location

32. Questions?Thank You!