TY - GEN
T1 - R-TSCH
T2 - 2018 IEEE Symposium on Computers and Communications, ISCC 2018
AU - Zorbas, Dimitrios
AU - Kotzanikolaou, Panayiotis
AU - Douligeris, Christos
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/11/15
Y1 - 2018/11/15
N2 - Time Slotted Channel Hopping (TSCH) has been proposed in various wireless protocols as a solution to combat external interference, path-loss fading and static jamming attacks. However, since TSCH algorithms generate a deterministic and periodic pattern of channel hops, they are still subject to jamming attacks. Proactive randomization of the channel generation process could provide a good solution against jamming attacks, however due to the strict time constraints of the timeslots, practical solutions should be very efficient. In this paper, we propose R-TSCH, a randomized radio channel generation algorithm that can be used to proactively protect wireless nodes from jamming attacks. Based on a cryptographic hash function and a secret key, R-TSCH produces a new pseudo-random channel sequence, which looks as truly random to anyone who has no access to the key. Our simulation results show that the attacked links of the TSCH network enhanced with the proposed mechanism can achieve an over 90% Packet Reception Rate (PRR) in presence of multiple jammers.
AB - Time Slotted Channel Hopping (TSCH) has been proposed in various wireless protocols as a solution to combat external interference, path-loss fading and static jamming attacks. However, since TSCH algorithms generate a deterministic and periodic pattern of channel hops, they are still subject to jamming attacks. Proactive randomization of the channel generation process could provide a good solution against jamming attacks, however due to the strict time constraints of the timeslots, practical solutions should be very efficient. In this paper, we propose R-TSCH, a randomized radio channel generation algorithm that can be used to proactively protect wireless nodes from jamming attacks. Based on a cryptographic hash function and a secret key, R-TSCH produces a new pseudo-random channel sequence, which looks as truly random to anyone who has no access to the key. Our simulation results show that the attacked links of the TSCH network enhanced with the proposed mechanism can achieve an over 90% Packet Reception Rate (PRR) in presence of multiple jammers.
UR - http://www.scopus.com/inward/record.url?scp=85059213222&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85059213222&partnerID=8YFLogxK
U2 - 10.1109/ISCC.2018.8538705
DO - 10.1109/ISCC.2018.8538705
M3 - Conference contribution
AN - SCOPUS:85059213222
T3 - Proceedings - IEEE Symposium on Computers and Communications
SP - 766
EP - 771
BT - 2018 IEEE Symposium on Computers and Communications, ISCC 2018
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 25 June 2018 through 28 June 2018
ER -