A general and efficient distance bounding protocol with multi-objective optimisation for RFID applications over a noisy channel
by Ebrahim Shafiee; Abolfazl Falahati
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 38, No. 4, 2021

Abstract: It is common to employ the distance bounding (DB) protocols to prevent relay attacks over RFID communication systems. It is impossible to utilise only one specific version of a DB protocol as a general resolution for secure identification and optimal performance due to the diversity and development of the RFID platforms such as ad hoc and IoT. Therefore, a general DB (GDB) protocol employing a multi-objective optimisation algorithm is proposed to find the appropriate GDB protocol's parameter values, increase security and reduce costs. On the other hand, reducing the false-accept probability against possible attacks increases security, and decreasing the protocol false-reject probability, runtime and memory reduces costs. The final desired optimal protocol is obtained from Pareto optimal solutions using the linear non-dimensionalisation scaling method and the LINMAP decision-making process. Introducing the figure of merit (FOM) criterion, analytical analysis, and simulation results indicate significant improvements in the protocol efficiency.

Online publication date: Wed, 22-Dec-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com