Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aziz AA, Sekercioglu YA, Fitzpatrick P, Ivanovich M (2012) A survey on distributed topology control techniques for extending the lifetime of battery powered wireless sensor networks. IEEE Commun Surv Tutorials 15(1):121–144
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–6
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–5
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–388
Zorzi M, Rao RR (2003) Geographic random forwarding (GeRaF) for Ad Hoc and sensor networks: multihop performance. IEEE Trans Mob Comput 2(4):337–348
Merlin CJ, Heinzelman WB (2010) Duty cycle control for low-power-listening MAC protocols. IEEE Trans Mob Comput 9(11):1508–1521
Ziouva E, Antonakopoulos T (2002) CSMA/CA performance under high traffic conditions: throughput and delay analysis. Comput Commun 25(3):313–321
Crossbow Technology. Available at http://www.xbow.com/. Accessed 2 July
Politis C, Dixit S, Lach HY, Uskela S (2004) Cooperative networks for the future wireless world. IEEE Commun Mag 42(9):70–79
Brown DR, Fazel F (2011) A game theoretic study of energy efficient cooperative wireless networks. J Commun Networks 13(3):266–276
Penrose MD (1999) On k-connectivity for a geometric random graph. Wiley Random Struct Algorithms 15(2):145–164
MathWorks. Available athttp://www.mathworks.com/. Accessed 2 July
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–582
Acknowledgments
This research was also partly funded by the National Science Council (NSC) of the Taiwan under grants NSC 101-2221-E-197-008-MY.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Cho, HH., Tseng, FH., Shih, T.K., Chou, LD., Chao, HC., Wu, TY. (2014). A k-Cooperative Analysis in Game-Based WSN Environment. In: Huang, YM., Chao, HC., Deng, DJ., Park, J. (eds) Advanced Technologies, Embedded and Multimedia for Human-centric Computing. Lecture Notes in Electrical Engineering, vol 260. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-7262-5_138
Download citation
DOI: https://doi.org/10.1007/978-94-007-7262-5_138
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-7261-8
Online ISBN: 978-94-007-7262-5
eBook Packages: EngineeringEngineering (R0)