Incentive mechanism for selfish nodes in wireless sensor networks based on evolutionary game

Chen, Zhide; Qiu, Yihui; Liu, Jingjing; Xu, Li

doi:10.1016/j.camwa.2011.08.052

Cited by 34 publications

(30 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An Evolutionary Game-based Incentive Mechanism (EGIM) was proposed by Chen et al [13] for adjusting the fitness of the node's forwarding approach through the determination of cooperation factor. This fitness function aids in converging the malicious intent of sensor nodes into reliable normal entities of the network.…”

Section: Related Workmentioning

confidence: 99%

Semi-Markov Process Inspired Selfish-aware Co-operative Scheme for WSNs (SMPISCS)

Vadivel¹,

Ramarao²

2017

Preprint

View full text Add to dashboard Cite

Abstract-In wireless sensor network (WSN), energy and packet forwarding tendencies of sensor nodes plays a potential role in ensuring a maximum degree of co-operation under data delivery.This quantified level of co-operation represents the performance of the network in terms of increased packet delivery rate, throughput and decreased level of control overhead and delay depending on the data being aggregated. The performance of a sensor network is highly influenced by the selfish behaving nature of sensor nodes that gets exhibited when the residual energy reaches below a tolerable level of activeness in packet forwarding. The selfish sensor node needs to be identified in future through reliable forecasting mechanism for improving the lifetime and packet delivery rate. Semi-Markov Process Inspired Selfish-aware Co-operative Scheme for WSNs (SMPISCS) is propounded for making an attempt to mitigate selfish nodes for prolonging the lifetime of the network and balancing energy consumptions of the network. In SMPISCS model possible kinds of sensor node's behavior for quantifying and future forecasting the probability with which the node could turn into selfish. Simulation experiments are carried out through ns-2 and the performance of the network are analyzed based on varying number of sensor nodes, number of selfish sensor nodes and range of detection threshold.

show abstract

Section: Related Workmentioning

confidence: 99%

Semi-Markov Process Inspired Selfish-aware Co-operative Scheme for WSNs (SMPISCS)

Vadivel¹,

Ramarao²

2017

Preprint

View full text Add to dashboard Cite

show abstract

“…. , ) do // refers to the number of players (4) if step == 1 then (5) p l a y e r randomly chooses a strategy (6) else (7) p l a y e r chooses a strategy (8) end if (9) for each neighbor ∈ ( ) of player (10) p l a y e r chooses a strategy for playing with (11) p l a y e r gets payoff from a game → (12) p l a y e r gets payoff from a game (13) p l a y e r observes the payoff from its neighbor → (14) end for (15) p l a y e r computes its utility value (16) p l a y e r updates strategy (17) end for (18) end for Algorithm 1: The interaction process among nodes under the PD game framework.…”

Section: Prisoner's Dilemma (Pd) Gamementioning

confidence: 99%

“…In previous research, different mechanisms such as reputation system, trust management system, and payoff mechanism have been developed to stimulate cooperation and lessen nodes' selfish behaviors [3,[8][9][10]. In addition, incentive mechanisms based on the evolutionary game have been used to analyze the dynamics of the trust strategy selection, such as a trust strategy or a strategy that tends to cooperate [11,12].…”

Section: Introductionmentioning

confidence: 99%

An Efficient Approach for Stimulating Cooperation among Nodes in Wireless Sensor Networks

Wang

Shen

et al. 2016

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

A Wireless Sensor Network (WSN), characterized as being self-organizing and multihop, consists of a large number of lowpower and low-cost nodes. The cooperation among nodes is the foundation for WSNs to achieve the desired functionalities, such as the delivery or forwarding of packets. However, due to the limited resources such as energy, computational availability, and communication capabilities, there may exist some selfish nodes that refuse to cooperate with others. If the critical masses of nodes do not cooperate in the network, the network would not be able to operate to achieve its functional requirements. To resolve the problem above, we introduce a Win-Stay, Lose-Likely-Shift (WSLLS) approach into a Prisoner's Dilemma (PD) game framework, and it applies a utility-based function, which is a linear combination of one player's payoff and its neighbors' in a game, to evaluate a player's (i.e., node) performance for a game. Experimental results demonstrate that our approach performs well in stimulating cooperation in different settings under a certain condition with limited information, regardless of the static topologies types of WSNs, initial proportion of cooperation, and the average number of neighbors.

show abstract

“…Several factors, such as the mobility of nodes, the number of copies of the messages and buffer space of each node, etc., should be considered [13][14][15][16][17][18][19].…”

Section: Problem Statementmentioning

confidence: 99%

A comprehensive-integrated buffer management strategy for opportunistic networks

Pan

Ruan

Zhou

et al. 2013

J Wireless Com Network

View full text Add to dashboard Cite

Opportunistic networks aim to provide reliable communications in an intermittently connected environment. The research in cache management of opportunistic networks has been done a lot in those aspects, such as queue strategy, cache replace, redundancy delete, etc. But most of the existing studies only focus on a subdivision of the buffer management. To deal with such case, this article proposes a comprehensive integration buffer management strategy, called comprehensive-integrated buffer management (CIM), which takes all information relevant to message delivery and network resources into consideration. The simulation experiments show that the CIM strategy improved the performance in terms of delivery ratio, overhead ratio, and average delivery delay.

show abstract

Incentive mechanism for selfish nodes in wireless sensor networks based on evolutionary game

Cited by 34 publications

References 6 publications

Semi-Markov Process Inspired Selfish-aware Co-operative Scheme for WSNs (SMPISCS)

Semi-Markov Process Inspired Selfish-aware Co-operative Scheme for WSNs (SMPISCS)

An Efficient Approach for Stimulating Cooperation among Nodes in Wireless Sensor Networks

A comprehensive-integrated buffer management strategy for opportunistic networks

Contact Info

Product

Resources

About