Consider an infinite one-dimensional cellular network. The cells are labeled .., -3, -2, -1, 0, 1,...

 

Transcribed Image Text:

Consider an infinite one-dimensional cellular network. The cells are labeled .., -3, -2, -1, 0, 1, 2, 3, .. by integers as follows: Given a user who was initially located at cell 2 and performed the first location update at there. Afterwards, he moved in the following pattern: 2, 3, 4, 3, 4, 3, 4, 5, 6, 7. Suppose distance-based strategy is used and the threshold value is 2. As indicated in the above movement pattern, the user is now in cell 7. (a) How many location updates has been performed, excluding the first location update at cell 2? (1 mark) (2 marks) (3 marks) (b) Identify in which cells he performed location update in (a). (c) Which cell(s) should be paged if the system wants to find the user? Consider an infinite one-dimensional cellular network. The cells are labeled .., -3, -2, -1, 0, 1, 2, 3, .. by integers as follows: Given a user who was initially located at cell 2 and performed the first location update at there. Afterwards, he moved in the following pattern: 2, 3, 4, 3, 4, 3, 4, 5, 6, 7. Suppose distance-based strategy is used and the threshold value is 2. As indicated in the above movement pattern, the user is now in cell 7. (a) How many location updates has been performed, excluding the first location update at cell 2? (1 mark) (2 marks) (3 marks) (b) Identify in which cells he performed location update in (a). (c) Which cell(s) should be paged if the system wants to find the user?