University of Oulu

Y. Xu, J. Liu, Y. Shen, J. Liu, X. Jiang and T. Taleb, "Incentive Jamming-Based Secure Routing in Decentralized Internet of Things," in IEEE Internet of Things Journal, vol. 8, no. 4, pp. 3000-3013, 15 Feb.15, 2021, doi: 10.1109/JIOT.2020.3025151

Incentive jamming-based secure routing in decentralized Internet of Things

Saved in:
Author: Xu, Yang1; Liu, Jia2; Shen, Yulong3;
Organizations: 1School of Economics and Management, Xidian University, Xi’an 710071, China
2Center for Cybersecurity Research and Development, National Institute of Informatics, Tokyo 101-8430, Japan
3School of Computer Science and Technology, Xidian University, Xi’an 710071, China
4Institute of Network Sciences and Cyberspace, Tsinghua University, Beijing 100084, China
5Beijing National Research Center for Information Science and Technology (BNRist), Beijing, China
6School of Systems Information Science, Future University Hakodate, Hakodate 041-8655, Japan
7Department of Communications and Networking, School of Electrical Engineering, Aalto University, Finland
8Faculty of Information Technology and Electrical Engineering, Oulu University
9Department of Computer and Information Security, Sejong University, Seoul 05006, South Korea
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 4.7 MB)
Persistent link:
Language: English
Published: Institute of Electrical and Electronics Engineers, 2021
Publish Date: 2021-06-22


This article focuses on the secure routing problem in the decentralized Internet of Things (IoT). We consider a typical decentralized IoT scenario composed of peer legitimate devices, unauthorized devices (eavesdroppers), and selfish helper jamming devices (jammers), and propose a novel incentive jamming-based secure routing scheme. For a pair of source and destination, we first provide theoretical modeling to reveal how the transmission security performance of a given route is related to the jamming power of jammers in the IoT. Then, we design an incentive mechanism with which the source pays some rewards to stimulate the artificial jamming among selfish jammers, and also develop a two-stage Stackelberg game framework to determine the optimal source rewards and jamming power. Finally, with the help of the theoretical modeling as well as the source rewards and jamming power setting results, we formulate a shortest weighted path-finding problem to identify the optimal route for secure data delivery between the source-destination pair, which can be solved by employing the Dijkstra’s or Bellman-Ford algorithm. We prove that the proposed routing scheme is individually rational, stable, distributed, and computationally efficient. Simulation and numerical results are provided to demonstrate the performance of our routing scheme.

see all

Series: IEEE internet of things journal
ISSN: 2372-2541
ISSN-E: 2327-4662
ISSN-L: 2327-4662
Volume: 8
Issue: 4
Pages: 3000 - 3013
DOI: 10.1109/JIOT.2020.3025151
Type of Publication: A1 Journal article – refereed
Field of Science: 213 Electronic, automation and communications engineering, electronics
Funding: This work was supported in part by the National Natural Science Foundation of China under Grant 61802292, in part by JSPS KAKENHI Grant Number JP20K14742, in part by the Project of Cyber Security Establishment with Inter University Cooperation, in part by the National Key R&D Program of China under Grant 2018YFE0207600 and Grant 2018YFB2100403, in part by Japan JSPS Grant No.18H03235, in part by the China NSFC under Grant 61972308 and Grant 61902214, in part by the Academy of Finland Project CSN under Grant Agreement 311654, in part by the 6Genesis project under Grant No. 318927, and in part by the Tsinghua University Initiative Scientific Research Program 2019Z08QCX19.
Academy of Finland Grant Number: 311654
Detailed Information: 311654 (Academy of Finland Funding decision)
318927 (Academy of Finland Funding decision)
Copyright information: © 2021 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.