期刊文献+

无线传感器网络能效时延平衡数据收集机制 被引量:1

Energy efficiency and delay balancing data gathering for wireless sensor networks
下载PDF
导出
摘要 在追求无线传感器网络高能量效率的同时,考虑数据汇聚时延,提出了一种能效与时延平衡的数据收集机制(energy efficiency and delay balancing data gathering,EEDBDG).该机制采用一种新型动态树来组织网络拓扑,消除了"热区"问题,节点动态选择路由并轮换充当树根,根节点收集数据并与基站直接通信.同时,针对不同的时延和能效要求,提出了3种数据收集策略:时延最优算法(EEDBDG-D),能效最优算法(EEDBDG-E)和能效时延平衡算法(EEDBDG-M).仿真结果表明,在节点通信半径受限的情况下,EEDBDG平衡了节点能量消耗,延长了网络生命时间,在节能与省时上均表现出了突出的性能.与GSEN相比,在最好情况下,EEDBDG-E网络生命期提高了72%,EEDBDG-D汇聚时延降低了74%. Considering data gathering delay while seeking high energy efficiency in wireless sensor networks, an energy efficiency and delay balancing data gathering scheme (EEDBDG) was proposed. EEDBDG organized the topology based on a novel dynamic tree and avoided the hot spot problem. The nodes selected routing paths dynamically and took turns to act as the root of the tree. The root node gathered the data and communicated with the base station directly. In EEDBDG, three data gathering strategies were proposed for different requests for delay and energy efficiency. These were optimum delay algorithm (EEDBDCrD), optimum energy efficiency algorithm (EEDBDG-E) and a compromise algorithm (EEDBDG-M). In the case where the sensor node communication radius was restricted, simulation results show that EEDBDG equalizes the energy consumption of all the nodes, prolongs the network lifetime and achieves an outstanding performance in energy-saving and time-thrift. Compared with GSEN, in the best case, the network lifetime using EEDBDG-E is prolonged by 72% and the data gathering delay using EEDBDG-D is decreased by 74%.
出处 《中国科学技术大学学报》 CAS CSCD 北大核心 2008年第12期1414-1421,共8页 JUSTC
基金 国家自然科学基金项目(60872009,60602016) 国家重点基础研究发展(973)计划(2003CB314801) 国家高技术研究发展(863)计划(2007AA01Z428) 安徽省高校自然科学研究计划重大项目(ZD2008005-2) 华为基金(YJCB2007061WL)资助
关键词 无线传感器网络 能量效率 时延 动态树 数据收集 wireless sensor networks energy efficiency delay dynamic tree data gathering
  • 相关文献

参考文献8

  • 1Akyildiz I F, Su W, Sankarasubramaniam Y, et al. Wireless sensor networks:a survey [ J ]. Computer Networks, 2002, 38(4):393-422. 被引量:1
  • 2蔺智挺,屈玉贵,翟羽佳,赵保华.一种高效覆盖的节点放置算法[J].中国科学技术大学学报,2005,35(3):411-416. 被引量:13
  • 3Heinzelman W R, Chandrakasan A, Balakrishnan H. Energy-efficient communication protocol for wireless microsensor networks [C]//Proceedings of the 33rd Hawaii Annual International Conference on System Sciences. Hawaii: IEEE Computer Society, 2000, 8: 3 005-3 014. 被引量:1
  • 4Younis O, Fahmy S. HEED: a hybrid, energy- efficient, distributed clustering approach for ad hoc sensor networks[J]. IEEE Transactions on Mobile Computing, 2004, 3(4): 366-379. 被引量:1
  • 5Lindsey S, Raghavendra C. PEGASIS:power-efficient gathering in sensor information systems [C]// Proceedings of the IEEE Aerospace Conference. Montana: IEEE Aerospace and Electronic Systems Society, 2002, 3:3 125-3 130. 被引量:1
  • 6Tabassum N, Ahsanul Haque A K M, Urano Y. GSEN: an efficient energy consumption routing scheme for wireless sensor network[C]//International Conference on Networking International Conference on Systems and International Conference on Mobile Communications and Learning Technologies. IEEE Computer Society, 2006 : 117-122. 被引量:1
  • 7Hall D L, Llinas J. An introduction to multisensor data fusion[J]. Proceedings of the IEEE, 1997, 85(1): 6-23. 被引量:1
  • 8黄刘生,李虹,徐宏力,吴俊敏.无线传感器网络中基于负载平衡的多路路由[J].中国科学技术大学学报,2006,36(8):887-892. 被引量:10

