Name
Abstract | ||
|---|---|---|
In a radio network, a denial-of-service attack or an attach storm after a temporary outage may cause severe access network overload. Unavailability of radio network services for its subscribing users causes dissatisfaction among the users and should be prevented. 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. Encoding of radio resources in the puzzle solution enables a more efficient use of communication and processing resources. In addition, it gives malicious devices no incentive to guess the solution, since any solution other than the intended one fails to convey the information enabling the device to proceed further. |
Year | Venue | Keywords |
|---|---|---|
2015 | IEEE Conference on Communications and Network Security | random access,denial-of-service,overload,computational puzzle |
Field | DocType | ISSN |
Radio resource management,Base station,Authentication,Computer science,Computer security,Server,Computer network,Radio access network,Access network,Random access,UMTS Terrestrial Radio Access Network | Conference | 2474-025X |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mats Näslund | 1 | 141 | 21.58 |
| Elena Dubrova | 2 | 288 | 48.55 |
| Göran Selander | 3 | 26 | 4.02 |
| Fredrik Lindqvist | 4 | 7 | 2.43 |