Skip to main content
SpringerLink
Log in
Book cover

Handbook of Peer-to-Peer Networking pp 1081–1104Cite as

Opportunistic Information Retrieval in Sparsely Connected Ad Hoc Networks

  • Chapter
  • First Online:

  • 2575 Accesses

Abstract

With the advancement in technology, many users carry wireless computing de-vices e.g., PDAs, cell-phones etc. Such devices can form mobile ad hoc networks and communicate with one another via the help of intermediate nodes. Such ad hoc networks are very useful in several scenarios e.g., battlefield operations, vehicular ad hoc networks and disaster response scenarios. The ability to access important information in these scenarios is highly critical. Many ad hoc routing schemes have been designed for ad hoc networks but such routing schemes are not useful in some challenging network scenarios where the nodes have intermittent connectivity and suffer frequent partitioning. Recently, disruption tolerant network technologies [5, 12] have been proposed to allow nodes in such extreme network-ing environment to communicate with one another. Several DTN routing schemes [4, 14] have been proposed.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   349.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   449.99
Price excludes VAT (USA)
  • Durable hardcover 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. A. R. Bharambe et al. (2004). Mercury: supporting scalable multi-attribute range queries. In Proceedings of ACM Sigcomm, Aug/Sept

    Google Scholar 

  2. L. Breslau et al. (1999). Web Caching and Zipf-like Distributions: Evidence and Implica-tions. In IEEE Infocom.

    Google Scholar 

  3. J. Broch et al. (1998). A Performance Comparison of Multhop wireless Adhoc Network Routing Protocols. In ACM Mobicom.

    Google Scholar 

  4. J. Burgess et al. (2006). MaxProp: Routing for vehicle-based disruption tolerant networks. In Proceedings of IEEE Infocom

    Google Scholar 

  5. V. Cerf et al. (2007). Delay Tolerant Networking Architecture. RFC4838

    Google Scholar 

  6. A. Chaintreau et al. (2007). Impact of Human Mobility on Opportunistic Forwarding Algorithms.IEEE Transaction on Mobile Computing, pp 606–620

    Google Scholar 

  7. M. Chuah, R. Metgzer (2008). Secure Data Retrieval System for DTNs. In Proceedings of IEEE Milcom, Oct/Nov

    Google Scholar 

  8. M. Chuah, P. Yang (2007). Data-Centric information retrieval schemes for Disruption Tolerant Net-works. In Lehigh CSE Department Technical Report.

    Google Scholar 

  9. M. Chuah, P. Yang (2007). Performance evaluations of a content-based information retrieval scheme for DTNs. In Proceedings of Milcom

    Google Scholar 

  10. E. Cohen, S. Shenker (2002). Replication strategies in unstructured peer-to-peer networks. In Proceedings of ACM Sigcomm

    Google Scholar 

  11. N. Eagle, A. Pentland (2005). Reality Mining: Sensing Complex Social Systems. Journal of Per-sonal and Ubiquitous Computing.

    Google Scholar 

  12. K. Fall (2003). A delay tolerant network architecture for challengednetworks. In Proceedings of ACM Sigcomm

    Google Scholar 

  13. T. Hara (2001). Effective Replica Allocation in AdHoc Networks for Improving Data Accessibility. In Proceedings of IEEE Infocom.

    Google Scholar 

  14. A. Lingren et al. (2004). Probabilistic Routing in Intermittently Connected Networks. In Proceedings of Workshop on Service Assurance with Partial and Intermittent Resources

    Google Scholar 

  15. B. Sheng et al. (2006). Data Storage Placement in Sensor Networks. In Proceedings of ACM Mobihoc

    Google Scholar 

  16. T. Spyropoulos et al. (2007). Efficient routing in intermittently connected mobile networks: multiple copy case. IEEE/ACM Transactions on Networking

    Google Scholar 

  17. In The network simulator ns-2. http://www.isi.edu/nsnam/ns/.

  18. A. Vahdat, D. Becker. Epidemic Routing for partially connected adhoc networks. Technical Report CS-200006, Duke University

    Google Scholar 

  19. Y. Wang et al. (2005). Erasure-Coding Based Routing for Opportunistic Networks. In Proceedings of ACM workshop on DTN.

    Google Scholar 

  20. H. Wang et al. (2008). Snoogle: A search engine for the physical world. In Proceedings of IEEE Infocom.

    Google Scholar 

  21. L. Yin, G. Cao. (2004). Supporting Cooperative Caching in Adhoc Networks. In Proceedings of IEEE In-focom

    Google Scholar 

  22. E. Yoneki et al. (2007). A Social-Aware Overlay for Publish/Subscribe Communication in Delay Tolerant Networks. In Proceedings of ACM MSWiM, Oct

    Google Scholar 

  23. X. Zhang et al. (2007). Modeling of a Bus-based Disruption Tolerant Network Trace: Mobility Model-ing and Impact on Routing. In Proceedings of ACM Mobicom.

    Google Scholar 

Download references

Acknowledgement

This work has been supported by DARPA under Contract W15P7T-06-C-P430. Any opinions, findings, and conclusions or recommendations expressed in this paper are those of the authors and do not necessarily reflect the views of the sponsor of this work. The authors would like to thank Peng Yang for helping to generate the simulation results for the CACHE data scheme.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Lehigh University, 19 Memorial Drive West, 18015, Bethlehem, PA, USA

    Mooi-Choo Chuah & Jian-bin Han

Authors
  1. Mooi-Choo Chuah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jian-bin Han
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mooi-Choo Chuah .

Editor information

Editors and Affiliations

  1. Dept. Electrical & Computer Engineering, University of Waterloo, University Avenue W. 200, Waterloo, N2L 3G1, Canada

    Xuemin Shen

  2. Huawei Technologies, Somerset Corporate Blvd. 400, Bridgewater, 08807, U.S.A.

    Heather Yu

  3. Avaya Labs Research, Mount Airy Road 233, Basking Ridge, 07920, U.S.A.

    John Buford

  4. Dept. Electrical & Computer Engineering, University of Waterloo, University Avenue W. 200, Waterloo, N2L 3G1, Canada

    Mursalin Akon

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Chuah, MC., Han, Jb. (2010). Opportunistic Information Retrieval in Sparsely Connected Ad Hoc Networks. In: Shen, X., Yu, H., Buford, J., Akon, M. (eds) Handbook of Peer-to-Peer Networking. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09751-0_38

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-09751-0_38

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-09750-3

  • Online ISBN: 978-0-387-09751-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation