Skip to main content

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

Included in the following conference series:

Abstract

Ambient Assisted Living provides support for people’s daily life and aims at improving their quality of life. A health monitoring service could be intended to address the needs of sick people. Patient monitoring by medical personnel is frequently supported by handheld devices receiving health-care information. Location of these mobile devices is necessary in order to communicate any information, and the search strategy to locate them becomes a challenging issue in comparison to networks with permanent connections. We address this problem from an application point of view considering a membership based communication system characterized by users following repetitive patrol patterns day after day. We identify these patterns to generate a history of network connections to decrease the time required to locate any device on the network. We propose a modification of the commonly used Random Walk strategy to setup new connections on ad-hoc networks taking advantage of the learned patrol patterns.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Bar-Yossef, Z., Friedman, R., Kliot, G.: RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks. ACM Trans. Comput. Syst. 26(2), 1–66 (2008)

    Article  Google Scholar 

  2. Chockler, G.V., Keidar, I., Vitenberg, R.: Group communication specifications: a comprehensive study. ACM Comput. Surv. 33(4), 427–469 (2001)

    Article  Google Scholar 

  3. Bar-Yossef, Z., Gurevich, M.: Random sampling from a search engine’s index. In: Proceedings of the 15th International Conference on World Wide Web, WWW 2006, pp. 367–376. ACM, New York (2006)

    Google Scholar 

  4. Dasgupta, A., Das, G., Mannila, H.: A random walk approach to sampling hidden databases. In: Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data, SIGMOD 2007, pp. 629–640. ACM, New York (2007)

    Chapter  Google Scholar 

  5. Grundel, D.A.: Searching for a moving target: optimal path planning. In: Proceedings of Networking, Sensing and Control, pp. 867–872. IEEE, Los Alamitos (2005)

    Google Scholar 

  6. Kurumida, Y., Ogata, T., Ono, H., Sadakane, K., Yamashita, M.: A generic search strategy for large-scale real-world networks. In: Proceedings of the 1st international Conference on Scalable information Systems, InfoScale 2006, vol. 152. ACM, New York (2006)

    Google Scholar 

  7. Mabrouki, I., Lagrange, X., Froc, G.: Random walk based routing protocol for wireless sensor networks. In: Proceedings of the 2nd international Conference on Performance Evaluation Methodologies and Tools. ACM International Conference Proceeding Series, vol. 321, pp. 1–10. ICST, Brussels (2007)

    Google Scholar 

  8. Avin, C., Brito, C.: Efficient and robust query processing in dynamic environments using random walk techniques. In: Proceedings of the Third International Symposium on Information Processing in Sensor Networks, pp. 277–286 (2004)

    Google Scholar 

  9. Alon, N., Avin, C., Koucky, M., Kozma, G., Lotker, Z., Tuttle, M.R.: Many random walks are faster than one. In: Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures, SPAA 2008, pp. 119–128. ACM, New York (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abad, JA., Gorricho, JL. (2009). A Device Search Strategy Based on Connections History for Patient Monitoring. In: Omatu, S., et al. Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living. IWANN 2009. Lecture Notes in Computer Science, vol 5518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02481-8_126

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02481-8_126

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02480-1

  • Online ISBN: 978-3-642-02481-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics