Selfish Node Detection Based on GA and Learning Automata in IoT [PDF]
International Journal of Information and Communication Technology Research, 2023 It is critical to increasing the network throughput on the internet of things with short-range nodes. Nodes prevent to cooperate with other nodes are known as selfish nodes.
Solmaz Nopahari +2 more
doaj
An Erlang factor-based conditional reliability mechanism for enforcing co-operation in MANETs [PDF]
Serbian Journal of Electrical Engineering, 2016 Reputation is considered to be one of the vital entities for maintaining collaboration among wireless mobile nodes present in an ad hoc environment.
Janakiraman Sengathir +1 more
doaj +1 more source
Routing Misbehavior Detection in MANETs Using 2ACK
Journal of Telecommunications and Information Technology, 2023 This paper proposes routing misbehavior detection in MANETs using 2ACK scheme. Routing protocols for MANETs are designed based on the assumption that all participating nodes are fully cooperative.
Sunilkumar S. Manvi +2 more
doaj +1 more source
PERFORMANCE ANALYSIS OF DSR ROUTING PROTOCOL UNDER ENERGY BASED SELFISH ATTACK IN MOBILE AD HOC NETWORKS [PDF]
ICTACT Journal on Communication Technology, 2010 Mobile Ad hoc Networks (MANETs) rely on the cooperation of all participating nodes to provide the fundamental operations such as routing and data forwarding.
T.V.P.Sundararajan, A.Shanmugam
doaj
Exponential Reliability Coefficient based Reputation Mechanism for isolating selfish nodes in MANETs
Egyptian Informatics Journal, 2015 In mobile ad hoc networks, cooperation among active mobile nodes is considered to play a vital role in reliable transmission of data. But, the selfish mobile nodes present in an ad hoc environment refuse to forward neighbouring nodes’ packet for ...
J. Sengathir, R. Manoharan
doaj +1 more source
On Nash Equilibria in Non-Cooperative All-Optical Networks
Algorithms, 2021 We consider the problem of determining a routing in all-optical networks, in which some couples of nodes want to communicate. In particular, we study this problem from the point of view of a network provider that has to design suitable payment functions ...
Vittorio Bilò +2 more
doaj +1 more source
A novel dynamic reputation-based source routing protocol for mobile ad hoc networks
EURASIP Journal on Wireless Communications and Networking, 2019 Routing in mobile ad hoc networks is based on the cooperation of the network’s nodes. The presence of selfish nodes that do not cooperate in this task drastically reduces the number of delivered packets.
Lenin Guaya-Delgado +3 more
doaj +1 more source
Detection of selfish nodes based on credit mechanism in opportunistic networks
Tongxin xuebao, 2012 The existence of selfish nodes seriously affects the routing performance of opportunistic networks(OppNet).To protect the OppNet against the nodes’ selfish behavior,a credit-based selfish nodes detection mechanism was proposed to make it possible to keep
Zuo-yong TANG +3 more
doaj +2 more sources
Efficiency Loss of Mixed Equilibrium Behaviors with Polynomial Cost Functions
Promet (Zagreb), 2010 This paper investigates the efficiency loss of selfish routing simultaneously with user equilibrium (UE) player and Cournot-Nash (CN) players. The upper bound of the efficiency loss of UE-CN mixed equilibrium with polynomial cost functions is obtained by
Xiaojun Yu, Hai-Jun Huang
doaj +1 more source
Efficiency of Atomic Splittable Selfish Routing with Polynomial Cost Functions
, 2008 Price of anarchy, Equilibrium, Selfish routing, System optimum, Network,
Hai Yang, Hong Lo, Deren Han
core +2 more sources