Skip to main content

Golay Code Clustering for Mobility Behavior Similarity Classification in Pocket Switched Networks

  • Conference paper
Wireless Algorithms, Systems, and Applications (WASA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6843))

Abstract

In Pocket Switched Networks (PSN), the similarity of mobility patterns of different human beings can be exploited to design routing protocols that have better packet delivery ratio and shorter end-to-end delay. However, current research lacks techniques to effectively quantify the similarity of human beings’ mobility behaviors as they exhibit diversities in both the time and spatial domains. In this paper, we provide a mechanism to encode the human mobility patterns and propose a Golay code based clustering system to facilitate the identification of the set of codewords that incarnate similar mobility behaviors. We will apply this clustering based mobility behavior similarity classification method to design PSN routing protocols in our future research.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hui, P., Chaintreau, A., Gass, R., Scott, J., Crowcroft, J., Diot, C.: Pocket switched networking: Challenges, feasibility and implementation issues. In: Stavrakakis, I., Smirnov, M. (eds.) WAC 2005. LNCS, vol. 3854, pp. 1–12. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Wang, S., Liu, M., Cheng, X.: Routing in pocket switched networks. IEEE Wireless Communications (2011)

    Google Scholar 

  3. Gao, W., Cao, G.: On exploiting transient contact patterns for data forwarding in delay tolerant networks. In: ICNP (2010)

    Google Scholar 

  4. Dubois-Ferriere, H., Grossglauser, M., Vetterli, M.: Age matters: efficient route discovery in mobile ad hoc networks using encounter ages. In: MobiHoc, Annapolis, Maryland, USA (2003)

    Google Scholar 

  5. Wang, S., Liu, M., Cheng, X., Huang, J., Yang, B., Li, Z., Chen, B.: Hero - a home based routing in pocket switched networks: the single-copy case. Submitted to IEEE Transactions on Parallel and Distributed Systems (March 2011)

    Google Scholar 

  6. Hui, P., Crowcroft, J., Yoneki, E.: Bubbble rap: social-based forwarding in delay tolerant networks. In: MobiHoc, Hong Kong, China (2008)

    Google Scholar 

  7. Liu, C., Wu, J.: Routing in a cyclic mobispace. In: MobiHoc, Hong Kong, China (2008)

    Google Scholar 

  8. Leguay, J., Friedman, T., Conan, V.: Evaluating mobility pattern space routing for dtns. In: INFOCOM, Barcelona, Catalunya, SPAIN (2006)

    Google Scholar 

  9. Van Lint, J.: Nonexistence theorems for perfect error-correcting codes. In: Proceedings of the Symposium on Computers in Algebra and Number Theory, pp. 89 – 95 (1970)

    Google Scholar 

  10. Van Lint, J.: A survey of perfect codes. Journal of Mathematics 5(2) (1975)

    Google Scholar 

  11. Tietavainen, A.: On the nonexistence of perfect codes over finite fields. SIAM Journal of Applied Mathematics 24(1), 88–96 (1973)

    Article  MathSciNet  Google Scholar 

  12. Lin, S., Costello, D.: Error Control Coding: Fundamentals and Applications. Hall Inc., Englewood Cliffs, NJ (1983)

    MATH  Google Scholar 

  13. Berkovich, S., El-Qawasmeh, E.: Reversing the error-correction scheme for a fault-tolerant indexing. The Computer Journal 43(1), 54–64 (2000)

    Article  MATH  Google Scholar 

  14. Berkovich, E.: Method of and system for searching a data dictionary with fault tolerant indexing. US patent No.: US 7,168,025 B1 (2007)

    Google Scholar 

  15. Henderson, T., Kotz, D., Abyzov, I., Yeo, J.: Crawdad trace set dartmouth/campus/movement (v. 2005-03-08) (March 2005), http://crawdad.cs.dartmouth.edu/dartmouth/campus/movement

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yu, H., Berkovich, S., Jing, T., Chen, D. (2011). Golay Code Clustering for Mobility Behavior Similarity Classification in Pocket Switched Networks. In: Cheng, Y., Eun, D.Y., Qin, Z., Song, M., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2011. Lecture Notes in Computer Science, vol 6843. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23490-3_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23490-3_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23489-7

  • Online ISBN: 978-3-642-23490-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics