期刊文献+

能量均衡的无线传感器网络分簇方法 被引量:9

Energy-balanced clustering method in wireless sensor networks
下载PDF
导出
摘要 在对节点通信模式和簇群划分过程分析的基础上,提出一种在节点分布不均匀的条件下,构建能量均衡簇群的方法。该算法兼顾了簇群成员节点与簇头通信的能量消耗和簇群能耗负载,实现各簇群间能耗的平衡。仿真表明,该方法在网络生命期、节点平均生命期和网络扩展性方面比基于最短距离的分簇算法具有更好的性能。 Based on investigating the communication model of nodes in clusters and load control of clusters, this paper proposed an energy-balanced clustering algorithm, which implemented energy drainage distributed uniformly in network. Simulations show that the method has better performance in lifetime of network contrasting with the shortest distance clustering.
出处 《计算机应用研究》 CSCD 北大核心 2008年第3期878-880,共3页 Application Research of Computers
关键词 无线传感器网络 簇群划分 能量均衡 wireless sensor network( WSN) clustering energy-balanced
  • 相关文献

参考文献8

  • 1AKYILDIZ I F, SU W, SANKARASUBRAMANIAM Y, et al. Wireless sensor networks: a survey [ J]. Computer Networks, 2002,38 (4) :393-422.
  • 2YOUNIS S, FAHMY S. Distributed clustering in Ad hoc sensor net-works : a hybrid, energy-efficient approach [ C ]//Proc of IEEE INFOCOM. Hong Kong: [ s. n. ] , 2004.
  • 3HEINZELMAN W, CHANDRAKASAN A, BALAKRISHNAN H. An application-specific protocol architecture for wireless microsensor net-works [J]. IEEE Trans Wireless Comm, 2002, 1 (4) :660-670.
  • 4BLOUGH D M, SANTI P. Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary Ad hoc networks[ C]//Proc of ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM). 2002.
  • 5AMIS D, PRAKASH R, VUONG T H P, et al. Max-min d-cIuster formation in wireless Ad hoc networks [ C ]//Proc of IEEE INFOCOM. 2000.
  • 6BHARDWAJ M, GARNETT T, CHANDRAKASAN A P. Upper bounds on lifetime of sensor networks [ C]//Proc of IEEE International Conference on Communications ( ICC' 01 ). Helsinki: [ s. n. ] , 2001.
  • 7NICULESCU D, NATH B. Ad hoc positioning system (APS) using AoA [C]//Proc of IEEE INFOCOM. San Francisco : [ s. n. ], 2003.
  • 8汤波,周明天.无线传感器网络节点命名算法的研究[J].华中科技大学学报(自然科学版),2005,33(z1):54-56. 被引量:3

二级参考文献7

  • 1[1]Estrin D,Govindan R,Heidemann J.Next century challenges:scalable coordination in sensor network[A].Proceedings of the 5th ACM/IEEE International Conference on Mobile Computing and Networking [C].Seattle:IEEE Computer Society,1999.263-270
  • 2[2]Akyildiz I F,Su W,Sankarasubramaniam Y,et al.Wireless sensor network:a survey[J].Computer Network,2002,38(4):393-422
  • 3[3]Bulusu N,Heidemann J,Estrin D.Adaptive beacon placement[A].Proceedings of the Twenty First International Conference on Distributed Computing Systems (ICDCS-21) [C].Phoenix,2001.
  • 4[4]Klamkin M.Extensions of the birthday surprise[J].Journal of Combin Theory,1967,3:279-282
  • 5[5]Flajolet P,Gardy D,Thimonier L.Birthday paradox,coupon collectors,caching algorithms and self-organizing search [J].Discrete App Math,1992,39 (3):207-229
  • 6[6]Doherty L.Algorithms for position and data recovery in wireless sensor networks[D].Berkeley:Department of Electronic Engineering and Computer Science,University of California,2000.
  • 7[7]Stallings W.Cryptography and network security:principles and practice[M].2nd Edition.Indiana:Prentice-Hall Inc,2001.

共引文献2

同被引文献75

引证文献9

二级引证文献74

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部