Location management in mobile ad hoc wireless networks using quorums and clusters

Position-based reactive routing is a scalable solution for routing in mobile ad hoc networks. The route discovery algorithm in position-based routing can be efficiently implemented only if the source knows the current address of the destination. In this paper, a quorum-based location management scheme is proposed. Location servers are selected using the minimum dominating set (MDS) approach, and are further organized into quorums for location update and location query. When a mobile node moves, it updates its location servers in the update quorum; when a node requests the location information of another node, it will send a query message to the location servers in the query quorum. We propose to use the position-based quorum system, which is easy to construct and guarantees that the update quorums always intersect with the query quorums so that at least one location server in the query quorum is aware of the most recent location of the mobile node. Clusters are introduced for large scale ad hoc networks for scalability. Experiment results show that the proposed scheme provides good scalability when network size increases. Copyright © 2005 John Wiley & Sons, Ltd.

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

[2]  Zygmunt J. Haas,et al.  Ad Hoc mobility management with uniform quorum systems , 1999, TNET.

[3]  Zygmunt J. Haas,et al.  Ad-hoc mobility management with randomized database groups , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[4]  Martin Mauve,et al.  A survey on position-based routing in mobile ad hoc networks , 2001, IEEE Netw..

[5]  Amotz Bar-Noy,et al.  Tracking mobile users in wireless communications networks , 1993, IEEE Trans. Inf. Theory.

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

[7]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

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

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[11]  Zygmunt J. Haas,et al.  Virtual backbone generation and maintenance in ad hoc network mobility management , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[12]  Mukesh Singhal,et al.  Load-Balanced Location Management for Cellular Mobile Systems Using Quorums and Dynamic Hashing , 2001, Wirel. Networks.