N-person card game approach for solving SET K-COVER problem in wireless sensor networks

IEEE Transactions on Instrumentation and Measurement

Volumn 61, Issue 5, 2012, Pages 1522-1535

  Wang, Qiang ^a   Yan, Wenjie ^a   Shen, Yi ^a  

^a HARBIN INSTITUTE OF TECHNOLOGY   (China)

Author keywords

Coverage game; distributed algorithm; game theory; Nash equilibrium; SET K COVER; wireless sensor networks (WSNs)

Indexed keywords

CARD GAMES; CONVERGENCE PERFORMANCE; COVERAGE GAME; DISTRIBUTED METHODS; EXTENSIVE SIMULATIONS; MESSAGE COMPLEXITY; NASH EQUILIBRIA; OPTIMALITY; PAYOFF FUNCTION; PRACTICAL ISSUES; REAL APPLICATIONS; SENSING AREAS; SET K-COVER; SOLVING SET; WIRELESS SENSOR NETWORK (WSNS);

ALGORITHMS; EXPERIMENTS; GAME THEORY; PARALLEL ALGORITHMS; SENSORS; TELECOMMUNICATION NETWORKS;

WIRELESS SENSOR NETWORKS;

EID: 84862827396     PISSN: 00189456     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIM.2011.2181781     Document Type: Conference Paper

References (31)

