Location Service, Information Dissemination and Object Tracking in Wireless Sensor Networks by Using Quorum Methods

Quorum methods were originally used in consistency control for data replicas in distributed database systems. Replication of data is the key technology for high availability and fault tolerance in a distributed system. Upon receiving a request to perform an operation on a particular datum, the server is responsible for cooperating with other servers in the group that have copies of the data. Different replication schemes involve different numbers of servers for the successful accomplishment of an operation. For example, in the traditional read-any/write-all scheme, a writing request must be finished by all servers in the system, so that a read operation can be performed by any single server. However, this scheme is not reliable because failure any one of the servers will cause failure of the write operation, and finally failure of data accessing. The quorum consensus method aims at reducing the number of servers taking part in a data operation. A quorum is a subgroup of servers whose size gives it the right to make decisions. For example, if having a majority is the criterion, a quorum must consist of at least n/2 servers cooperating to carry out operations, where n is the total number of servers in the system. The quorum method was used early on in [1]. Gifford in his paper developed a file replication scheme in which a number of ‘votes’ is assigned to each physical copy at a replica manager of a single logical file. In each transaction, a read quorum of R votes must be collected to proceed with a read opera-

[1]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[2]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[3]  Feng Zhao,et al.  Scalable Information-Driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor Networks , 2002, Int. J. High Perform. Comput. Appl..

[4]  Guohong Cao,et al.  DCTC: dynamic convoy tree-based collaboration for target tracking in sensor networks , 2004, IEEE Transactions on Wireless Communications.

[5]  Chien-Chung Shen,et al.  Facilitating match-making service in ad hoc and sensor networks using pseudo quorum , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[6]  Zongkai Yang,et al.  A Survey on Mobile Ad Hoc Wireless Network , 2004 .

[7]  Ivan Stojmenovic,et al.  Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[8]  Amotz Bar-Noy,et al.  Mobile users: To update or not to update? , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[9]  Arun K. Somani,et al.  Optimal location management algorithms for mobile networks , 1998, MobiCom '98.

[10]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

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

[12]  Akbar M. Sayeed,et al.  Detection, Classification and Tracking of Targets in Distributed Sensor Networks , 2002 .

[13]  Vaduvur Bharghavan,et al.  Enhancing ad hoc routing with dynamic virtual infrastructures , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  Kirk Martinez,et al.  Environmental sensor networks , 2004, Computer.

[15]  John Zhonghe Wang.  A Fully Distributed Location Registration Strategy for Universal Personal Communication Systems , 1993, IEEE J. Sel. Areas Commun..

[16]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[17]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

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

[19]  Suresh Singh,et al.  Scalable Routing Protocol for Ad Hoc Networks , 2001, Wirel. Networks.

[20]  Guohong Cao,et al.  Optimizing tree reconfiguration to track mobile targets in sensor networks , 2003, MOCO.

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

[22]  Deborah Estrin,et al.  Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table , 2003, Mob. Networks Appl..

[23]  Ying Zhang,et al.  Combs, needles, haystacks: balancing push and pull for discovery in large-scale sensor networks , 2004, SenSys '04.

[24]  George Coulouris,et al.  Distributed systems (3rd ed.): concepts and design , 2000 .

[25]  Richard R. Brooks,et al.  Self-Organized Distributed Sensor Network Entity Tracking , 2002, Int. J. High Perform. Comput. Appl..

[26]  Himabindu Pucha,et al.  Performance comparison of scalable location services for geographic ad hoc routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[27]  Jorge Urrutia,et al.  Compass routing on geometric networks , 1999, CCCG.

[28]  Udo W. Pooch,et al.  An efficient data dissemination method in wireless sensor networks , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[29]  Baruch Awerbuch,et al.  Online tracking of mobile users , 1995, JACM.

[30]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[31]  Klara Nahrstedt,et al.  A scalable location management scheme in mobile ad-hoc networks , 2001, Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks.

[32]  Nitin H. Vaidya,et al.  Location‐Aided Routing (LAR) in mobile ad hoc networks , 2000, Wirel. Networks.

[33]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[34]  Mani Srivastava,et al.  Overview of sensor networks , 2004 .

[35]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 2001, Wirel. Networks.

[36]  Feng Zhao,et al.  Distributed Group Management for Track Initiation and Maintenance in Target Localization Applications , 2003, IPSN.

[37]  Deborah Estrin,et al.  Habitat monitoring: application driver for wireless communications technology , 2001, SIGCOMM LA '01.

[38]  Gregory G. Finn,et al.  Routing and Addressing Problems in Large Metropolitan-Scale Internetworks. ISI Research Report. , 1987 .

[39]  Deborah Estrin,et al.  Guest Editors' Introduction: Overview of Sensor Networks , 2004, Computer.

[40]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[41]  Haiyun Luo,et al.  A two-tier data dissemination model for large-scale wireless sensor networks , 2002, MobiCom '02.

[42]  David K. Gifford,et al.  Weighted voting for replicated data , 1979, SOSP '79.

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

[44]  Yu Hen Hu,et al.  Detection, classification, and tracking of targets , 2002, IEEE Signal Process. Mag..

[45]  Andrea Vitaletti,et al.  Localized techniques for broadcasting in wireless sensor networks , 2004, DIALM-POMC '04.

[46]  Feng Zhao,et al.  Information-Driven Dynamic Sensor Collaboration for Tracking Applications , 2002 .