TY - GEN
T1 - A Capacity-Aware Distributed Denial-of-Service Attack in Low-Power and Lossy Networks
AU - Biswas, Rajorshi
AU - Wu, Jie
AU - Li, Xiuqi
N1 - Funding Information:
ACKNOWLEDGMENTS This research was supported in part by NSF grants CNS 1824440, CNS 1828363, CNS 1757533, CNS 1618398, CNS 1651947, and CNS 1564128.
Publisher Copyright:
© 2019 IEEE.
PY - 2019/9
Y1 - 2019/9
N2 - Low-Power and Lossy Network (LLN) is composed of embedded devices with limited power, memory, and processing resources. LLN has a wide variety of applications including industrial monitoring, connected home, health care, urban sensor networks and environmental monitoring. LLN uses Routing Protocol for Low-power and lossy networks (RPL) protocol. The RPL maintains directed acyclic graphs for routing packets. By exploiting some features, a Distributed Denial-of-Service (DDoS) attack can be conducted easily. DDoS attacks are very popular and well studied in the context of the Internet, but not in the context of LLNs. In this paper, we propose a powerful DDoS attack framework in LLNs. We formulate the attack as an optimization problem for selecting an optimal set of attackers and their targeted neighbors constrained by a limited link bandwidth. We propose an optimal solution by transforming the optimization problem into a max-flow problem. We provide simulations to support our model.
AB - Low-Power and Lossy Network (LLN) is composed of embedded devices with limited power, memory, and processing resources. LLN has a wide variety of applications including industrial monitoring, connected home, health care, urban sensor networks and environmental monitoring. LLN uses Routing Protocol for Low-power and lossy networks (RPL) protocol. The RPL maintains directed acyclic graphs for routing packets. By exploiting some features, a Distributed Denial-of-Service (DDoS) attack can be conducted easily. DDoS attacks are very popular and well studied in the context of the Internet, but not in the context of LLNs. In this paper, we propose a powerful DDoS attack framework in LLNs. We formulate the attack as an optimization problem for selecting an optimal set of attackers and their targeted neighbors constrained by a limited link bandwidth. We propose an optimal solution by transforming the optimization problem into a max-flow problem. We provide simulations to support our model.
UR - http://www.scopus.com/inward/record.url?scp=85084839943&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85084839943&partnerID=8YFLogxK
U2 - 10.1109/Sarnoff47838.2019.9067822
DO - 10.1109/Sarnoff47838.2019.9067822
M3 - Conference contribution
AN - SCOPUS:85084839943
T3 - 2019 IEEE 40th Sarnoff Symposium, Sarnoff 2019
BT - 2019 IEEE 40th Sarnoff Symposium, Sarnoff 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 40th IEEE Sarnoff Symposium, Sarnoff 2019
Y2 - 23 September 2019 through 24 September 2019
ER -