基于连通覆盖度的无线传感器网络分簇协议研究
|
摘要
无线传感器网络是由布置在检测区域内大量的廉价微型传感器节点组成,通过无线通信方式形成的一个多跳的自组织的网络系统。现已广泛应用于军事、环境监测和现代化农业等方面,具有重要的研究意义和实用价值。高效节能是该网络的首要设计目标,以延长网络寿命。作为网络拓扑控制研究的重点:网络覆盖度和连通度对网络耗能的影响十分重大。
本文首先对无线传感器网络的基础知识和研究意义等进行了介绍。详细阐述了影响无线传感器网络能耗的重要指标-拓扑控制中的诸多影响参数。在此基础上,从分簇拓扑、连通性、覆盖度三个方面进行综合考虑,提出了一种新的分簇协议,将新方法和传统方法比较,取得了一些有意义的成果,具体工作如下:
1提出了基于连通覆盖度的无线传感器分簇协议,该协议依据分而治之的原则。利用最大熵原理在保证网络连通覆盖度的前提下对网络进行初始化分簇,选出临时簇头后,在每个簇内执行CDS选取和簇头优化更新以及替补簇头节点的选取,最后利用最短路径算法导出的最低成本路径算法进行簇间和簇内通信。仿真实验表明,该方法与同类协议相比,更能够增强网络的连通覆盖度,不仅均衡了能量消耗,延长了网络生存时间,而且具有较强的可扩展性和鲁棒性。
2从无线传感器网络安全方面考虑,对所提出的基于连通覆盖的分簇协议结合经济学博弈论中的VCG拍卖模型,设计出了一个报真实能量值的激励机制设计方案,以保障在簇头选举中各节点能真实地报出自己的剩余能量。并对该机制进行了性能分析验证。经过性能分析,在数据包传输率、真实能量报价、数据延时和链路负载等方面有了较大改善,
Wireless sensor network is composed by a large number of low-cost tiny sensor nodes deployed in the detection region, which is a self-organized multi-hop network formed by the wireless communication. Due to its significance for research as well as practice, now it has been already widely used in many areas such as military, environmental monitoring, modern agriculture etc. Energy-efficiency is the primary goal of this network which aims to extend its lifetime. As the focus of network topology control, coverage and connectivity have a great effect on the energy consumption of the network.
This thesis firstly introduces the basic knowledge of wireless sensor network and the significance of the research, expounding the various parameters in the topology control which influence the energy assumption of wireless sensor network. Then, after a comprehensive study from the following three aspects: the cluster-based topology, connectivity and coverage, the thesis proposed a new clustering protocol, which is of significance when compared with the traditional ones. The main work is as follows:
First, it proposes a coverage-connectivity clustering protocol for wireless sensor networks, which is based on the“divide and rule”principle. The protocol makes use of maximum entropy principle to do the primary clustering under the premise of coverage-connectivity. When the temporary cluster heads are chosen, in each cluster, CDS will be operated, the cluster will be optimized and updated, and the substitutive head will be selected. Finally, in the adoption of the lowest-cost path algorithm derived from the shortest path algorithm, the protocol realizes the communication within and among clusters. Simulation experiments show that compared with the former classical clustering protocol, our protocol can improve the coverage-connectivity of the network: it not only balancing the energy assumption and lengthens the lifetime of the network, but also possesses strong salability and robust.
Second, regarding the security of wireless sensor networks, this thesis combines the VCG auction model in Game Theory and proposes an Incentive mechanism design to ensure that each node can report its trueful residual energy in the head selection. Besides, the thesis also conducts the Performance Verification, whose result shows that the Incentive mechanism design achieves great progress in Packet Delivery Ratio, End-to-End Delay and Link Load Balancing.
本文首先对无线传感器网络的基础知识和研究意义等进行了介绍。详细阐述了影响无线传感器网络能耗的重要指标-拓扑控制中的诸多影响参数。在此基础上,从分簇拓扑、连通性、覆盖度三个方面进行综合考虑,提出了一种新的分簇协议,将新方法和传统方法比较,取得了一些有意义的成果,具体工作如下:
1提出了基于连通覆盖度的无线传感器分簇协议,该协议依据分而治之的原则。利用最大熵原理在保证网络连通覆盖度的前提下对网络进行初始化分簇,选出临时簇头后,在每个簇内执行CDS选取和簇头优化更新以及替补簇头节点的选取,最后利用最短路径算法导出的最低成本路径算法进行簇间和簇内通信。仿真实验表明,该方法与同类协议相比,更能够增强网络的连通覆盖度,不仅均衡了能量消耗,延长了网络生存时间,而且具有较强的可扩展性和鲁棒性。
2从无线传感器网络安全方面考虑,对所提出的基于连通覆盖的分簇协议结合经济学博弈论中的VCG拍卖模型,设计出了一个报真实能量值的激励机制设计方案,以保障在簇头选举中各节点能真实地报出自己的剩余能量。并对该机制进行了性能分析验证。经过性能分析,在数据包传输率、真实能量报价、数据延时和链路负载等方面有了较大改善,
Wireless sensor network is composed by a large number of low-cost tiny sensor nodes deployed in the detection region, which is a self-organized multi-hop network formed by the wireless communication. Due to its significance for research as well as practice, now it has been already widely used in many areas such as military, environmental monitoring, modern agriculture etc. Energy-efficiency is the primary goal of this network which aims to extend its lifetime. As the focus of network topology control, coverage and connectivity have a great effect on the energy consumption of the network.
This thesis firstly introduces the basic knowledge of wireless sensor network and the significance of the research, expounding the various parameters in the topology control which influence the energy assumption of wireless sensor network. Then, after a comprehensive study from the following three aspects: the cluster-based topology, connectivity and coverage, the thesis proposed a new clustering protocol, which is of significance when compared with the traditional ones. The main work is as follows:
First, it proposes a coverage-connectivity clustering protocol for wireless sensor networks, which is based on the“divide and rule”principle. The protocol makes use of maximum entropy principle to do the primary clustering under the premise of coverage-connectivity. When the temporary cluster heads are chosen, in each cluster, CDS will be operated, the cluster will be optimized and updated, and the substitutive head will be selected. Finally, in the adoption of the lowest-cost path algorithm derived from the shortest path algorithm, the protocol realizes the communication within and among clusters. Simulation experiments show that compared with the former classical clustering protocol, our protocol can improve the coverage-connectivity of the network: it not only balancing the energy assumption and lengthens the lifetime of the network, but also possesses strong salability and robust.
Second, regarding the security of wireless sensor networks, this thesis combines the VCG auction model in Game Theory and proposes an Incentive mechanism design to ensure that each node can report its trueful residual energy in the head selection. Besides, the thesis also conducts the Performance Verification, whose result shows that the Incentive mechanism design achieves great progress in Packet Delivery Ratio, End-to-End Delay and Link Load Balancing.
引文
[1] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, E. Cayirci, A survey on sensor networks, IEEE Communications Magazine 2002.40(8):pp104–112.
[2]Jennifer Yick, Biswanath Mukherjee.Wireless sensor network survey.Computer Networks 52 2008:pp2292–2330
[3]Wendi Rabiner.H, Anantha.C. Energy-Efficient Communication Protocol forWireless Microsensor Networks. Proceedings of the 33rd Hawaii International Conference on System Sciences 2000:pp3005~3014
[4]Younis O, fahmy S. HEED: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks. IEEE Trans. on Mobile Computing, 2004,3(4):pp660~669.
[5]Chen B, Jamieson K, Balakrishnan H, Morris R. SPAN: An energy efficient coordination algorithm for topology maintenance in ad hoc wireless networks. ACM Wireless Networks, 2002,8(5):pp481?494.
[6]J.Yao,M.Dash.Entroy-based fuzzy clustering and modeling.Fuzzy Sets and Systems.2000.188-282
[7]Xuewang,junjie.M.Parallel energy-efficient coverage optimization with maximum entropy clustering in wireless sensor networks.J.Parallel Distrib.Computer
[8]Gupta P, Kumar PR. The capacity of wireless networks. IEEE Trans. on Information Theory, 2000.46(2):pp388~404.
[9]张学,陆桑璐,陈贵海.无线传感器网络的拓扑控制.软件学报[J].2007.18(4)pp:943-954
[10]Wang X, Xing G, Zhang Y, Lu C, P.Integrated coverage and connectivity configuration in wireless sensor networks. Proceedings of ACM International Conference on Embedded Networked Sensor Systems (SenSys 2003), Los Angeles, CA, pp 28–39
[11]文浩,林闯.无线传感器网络的QoS体系结构.计算机学报[J].2009.32(3)
[12]Meguerdichian S, Koushanfar F, Potkonjak M, Srivastava MB. Coverage problems in wireless ad-hoc sensor networks. In: Bauer F, Cavendish D, eds. Proc. of the IEEE Conf. on ComputerCommunications (INFOCOM). New York: IEEE Press, 2001. pp1380~1387.
[13]Thai MT, Wang F, Du DZ. Coverage problems in wireless sensor networks: designs and analysis. Special Issue on Coverage Problems in Sensor Networks.2007.
[14]Deng J, Han YS, Heinzelman WB, Varshney PK. Scheduling sleeping nodes in high density cluster-based sensor networks. ACM/Kluwer Mobile Networks and Applications (MONET), 2005.10(6):pp825~835.
[15]Wu K, Gao Y, Li F, Xiao Y. Lightweight deployment-aware scheduling for wireless sensor networks. ACM/Kluwer Mobile Networks and Applications (MONET), 2005,10(6):837~852.
[16]Santi P.The critical transmitting range for connectivity in mobile ad hoc networksi-J].IEEE Transaction on Mobile Computing,2005.4(3):pp310~317
[17]Narayanaswamy S, Kawadia V, Sreenivas RS, Kumar PR. Power control in ad-hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol. In: Proc. of the European Wireless Conf. Florence, 2002:pp156~162.
[18] F. Ye, G. Zhong, J. Cheng, S. Lu, L. Zhang, PEAS: A robust energy conserving protocol for long-lived sensor networks, in: Proc. of the 23rd International Conference on Distributed Computing Systems, ICDCS, Providence, USA, 2003, pp.28~37.
[19]Kawadia V. Protocols and architecture for wireless ad hoc networks [Ph.D. Thesis]. University of Illinois at Urbana Champaign, 2004.
[20]SEAPAHN.M,FARINAZ.K.Exposure inWireless Sensor Networks:Theory and Practical Solutions.Wireless Networks 2002(8):pp443–454,
[21]刘林峰,金杉.无线传感器网络的拓扑控制算法综述[J].计算机科学2008.01.35(3)
[22]周培德.计算几何.北京:清华大学出版社.2005
[23] Senti P.Blough D.The critical Transmitting range for eonnectiv-ity in sparse wireless ad hoc networks[J].IEEE Transaction on Mobile Computing,2003.2(1):pp25～39
[24] P Gupta, PR Kumar;Critical power for asymptotic connectivity in wireless networks.In:Proe of Stoehastie Analysis,Control,Optimization and Application[c]Boston,MA:IEEE Press,1998.pp547~566
[25] Asymptotic.critical transmission ranges for connectivity in wireless ad hoc networks with Bemoulli nodes[A].In : Proc. of IEEE Wireless Communications and Networking Conference[C].New Orleans,LA.2005
[26]Tian D, Georganas ND.A coverage-preserving node scheduling scheme for large wireless sensor networt. Proceeding of 1st ACM Workshop on Wireless Sensor Networks and Applications (WSNA 02),Atlanta, GA
[27] Di Tian, Nicolas D. Georganas, Connectivity maintenance and coverage preservation in wireless sensor networks, in: Proc. Canadian Conf. on Electrical and Computer Engineering, 2004.
[28]Tian D, Georganas ND. Location and calculation-free node-scheduling schemes in large wireless sensor networks. Ad Hoc Networks :pp65–85
[29]Yan T, He T, Stankovic JA.Differentiated surveillance for sensor networks. Proceedings of ACM International Conference on Embedded Networked Sensor Systems (SenSys 2003), Los Angeles, CA
[30]H.Chen,H.Wu.T.Grid-based Approavh for working node selection in wireless sensor networks.Proceeding of IEEE International Conferenceon Communications.Paris,France,2004
[31]X.R Wang,G.l.xing,Y.f.Zhang. Interaged Coverage and Connectivity Configuration in wireless Sensor Networks.Proceedings of the 1st ACM Conference on Embedded Networks Sensors Systems,Los Angeles,CA,2003
[32]Mihaela.C, David.M. Wireless Sensor Networks with Energy Efficient Organization. Journal of Interconnection Networks.2002(3):pp213-229
[33]M.Cardie,D.z.Du. Improving Wireless Sensor Network Lifetime throught Power Aware Organization,ACM Wireless Networks,2005.11(3):pp333-340
[34]J.Lu,K.Suda. Coverage-aware Self-scheduling in Sensor Networks,Proceedings of the 18th IEEE Annual Workshop on Computer Communications ,Dann Point,California,USA,2003
[35]H. Zhang, J.C. Hou, Maintaining sensing coverage and connectivity in large sensor networks,[J].Wireless Ad Hoc Sensor Net .2005,pp89~124.
[36]Lichun Bao.Garcia Luna Aceves.Stable energy-aware topology management in ad hoc networks.Ad Hoc Networks.2010(8):pp313–327
[37]Wei An, Fang-Ming Shao, Huajun Meng.The coverage-control optimization in sensor network subject to sensing area[J] ,Computers and Mathematics with Applications2009 (57):pp529-539
[38] Jie Jia , Jian Chena, Guiran Chang.Energy efficient coverage control in wireless sensor networks based on multi-objective genetic algorithm[J],Computers and Mathematics with Applications 2009(57):pp1756-1766
[39] XueWang,Junjie Ma,ShengWang.Parallel energy-efficient coverage optimization with maximum entropy clustering in wireless sensor networks[J] ,J.Parallel Distrib. Comput 2009:pp102~113
[40]Seapahn Meguerdichian,Miodrag Potkonjak.Low Power 0/1 Coverage and Scheduling Techniques in Sensor Networks[J]IEEE Transaction on computer,2002:pp87~96
[41]Krishnendu Chakrabarty,S.Sitharama Lyengar.Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks.IEEE Transaction on computer,2002
[42]Wang et al..Intergrated Coverage and Connectivity Configuration in Wireless Sensor Networks, in: Proceedings of the First ACM Conference on Embedded Networked Sensor Systems, Los Angeles, November 2003
[43] Zhang and Hou.Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. Technical report .2003(7).
[44]Yi zhou,Krishnendu Chakrabarty.A Distributed Coverage and Connectivity Centric Technique for Selecting Active Nodes in Wireless Sensor Networks. IEEE Transaction on computer,2005
[45]L.Wang, H. Ji, X. Gao, Clustering based on possibilistic entropy, in: Proceedings of 7th International Conference on Signal Processing, 2004.pp. 1467~1470.
[46]蒋杰,方立。无线传感器网络最小连通覆盖集问题求解算法[J].软件学报2006(2)pp:175-184.
[47] M. Noto, H. Sato, A method for the shortest path search by extended Dijkstra algorithm, in: IEEEInternational Conference on Systems, Man, and Cybernetics, 2000, pp. 2316~2320.
[48]Stanislava Soro.cluster head election technique for coverage preservation in wireless sensor networks. [J] AD Hoc Networks.2009:pp:955-972
[49]K.Komathy.P.Narayanasamy.Trust-based evolutionary game model assisting AODV routing against selfishness. Journal of Network and Computer Applications. Journal of Network and Computer Applications.2008.31(4):pp446-471
[50] Felegyhazi M,Hubaux J P,Buttyan L.Nash equilibria of packet forwarding strategies in wireless Ad hoc networks[J].IEEE Transactions on Mobile Computing.2006.5(5):463-476
[51] Marti S,Giuli T,Lai K,Baker M.Mitigating routing misbehavior in mobile Ad hoe networks。Proceedings of the MobiCom.Boston.2000:255-265
[52] A.B. MacKenzie, L.A. DaSilva, Game Theory for Wireless Engineers (Synthesis Lectures on Communications), Morgan & Claypool Publishers, 2006.
[53] J. Byers, G. Nasser, Utility-based decision-making in wireless sensor networks, in: Proceedings of the First ACM International Symposium on Mobile ad hoc networking and Computing, Poster Session, 2000,pp. 143–144.
[54]NisanA.Algorithmic mechanism design. Games and Economic Behavior.2001,35(12):pp166—196.
[55] A. Agah, M. Asadi, S.K. Das, Prevention of DoS attacks in sensor networks using repeated game theory, in: Proceedings of the International Conference on Wireless Networks, 2006.
[56]Renita Machado,Sirin Tekinay.A survey of game-theoretic approaches in wireless sensor networks.Computer Networks 2008(52):3047–3061
[57] R. Vidal, O. Shakernia, H. Kim, D. Shim, S. Sastry, Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation, IEEE Transactions on Robotics and Automation 2002.18 (5):pp662–669.
[58]汪洋,林闯,李泉林等.基于非合作博弈的无线网络路由机制研究[J].计算机学报.2009.32(1):pp54-68
[59] Josang At Ismail R.A survey of trust and reputation systems for online service provision.Decision Support Systems.2007.43(2):pp618-644
[60]Juan J, R. Srikant.A game theory based reputation mechanism to incentivize cooperation in wireless ad hoc networks[J].Ad Hoc Networks 2010(8):pp416–429.
[61]Groves T.Incentives in teams.Econometrica.1973,41(4):617-631
[62]Agah A,Das SK,Basu K.A game theory based approach for security in wireless sensor networks.In:Proc.of the 23rd IEEE Computing and Communications Conf Phoenix ,2004:pp259-263.
[63]M.J.Osborne,A.Rubinstein,A Course in Game Theory[p], MIT Press,1994.
[64] Sami R.Distributed algorithmic mechanism design[Ph.D Thesis]New Haven,Connecticut:Yale University,2003.
[65]You-Chiun W,Chun Chi H,Efficient Deployment Algorithms for Ensuring Coverage andConnectivity of Wireless Sensor Networks[J].Ad Hoc Networks.2010(8):416-429
[2]Jennifer Yick, Biswanath Mukherjee.Wireless sensor network survey.Computer Networks 52 2008:pp2292–2330
[3]Wendi Rabiner.H, Anantha.C. Energy-Efficient Communication Protocol forWireless Microsensor Networks. Proceedings of the 33rd Hawaii International Conference on System Sciences 2000:pp3005~3014
[4]Younis O, fahmy S. HEED: A hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks. IEEE Trans. on Mobile Computing, 2004,3(4):pp660~669.
[5]Chen B, Jamieson K, Balakrishnan H, Morris R. SPAN: An energy efficient coordination algorithm for topology maintenance in ad hoc wireless networks. ACM Wireless Networks, 2002,8(5):pp481?494.
[6]J.Yao,M.Dash.Entroy-based fuzzy clustering and modeling.Fuzzy Sets and Systems.2000.188-282
[7]Xuewang,junjie.M.Parallel energy-efficient coverage optimization with maximum entropy clustering in wireless sensor networks.J.Parallel Distrib.Computer
[8]Gupta P, Kumar PR. The capacity of wireless networks. IEEE Trans. on Information Theory, 2000.46(2):pp388~404.
[9]张学,陆桑璐,陈贵海.无线传感器网络的拓扑控制.软件学报[J].2007.18(4)pp:943-954
[10]Wang X, Xing G, Zhang Y, Lu C, P.Integrated coverage and connectivity configuration in wireless sensor networks. Proceedings of ACM International Conference on Embedded Networked Sensor Systems (SenSys 2003), Los Angeles, CA, pp 28–39
[11]文浩,林闯.无线传感器网络的QoS体系结构.计算机学报[J].2009.32(3)
[12]Meguerdichian S, Koushanfar F, Potkonjak M, Srivastava MB. Coverage problems in wireless ad-hoc sensor networks. In: Bauer F, Cavendish D, eds. Proc. of the IEEE Conf. on ComputerCommunications (INFOCOM). New York: IEEE Press, 2001. pp1380~1387.
[13]Thai MT, Wang F, Du DZ. Coverage problems in wireless sensor networks: designs and analysis. Special Issue on Coverage Problems in Sensor Networks.2007.
[14]Deng J, Han YS, Heinzelman WB, Varshney PK. Scheduling sleeping nodes in high density cluster-based sensor networks. ACM/Kluwer Mobile Networks and Applications (MONET), 2005.10(6):pp825~835.
[15]Wu K, Gao Y, Li F, Xiao Y. Lightweight deployment-aware scheduling for wireless sensor networks. ACM/Kluwer Mobile Networks and Applications (MONET), 2005,10(6):837~852.
[16]Santi P.The critical transmitting range for connectivity in mobile ad hoc networksi-J].IEEE Transaction on Mobile Computing,2005.4(3):pp310~317
[17]Narayanaswamy S, Kawadia V, Sreenivas RS, Kumar PR. Power control in ad-hoc networks: Theory, architecture, algorithm and implementation of the COMPOW protocol. In: Proc. of the European Wireless Conf. Florence, 2002:pp156~162.
[18] F. Ye, G. Zhong, J. Cheng, S. Lu, L. Zhang, PEAS: A robust energy conserving protocol for long-lived sensor networks, in: Proc. of the 23rd International Conference on Distributed Computing Systems, ICDCS, Providence, USA, 2003, pp.28~37.
[19]Kawadia V. Protocols and architecture for wireless ad hoc networks [Ph.D. Thesis]. University of Illinois at Urbana Champaign, 2004.
[20]SEAPAHN.M,FARINAZ.K.Exposure inWireless Sensor Networks:Theory and Practical Solutions.Wireless Networks 2002(8):pp443–454,
[21]刘林峰,金杉.无线传感器网络的拓扑控制算法综述[J].计算机科学2008.01.35(3)
[22]周培德.计算几何.北京:清华大学出版社.2005
[23] Senti P.Blough D.The critical Transmitting range for eonnectiv-ity in sparse wireless ad hoc networks[J].IEEE Transaction on Mobile Computing,2003.2(1):pp25～39
[24] P Gupta, PR Kumar;Critical power for asymptotic connectivity in wireless networks.In:Proe of Stoehastie Analysis,Control,Optimization and Application[c]Boston,MA:IEEE Press,1998.pp547~566
[25] Asymptotic.critical transmission ranges for connectivity in wireless ad hoc networks with Bemoulli nodes[A].In : Proc. of IEEE Wireless Communications and Networking Conference[C].New Orleans,LA.2005
[26]Tian D, Georganas ND.A coverage-preserving node scheduling scheme for large wireless sensor networt. Proceeding of 1st ACM Workshop on Wireless Sensor Networks and Applications (WSNA 02),Atlanta, GA
[27] Di Tian, Nicolas D. Georganas, Connectivity maintenance and coverage preservation in wireless sensor networks, in: Proc. Canadian Conf. on Electrical and Computer Engineering, 2004.
[28]Tian D, Georganas ND. Location and calculation-free node-scheduling schemes in large wireless sensor networks. Ad Hoc Networks :pp65–85
[29]Yan T, He T, Stankovic JA.Differentiated surveillance for sensor networks. Proceedings of ACM International Conference on Embedded Networked Sensor Systems (SenSys 2003), Los Angeles, CA
[30]H.Chen,H.Wu.T.Grid-based Approavh for working node selection in wireless sensor networks.Proceeding of IEEE International Conferenceon Communications.Paris,France,2004
[31]X.R Wang,G.l.xing,Y.f.Zhang. Interaged Coverage and Connectivity Configuration in wireless Sensor Networks.Proceedings of the 1st ACM Conference on Embedded Networks Sensors Systems,Los Angeles,CA,2003
[32]Mihaela.C, David.M. Wireless Sensor Networks with Energy Efficient Organization. Journal of Interconnection Networks.2002(3):pp213-229
[33]M.Cardie,D.z.Du. Improving Wireless Sensor Network Lifetime throught Power Aware Organization,ACM Wireless Networks,2005.11(3):pp333-340
[34]J.Lu,K.Suda. Coverage-aware Self-scheduling in Sensor Networks,Proceedings of the 18th IEEE Annual Workshop on Computer Communications ,Dann Point,California,USA,2003
[35]H. Zhang, J.C. Hou, Maintaining sensing coverage and connectivity in large sensor networks,[J].Wireless Ad Hoc Sensor Net .2005,pp89~124.
[36]Lichun Bao.Garcia Luna Aceves.Stable energy-aware topology management in ad hoc networks.Ad Hoc Networks.2010(8):pp313–327
[37]Wei An, Fang-Ming Shao, Huajun Meng.The coverage-control optimization in sensor network subject to sensing area[J] ,Computers and Mathematics with Applications2009 (57):pp529-539
[38] Jie Jia , Jian Chena, Guiran Chang.Energy efficient coverage control in wireless sensor networks based on multi-objective genetic algorithm[J],Computers and Mathematics with Applications 2009(57):pp1756-1766
[39] XueWang,Junjie Ma,ShengWang.Parallel energy-efficient coverage optimization with maximum entropy clustering in wireless sensor networks[J] ,J.Parallel Distrib. Comput 2009:pp102~113
[40]Seapahn Meguerdichian,Miodrag Potkonjak.Low Power 0/1 Coverage and Scheduling Techniques in Sensor Networks[J]IEEE Transaction on computer,2002:pp87~96
[41]Krishnendu Chakrabarty,S.Sitharama Lyengar.Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks.IEEE Transaction on computer,2002
[42]Wang et al..Intergrated Coverage and Connectivity Configuration in Wireless Sensor Networks, in: Proceedings of the First ACM Conference on Embedded Networked Sensor Systems, Los Angeles, November 2003
[43] Zhang and Hou.Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. Technical report .2003(7).
[44]Yi zhou,Krishnendu Chakrabarty.A Distributed Coverage and Connectivity Centric Technique for Selecting Active Nodes in Wireless Sensor Networks. IEEE Transaction on computer,2005
[45]L.Wang, H. Ji, X. Gao, Clustering based on possibilistic entropy, in: Proceedings of 7th International Conference on Signal Processing, 2004.pp. 1467~1470.
[46]蒋杰,方立。无线传感器网络最小连通覆盖集问题求解算法[J].软件学报2006(2)pp:175-184.
[47] M. Noto, H. Sato, A method for the shortest path search by extended Dijkstra algorithm, in: IEEEInternational Conference on Systems, Man, and Cybernetics, 2000, pp. 2316~2320.
[48]Stanislava Soro.cluster head election technique for coverage preservation in wireless sensor networks. [J] AD Hoc Networks.2009:pp:955-972
[49]K.Komathy.P.Narayanasamy.Trust-based evolutionary game model assisting AODV routing against selfishness. Journal of Network and Computer Applications. Journal of Network and Computer Applications.2008.31(4):pp446-471
[50] Felegyhazi M,Hubaux J P,Buttyan L.Nash equilibria of packet forwarding strategies in wireless Ad hoc networks[J].IEEE Transactions on Mobile Computing.2006.5(5):463-476
[51] Marti S,Giuli T,Lai K,Baker M.Mitigating routing misbehavior in mobile Ad hoe networks。Proceedings of the MobiCom.Boston.2000:255-265
[52] A.B. MacKenzie, L.A. DaSilva, Game Theory for Wireless Engineers (Synthesis Lectures on Communications), Morgan & Claypool Publishers, 2006.
[53] J. Byers, G. Nasser, Utility-based decision-making in wireless sensor networks, in: Proceedings of the First ACM International Symposium on Mobile ad hoc networking and Computing, Poster Session, 2000,pp. 143–144.
[54]NisanA.Algorithmic mechanism design. Games and Economic Behavior.2001,35(12):pp166—196.
[55] A. Agah, M. Asadi, S.K. Das, Prevention of DoS attacks in sensor networks using repeated game theory, in: Proceedings of the International Conference on Wireless Networks, 2006.
[56]Renita Machado,Sirin Tekinay.A survey of game-theoretic approaches in wireless sensor networks.Computer Networks 2008(52):3047–3061
[57] R. Vidal, O. Shakernia, H. Kim, D. Shim, S. Sastry, Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation, IEEE Transactions on Robotics and Automation 2002.18 (5):pp662–669.
[58]汪洋,林闯,李泉林等.基于非合作博弈的无线网络路由机制研究[J].计算机学报.2009.32(1):pp54-68
[59] Josang At Ismail R.A survey of trust and reputation systems for online service provision.Decision Support Systems.2007.43(2):pp618-644
[60]Juan J, R. Srikant.A game theory based reputation mechanism to incentivize cooperation in wireless ad hoc networks[J].Ad Hoc Networks 2010(8):pp416–429.
[61]Groves T.Incentives in teams.Econometrica.1973,41(4):617-631
[62]Agah A,Das SK,Basu K.A game theory based approach for security in wireless sensor networks.In:Proc.of the 23rd IEEE Computing and Communications Conf Phoenix ,2004:pp259-263.
[63]M.J.Osborne,A.Rubinstein,A Course in Game Theory[p], MIT Press,1994.
[64] Sami R.Distributed algorithmic mechanism design[Ph.D Thesis]New Haven,Connecticut:Yale University,2003.
[65]You-Chiun W,Chun Chi H,Efficient Deployment Algorithms for Ensuring Coverage andConnectivity of Wireless Sensor Networks[J].Ad Hoc Networks.2010(8):416-429