Mobility agent based on activity rate of user and adaptive paging for location management in wireless networks

Abstract

In urban cities, many MUs (mobile users) follow a fixed mobility pattern. Most of the time, these users can be found in a particular registration area (RA) at a certain time period. We say that MUs follow a fixed set of RAs on a daily basis. Therefore, an MU can be located at one of the RA from the set of fixed RAs when a call arrives. In prior schemes, the location update cost is minimized by increasing paging cost. In this paper, we propose a mobility agent (MA) and adaptive paging strategy based on MUs' movement. The MA is a special functional entity in the network, and many RAs are connected to MA as per mobility pattern of an MU. The paging area is selected based on the average speed of MUs. The major features of the proposed scheme are the overall reduced location management cost and less paging time compared with existing scheme. We present analytical modeling and performance evaluation that show that the proposed scheme has less location management cost and less paging time to locate an MU compared with existing scheme.

Fast and upper bounded Fano decoding algorithm: queuing analysis

“…Owing to their popularity for worldwide coverage, satellite networks have been used extensively in military and commercial applications . One of the best advantages of adopting aforementioned networks is the mobility characteristic . Unfortunately, the implication of such feature leads to the emergence of a real challenge for researchers, which certainly includes the necessity of having efficient and reliable designs that effectively use the battery power .…”