全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
电子学报  2013 

基于融合的无线传感器网络k-集覆盖的分布式算法

DOI: 10.3969/j.issn.0372-2112.2013.04.006, PP. 659-665

Keywords: 无线传感器网络,覆盖优化,融合感知,博弈论,分布式计算

Full-Text   Cite this paper   Add to My Lib

Abstract:

当节点采用概率感知模型且融合多个节点的数据进行联合感知的情况下,提出了一个新的无线传感器网络的覆盖优化问题:基于融合的k-集覆盖优化问题.首先,将优化问题建模为融合覆盖博弈,证明该博弈是势博弈,且势函数与优化目标函数一致,因此,最优解是一个纯策略Nash均衡解.其次,给出了节点间融合覆盖效用独立的判定条件,进而分别提出同步、异步控制的、基于局部信息的、分布式的覆盖优化算法,证明了算法收敛到纯策略Nash均衡.最后,仿真实验结果表明,当算法收敛时,网络能达到高的覆盖率且具有好的覆盖稳定性.

References

[1]  任丰原,黄海宁,林闯.无线传感器网络[J].软件学报,2003,14(7):1282-1290. REN Feng-yuan,HUANG Hai-ning,LIN Chuang..Wireless sensor networks[J].Journal of Software,2003,14(7):1282-1290.(in Chinese)
[2]  S Slijepcevic,M Potkonjak.Power efficient organization of wireless sensor networ ks[A].Proceedings of the IEEE International Conference on Communications [C] .Helsinki:IEEE Computer Society Press,2001.472-476.
[3]  Nadeem Ahmed,Salil S Kanhere,Sanjay Jha.Probabilistic coverage in wireless senso r networks[A].Proceedings of 30th Annual IEEE Conference on Local Computer Net works[C].Sydney:IEEE Computer Society Press,2005.672-681.
[4]  孟凡治,王换招,何晖.基于联合感知模型的无线传感器网络连通性覆盖协议[J].电子学报, 2011,39 (4):772-779. MENG Fan-zhi,WANG Huan-zhao,HE Hui.Connected coverage protocol using cooperati ve sensing model for wireless sensor networks[J].Acta Electronica Sinica,2011, 39(4):772-779.(in Chinese)
[5]  Guoliang Xing,Rui Tan,Benyuan Liu,Jianping Wang,Xiaohua Jia,Chih-Wei Yi.Data fu sion improves the coverage of wireless sensor networks[A].Proceedings of the 1 5th Annual International Conference on Mobile Computing and Networking [C].Bei jing:ACM Press,2009.157-168.
[6]  D Monderer,L Shapley.Potential games[J].Games and Economic Behavior,1996,14:12 4-143.
[7]  Jason R Marden,Gürdal Arslan,Jeff S Shamma.Cooperative control and potential ga mes[J].IEEE Transactions on Systems,Man and Cybernetics,2009,39(6):1393-1407.
[8]  Bang Wang.Coverage Control in Sensor Networks[M].London:Springer-Verlag,2010.
[9]  凡高娟,王汝传,黄海平,等.基于容忍覆盖区域的无线传感器网络节点调度算法[J].电子学 报,2011,39(1):89-94. FAN Gao-juan,WANG Ru-chuan,HUANG Hai-ping,et al.Tolerable coverage area based node scheduling algorithm in wireless sensor networks[J].Acta Electronica Sin ica,2011,39(1):89-94.(in Chinese)
[10]  Zo?Abrams,Ashish Goel,Serge A Plotkin.Set k-cover algorithms for energy effic ient monitoring in wireless sensor networks[A].Proceedings of the Third Intern ational Symposium on Information Processing in Sensor Networks[C].California:A CM Press,2004.424-432.
[11]  Amol Deshpande,Samir Khuller,Azarakhsh Malekian,Mohammed Toossi.Energy efficient monitoring in sensor networks[J].Algorithmica,2011,59(1):94-114.
[12]  Xin Ai,Vikram Srinivasan,Chen-Khong Tham.Optimality and complexity of pure Nash equilibria in the coverage game[J].IEEE Journal on Selected Areas in Communic ations ,2008,26(7):1170-1182.
[13]  Mohamed Hefeeda,Hossein Ahmadi.A probabilistic coverage protocol for wireless se nsor networks[A].Proceedings of the IEEE International Conference on Network P rotocols[C].Beijing:IEEE Computer Society Press,2007.41-50.
[14]  何欣,桂小林.基于概率感知覆盖的无线传感器网络节点优化部署方案[J].通信学报,2010, (9A):1-8. HE Xin,GUI Xiao-lin.Probabilistic disc model based optimal node deployment sche me to target coverage in wireless sensor networks[J].Journal on Communications ,2010,(9A):1-8.(in Chinese)
[15]  Wei Wang,Vikram Srinivasan,Kee Chaing Chua,Bang Wang.Energy-efficient coverage for target detection in wireless sensor networks[A].Proceedings of the 6th Int ernational Conference on Information Processing in Sensor Networks [C].Massach usetts ,USA:ACM Press 2007.313-322.
[16]  Satoru Fujishige.Submodular Functions and Optimization (Second Edition)[M].Ams terdam:Elsevier,2005.
[17]  Fudenberg D,J Tirole.Game Theory[M].Cambridge,MA:MIT Press,1991.
[18]  Renita Machado,Sirin Tekinay.A survey of game-theoretic approaches in wireless sensor networks[J].Computer Networks,2008,52(16):3047-3061.
[19]  Ozan Candogan,Ishai Menache,Asuman E Ozdaglar,Pablo A Parrilo.Near-optimal powe r control in wireless networks:A potential game approach[A].Proceedings of the 29th IEEE International Conference on Computer Communications (INFOCOM)[C].Sa n Diego,CA,USA:IEEE Computer Society Press,2010.1954-1962.
[20]  Alex Fabrikant,Christos H Papadimitriou,Kunal Talwar.The complexity of pure Nash equilibria[A].Proceedings of the 36th Annual ACM Symposium on Theory of Compu ting[C].Chicago,USA:ACM Press,2004.604-612.
[21]  Christos H Papadimitriou.How easy is local search[J].Journal of Computer and S ystem Sciences,1988,37(2):79-100.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133