A random access procedure based on tunable puzzles
In a radio network, a denial-of-service attack or an attack storm after a temporary outage may cause severe access network overload. The problem is likely to become even more acute with the growth of Internet-of-Things applications that are expected to support critical infrastructure.
In this paper, we present a new random access procedure based on tunable puzzles. Tunable puzzles provide the means to balance the load on the access network, prioritize certain devices, and localize radio resources for subsequent transmissions. By tuning the difficulty of puzzles, a base station can control the period of time before a device can send its next message. The prioritization by means of puzzles creates considerably less extra load on the base station compared to other alternatives, e.g. by using authentication.
Mats Näslund, Elena Dubrova, Göran Selander, F. Lindqvist.
Presented 2015-11-30 at the IEEE Workshop on Security and Privacy in Cybermatics (SPICY'2015).
© 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.