Mobiscope: A Scalable Spatial Discovery Service for Mobile Network Resources

  • Matthew Denny
  • Michael J. Franklin
  • Paul Castro
  • Apratim Purakayastha
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2574)


Mobiscope is a discovery service where clients submit longrunning queries to continually find sets of moving network resources within a specified area. As in moving object databases (MODBMSs), moving resources advertise their positions as functions over time. When Mobiscope receives a query, it runs the query statically against advertisements (ads) that are currently cached by Mobiscope, and then continuously over ads that Mobiscope receives subsequently. For scalability, Mobiscope distributes the workload to multiple nodes by spatial coordinates. Application-level routing protocols based on geography ensure that all queries find all matching resources on any node without significant processing overhead. Simulation results indicate that Mobiscope scales well, even under workloads that stress Mobiscope’s distribution model.


Position Function Service Region Mobile Resource Continuous Query Multiple Directory 
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]
    W. Adjie-Winoto, E. Schwartz, H. Balakrishnan, and J Lilley. The design and implementation of an intentional naming system. Operating Systems Review, 35(5):186–201, December 1999.CrossRefGoogle Scholar
  2. [2]
    P. Castro, B. Greenstein, R. Muntz, C. Bisdikian, P. Kermani, and M. Papadopouli. Locating application data across service discovery domains. In Mobicom, 2001.Google Scholar
  3. [3]
    S. Chandrasekaran and M. J. Franklin. Streaming queries over streaming data. In VLDB, 2002.Google Scholar
  4. [4]
    N. H. Cohen, H. Lei, P. Castro, J. S. Davis II, and A. Purakayastha. Composing pervasive data using iql. In 4th IEEE Workshop on Mobile Computing Systems and Applications, pages 94–104, 2002.Google Scholar
  5. [5]
    N. H. Cohen, A. Purakayastha, L. Wong, and D. L. Yeh. iqueue: A pervasive data composition framework. In MDM, 2002.Google Scholar
  6. [6]
    M. Denny. Mobiscope: A scalable spatial discovery service for mobile network resources. Master’s thesis, U.C. Berkeley, 2002.Google Scholar
  7. [7]
    S. Chandrasekaran et. al. Telegraphcq: Continuous dataflow processing for an uncertain world. In The First Biennial Conference on Inoovative Data Systems Research, 2003.Google Scholar
  8. [8]
    V. Gaede and G. Gunther. Multidimensional access methods. In Computing Surveys 30(2), 1998.Google Scholar
  9. [9]
    E. Guttman, C. Perkins, J. Veizades, and M. Day. Service location p rotocol, version 2. RFC 2608.Google Scholar
  10. [10]
    J. M. Hellerstein and M. Stonebraker, editors. Readings in Database Systems, 3rd Ed., chapter 2: Relational Implementation Techniques (Chapter Notes), pages 77–82. Morgan Kaufmann Publishers, Inc., 1998.Google Scholar
  11. [11]
    T. Hodes, S. Czerwinski, B. Zhao, A. Joseph, and R. Katz. An architecture for a secure service discovery service. In ACM Baltzer Wireless Networks (to Appear).Google Scholar
  12. [12]
    G. Kollios, D. Gunopulos, and V. J. Tsotras. On indexing mobile objects. In PODS, 1999.Google Scholar
  13. [13]
    C. Mohan, B. Lindsay, and R. Obermarck. Transaction management in the r* distributed database management system. In TODS 11(4), 1986.Google Scholar
  14. [14]
    Julio C. Navas and Tomasz Immielinski. Geocast-geographic addressing and routing. In Mobicom, 1997.Google Scholar
  15. [15]
    D. Pfoser, C. S. Jensen, and Y. Theodoridis. Novel approaches in query processing for moving object trajectories. In VLDB, 2000.Google Scholar
  16. [16]
    S. Ratnasamy, P. Francis, M. Handley, and R. Karp. A scalable content-adressable network. In SIGCOMM, 2001.Google Scholar
  17. [17]
    S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the positions of continuously moving objects. In SIGMOD, 2000.Google Scholar
  18. [18]
    M. A. Shah, J. M. Hellerstein, S. Chandrasekaran, and M. J. Franklin. Flux: An adaptive repartitioning operator for continuous query systems. In ICDE, 2003.Google Scholar
  19. [19]
    D. Steere, A. Baptista, D. Mcnamee, C. Pu, and J. Walpole. Research challenges in environmental observation and forecasting systems. In MobiCom, 2000.Google Scholar
  20. [20]
    O. Wolfson, S. Chamberlain, S. Dao, S. Dao, L. Jiang, and G. Mendez. Cost and imprecision in modeling the position of moving objects. In ICDE, 1998.Google Scholar
  21. [21]
    O. Wolfson, B. Xu, S. Chamberlain, and L. Jiang. Moving objects databases: Issues and solutions. In Conference on Scientific and Statistical Database Management (SSDBM98), 1998.Google Scholar
  22. [22]
    W. Yeong, T. Howes, and S. Kille. Lightweight directory access protocol. RFC 1777.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Matthew Denny
    • 1
  • Michael J. Franklin
    • 1
  • Paul Castro
    • 2
  • Apratim Purakayastha
    • 2
  1. 1.U.C. BerkeleyBerkeleyUSA
  2. 2.IBM T.J. Watson Research CenterHawthorneUSA

Personalised recommendations