Handbook of Applied Cryptography
Handbook of Applied Cryptography
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
CRC Standard Curves and Surfaces with Mathematica, Second Edition (Chapman & Hall/Crc Applied Mathematics and Nonlinear Science)
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
How Small Labels Create Big Improvements
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
Event-driven, role-based mobility in disaster recovery networks
Proceedings of the second ACM workshop on Challenged networks
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Truth Discovery with Multiple Conflicting Information Providers on the Web
IEEE Transactions on Knowledge and Data Engineering
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Achieving anycast in DTNs by enhancing existing unicast protocols
Proceedings of the 5th ACM workshop on Challenged networks
Achieving anycast in DTNs by enhancing existing unicast protocols
Proceedings of the 5th ACM workshop on Challenged networks
Heterogeneous network-based trust analysis: a survey
ACM SIGKDD Explorations Newsletter
| Hi-index | 0.00 |
Effectively utilizing groups in delay tolerant networks (DTNs) can both improve the throughput of unicast routing protocols and open the door for a wide range of paradigms, such as anycast and multicast. Unfortunately, in DTN environments, there is no centralized entity that can quickly and reliably transmit group membership lists, and hence group information must be disseminated through unreliable and potentially malicious nodes. In this paper, we propose a local and robust group information dissemination and consolidation protocol, called MembersOnly, that both quickly and accurately transmits group membership information to all nodes in the network, even if multiple malicious nodes attempt to disrupt the process. We show via analysis and simulations that MembersOnly is able to withstand multiple types of attacks, with only very limited periods of vulnerability that disappear relatively quickly. This is in contrast to current techniques that cannot withstand many of these attacks, resulting in quick and thorough corruption of group membership lists. In addition, we show via simulation that even the most basic routing protocols can gain a performance advantage when using MembersOnly.