期刊文献+

基于分离树的能量有效数据转发机制

下载PDF
导出
摘要 在无线传感网中,由于传感器节点能量极度受限,而传统的广播通信方式会产生很大的数据冗余,因而造成能量利用率较低。文章通过建立以汇聚节点为根节点的分离树来解决以上问题,m颗分离树均匀覆盖整个网络并交替进行工作,不工作时则进入休眠状态以节省能量。在数据转发阶段,分离树中的节点有方向性地将数据转发到汇聚节点,有效避免环路和回传,从而大幅度降低了冗余数据的转发。
作者 吴晨
机构地区 重庆邮电大学
出处 《广东通信技术》 2016年第3期64-67,共4页 Guangdong Communication Technology
基金 国家物联网专项(工信部科函[2014]351号)
  • 相关文献

参考文献8

  • 1Yu J, Wang N, Wang G, et al. Connected dominating sets n wireless ad hoc and sensor networks-A comprehensive survey[J]. Computer Communications, 2013, 36(2): 121-134.
  • 2Pantazis N, Nikolidakis S A, Vergados D D. Energy-efficient routing protocols in wireless sensor networks: A survey[J] Communications Surveys & Tutorials, IEEE, 2013, 15(2) 551-591.
  • 3Kuila P, Jana P K. Energy efficient clustering and routing algorithms for wireless sensor networks: Particle swarm op- timization approach[J]. Engineering Applications of Artificial Intelligence, 2014, 33:127-140.
  • 4Tseng Y C, Ni S Y, Chen Y S, et al, The broadcast storm problem in a mobile ad hoc network[J]. Wireless networks, 2002, 8(2-3): 153-167.
  • 5Hanashi A M, Siddique A, Awan I, et al. Performance evalu- ation of dynamic probabilistic broadcasting for flooding in mobile ad hoc networks[J]. Simulation Modelling Practice and Theory, 2009, 17(2): 364-375.
  • 6Yassein M B, Nimer S F, AI-Dubai A Y. A new dynamic counter-based broadcasting scheme for Mobile Ad hoc Networks[J]. Simulation Modelling Practice and Theory 2011, 19(1): 553-563.
  • 7凌飞,吴振华.能量均衡的最小连通支配集分布式算法[J].传感技术学报,2012,25(9):1316-1321. 被引量:15
  • 8Liu X. A survey on clustering routing protocols in wireless sensor networks[J]. Sensors, 2012, 12(8): 11113-11153.

二级参考文献13

  • 1阎新芳,孙雨耕,胡华东.基于极大权的最小连通支配集启发式算法[J].电子学报,2004,32(11):1774-1777. 被引量:24
  • 2张静,孙雨耕,房朝晖.能量有效的最小连通支配集近似算法[J].传感技术学报,2004,17(4):603-606. 被引量:7
  • 3Kassaei H, Mehrandish M, Narayanan L, et al. Efficient Algorithms for Connected Dominating Sets in Ad Hoe Networks[ C ]//Proceed- ings of Proceedings 2010 IEEE Wireless Communications and Net-working Conference( WCNC). 2010. Sydney Australia IEEE. 1-6.
  • 4Kim D,Zhang Z, Li X Y,et al. A Belter Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs[ J ]. IEEE Transactions on Mobile Computing, 2010,9 ( 8 ) : 1108 - 1118.
  • 5Yin B, Shi H,Shang Y.An Effcient Algorithm for Constructing a Connected Dominating Set in Mobile Ad Hoc Networks[J].Journal of Parallel and Distributed Computing,2011,71(1):27-39.
  • 6Zou F, Wang Y,Xu X H,et al. New Approximations for Minimmn- Weighled Dominating Sets and Minimum-Weighted Connecled Dominating Sets on Unit Disk Science ,2011,412(3 ) : 198-208.
  • 7Guha S, Khuller S. Approximation Algorilhms for Connected Dominating Sets[ J ]. Algorithmica, 1998,20(4 ) :374-387.
  • 8高文宇.无线传感器网络巾的连通支配集求解算法[J].徽计算机信息(测控自动化),2010,26(1):47-49.
  • 9Wu J. Extended Dominating-Set-Based Routing in Ad Hoe Wireless Networks with Unidirectional Links [ J ]. IEEE Trans. on Paralle! and Distributed Systems, 2002,13 ( 9 ) : 866-881.
  • 10Alzoubi K M ,Wan P J ,Freider O. Distributed Heuristics for Connected Dominating Set in Wireless Ad Hoc Networks [ J ]. 1EEE ConCert/ KICS Journal on Communication Networks ,2002,4( 1 ) :22-29.

共引文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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