A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. This report suggests an approach to utilize location information (for instance, obtained using the global positioning system) to improve performance of routing protocols for ad hoc networks.

/pdf/location-aided-routing-lar-in-mobile-ad-hoc-networks-4ijy8yjn7d.pdf

Location-aided routing (LAR) in mobile ad hoc networks

A mobile ad hoc network consists of wireless hosts that may move often. Movement of hosts results in a change in routes, requiring some mechanism for determining new routes. Several routing protocols have already been proposed for ad hoc networks. This paper suggests an approach to utilize location information (for instance, obtained using the global positioning system) to improve performance of routing protocols for ad hoc networks. By using location information, the proposed Location‐Aided Routing (LAR) protocols limit the search for a new route to a smaller “request zone” of the ad hoc network. This results in a significant reduction in the number of routing messages. We present two algorithms to determine the request zone, and also suggest potential optimizations to our algorithms.

This paper presents a mobile tracking scheme that exploits the predictability of user mobility patterns in wireless PCS networks. Instead of the constant velocity fluid-flow or the random-walk mobility model, a more realistic Gauss-Markov model is introduced, where a mobile's velocity is correlated in time to a various degree. Based on the Gauss-Markov model, a mobile's future location is predicted by the network based on the information gathered from the mobile's last report of location and velocity. When a call is made, the network pages the destination mobile at and around the predicted location of the mobile and in the order of descending probability until the mobile is found. A mobile shares the same prediction information with the network and reports its new location whenever it reaches some threshold distance away from the predicted location. We describe an analytical framework to evaluate the cost of mobility management for the proposed predictive distance-based scheme. We then compare this cost against that of the regular, non-predictive distance-based scheme, which is obtained through simulations. Performance advantage of the proposed scheme is demonstrated under various mobility and call patterns, update cost, page cost, and frequencies of mobile location inspections.

https://www.comm.toronto.edu/%7Eliang/publications/Infocom99.pdf

Predictive distance-based mobility management for PCS networks

This paper describes current and proposed protocols for mobility management for public land mobile network (PLMN)-based networks, mobile Internet protocol (IP) wireless asynchronous transfer mode (ATM) and satellite networks. The integration of these networks will be discussed in the context of the next evolutionary step of wireless communication networks. First, a review is provided of location management algorithms for personal communication systems (PCS) implemented over a PLMN network. The latest protocol changes for location registration and handoff are investigated for mobile IP followed by a discussion of proposed protocols for wireless ATM and satellite networks. Finally, an outline of open problems to be addressed by the next generation of wireless network service is discussed.

http://www.cs.tcd.ie/~htewari/papers/ieee99.pdf

Mobility management in next-generation wireless systems

This paper introduces a mobility tracking mechanism that combines a movement-based location update policy with a selective paging scheme. Movement-based location update is selected for its simplicity. It does not require each mobile terminal to store information about the arrangement and the distance relationship of all cells. In fact, each mobile terminal only keeps a counter of the number of cells visited. A location update is performed when this counter exceeds a predefined threshold value. This scheme allows the dynamic selection of the movement threshold on a per-user basis. This is desirable as different users may have very different mobility patterns. Selective paging reduces the cost for locating a mobile terminal in the expense of an increase in the paging delay. We propose a selective paging scheme which significantly decreases the location tracking cost under a small increase in the allowable paging delay. We introduce an analytical model for the proposed location tracking mechanism which captures the mobility and the incoming call arrival patterns of each mobile terminal. Analytical results are provided to demonstrate the cost-effectiveness of the proposed scheme under various parameters.

https://ir.nctu.edu.tw:443/bitstream/11536/1122/1/A1996VE43600013.pdf

Movement-based location update and selective paging for PCS networks

Wireless personal communication networks (PCNs) consist of a fixed wireline network and a large number of mobile terminals. These terminals are free to travel within the PCN coverage area without service interruption. Each terminal periodically reports its location to the network by a process called location update. When a call for a specific terminal arrives, the network will determine the exact location of the destination terminal by a process called terminal paging. This paper introduces a mobile user location management mechanism that incorporates a distance based location update scheme and a selective paging mechanism that satisfies predefined delay requirements. An analytical model is developed which captures the mobility and call arrival pattern of a terminal. Given the respective costs for location update and terminal paging, the average total location update and terminal paging cost is determined. An iterative algorithm is then used to determine the optimal location update threshold distance that results in the minimum cost. Analytical results are also obtained to demonstrate the relative cost incurred by the proposed mechanism under various delay requirements.

http://delab.csd.auth.gr/~dimitris/courses/mpc_fall05/papers/location_management/ACM_WINET_95_min_cost_loc_update_paging_under_delay.pdf

Mobile user location update and paging under delay constraints

A personal communications network (PCN) location tracking scheme called local anchoring is introduced which reduces the signalling cost as compared to the location management strategy proposed in the IS-41 standard. Local anchoring reduces the number of location registration messages between the home location register (HLR) and the visitor location registers (VLRs) in a way that location change is reported to a nearby VLR called the local anchor (LA) instead of to the HLR. This method successfully reduces the cost for location tracking when the call arrival rate is low relative to the mobility rate and the cost for location registration is high. A dynamic local anchoring mechanism is then introduced which dynamically selects the LA such that the expected cost for location registration and call delivery can be further reduced. It is demonstrated that the cost of dynamic local anchoring is always lower than or equal to that of the IS-41 scheme.

Local anchor scheme for reducing signaling costs in personal communications networks

The basic architecture of a personal communication network consists of a wireline network and mobile terminals. Each mobile terminal communicates with the wireline network through a nearby base station. In order to route incoming calls to a destination mobile terminal, the network must keep track of the location of each mobile terminal from time to time. This is achieved by location update such that each mobile terminal reports its current location to the network at specific time points. When an incoming call arrives, the network will page the mobile terminal starting from the last updated location. A trade-off, therefore, exists between the frequency of location update and the number of locations paged in order to track down the mobile terminal. This paper introduces a location update policy which minimizes the cost of mobile terminal location tracking. A mobile terminal dynamically determines when to update after moving to a new cell based on its mobility pattern and the incoming call arrival probability. The performance of this scheme is close to that of the optimal policy reported earlier. However, the processing time requirement of this scheme is very low. The minimal computation required by this scheme enables its usage in mobile terminals which has limited energy supply and computational power.

Dynamic mobile user location update for wireless PCS networks

This paper introduces a dynamic hierarchical database architecture for location management in personal communications service (PCS) networks. The proposed scheme allows the dynamic adjustments of user location information distribution based on the mobility and calling patterns of the mobile terminals (MTs). A unique distribution strategy is determined for each MT, and location pointers are set up at selected remote locations which indicate the current location of the MTs. This method effectively reduces the signaling and database access overhead for location registration and call delivery. Besides, the required processing is handled by a distributed network of directory registers and centralized coordination is not necessary. The functions of the other network elements, such as the home location register (HLR) and the visitor location registers (VLRs), remain primarily unchanged. This greatly facilitates the deployment of this scheme in current PCS networks.

Joseph S. M. Ho

Papers

Movement-based location update and selective paging for PCS networks

Mobile user location update and paging under delay constraints

Local anchor scheme for reducing signaling costs in personal communications networks

Dynamic mobile user location update for wireless PCS networks

Dynamic hierarchical database architecture for location management in PCS networks