By Topic

On Selfish Behavior in Wireless Sensor Networks: A Game Theoretic Case Study

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Mi Yan ; Dept. of Commun. Eng., Xiamen Univ., Xiamen, China ; Liang Xiao ; Liang Du ; Lianfen Huang

In this paper, we study the selfish behavior in wireless sensor networks and apply a game theory method to address this problem in a CSMA/CA protocol. More specifically, we formulate the Media Access Control (MAC) layer activity in sensor networks as an optimization problem in terms of the random accessing problem. Then we propose a distributed algorithm for the system to reach the Nash Equilibrium (NE). We have de-fined a Contention Window Select Game (CWSG) in which each sensor selects its own contention window to control the access probability. This approach can improve the average performance, compared to a random strategy with each sensor selecting its own window independently. We prove the unique existence of NE in the CWSG, and propose a penalizing mechan-ism based on repeated game to prevent the non-cooperative selfish behavior of decreasing the contention window without per-mission.

Published in:

Measuring Technology and Mechatronics Automation (ICMTMA), 2011 Third International Conference on  (Volume:2 )

Date of Conference:

6-7 Jan. 2011