High-efficiency and Low-overhead Selfish Node Detection Algorithm in Opportunistic Networks
Ali Md Liton,
Rahman Atiqur and
Hosen Md Shawkat
International Journal of Science and Business, 2020, vol. 4, issue 2, 281-289
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.
Keywords: opportunistic networks; Probabilistic Routing; selfish node; summery vector; HLSND Algorithm (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
https://ijsab.com/wp-content/uploads/493.pdf (application/pdf)
https://ijsab.com/volume-4-issue-2/2684 (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:aif:journl:v:4:y:2020:i:2:p:281-289
Access Statistics for this article
International Journal of Science and Business is currently edited by Dr. Md Shamim Hossain
More articles in International Journal of Science and Business from IJSAB International
Bibliographic data for series maintained by Farjana Rahman ().