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. © Springer-Verlag Berlin Heidelberg 2013.
CITATION STYLE
Chen, J., & Guo, W. (2013). A PSO-optimized Nash equilibrium-based task scheduling algorithm for wireless sensor network. In Communications in Computer and Information Science (Vol. 401, pp. 62–73). Springer Verlag. https://doi.org/10.1007/978-3-642-53959-6_7
Mendeley helps you to discover research relevant for your work.