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

  • Dan-Dan Liu
  • Xiao-Hua Jia
Part of the Signals and Communication Technology book series (SCT)

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.


Sensor Node Wireless Sensor Network Source Node Object Tracking Information Dissemination 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Gifford, D.K.(1979). Weighted voting for replicated data, in Proceedings 7th Sym-posium on Operating Systems Principles, ACM, pp.150-62.Google Scholar
  2. 2.
    G. Coulouris, J. Dollimore, T. Kindberg, Distributed systems: concepts and design, 3rd edition, ISBN 0-201-61918-0.Google Scholar
  3. 3.
    M. Maekawa, A n1/2algorithm for mutual exclusion in decentralized systems, ACM Transactions in Computer Systems, 14-159, May 1985.Google Scholar
  4. 4.
    D. Culler, D. Estrin, and M. Srivastava, Overview of sensor networks, Computer, Vol. 37, No. 8, 2004, pp. 41-49.CrossRefGoogle Scholar
  5. 5.
    K. Martinez, J. K. Hart, and R. Ong, Sensor network applications, Computer, Vol. 37, No. 8, 2004, pp. 50-56.CrossRefGoogle Scholar
  6. 6.
    M. Mauve, J. Widmer, and H. Hartenstein, A survey on position-based routing in mobile ad hoc networks, IEEE Network, vol.15, no.6, 2001.Google Scholar
  7. 7.
    R. Prakash, Z. Haas, M. Singhal, Load-balanced location management for cellu-lar mobile systems using quorums and dynamic hashing, ACM/Baltzer Wireless Networks (WINET) Journal, Volume 7, Number 5, Pages 497-512, September 2001.MATHCrossRefGoogle Scholar
  8. 8.
    G. Krishnamurthi, M. Azizoglu and A. K. Somani, Optimal location manage-ment algorithms for mobile networks, Proc. 4th Annual ACM/IEEE Int. Conf. on Mobile Computing and Networking MOBICOM’98, 223-232,1998.CrossRefGoogle Scholar
  9. 9.
    A. Bar-Noy and I. Kessler and M. Sidi, Mobile users: to update or not to update? in Proceedings of IEEE INFOCOM (1994), pp. 570-576.Google Scholar
  10. 10.
    B. Awerbuch and D. Peleg, Online tracking of mobile users, Journal of the Association for Computing Machinery 42(5), (September 1995) 1021-1058.MATHMathSciNetGoogle Scholar
  11. 11.
    J. Z. Wang, A fully distributed location registration strategy for universal per-sonal communication systems, IEEE Journal on Selected Areas in Communica-tions 11, (August 1993) 850-860.CrossRefGoogle Scholar
  12. 12.
    S.Sesay, Z. Yang and J. H, A survey on mobile ad hoc wireless network, Information Technology Journal 3(2), :168-175, 2004 ISSN 1682-6027.CrossRefGoogle Scholar
  13. 13.
    S. Basagni, I. Chlamtac, V. R. Syrotiuk, and B. A. Woodward, A distance routing effect algorithm for mobility (DREAM), MOBICOM 98, Dallas Texas USA.Google Scholar
  14. 14.
    Y.-B. Ko and N. H. Vaidya, Location-aided routing (LAR) in mobile ad hoc networks, ACM/Baltzer WINET J., vol. 6, no. 4, 2000, pp. 307-21.MATHCrossRefGoogle Scholar
  15. 15.
    S. M. Das, H. Pucha and Y. C. Hu, Performance comparison of scalable location services for geographic ad hoc routing, IEEE INFOCOM, 2005.Google Scholar
  16. 16.
    J. Li, J. Jannotti D. S. J. D. Couto, D. R. Karger, and R. Morris, A scalable lo-cation service for geographic ad hoc routing, in Proc. of ACM MobiCom, August 2000.Google Scholar
  17. 17.
    Y. Xue, B. Li, and K. Nahrstedt, A scalable location management scheme in mobile ad hoc networks, in Proc. of IEEE LCN, November 2001.Google Scholar
  18. 18.
    I. Stojmenovic, Home region based location updates and destination search schemes in ad hoc wireless networks, SITE, University of Ottawa, Tech. Rep. TR-99-10, September 1999.Google Scholar
  19. 19.
    S. Giordano and M. Hami, Mobility management: the virtual home region, EPFL, Tech. Rep. SSC/037, October 1999.Google Scholar
  20. 20.
    S. -C. M. Woo and S. Singh, Scalable routing protocol for ad hoc networks, Wireless Networks, vol.7, no. 5, pp. 513-529, 2001.MATHCrossRefGoogle Scholar
  21. 21.
    Z. J. Haas and B. Liang, Ad hoc mobility management with uniform quorum systems, IEEE/ACM Transactions on Netwoking, vol.7, no.2, pp.228-240, April 1999.CrossRefGoogle Scholar
  22. 22.
    I. Stojmenovic, A scalable quorum based location update scheme for routing in ad hoc wireless networks, SITE, University of Ottawa, Tech. Rep. TR-99-09, September1999.Google Scholar
  23. 23.
    W. R. Heinzelman, J. Kulit, and H. Balakrishnan, Adaptive protocols for infor-mation dissemination in wireless sensor networks, The 5th ACM/IEEE Annual International Conference on Mobile Computing and Networking (MOBICOM), Seattle, WA, Aug 1999.Google Scholar
  24. 24.
    C. Intanagonwiwat, R. Govindan, and D. Estrin, Directed diffusion: a scal-able and robust communication paradigm for sensor networks, The 6th An-nual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM), Boston, MA, Aug 2000.Google Scholar
  25. 25.
    S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks, Vol. 18, No. 4, pp. 319-349,1988.MATHCrossRefMathSciNetGoogle Scholar
  26. 26.
    B. S. Chlebus, Randomized communication in radio networks, Handbook of RandomizedComputing, Vol.1-2, pp. 401-456, Kluwer Academic Publishers, Dordrecht, 2001.Google Scholar
  27. 27.
    L. Orecchia, A. Panconesi, C. Petrioli, and A. Vitaletti, Localized techniques for broadcasting in wireless sensor networks, ACM DIALM-PODC Workshop at MOBICOM, Philadelphia, PA, 2004.Google Scholar
  28. 28.
    D. Liu, X. Hu, and X. Jia, Energy efficient information dissemination protocols by negotiation for wireless sensor networks, submitted to Computer Communications.Google Scholar
  29. 29.
    B. Karp and H. T. Hung, GPSR: greedy perimeter stateless routing for wire-less networks, The 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM), Boston, MA, Aug 2000.Google Scholar
  30. 30.
    E. Kranakis, H. Singh, and J. Urrutia, Compass routing on geometric networks, The 11th Canadian Conference on Computational Geometry (CCCG), Vancou-ver, Canada, Aug 1999.Google Scholar
  31. 31.
    P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, Routing With guaranteed delivery in ad hoc wireless networks, Wireless Networks, Vol. 7, pp. 609-616, 2001.MATHCrossRefGoogle Scholar
  32. 32.
    K. Gabriel and R. Sokal, A new statistical approach to geographic variation analysis, Systematic Zoology, Vol. 18, pp. 259-278, 1969.CrossRefGoogle Scholar
  33. 33.
    F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger, Geometric ad-hoc rout-ing: of theory and practice, The22nd ACM International Symposium on the Principles of Distributed Computing (PODC), Boston, MA, July 2003.Google Scholar
  34. 34.
    G.G. Finn, Routing and addressing problems in large metropolitan-scale inter-networks, ISI Research Report ISU/RR-87-180, March 1987.Google Scholar
  35. 35.
    I. Stojmenovic and X. Lin, Loop-free hybrid single-path/flooding routing al-gorithms with guaranteed delivery for wireless networks, IEEE Transactions on Parallel and Distributed Systems, Vol. 12, No. 10, October 2001, 1023-1032.CrossRefGoogle Scholar
  36. 36.
    H. Takagi and L. Kleinrock, Optimal transmission ranges for randomly dis-tributed packet radio terminals, IEEE Trans. on Communications, 32, 3, 1984, 246-257.CrossRefGoogle Scholar
  37. 37.
    K. Martinez I. Aydin and C. C. Shen, Facilitating match-making service in ad hoc and sensor networks using pseudo quorum, The 11th IEEE International Conference Computer Communication Networks (ICCCN), Miami, Florida, Oct 2002.Google Scholar
  38. 38.
    F. Ye, H. Luo, J. Cheng, S. Lu, and L. Zhang, A two-tier data dissemination model for large-scale wireless sensor networks, ACM MOBICOM’02, pp. 148-159, September 2002.Google Scholar
  39. 39.
    S. Ratnasamy, B. Karp, S. Shenker, D. Estrin, R. Govindan, L. Yin and F. Yu, Data-centric storage in sensornets with GHT, a geographic hash table, Mobile Networks and Applications, Vol. 8, 2003, pp.427-442.CrossRefGoogle Scholar
  40. 40.
    S. Y. Ni, Y. C. Tseng, Y. S. Chen and J. P. Sheu, The broadcast storm problem in a mobile ad hoc network, 5th annual International Conference on Mobile Com-puting and Networking (MobiCom’99), Seattle, Washington, Aug. 15-20 1999.Google Scholar
  41. 41.
    P. Sinha, R. Sivakumar and V. Bharghavan, Enhancing ad hoc routing with dynamic virtual infrastructures, IEEE INFOCOM 2001, pp. 1763-1772.Google Scholar
  42. 42.
    J. Chen, Y. Guan, and U. Pooch, An efficient data dissemination method in wireless sensor networks, IEEE INFOCOM 2004.Google Scholar
  43. 43.
    J. Liu, J. Liu, L. Reich, P. Cheung, and F. Zhao, Distributed group manage-ment for track initiation and maintenance in target localization applications, 2nd Workshop on Information Processing in Sensor Networks (IPSN), April 2003.Google Scholar
  44. 44.
    F. Zhao, J. Shin and J. Reich, Information-driven dynamic sensor collaboration for tracking applications, IEEE Signal Processing Magazine, pp.68-77, March 2002.Google Scholar
  45. 45.
    M. Chu, H. Haussecker and F. Zhao, Scalable information-driven sensor querying and routing for ad hoc heterogeneous sensor networks, International Journal of High Performance Computing Applications, 2002.Google Scholar
  46. 46.
    A. Cerpa, J. Elson, M. Hamilton, and J. Zhao, Habitat monitoring: application driver for wireless communications technology, First ACM SIGCOMM Workshop on Data Communications in Latin America and the Caribbean, April 2001.Google Scholar
  47. 47.
    W. Zhang, and G. Cao, DCTC: dynamic convoy tree-based collaboration for tar-get tracking in sensor networks, IEEE Transactions on Wireless Communication, http://www.cse.psu.edu/ gcao..
  48. 48.
    B. Brooks, C. Griffin and D. Friedlander, Self-organized distributed sensor net-work entity tracking, International Journal of High Performance Computing Ap-plications, Special Issue on Sensor Networks, 2002.Google Scholar
  49. 49.
    D. Li, K. Wong, Y. Hu and A. Sayeed, Detection, classification and tracking of targets in distributed sensor networks, IEEE, Signal Processing Magazine, pp. 17-29, March 2002.Google Scholar
  50. 50.
    W. Zhang, and G. Cao, Optimizing tree reconfiguration for mobile target track-ing in sensor networks, IEEE INFOCOM, March, 2004.Google Scholar
  51. 51.
    X. Liu, Q. Huang, and Y Zhang, Combs, needles, haystacks: balancing push and pull for discovery in large-scale sensor networks, The 2nd ACM Conference on Embedded Networked Sensor Systems, (SenSys), Baltimore, Maryland, Nov 2004.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • Dan-Dan Liu
    • 1
  • Xiao-Hua Jia
    • 2
  1. 1.Computer SchoolWuhan UniversityChina
  2. 2.Department of Computer ScienceCity University of HongKongChina

Personalised recommendations