1. M. Cardei, M. T. Thai, Y. S. Li, and W. Wu, "Energy-efficient target coverage in wireless sensor networks," in Proc. IEEE INFOCOM, 2005, pp. 1976-1984.
2. W. Wang, V. Srinivasan, and K. C. Chua, "Trade-offs between mobility and density for coverage in wireless sensor networks," in Proc. ACM Mobile Comput. Netw., 2007, pp. 39-50.
3. F. Ye, G. Zhong, S. Lu, and L. Zhang, "Energy efficient robust sensing coverage in large sensor networks," UCLA, Los Angeles, CA, Tech. Rep., 2002.
4. D. Tian and N. D. Georganas, "A node scheduling scheme for energy conservation in large wireless sensor networks," Wireless Comm. Mobile Comput., vol. 3, no. 2, pp. 271-290, Mar. 2003.
5. Z. Abrams, A. Goel, and S. Plotkin, "Set k-cover algorithms for energy efficient monitoring in wireless sensor networks," in Proc. IPSN, Apr. 2004, pp. 424-432.
6. X. Ai, V. Srinivasan, and C. K. Tham, "Optimality and complexity of pure Nash equilibria in the coverage game," IEEE J. Sel. Areas Commun., vol. 26, no. 7, pp. 1170-1182, Sep. 2008.
7. J. F. Nash, Essays on Game Theory. Northampton, MA: William Pratt House, 1996.
8. D. Vickrey and D. Koller, "Multi-agent algorithms for solving graphical games," in Proc. AAAI, 2002, pp. 345-351.
9. D. Fudenberg and J. Tirole, Game Theory. Cambridge, MA: MIT Press, 1991.
10. S. Sengupta, M. Chatterjee, and K. A. Kwiat, "A game theoretic framework for power control in wireless sensor networks," IEEE Trans. Comput., vol. 59, no. 2, pp. 231-242, Feb. 2010.
11. S.-K. Ng and W. K. G. Seah, "Game-theoretic approach for improving cooperation in wireless multihop networks," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 40, no. 3, pp. 559-574, Jun. 2010.
12. R. Kannan and S. Sitharama Iyengar, "Game-theoretic models for reliable path-length and energy-constrained routing with data aggregation in wireless sensor networks," IEEE J. Sel. Areas Commun., vol. 22, no. 6, pp. 1141-1150, Aug. 2004.
13. H. Ren and M. Q.-H. Meng, "Game-theoretic modeling of joint topology control and power scheduling for wireless heterogeneous sensor networks," IEEE Trans. Autom. Sci. Eng., vol. 6, no. 4, pp. 610-625, Oct. 2009.
14. C. U. Saraydar, N. B. Mandayam, and D. J. Goodman, "Efficient power control via pricing in wireless data networks," IEEE Trans. Commun., vol. 50, no. 2, pp. 291-303, Feb. 2002.
15. R. S. Komali, A. B. Mackenzie, and R. P. Gilles, "Effect of selfish node behavior on efficient topology design," IEEE Trans. Mobile Comput., vol. 7, no. 9, pp. 1057-1070, Sep. 2008.
16. L. Zhang, Y. Lu, L. Chen, and D. Dong, "Game theoretical algorithm for coverage optimization in wireless sensor networks," in Proc. WCE, London, U.K., Jul. 2-4, 2008, vol. I.
17. Y. Wenjie, W. Qiang, and S. Yi, " N-person card game algorithm for solving set k-cover problem in WSN," in Proc. IEEE I2MTC, Binjiang, China, 2011, pp. 1-6.
18. R. Katsuma, Y. Murata, N. Shibata, K. Yasumoto, and M. Ito, "Extending k-coverage lifetime of wireless sensor networks using mobile sensor nodes," in Proc. IEEE Int. Conf. Wireless Mobile Comput., Netw. Commun., WIMOB, 2009, pp. 48-54.
19. Z. Q. Yun, X. L. Bai, D. Xuan, T. H. Lai, andW. Jia, "Optimal deployment patterns for full coverage and k-connectivity wireless sensor networks," IEEE/ACM Trans. Netw., vol. 18, no. 3, pp. 934-947, Jun. 2010.
20. H. Zhang and J. C. Hou, "Maximizing a-lifetime for wireless sensor networks," in Proc. SenMetrics, 2005, pp. 70-77.
21. J. Jia, J. Chen, G. R. Chang, and Y.-Y. Wen, "Efficient cover set selection in wireless sensor networks," Acta Autom. Sinica, vol. 34, no. 9, pp. 1157-1162, Sep. 2008.
22. S. Slijepcevic and M. Potkonjak, "Power efficient organization of wireless sensor networks," in Proc. IEEE ICC, Helsinki, Finland, 2001, pp. 472-476.
23. D. H. Wolpert and W. G. Macready, "No free lunch theorems for optimization," IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 67-82, Apr. 1997.
24. X. Ai, V. Srinivasan, and C. K. Tham, "DARCo: Distributed, robust and asynchronous coverage in wireless sensor networks," in Proc. IEEE SECON, 2007, pp. 530-539.
25. H. H. Zhang and J. C. Hou, "Maintaining sensing coverage and connectivity in large sensor networks," in Proc. Ad Hoc Sens. Wireless Netw., Mar. 2005, vol. 1, pp. 89-124.
26. A. Howard, M. Mataric, and G. Sukhatme, "Relaxation on a mesh: A formalism for generalized localization," in IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Wailea, HI, Oct. 2001, pp. 1055-1060.
27. C. Savarese, J. Rabaey, and J. Beutel, "Locationing in distributed ad-hoc wireless sensor networks," in Proc. ICASSP, Salt Lake City, UT, May 2001, pp. 2037-2040.
28. P. Dubey, "Inefficiency of Nash equilibria," Math. Oper. Res., vol. 11, no. 1, pp. 1-8, Feb.1986.
29. [Online]. Available: http://ac411.hit.edu.cn/research/download/ npcgakcover. zip
30. K. Chakrabarty, S. S. Iyengar, H. Qi, and E. Cho, "Grid coverage for surveillance and target location in distributed sensor networks," IEEE Trans. Comput., vol. 51, no. 12, pp. 1448-1453, Dec. 2002.
31. Y. Zou and K. Chakrabarty, "Sensor deployment and target localization based on virtual forces," in Proc. 22nd Int. Annu. Joint Conf. IEEE Comput. Commun. Soc., San Francisco, CA, 2003, pp. 1293-1303.