期刊文献+

可分负载WSN的能耗最小负载调度研究 被引量:1

Research on minimizing energy consumption schedule for divisible load WSN
下载PDF
导出
摘要 减少无线传感器网络的能耗、延长网络生存周期已成为研究的热点之一。针对星型可分负载无线传感器网络的能耗最小问题,以典型可分负载调度为基础,提出了朴素的顺序调度算法(SSSA)及能耗与时间权衡调度算法(ETTS)。从理论与仿真角度分别证明了SSSA算法是在最短时间要求下的能耗最小负载调度算法,并通过仿真实验验证了两种算法对减少网络能耗、延长网络生存周期的有效性。实验表明:当网络拓扑对存活节点个数依赖较高时,应采用SSSA调度算法;当网络关心初始几轮负载处理能耗时,应采用ETTS算法。此外,随给定时间的增加,ETTS算法的能耗进一步减少。 To minimize energy consumption and prolong network lifetime in wireless sensor network (WSN) has become a hot research topic. For this purpose,we design a simple sequential schedule algo- rithm (SSSA) and an energy-time tradeoff schedule algorithm (ETTS) based on the classic divisible load scheduling algorithm in WSN. The SSSA is the minimum energy consumption algorithm among the clas- sic divisible load schedules proved by theory and experiment respectively under the constraint of minimal time. The experimental results show that the two schedule algorithms can reduce the network energy consumption and prolong the network life cycle effectively. And the SSSA should be used when the num- ber of surviving nodes is highly important to the network topology,otherwise the ETTS should be used when the energy of the initial rounds is especially concerned. Furthermore,the ETTS can reduce the en- ergy consumption further with the increase of the given time.
出处 《计算机工程与科学》 CSCD 北大核心 2015年第5期920-924,共5页 Computer Engineering & Science
基金 浙江省自然科学基金资助项目(LY14F020018)
关键词 无线传感器网络 可分负载 负载调度 星型网络 顺序传输 能耗最小 wireless sensor network divisible load load schedule star topology sequential transmis-sion minimum energy consumption
  • 相关文献

参考文献4

二级参考文献31

  • 1KWANGIL K, ROBERTAZZI T G. Signature search time evaluation in flat file databases [J]. IEEE Trans on Aerospace and Electronic Systems, 2008, 44 (2) : 493-502.
  • 2HUNG T G, ROBERTAZZI T G. Scheduling nonlinear computational loads [J]. IEEE Trans on Aerospace and Electronic Systems, 2008, 44 (3): 1169- 1182.
  • 3BHARADWAJ V, GHOSE D, MAN V. Multiinstallment load distribution in tree networks with delays[J]. IEEE Trans on Aerospace and Electronic Systems, 1995, 31(2).- 555-567.
  • 4BHARADWAJ V, GHOSE D, MAN V, et al. Scheduling divisible loads in parallel and distributed systems [M]. Los Alemitos, USA: IEEE Computer Society, 1996.
  • 5HAGERUP T. Allocating independent tasks to parallel processors: an experimental study [J]. Journal of Parallel and Distributed Computing, 1996, 11 ( 17 ):1-33.
  • 6BEAUMONT O, LEGRAND A, ROBERT Y. Scheduling divisible workloads on heterogeneous platforms [J]. Parallel Computing, 2003, 29(9):1121-1152.
  • 7YANG Y, RAADT K, CASANOVA H. Multiround algorithms for scheduling divisible loads [J]. IEEE Trans on Parallel and Distributed Systems, 2005, 16 (11): 1092-1102.
  • 8BHARADWAJ V,GHOSE D,ROBERTAZZI T G.Divisible load theory:a new paradigm for load scheduling in distributed systems[J].Cluster Computing,2003,6(1):7-18.
  • 9MOGES M,ROBERTAZZI T G.Wireless sensor networks:scheduling for measurement and data reporting[J].IEEE Transactions on Aerospace and Electronic Systems,2006,42(1):327-340.
  • 10LIU Haoying,YUAN Xiaojing,MOGES M.An efficient task scheduling method for improved network delay in distributed sensor networks[C] //Proceedings of Trident Com 2007.Piscataway,NJ,USA:IEEE,2007.1-8.

共引文献10

同被引文献4

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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