二级参考文献19

  • 1蔺智挺,屈玉贵,翟羽佳,赵保华.一种高效覆盖的节点放置算法[J].中国科学技术大学学报,2005,35(3):411-416. 被引量:13
  • 2Santpal Singh Dhillon, Krishnendu Chakrabarty. Sensor placement for effective coverage and surveillance in distributed sensor networks [A]. Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE[C], 2003,3(3):1609 - 1614. 被引量:1
  • 3Adlakha Sachin, Srivastava Mani. Critical density thresholds for coverage in wireless sensor networks [A]. Wireless Communications and Networking, 2003. WCNC 2003.2003 IEEE[C].2003,3(3):1615-1620. 被引量:1
  • 4Nojeoing Heo, Pramod K. Varshney. A distributed self spreading algorithm for mobile wireless sensor networks[A]. Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE[C]. 2003, 3(3):1597 - 1602. 被引量:1
  • 5Seapahn Meguerdichian, Farinaz Koushanfar,Miodrag Potkonjak, et al. Coverage Problems in Wireless Ad-hoc Sensor Networks ACM 2003[C],2003. 被引量:1
  • 6HUANG Chi-Fu, Tseng Ytr-Chee. The coverage problem in a wireless sensor network[A]. Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications[C]. September, 2003 ACM: 115-121. 被引量:1
  • 7Heinzelman W R,Chandrakasan A,Balakrishnan H.Energy-efficient counication protocol for wireless microsensor networks[C]∥Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.Maui Hawaii:IEEE Press,2000,2:3 005-3 014. 被引量:1
  • 8Akyildiz I F,Su W,Sankarasubramaniam Y,et al.A survey on sensor networks[J].IEEE Counications Magazine,2002,40(8):102-114. 被引量:1
  • 9Al-Karaki J N,Kamal A E.Routing techniques in wireless sensor networks:a survey[J].IEEE Wireless Counications,2004,11(6):6-28. 被引量:1
  • 10Estrin D,Govindan R,Heidemann J,et al.Next century challenges:scalable coordination in sensor networks[C]∥A/IEEE International Conference on Mobile Computing and Networking,Seattle:APress,1999:263-270. 被引量:1

共引文献21

同被引文献17

  • 1徐红兵,祝颖.基于拓扑控制的异类无线传感器网络分簇算法研究[J].电子科技大学学报,2006,35(S1):674-677. 被引量:5
  • 2许力,林志伟.基于图着色的无线自组网极小连通支配集算法[J].通信学报,2007,28(3):108-114. 被引量:17
  • 3KIM D, WU Y, LI Y, et al. Constructing minimum connected domi- nating sets with bounded diameters in wireless networks[J]. IEEE Trans Parallel and Distributed Systems, 2009, 20(2): 147-157. 被引量:1
  • 4MISRA R, MANDAL C. Minimum connected dominating set using a collaborative cover heuristic for ad hoc sensor networks[J]. IEEE Transac- tions on Parallel and Distributed Systems, 2010, 21(3): 292-302. 被引量:1
  • 5THAI M T, WANG F. Connected dominating sets in wireless net- works with different transmission ranges[J]. IEEE Transactions on Mobile Computing, 2007, 6(7): 1-10. 被引量:1
  • 6WU W L, DU H W, JIA X H, et al. Minimum connected dominating sets and maximal independent sets in unit disk graphs[J]. Theoretical Computer Science, 2006, 352(1): 1-7. 被引量:1
  • 7SAMIR K, BALAJI R, NEAL E. Young balancing minimum spanning trees and shortest path treesIJ]. Algorithm, 1994, 120(4):305-321. 被引量:1
  • 8L1 Y S, THAI M T, WU F. On the construction of a strongly con- nected broadcast arborescence with bounded transmission delay[J]. IEEE Transactions on Mobile Computing, 2006, 5(10): 1460-1470. 被引量:1
  • 9LI Y, CHENG M X, DUD Z. Optimal topology control for balanced energy consumption in wireless networks[J]. Journal Parallel and Dis- tributed Computing, 2005, 65(2): 124-131. 被引量:1
  • 10WAN P J, KHALED M A, OPHIR F. Distributed construction of connected dominating sets in wireless ad hoc networks[J]. ACM/Kluwer Mobile Networks and Applications, 2004, 9(2): 141- 149. 被引量:1

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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