Sending messages to mobile users in disconnected ad-hoc wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Message Ferrying: Proactive Routing in Highly-Partitioned Wireless Ad Hoc Networks
FTDCS '03 Proceedings of the The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems
Wearable Computers as Packet Transport Mechanisms in Highly-Partitioned Ad-Hoc Networks
ISWC '01 Proceedings of the 5th IEEE International Symposium on Wearable Computers
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Experimental evaluation of wireless simulation assumptions
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
A secure ad-hoc routing approach using localized self-healing communities
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Pocket switched networks and human mobility in conference environments
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Sybilproof reputation mechanisms
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Mobility Helps Peer-to-Peer Security
IEEE Transactions on Mobile Computing
Ariadne: a secure on-demand routing protocol for ad hoc networks
Wireless Networks
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Practical security for disconnected nodes
NPSEC'05 Proceedings of the First international conference on Secure network protocols
Authenticated routing for ad hoc networks
IEEE Journal on Selected Areas in Communications
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Pervasive and Mobile Computing
Revocation games in ephemeral networks
Proceedings of the 15th ACM conference on Computer and communications security
The quest for a killer app for opportunistic and delay tolerant networks: (invited paper)
Proceedings of the 4th ACM workshop on Challenged networks
Controlling resource hogs in mobile delay-tolerant networks
Computer Communications
Preventing unauthorized messages in DTN based mobile ad hoc networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Position based opportunistic routing for robust data delivery in MANETs
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Replication routing in DTNs: a resource allocation approach
IEEE/ACM Transactions on Networking (TON)
Robustness of DTN against routing attacks
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
SReD: a secure reputation-based dynamic window scheme for disruption-tolerant networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
A retrospective look at the UMass DOME mobile testbed
ACM SIGMOBILE Mobile Computing and Communications Review
ARDEN: Anonymous networking in delay tolerant networks
Ad Hoc Networks
Resilience and security of opportunistic communications for emergency evacuation
Proceedings of the 7th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Secure Multi-copy Routing in Compromised Delay Tolerant Networks
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
Disruption-Tolerant Networks (DTNs) deliver data in network environments composed of intermittently connected nodes. Just as in traditional networks, malicious nodes within a DTN may attempt to delay or destroy data in transit to its destination. Such attacks include dropping data, flooding the network with extra messages, corrupting routing tables, and counterfeiting network acknowledgments. Many existing methods for securing routing protocols require authentication supported by mechanisms such as a public key infrastructure, which is difficult to deploy and operate in a DTN, where connectivity is sporadic. Furthermore, the complexity of such mechanisms may dissuade node participation so strongly that potential attacker impacts are dwarfed by the loss of contributing participants. In this paper, we use connectivity traces from our UMass DieselNet project and the Haggle project to quantify routing attack effectiveness on a DTN that lacks security. We introduce plausible attackers and attack modalities and provide complexity results for the strongest of attackers. We show that the same routing with packet replication used to provide robustness in the face of unpredictable mobility allows the network to gracefully survive attacks. In the case of the most effective attack, acknowledgment counterfeiting, we show a straightforward defense that uses cryptographic hashes but not a central authority. We conclude that disruption-tolerant networks are extremely robust to attack; in our trace-driven evaluations, an attacker that has compromised 30% of all nodes reduces delivery rates from 70% to 55%, and to 20% with knowledge of future events. By comparison, contemporaneously connected networks are significantly more fragile.