Twitter in disaster mode
Published 26 September 2011
Theus Hossmann, Franck Legendre, Paolo Carta, Per Gunningberg, Christian Rohner
Citations77
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
It is argued why Twitter with its simplicity and versatile features (e.g., retweet and hashtag) is a good platform to support a variety of different situations and presented Twimight, the authors' disaster ready Twitter application.
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.
Keywords
Computer Science
Epidemic routing for partially-connected ad hoc networks
4,149 Citations2000Amin Vahdat
This work introduces Epidemic Routing, where random pair-wise exchanges of messages among mobile hosts ensure eventual message delivery and achieves eventual delivery of 100% of messages with reasonable aggregate resource consumption in a number of interesting scenarios.
Spray and wait
2,576 Citations2005Thrasyvoulos Spyropoulos, Konstantinos Psounis +1 more
A new routing scheme, called Spray and Wait, that "sprays" a number of copies into the network, and then "waits" till one of these nodes meets the destination, which outperforms all existing schemes with respect to both average message delivery delay and number of transmissions per message delivered.
ACM SIGMOBILE Mobile Computing and Communications ReviewProbabilistic routing in intermittently connected networks
2,287 Citations2003Anders Lindgren, Avri Doria +1 more
A probabilistic routing protocol for intermittently connected networks where there is no guarantee that a fully connected path between source and destination exist at any time, rendering traditional routing protocols unable to deliver messages between hosts.
A message ferrying approach for data delivery in sparse mobile ad hoc networks
1,313 Citations2004Wenrui Zhao, Mostafa Ammar +1 more
This paper describes a mobility-assisted approach which utilizes a set of special mobile nodes called message ferries to provide communication service for nodes in the deployment area and evaluates the performance of MF via extensive ns simulations which confirm it is efficient in both data delivery and energy consumption under a variety of network conditions.
Social network analysis for routing in disconnected delay-tolerant MANETs
1,150 Citations2007Elizabeth Daly, Mads Haahr
SimBet Routing is proposed which exploits the exchange of pre-estimated "betweenness' centrality metrics and locally determined social "similarity' to the destination node and outperforms PRoPHET Routing, particularly when the sending and receiving nodes have low connectivity.
IEEE Communications MagazineMesh networks: commodity multihop ad hoc networks
877 Citations2005Raffaele Bruno, Marco Conti +1 more
A survey of the current state of the art in off-the-shelf and proprietary solutions to build wireless mesh networks and the challenges of designing a high-performance, scalable, and cost-effective wireless mesh network are addressed.
SoundSense
580 Citations2009Hong Lu, Wei Pan +3 more
This paper proposes SoundSense, a scalable framework for modeling sound events on mobile phones that represents the first general purpose sound sensing system specifically designed to work on resource limited phones and demonstrates that SoundSense is capable of recognizing meaningful sound events that occur in users' everyday lives.
The Jigsaw continuous sensing engine for mobile phone applications
563 Citations2010Hong Lu, Jun Yang +4 more
The design, implementation and evaluation of the Jigsaw continuous sensing engine is presented, which balances the performance needs of the application and the resource demands of continuous sensing on the phone, to demonstrate its capability to recognize user activities and perform long term GPS tracking in an energy-efficient manner.
IEEE Transactions on Parallel and Distributed SystemsLoop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks
401 Citations2001Ivan Stojmenović, Lin Xu
2-hop GEDIR, DIR, and MFR methods in which node A selects the best candidate node C among its 1-hop and 2-hop neighbors according to the corresponding criterion and forwards m to its best1-hop neighbor among joint neighbors of A and C are proposed.
Fisheye State Routing in Mobile Ad Hoc Networks.
280 Citations2000Guangyu Pei, Mário Gerla +1 more
FSR introduces the notion of multi-level fisheye scope to reduce routing update overhead in large networks and is shown to be simple, efficient and scalable in a mobile, ad hoc environment.
Know Thy Neighbor: Towards Optimal Mapping of Contacts to Social Graphs for DTN Routing
160 Citations2010Theus Hossmann, Thrasyvoulos Spyropoulos +1 more
This paper proposes an online algorithm that uses concepts from unsupervised learning and spectral graph theory to infer this 'correct' graph structure, and allows each node to locally identify and adjust to the optimal operating point, and achieves good performance in all scenarios considered.
Time scales and delay-tolerant routing protocols
36 Citations2008Jouni Karvo, Jörg Ott
This work characterises this issue, which has been overlooked in this field so far, using PROPHET and MaxPROP as two representative routing protocols and derive mechanisms to dynamically and independently determine routing parameters in mobile nodes.
Congestion avoidance in a data-centric opportunistic network
24 Citations2011Fredrik Bjurefors, Per Gunningberg +2 more
The results obtained on the emulation platform for opportunistic networks show that strategies with a high data refresh rate achieve the most efficient delivery and generate the smallest overhead on the authors' community and mobility scenarios.
A Search-based Network Architecture for Content-oriented and Opportunistic Communication
4 Citations2008Erik Nordström, Per Gunningberg +1 more
This thesis develops a new network architecture that matches the constraints of a challenged network, in this case, an opportunistic network, and argues that content binding should be done late in challenged networks, something which the search approach supports well.