IDEAS home Printed from https://ideas.repec.org/a/aif/journl/v4y2020i2p281-289.html
   My bibliography  Save this article

High-efficiency and Low-overhead Selfish Node Detection Algorithm in Opportunistic Networks

Author

Listed:
  • Ali Md Liton
  • Rahman Atiqur
  • Hosen Md Shawkat

Abstract

To address the problems of large overhead and inaccurate judgment for selfish node of the existing selfish node detecting algorithm in opportunistic networks, a high-efficiency and low-overhead algorithm to detect the selfish node HLSND algorithm is proposed. The algorithm combines the SV list interactive information and attributes of the message forwarded by encounter node to judge its selfishness. According to the message attributes forwarded by the node, it can be judged whether it has the selfish behavior of forged the message in SV list. The RSSI technique is used to measure the distance of the nodes to improve the judgment accuracy of self – interest behavior. At the same time, information of selfish node is carried when forward other message to reduce the system overhead. The simulation results show that the HLSND detection algorithm can effectively improve the throughput and message delivery rate in the network and reduce the energy consumption and time delay of the system.

Suggested Citation

  • Ali Md Liton & Rahman Atiqur & Hosen Md Shawkat, 2020. "High-efficiency and Low-overhead Selfish Node Detection Algorithm in Opportunistic Networks," International Journal of Science and Business, IJSAB International, vol. 4(2), pages 281-289.
  • Handle: RePEc:aif:journl:v:4:y:2020:i:2:p:281-289
    as

    Download full text from publisher

    File URL: https://ijsab.com/wp-content/uploads/493.pdf
    Download Restriction: no

    File URL: https://ijsab.com/volume-4-issue-2/2684
    Download Restriction: no
    ---><---

    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:aif:journl:v:4:y:2020:i:2:p:281-289. 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: Farjana Rahman (email available below). General contact details of provider: .

    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.