An evaluation of location management procedures

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 registered in. As the timer elapses, the mobile performs a location update. Both scenarios also differ in the way paging is performed. In the first scenario it is only necessary to page in the location area the mobile is currently registered in. In order to do this efficiently, the paging is done in a 2-step fashion: mobiles are paged first in the paging area in which they were registered in, and next in the entire location area they are registered in. In the second scenario the mobile is paged in multiple steps: first in the paging area it is registered in, next in a circle of paging areas surrounding that area, and so on, until the mobile is found, or the number of steps has reached a certain upper limit. Results comprise a quantitative and qualitative comparison of these scenarios, and guidelines for optimal applicatio

Location management and multimedia communication service based on mobile IP and cellular IP network

[[abstract]]Wireless communication that provides voice only is not sufficient to support the necessity of user. It is an important feature of future wireless communication to offer this capability through mobile Internet. Mobile IP allows mobile hosts to change their location and reduce the losing probability of data packets in wireless communication networks. However, Mobile IP still have some defects in handoff and route aspects. Therefore, Cellular IP protocol is proposed for routing of IP diagrams to mobile stations and fast handoff control in a limited geographical area. In this paper, a handoff method is proposed to improve Quality of Service and resource switching management to reduce data packet loss for mobile multimedia communication in hierarchical network. In the future, all-IP network and mobile multimedia communication are two important characteristics, so that IP macromobility and micromobility network architecture are combined for data packets transfer. A Soft-handoff method is also presented to improve Quality of Service (QoS) and resource switching management to reduce data packet loss.[[notice]]補正完畢[[notice]]補正完畢[[conferencetype]]國際[[conferencedate]]20030327~20030329[[iscallforpapers]]Y[[conferencelocation]]Xi'an, Chin

Distributed tuplespace and location management - an integrated perspective using Bluetooth

Location based or "context aware" computing is becoming increasingly recognized as a vital part of a mobile computing environment. As a consequence, the need for location-management middleware is widely recognized and actively researched. Location management is frequently offered to the application through an API where the location is given in the form of coordinates. It is the opinion of the authors that a localization API should offer localized data (e.g. direction to the nearest pharmacy) directly through a transparent and integrated API. Our proposed middleware for location and context management is built on top of Mobispace. Mobispace is a distributed tuplespace made for J2me units where replication between local replicas takes place with a central server (over GPRS) or with other mobile units (using Bluetooth). Since a Bluetooth connection indicates physical proximity to another node, a set of stationary nodes may distribute locality information over Bluetooth connections, and this information may be retrieved through the ordinary tuplespace AP

Location management for GPRS

Master'sMASTER OF ENGINEERIN

Simulated Annealing for Location Area Planning in Cellular networks

LA planning in cellular network is useful for minimizing location management cost in GSM network. In fact, size of LA can be optimized to create a balance between the LA update rate and expected paging rate within LA. To get optimal result for LA planning in cellular network simulated annealing algorithm is used. Simulated annealing give optimal results in acceptable run-time.Comment: 7 Pages, JGraph-Hoc Journa