期刊文献+

ZigBee网络节点选择性优化广播算法 被引量:1

ZigBee Node Selective Optimizing Broadcast Algorithm
下载PDF
导出
摘要 针对ZigBee协议网络层广播算法产生广播暴和网络运行效率低的问题,根据ZigBee技术特点提出一种节点选择性优化广播算法。该算法利用部分节点的一跳和两跳邻居信息、节点接收信号强度信息、节点间父子关系等,将网络节点分成不同类型的工作节点,节点在进行广播时根据自身的工作类型处理广播帧。理论分析表明该算法能够完全覆盖网络。仿真结果表明,在相同条件下,与其他适用于ZigBee网络的广播算法相比,该算法的节点转播率低,节点平均开销小。节点选择性优化广播算法有助于提高ZigBee网络的运行效率,降低能耗,延长网络使用寿命。 Broadcast storm and the low efficiency of network operation are well known problems generated by ZigBee protocol. In this work, we demonstrate an optimised ZigBee node selective broadcast algorithm, which is based on the original ZigBee features. Using some node' s one-hop and two-hop neighbour information, the information of received signal strength and the parent-child relationship a- mong nodes, the improved algorithm classifies network nodes into different types. Therefore it helps the nodes to process broadcast frames according to their work type. Theoretical analysis has been provided to show that the algorithm can cover the whole network. Furthermore, simulation results prove that performance is improved significantly comparing to previous ZigBee network broadcast algo- rithm, and the node rebroadcast rate and node spending time are reduced. ZigBee node selective optimised broadcast algorithm devel- oped in this work shows great potential to improve the operation efficiency of the ZigBee network, reduce energy consumption and extend the network lifetime.
出处 《控制工程》 CSCD 北大核心 2014年第3期403-408,共6页 Control Engineering of China
基金 国家自然科学基金项目(60973022/F020202) 轧制技术及连轧自动化国家重点实验室(东北大学)开放课题(2011002)
关键词 ZIGBEE 优化 广播算法 邻居节点信息 ZigBee optimization broadcasting algorithm neighbor information
  • 相关文献

参考文献10

二级参考文献46

  • 1方震,赵湛,郭鹏,张玉国.基于RSSI测距分析[J].传感技术学报,2007,20(11):2526-2530. 被引量:265
  • 2Adi Shamir.无线电传播简介:专用术语,室内传播和路径损耗计算及实例[J].今日电子,2002(z1):26-30. 被引量:15
  • 3张洁颖,孙懋珩,王侠.基于RSSI和LQI的动态距离估计算法[J].电子测量技术,2007,30(2):142-145. 被引量:59
  • 4Tseng Yu Chee, Ni Sze Yao, Chen Yuh Shyan, et al. The broadcast storm problem in a mobile Ad hoe network [J]. Wireless Networks, 2002, 8(2): 153-167.
  • 5Nian Mei, Wang Neng. A Dynamic counter-based forwarding scheme for ODMRP [ C ] // WiCOM 2006- September. Wuhan: IEEE Press, 2006: 1-4.
  • 6Xu Jiuliang, Wang Hongyu. A conditioned broadcasting approach for on-demand Ad hoe routing protocols[ C]// PIMRC 2007-September. Athens: IEEE Press, 2007: 1-5.
  • 7Lee Sung Ju, M Gerla, Chiang Ching Chuan. On-demand multieast routing protocol [ C]// WCNC 1999- September. New Orleans: IEEE Press, 1999: 1298- 1302.
  • 8Rappaport Theodore S. Wireless communications: principles and practice[M]. New Jersey: Prentice Hall, 2001: 73-99.
  • 9Heissenbüel M,Braun T,W?lchli M,and Bernoulli T.Optimized stateless broadcasting in wireless multi-hop networks[C].Proc.IEEE INFOCOM2006,Barcelona,Spanish,April 23-29 2006:1-12.
  • 10Khan I A,Javaid A,and Qian H L.Distance-based dynamically adjusted probabilistic forwarding for wireless mobile Ad Hoc networks[C].IEEE and IFIP WOCN'08,Surabaya,Indonesia,May 5-7,2008:1-6.

共引文献209

同被引文献10

  • 1An Zeng,Cheng-Jun Zhang.Ranking spreaders by decomposing complex networks[J]. Physics Letters A . 2013 (14)
  • 2Bonan Hou,Yiping Yao,Dongsheng Liao.Identifying all-around nodes for spreading dynamics in complex networks[J]. Physica A: Statistical Mechanics and its Applications . 2012 (15)
  • 3Enrico Nardelli,Guido Proietti,Peter Widmayer.??Finding the most vital node of a shortest path(J)Theoretical Computer Science . 2002 (1)
  • 4Duanbing Chen,Linyuan Lu,Ming-Sheng Shang.Identifying influential nodes in complex networks. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS . 2012
  • 5Hu J,Wang B,Lee D Y.Evaluating node importance withmulti-criteria. IEEE/ACM International Conferenceson Cyber,Physical and Social Computing . 2010
  • 6Lin, Kao-Cheng,CHern, Maw-Sheng.Single most vital arc in the most economical path problem-a parametric analysis. Computers and Operations Research . 1994
  • 7Anne-Marie Kermarrec,Erwan Le Merrer,Bruno Sericola,Gilles Trédan.??Second order centrality: Distributed assessment of nodes criticity in complex networks(J)Computer Communications . 2010 (5)
  • 8Wu RZ,Hu XY,Tang LR.Node Importance Evaluation Based on Triangle Module for Optical Mesh Networks. Wireless Communications, Networking and Mobile Computing (WiCOM), 2011 7th International Conference on . 2011
  • 9Daijun Wei,Xinyang Deng,Xiaoge Zhang,Yong Deng,Sankaran Mahadevan.??Identifying influential nodes in weighted networks based on evidence theory(J)Physica A: Statistical Mechanics and its Applications . 2013 (10)
  • 10Enrico Nardelli,Guido Proietti,Peter Widmayer.??A faster computation of the most vital edge of a shortest path ☆ ☆ Work supported by the EU TMR Grant CHOROCHRONOS and by grant “Combinatorics and Geometry” of the Swiss National Science Foundation.(J)Information Processing Letters . 2001 (2)

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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