Ad Hoc mobility management with uniform quorum systems

A distributed mobility management scheme using a class of uniform quorum systems (UQS) is proposed for ad hoc networks. In the proposed scheme, location databases are stored in the network nodes themselves, which form a self-organizing virtual backbone within the flat network structure. The databases are dynamically organized into quorums, every two of which intersect at a constant number of databases. Upon location update or call arrival, a mobile's location information is written to or read from all the databases of a quorum, chosen in a nondeterministic manner. Compared with a conventional scheme [such as the use of home location register (HLR)] with fixed associations, this scheme is more suitable for ad hoc networks, where the connectivity of the nodes with the rest of the network can be intermittent and sporadic and the databases are relatively unstable. We introduce UQS, where the size of the quorum intersection is a design parameter that can be tuned to adapt to the traffic and mobility patterns of the network nodes. We propose the construction of UQS through the balanced incomplete block designs. The average cost, due to call loss and location updates using such systems, is analyzed in the presence of database disconnections. Based on the average cost, we investigate the tradeoff between the system reliability and the cost of location updates in the UQS scheme. The problem of optimizing the quorum size under different network traffic and mobility patterns is treated numerically. A dynamic and distributed HLR scheme, as a limiting case of the UQS, is also analyzed and shown to be suboptimal in general. It is also shown that partitioning of the network is sometimes necessary to reduce the cost of mobility management.

[1]  Vaduvur Bharghavan,et al.  Routing in ad hoc networks using a spine , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[2]  Howard M. Proskin,et al.  Theory of Block Designs , 1989 .

[3]  Mamoru Maekawa,et al.  A N algorithm for mutual exclusion in decentralized systems , 1985, TOCS.

[4]  Haim Hanani,et al.  Balanced incomplete block designs and related designs , 1975, Discret. Math..

[5]  Baruch Awerbuch,et al.  Concurrent Online Tracking of Mobile Users , 1991, SIGCOMM.

[6]  Jacob Sharony,et al.  An architecture for mobile radio networks with dynamically changing topology using virtual subnets , 1996, Mob. Networks Appl..

[7]  M. Singhal,et al.  A Dynamic Approach to Location Management in Mobile Computing Systems , 1996 .

[8]  D. A. Sprott Some Series Of Partially Balanced Incomplete Block Designs , 1955, Canadian Journal of Mathematics.

[9]  J. Jubin,et al.  The DARPA packet radio network protocols , 1987, Proceedings of the IEEE.

[10]  Yi-Bing Lin,et al.  On optimizing the location update costs in the presence of database failures , 1998, Wirel. Networks.

[11]  Mukesh Singhal,et al.  Dynamic hashing + quorum = efficient location management for mobile computing systems , 1997, PODC '97.

[12]  W.K. Ng,et al.  Coterie templates: a new quorum construction method , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.

[13]  David Peleg,et al.  The Availability of Quorum Systems , 1995, Inf. Comput..

[14]  Ravi Jain,et al.  Two user location strategies for personal communications services , 1994, IEEE Personal Communications.

[15]  F.A. Tobagi,et al.  Issues in packet radio network design , 1987, Proceedings of the IEEE.

[16]  Zygmunt J. Haas,et al.  The performance of query control schemes for the zone routing protocol , 1998, SIGCOMM '98.

[17]  Mostafa H. Ammar,et al.  The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data , 1992, IEEE Trans. Knowl. Data Eng..

[18]  Mukesh Singhal,et al.  A Dynamic Apporach Towards Location Management in Mobile Computing Systems , 1996, International Conference on Software Engineering and Knowledge Engineering.

[19]  David Peleg,et al.  Crumbling walls: a class of practical and efficient quorum systems , 1995, PODC '95.

[20]  Divyakant Agrawal,et al.  An efficient and fault-tolerant solution for distributed mutual exclusion , 1991, TOCS.

[21]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[22]  Moni Naor,et al.  Access Control and Signatures via Quorum Secret Sharing , 1998, IEEE Trans. Parallel Distributed Syst..

[23]  Divyakant Agrawal,et al.  Quorum consensus algorithms for secure and reliable data , 1988, Proceedings [1988] Seventh Symposium on Reliable Distributed Systems.

[24]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[25]  J. Sharony A mobile radio network architecture with dynamically changing topology using virtual subnets , 1996, Proceedings of ICC/SUPERCOMM '96 - International Conference on Communications.