Location management and fault tolerance issues in mobile networks

This chapter analyzes and proposes some mobility management models and schemes by taking into account their capability to reduce search and location update costs in wireless mobile networks. The first model proposed is called the built-in memory model; it is based on the architecture of the IS-41 network and aims at reducing the home-location-register (HLR) access overhead. The performance of this model was investigated by comparing it with the IS-41 scheme for different call-to-mobility ratios (CMRs). Experimental results indicate that the proposed model is potentially beneficial for large classes of users and can yield substantial reductions in total user-location management costs, particularly for users who have a low CMR. These results also show that the cost reduction obtained on the location update is very significant while the extra costs paid to locate a mobile unit simply amount to the costs of crossing a single pointer between two location areas. The built-in memory model is also compared with the forwarding pointers’ scheme. The results show that this model consistently outperforms the forwarding pointers’ strategy. A second location management model to manage mobility in wireless communications systems is also proposed. The results show that significant cost savings can be obtained compared with the IS-41 standard location-management scheme depending on the value of the mobile units’ CMR.

Download Full-text

ON THE PERFORMANCE OF STATIC AND DYNAMIC LOCATION MANAGEMENT STRATEGIES IN MOBILE COMPUTING

International Journal of Foundations of Computer Science ◽

10.1142/s0129054111008210 ◽

2011 ◽

Vol 22 (03) ◽

pp. 519-546 ◽

Cited By ~ 2

Author(s):

JAVID TAHERI ◽

ALBERT Y. ZOMAYA

Keyword(s):

Mobile Networks ◽

Management Strategies ◽

Location Management ◽

Dynamic Mode ◽

Management Problem ◽

Static Mode ◽

Management Algorithm ◽

Dynamic Location ◽

Pros And Cons ◽

Performance Results

This work reviews a number of algorithms to solve the location management problem in mobile networks for both static and dynamic scenarios. In the static mode, results of five algorithms are used to highlight the pros and cons for each algorithm. These results provide new insight into the mobility management problem that can influence the design of future wireless networks. In the dynamic mode in which mobile users' past movement patterns are used in making future paging decisions by the network, the performance of an online location management algorithm is examined under different deployment setups. Performance results of this algorithm show its advantages over the currently implemented and/or proposed static location management systems (including GSM).

Download Full-text

Virtual Net: A Decentralized Architecture for Interaction in Mobile Virtual Worlds

Wireless Communications and Mobile Computing ◽

10.1155/2018/9749187 ◽

2018 ◽

Vol 2018 ◽

pp. 1-24

Author(s):

Bingqing Shen ◽

Jingzhi Guo

Keyword(s):

Fault Tolerance ◽

Mobile Devices ◽

Mobile Technology ◽

Virtual Worlds ◽

Mobile Networks ◽

Virtual World ◽

Object State ◽

High Interaction ◽

Decentralized Architecture ◽

User Content

With the development of mobile technology, mobile virtual worlds have attracted massive users. To improve scalability, a peer-to-peer virtual world provides the solution to accommodate more users without increasing hardware investment. In mobile settings, however, existing P2P solutions are not applicable due to the unreliability of mobile devices and the instability of mobile networks. To address the issue, a novel infrastructure model, called Virtual Net, is proposed to provide fault-tolerance in managing user content and object state. In this paper, the key problem, namely, object state update, is resolved to maintain state consistency and high interaction responsiveness. This work is important in implementing a scalable mobile virtual world.

Download Full-text