skip to main content
10.1145/2414393.2414394acmotherconferencesArticle/Chapter ViewAbstractPublication PagesextremecomConference Proceedingsconference-collections
research-article

Twitter in disaster mode: opportunistic communication and distribution of sensor data in emergencies

Authors Info & Claims
Published:26 September 2011Publication History

ABSTRACT

Recent events (earthquakes, floods, etc.) have shown that users heavily rely on online social networks (OSN) to communicate and organize during disasters and in their aftermath. In this paper, we discuss what features could be added to OSN apps for smart phones -- for the example of Twitter -- to make them even more useful for disaster situations. In particular, we consider cases where the fixed communication infrastructure is partially or totally wiped out and propose to equip regular Twitter apps with a disaster mode. The disaster mode relies on opportunistic communication and epidemic spreading of Tweets from phone to phone. Such "disaster-ready" applications would allow to resume (although limited) communication instantaneously and help distressed people to self-organize until regular communication networks are functioning again, or, temporary emergency communication infrastructure is installed.

We argue why we believe that Twitter with its simplicity and versatile features (e.g., retweet and hashtag) is a good platform to support a variety of different situations and present Twimight, our disaster ready Twitter application. In addition, we propose Twimight as a platform for disseminating sensor data providing information such as locations of drinkable water sources. Eventually, we propose to rely on interest matching to scale Twitter hashtag-based searches in an opportunistic environment. The combination of these features make our opportunistic Twitter the ideal emergency kit in situations of disasters. We discuss and define the main implementation and research challenges (both technical and non-technical).

References

  1. A. Bruns, "Tracking crises on twitter: Analysing #qldfloods and #eqnz." Presented at the Emergency Media and Public Affairs Conference, Canberra, 2011.Google ScholarGoogle Scholar
  2. R. Bruno, M. Conti, and E. Gregori, "Mesh networks: commodity multihop ad hoc networks," Communications Magazine, IEEE, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. Vahdat and D. Becker, "Epidemic routing for partially-connected ad hoc networks," Tech. Rep., 2000.Google ScholarGoogle Scholar
  4. W. Zhao, M. Ammar, and E. Zegura, "A message ferrying approach for data delivery in sparse mobile ad hoc networks," in ACM MobiHoc, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Delay tolerant networking research group. {Online}. Available: http://www.dtnrg.orgGoogle ScholarGoogle Scholar
  6. E. Nordström, P. Gunningberg, and C. Rohner, "A search-based network architecture for content-oriented and opportunistic communication," Uppsala University Technical Report 2009-003, 2009, http://code.google.com/p/haggle.Google ScholarGoogle Scholar
  7. PodNet Project. {Online}. Available: http://www.podnet.ee.ethz.ch/Google ScholarGoogle Scholar
  8. T. Abdelzaher, Y. Anokwa, P. Boda, J. Burke, D. Estrin, L. Guibas, A. Kansal, S. Madden, and J. Reich, "Mobiscopes for human spaces," IEEE Pervasive Computing, April 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Ushahidi platform. {Online}. Available: http://www.ushahidi.com/Google ScholarGoogle Scholar
  10. H. Lu, J. Yang, Z. Liu, N. D. Lane, T. Choudhury, and A. T. Campbell, "The jigsaw continuous sensing engine for mobile phone applications," in ACM SenSys, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. H. Lu, W. Pan, N. D. Lane, T. Choudhury, and A. T. Campbell, "Soundsense: scalable sound sensing for people-centric applications on mobile phones," in ACM MobiSys, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. F. Bjurefors, P. Gunningberg, C. Rohner, and S. Tavakoli, "Congestion avoidance in a data-centric opportunistic network," in Proceedings of the 2011 ACM SIGCOMM Workshop on Information-Centric Networking, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. I. Stojmenovic and X. Lin, "Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks," IEEE Trans. Parallel Distrib. Syst., vol. 12, October 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. G. Pei, M. Gerla, and T.-W. Chen, "Fisheye state routing in mobile ad hoc networks," in In ICDCS Workshop on Wireless Networks and Mobile Computing, 2000, pp. 71--78.Google ScholarGoogle Scholar
  15. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Spray and wait: an efficient routing scheme for intermittently connected mobile networks," in ACM WDTN, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. A. Lindgren, A. Doria, and O. Schelén, "Probabilistic routing in intermittently connected networks," SIGMOBILE MCCR, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. E. M. Daly and M. Haahr, "Social network analysis for routing in disconnected delay-tolerant MANETs," in ACM MobiHoc, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. N4c. {Online}. Available: http://www.n4c.euGoogle ScholarGoogle Scholar
  19. J. Karvo and J. Ott, "Time scales and delay-tolerant routing protocols," in ACM CHANTS, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. T. Hossmann, T. Spyropoulos, and F. Legendre, "Know thy neighbor: Towards optimal mapping of contacts to social graphs for DTN routing," in IEEE Infocom, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Other conferences
    ExtremeCom '11: Proceedings of the 3rd Extreme Conference on Communication: The Amazon Expedition
    September 2011
    79 pages
    ISBN:9781450310796
    DOI:10.1145/2414393

    Copyright © 2011 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 26 September 2011

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader