IDEAS home Printed from https://ideas.repec.org/a/gvu/itdw00/v3y2021i2id1304.html

Metric Routing Protocol for Detecting Untrustworthy Nodes for Packet Transmission

Author

Listed:
  • S. Smys
  • C. Vijesh Joe

Abstract

IoT objects that have a resource constrained nature resulting in a number of attacks in the routing protocol for lossy networks and low-power networks. RPL is very vulnerable to selfish behaviours and internal attacks though they are built with encryption protection to secure messages. To address this vulnerability, in this paper, we propose a novel trustworthiness methodology based on metric for incorporating trust evaluation, enhancing the robustness of security mechanism. Simulation results indicate that the proposed work is efficient in terms of throughput, nodes' rank changes, energy consumption and packet delivery ratio. Moreover, using mathematical modelling, it has been observed that this methodology meets the demands of loop-freeness, optimality and consistency. This shows that this metic has both monotonicity and isotonicity requirements to enable the routing protocol. Incorporating the concepts of game theory, we can use this technique as a strategy to iterate Prisoner's Dilemma. Both evolutionary simulation and mathematical analysis indicate that the proposed metric-based routing protocol is an efficient technique in promoting evolution and stability of the IoT network.

Suggested Citation

Handle: RePEc:gvu:itdw00:v:3:y:2021:i:2:id:1304
DOI: 10.36548/jitdw.2021.2.001
as

Download full text from publisher

File URL: https://irojournals.com/itdw/article/view/1304
File Function: Abstract page
Download Restriction: no

File URL: https://irojournals.com/itdw/article/download/1304/1171
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.36548/jitdw.2021.2.001?utm_source=ideas
LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
---><---

More about this item

Keywords

;
;
;
;
;
;

Statistics

Access and download statistics

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gvu:itdw00:v:3:y:2021:i:2:id:1304. See general information about how to correct material in RePEc.

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

We have no bibliographic references for this item. You can help adding them by using this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Manager (email available below). General contact details of provider: https://irojournals.com/itdw .

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.