Most previously proposed position based routing algorithms for wireless ad hoc networks were based on forwarding the actual message along multiple paths toward an area where destination is hopefully located. The significant communication overhead can be avoided if the routing strategy is changed. We propose that the source node issues several search 'tickets' (each ticket is a 'short' message c...

We investigates the performance of movement-based location update in multitier wireless networks with sparsely correlated low-tier microcells. The topologies are considered to have random overlays of different microcell cluster sizes, with distributions spatially of two forms: homogeneous and nonhomogeneous. Permission for a mobile station (MS) to report to either a low-tier microcell or a high...

Most previously proposed position based routing algorithms for wireless ad hoc networks were based on forwarding the actual message along multiple paths toward an area where destination is hopefully located. The significant communication overhead can be avoided if the routing strategy is changed. We propose that the source node issues several search 'tickets' (each ticket is a 'short' message c...

This paper suggests an improved probabilistic location update (IPLU) scheme for advanced cellular mobile networks. The location management cost with IPLU is analyzed, and various performance characteristics of IPLU are investigated. It is shown that IPLU has the parameter that can be used as a control parameter to achieve the best performance when the unit location update cost ( ) and the unit ...

—In this paper, an embedded Markov chain model is proposed to analyze the signaling cost of the Movement-Based Location Update (MBLU) scheme under which a Location Update (LU) occurs whenever the number of cells crossed reaches a threshold, called movement threshold. Compared with existing literature, this paper has the following advantages. 1) This paper proposes an embedded Markov chain mode...

t This paper gives a comparative description of two scenarios for location management in a mobile telecommunications system. The first scenario uses fixed location and paging areas. Mobiles perform a location update as they enter a new location area. The second scenario uses a time-out based location updating scheme. Mobiles start their timer as they leave the paging area they are currently reg...

An important feature that is expected to be owned by today s mobile computing systems is the ability of processing locationdependent continuous queries on moving objects. The result of a location-dependent query depends on the current location of the mobile client which has generated the query as well as the locations of the moving objects on which the query has been issued. When a location-dep...

All previously proposed position based routing algorithms for wireless ad hoc networks were based on forwarding the actual message along multiple paths toward an area where destination is hopefully located (except our previous report [SV]). In [SV], we proposed to reduce significantly the communication overhead by changing the routing strategy. The source node issues several search 'tickets' (e...

The fluid-flow model is suitable for vehicle traffic on highways but not for pedestrian movements with frequent “stop-and-go” behavior. Considering the change of a mobile’s velocity within a short time is limited due to physical restrictions, therefore a mobile user’s future velocity is likely to be correlated with its past and current velocity. Since Gauss–Markov model captures the essence of ...

Several alternative strategies for reducing paging and location update costs have been proposed lately. This paper initially compares four well-known strategies, that differ in the manner they approach that problem. The same mobility model and performance evaluation criteria were used for all strategies analyzed. Users are classified utilizing the call-to-mobility-ratio (CMR) metric. Results ar...