A k-Cooperative Analysis in Game-Based WSN Environment
暂无分享,去创建一个
[1] Christos Politis,et al. Cooperative networks for the future wireless world , 2004, IEEE Communications Magazine.
[2] Ville Kaseva,et al. Low-power WSN Technology , 2012 .
[3] Michele Zorzi,et al. Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance , 2003, IEEE Trans. Mob. Comput..
[4] Wendi B. Heinzelman,et al. Energy-Efficient Duty Cycle Assignment for Receiver-Based Convergecast in Wireless Sensor Networks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.
[5] Jiann-Liang Chen,et al. An Energy-Efficient Dynamic Duty-Cycle and Dynamic Schedule Assignment Scheme for WSNs , 2011, 2011 IEEE Asia-Pacific Services Computing Conference.
[6] M. Penrose. On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.
[7] Theodore Antonakopoulos,et al. CSMA/CA performance under high traffic conditions: throughput and delay analysis , 2002, Comput. Commun..
[8] Weifa Liang,et al. Response Time Constrained Top-k Query Evaluation in Sensor Networks , 2008, 2008 14th IEEE International Conference on Parallel and Distributed Systems.
[9] D. Richard Brown,et al. A game theoretic study of energy efficient cooperative wireless networks , 2011, Journal of Communications and Networks.
[10] Y. Ahmet Sekercioglu,et al. A Survey on Distributed Topology Control Techniques for Extending the Lifetime of Battery Powered Wireless Sensor Networks , 2013, IEEE Communications Surveys & Tutorials.