Skip to main content

Indexing Moving Objects on Road Networks in P2P and Broadcasting Environments

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4295))

Abstract

Scalability is one of the crucial problems in realizing massively distributed systems such as ubiquitous computing. In this paper, we focus on indexing methods in massively distributed environments. A number of work on indexing in P2P, like CAN and Chord, have been devoted to overcome this problem. The lengths of routing path are \(O(dn^{\frac{1}{d}})\) for CAN and O(logn) for Chord, which are in fact the cost of search, where there are n nodes. In this paper, we propose an alternative indexing scheme not only relying on P2P but also on broadcasting environments. The contributions of this paper include firstly the reduction of routing path to nearly O(1) for road-oriented query by using broadcasting, and secondly handling the mobility of nodes on road networks.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Stoica, I., Morris, R., Karger, D.R., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of International Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 149–160 (2001)

    Google Scholar 

  2. Ratnasamy, S., Francis, P., Handley, M., Karp, R.M., Shenker, S.: A scalable content-addressable network. In: Proceedings of International Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 161–172 (2001)

    Google Scholar 

  3. Karp, B., Kung, H.T.: GPSR: Greedy Perimeter Stateless Routing for wireless networks. In: Proceedings of International Conference on Mobile Computing and Networking, pp. 243–254 (2000)

    Google Scholar 

  4. Young-Bae, K., Vaidya, N.H.: Location-Aided Routing (LAR) in mobile ad hoc networks. Wireless Networks 6(4), 307–321 (2000)

    Article  MATH  Google Scholar 

  5. Imielinski, T., Viswanathan, S., Badrinath, B.R.: Data on Air: Organization and Access. IEEE Transactions on Knowledge and Data Engineering 9(3), 353–372 (1997)

    Article  Google Scholar 

  6. Jensen, C.S., Kolárvr, J., Pedersen, T.B., Timko, I.: Nearest neighbor queries in road networks. In: Proceedings of ACM International Symposium on Advances in Geographic Information Systems, pp. 1–8 (2003)

    Google Scholar 

  7. Jensen, C.S., Pedersen, T.B., Speicys, L., Timko, I.: Data Modeling for Mobile Services in the Real World. In: Proceedings of International Symposium on Spatial and Temporal Databases, pp. 1–9 (2003)

    Google Scholar 

  8. Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: a fault-tolerant wide-area application infrastructure. Computer Communication Review 32(1), 81 (2002)

    Article  Google Scholar 

  9. Andrzejak, A., Xu, Z.: Scalable, Efficient Range Queries for Grid Information Services. In: Peer-to-Peer Computing, pp. 33–40 (2002)

    Google Scholar 

  10. Cai, M., Frank, M.R., Chen, J., Szekely, P.A.: MAAN: A Multi-Attribute Addressable Network for Grid Information services. In: Proceedings of International Workshop on Grid Computing, pp. 184–191 (2003)

    Google Scholar 

  11. Daskos, A., Ghandeharizadeh, S., An, X.: PePeR: A distributed range addressing space for peer-to-peer systems. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol. 2944, pp. 200–218. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  12. Hye-Young, K., Bog-Ja, L., Ki-Joune, L.: P2P spatial query processing by delaunay triangulation. In: Kwon, Y.-J., Bouju, A., Claramunt, C. (eds.) W2GIS 2004. LNCS, vol. 3428, pp. 136–150. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Bo-Ryun, K.: Generation of the Vehicle Trajectories using the Realistic Speed Model. Master’s thesis, Pusan National University (2006)

    Google Scholar 

  14. Civilis, A., Jensen, C.S., Nenortaite, J., Pakalnis, S.: Efficient Tracking of Moving Objects with Precision Guarantees. In: Proceedings of International Conference on Mobile and Ubiquitous Systems, pp. 164–173 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kang, HY., Kim, JS., Li, KJ. (2006). Indexing Moving Objects on Road Networks in P2P and Broadcasting Environments. In: Carswell, J.D., Tezuka, T. (eds) Web and Wireless Geographical Information Systems. W2GIS 2006. Lecture Notes in Computer Science, vol 4295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11935148_21

Download citation

  • DOI: https://doi.org/10.1007/11935148_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49466-9

  • Online ISBN: 978-3-540-49467-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics