A Diversity-based Selfish Node Detection Algorithm for Socially Aware Networking

Because mobile devices only have the limited resource in socially aware networking, some network nodes are unwilling to sacrifice their resource to forward messages to others for free, thus forming selfish nodes. However selfish nodes will cause dropping in the message delivery rate and affect the n...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of signal processing systems Ročník 93; číslo 7; s. 811 - 825
Hlavní autoři: Xiao, Nan, Xinyi, Rang, Xiong, Zenggang, Xu, Fang, Zhang, Xuemin, Xu, Qiong, Zhao, Xiaochao, Ye, Conghuan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.07.2021
Springer Nature B.V
Témata:
Algorithms
Circuits and Systems
Computer Imaging
Electrical Engineering
Electronic devices
Engineering
Image Processing and Computer Vision
Messages
Nodes
Pattern Recognition
Pattern Recognition and Graphics
Signal,Image and Speech Processing
Vision
Limited resource
Diversity detection
Selfish nodes
Socially aware networking
ISSN:1939-8018, 1939-8115
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Because mobile devices only have the limited resource in socially aware networking, some network nodes are unwilling to sacrifice their resource to forward messages to others for free, thus forming selfish nodes. However selfish nodes will cause dropping in the message delivery rate and affect the network performance, so this paper has proposed a diversity-based selfish node detection algorithm (DSNDA). Firstly, it mainly applies the node forwarding willingness mechanism to detect whether the node is selfish. If the node has the inadequate resource, that is, it cannot forward any messages for others; then it will be selfish. If the node’s resource is enough and the node has forwarded messages to other nodes, it indicates that the node is not selfish. Otherwise, DSNDA algorithm will use reputation mechanism to check the node further. If the node has broken faith, it indicates that the node is selfish. On the contrary the message confirmation mechanism will be employed to make the final check on the node. If a message does not be received or discarded after the node’s receiving it, which proves that it has selfish behaviour. If not, the node is normal. It can be proved by the simulation experiment and results that the DSNDA algorithm has significantly improved the delivery rate of messages, comparing with other algorithms. At the same time, reducing the network delay, thus verifying the feasibility of DSNDA.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1939-8018
1939-8115
DOI:10.1007/s11265-021-01666-y