Information Technology Reference
In-Depth Information
A PSO-Optimized Nash Equilibrium-Based Task
Scheduling Algorithm for Wireless Sensor Network
Jiaye Chen and Wenzhong Guo
*
College of Mathematics and Computer Sciences, Fuzhou University, Fuzhou 350108, PR China
cjy_fzu@126.com, guowenzhong@fzu.edu.cn
Abstract.
For the dynamic load characteristics of Wireless sensor network, we
propose the idea of parallel Coalition and introduce the game theory into the
solving of dynamic task allocation problem. In this paper, we design the model
of multiple task allocation based on Nash equilibrium, and use runtime of task,
Transmission energy consumption and Residual energy to design the utility
function of Games. Then we use PSO to find to the point of Nash equilibrium.
By using this method, guarantee the task execution effectiveness and improve
the utilization rate of networks. Simulation results prove the validity of the
algorithm, and can effectively prolong the lifetime of the network.
Keywords:
WSN, task allocation, PSO, Game Theory, Nash equilibrium.
1
Introduction
Wireless sensor network (WSN) which includes a large number of sensor nodes is a
wireless self-organizing and data-centric network
[1]. The biggest drawback of wire-
less sensor network is that nodes have very limited energy, storage space and compu-
ting ability. Task scheduling is a classic problem of extensive research in the field of
high-performance computing, and is also the core issues in the area of operating sys-
tem research. In the operation of parallel and distributed computing systems, In order
to effectively use the system resources, an application is usually decomposed into
multiple tasks. Systems allocate resources to each task and determine the ordering of
tasks execution. Task management is an important module in WSN, and it works
together with the mobile management and energy management to monitor energy
consumption, dynamic change and the role of task allocation of the sensor nodes in
the entire network
[1].
Many native and foreign scholars have done much research work on task allocation
of WSN during the past several years. Yang et al propose an energy-balanced alloca-
tion of a real-time application onto a single-hop cluster of homogeneous sensor nodes
connected with multiple wireless channels
[2]. An epoch-based application consisting
of a set of communicating tasks is considered. Each sensor node is equipped with dis-
crete dynamic voltage scaling (DVS). The time and energy costs of both computation
