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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., et al.: Wireless sensor networks: a survey. Computer Networks 38, 393–422 (2002)
Yu, Y., Viktor, K.P.: Energy-balanced task allocation for collaborative processing in wireless sensor networks. Mobile Networks and Applications 10(12), 115–131 (2005)
Liu, M., Li, H.H., Shen, Y.: Research on task allocation technique for aerial target tracking based on wireless sensor network. Journal of Astronautics 28(4), 960–965 (2007)
Chen, G.L., Guo, W.Z., Chen, Y.Z.: Research on dynamic alliance of task allocation and its algorithm in wireless sensor network. Journal on Communication 30(11), 48–55 (2009)
Guo, W.Z., Xiong, N.X., Chao, H.C., et al.: Design and Analysis of Self-Adapted Task Scheduling Strategies in Wireless Sensor Networks. Sensors 11(7), 6533–6554 (2011)
Maynard, S.J.: Evolution and the Theory of Games. Cambridge University Press, Cambridge (1982)
Thomas, R.: Genetic Algorithm Learning and Evolutionary Games. Journal of Economic Dynamics & Control 25, 1019–1037 (2001)
Chen, S.J., Sun, Y.G., Wu, Z.G.: A Genetic Algorithm to Acquire the Nash Equilibrium. System Engineering 19(5), 67–70 (2001)
Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing Nash equilibrium. In: STOC 2006, pp. 71–78. ACM press, Seattle (2005)
Thomas, R.: Genetic algorithm learning and evolutionary games. Journal of Economic Dynamics & Control 25(6), 1019–1037 (2001)
Kan, Y., Wang, R.C.: Nash Equilibrium Based Task Scheduling Algorithm of Multi-schedulers in Grid Computing. Acta Electronica Sinica 37(2), 329–333 (2009)
Zhang, G.F., Jiang, J.G., Xia, N., Su, Z.P.: Solutions of complicated coalition generation based on discrete particle swarm optimization. Acta Electronica Sinica 35(2), 323–327 (2007)
Wu, Q., Rao, N.S., Barhen, J.: On computing mobile agent routes for data fusion in distributed sensor networks. IEEE Trans. on Knowledge and Data Engineering 16(6), 740–753 (2004)
Garey, M.R., Johnson, D.S.: “Strong” NP-Completeness Results: Motivation, Examples, and Implications. Journal of the Association for Computing Machinery 25(3), 499–508 (1978)
Mezura-Montes, E., Coello, C.A.C.: A simple multi-membered evolution strategy to save constrained optimization problems. IEEE Transactions on Evolutionary Computation 9(1), 1–17 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, J., Guo, W. (2013). A PSO-Optimized Nash Equilibrium-Based Task Scheduling Algorithm for Wireless Sensor Network. In: Su, J., Zhao, B., Sun, Z., Wang, X., Wang, F., Xu, K. (eds) Frontiers in Internet Technologies. Communications in Computer and Information Science, vol 401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53959-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-53959-6_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53958-9
Online ISBN: 978-3-642-53959-6
eBook Packages: Computer ScienceComputer Science (R0)