By Topic

Game Theoretical Approach for Channel Allocation in Wireless Sensor and Actuator Networks

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

6 Author(s)
Jiming Chen ; Dept. of Control Sci. & Eng., Zhejiang Univ., Hangzhou, China ; Qing Yu ; Peng Cheng ; Youxian Sun
more authors

In this paper, multi-channel allocation in wireless sensor and actuator networks is formulated as an optimization problem which is NP-hard. In order to efficiently solve this problem, a distributed game based channel allocation (GBCA) Algorithm is proposed by taking into account both network topology and routing information. For both tree/forest routing and non-tree/forest routing scenarios, it is proved that there exists at least one Nash Equilibrium for the problem. Furthermore, the sub- optimality of Nash Equilibrium and the convergence of the Best Response dynamics are also analyzed. Simulation results demonstrate that GBCA significantly reduces the interference and dramatically improves the network performance in terms of delivery ratio, throughput, channel access delay, and energy consumption.

Published in:

Automatic Control, IEEE Transactions on  (Volume:56 ,  Issue: 10 )