TY - GEN
T1 - Friend or Flood? Social prevention of flooding attacks in opportunistic networks
AU - Parris, Iain
AU - Henderson, Tristan
PY - 2014/6/30
Y1 - 2014/6/30
N2 - Opportunistic networks enable decentralised and infrastructure-less social networking applications, through the cooperation of peer mobile devices to forward messages on one another's behalf. The decentralised and cooperative nature of these networks, however, introduces potential security threats. For instance, malicious nodes may modify messages, or send many messages in an attempt to drain other nodes' resources and thereby disrupt the network. Such attacks are well-studied for wireless ad hoc networks, but may need reconsideration in disconnected opportunistic networks. In this paper we define a simple flooding attack that can deny service in an opportunistic network. We simulate the attack and demonstrate its efficacy using real-world datasets. We furthermore develop a scheme for mitigating the attack, by using the social relations between nodes. The scheme is lightweight, requires only local knowledge to be stored by each node, and is shown to be effective: for one dataset, the median proportion of time spent offline by nodes was reduced from 42.7% to 6.3%.
AB - Opportunistic networks enable decentralised and infrastructure-less social networking applications, through the cooperation of peer mobile devices to forward messages on one another's behalf. The decentralised and cooperative nature of these networks, however, introduces potential security threats. For instance, malicious nodes may modify messages, or send many messages in an attempt to drain other nodes' resources and thereby disrupt the network. Such attacks are well-studied for wireless ad hoc networks, but may need reconsideration in disconnected opportunistic networks. In this paper we define a simple flooding attack that can deny service in an opportunistic network. We simulate the attack and demonstrate its efficacy using real-world datasets. We furthermore develop a scheme for mitigating the attack, by using the social relations between nodes. The scheme is lightweight, requires only local knowledge to be stored by each node, and is shown to be effective: for one dataset, the median proportion of time spent offline by nodes was reduced from 42.7% to 6.3%.
UR - http://hotpost14.realmv6.org/
U2 - 10.1109/icdcsw.2014.8
DO - 10.1109/icdcsw.2014.8
M3 - Conference contribution
SN - 978-1-4799-4182-7
T3 - Distributed Computing Systems Workshops (ICDCSW)
SP - 16
EP - 21
BT - Distributed Computing Systems Workshops (ICDCSW), 2014 IEEE 34th International Conference on
PB - IEEE
T2 - Sixth International Workshop on Hot Topics in Peer-to-peer computing and Online Social neTworking (HotPOST 2014)
Y2 - 30 June 2014 through 3 July 2014
ER -