A k-Cooperative Analysis in Game-Based WSN Environment
In wireless sensor networks (WSNs), the coverage problem usually accompanies the energy-saving issue, which ensures the fundamental functions are workable. Therefore, the sensor nodes must be deployed and survived in the target place for a long time, and sustain the trade-off between expected coverage and limited battery energy. The lesser sensor nodes are awake in an epoch, the longer network lifetime is achieved. It shows that the coverage problem must be solved based on the energy efficiency viewpoint. In this paper, we propose a game-based WSNs environment and solve the energy saving issue with the minimum number of competition players, which implies the most suitable duty-cycle for all sensor nodes. In the simulation results, the proposed approach achieves the lowest power consumption and longest network lifetime.
KeywordsWireless sensor network Energy saving Integer linear programming \( k \)-cooperative game
This research was also partly funded by the National Science Council (NSC) of the Taiwan under grants NSC 101-2221-E-197-008-MY.
- 2.Suhonen J, Kohvakka M, Kaseva V, Hämäläinen TD, Hännikäinen M (2012) Low-power WSN technology,” in Low-power wireless sensor networks, chap. 1, Springer US, pp 1–6Google Scholar
- 3.Zhang Y, Feng CH, Demirkol I, Heinzelman WB (2010) Energy-efficient duty cycle assignment for receiver-based convergecast in wireless sensor networks. In: Proceeding of the IEEE global telecommunications conference (GLOBECOM), Miamim, Florida, USA, pp 1–5Google Scholar
- 4.Cho H-H, Chang J-M, Chen C-Y, Huang S-Y, Chao H-C, Chen J-L (2011) An energy-efficient dynamic duty-cycle and dynamic schedule assignment scheme for WSNs. In: Proceeding of the IEEE Asia-Pacific services computing conference (APSCC), Jeju, Korea, pp 384–388Google Scholar
- 8.Crossbow Technology. Available at http://www.xbow.com/. Accessed 2 July
- 11.Penrose MD (1999) On k-connectivity for a geometric random graph. Wiley Random Struct Algorithms 15(2):145–164Google Scholar
- 12.MathWorks. Available athttp://www.mathworks.com/. Accessed 2 July
- 13.Liang W, Chen B, Yu XJ (2008) Response time constrained Top-k query evaluation in sensor networks. In: Proceeding of 14th IEEE international conference on parallel and distributed systems (ICPADS), Melbourne, Australia, pp 575–582Google Scholar