共查询到20条相似文献,搜索用时 61 毫秒
1.
在分析无线传感器网络节能要求的基础上对无线传感器网络路由协议中使用的休眠调度算法进行了讨论,内容包括各种休眠调度算法的基本实现方法、考虑因素以及涉及到的关键技术.最后指明休眠调度对传感器网络节能的重要性. 相似文献
2.
3.
4.
5.
带休眠算法的无线传感器网络MAC协议 总被引:1,自引:0,他引:1
由于无线传感器网络中每个传感器节点的能量有限,所以需要有效的MAC协议来保持能量的高效利用。在MAC协议中引入休眠算法是其中一种重要的节能方式。现有的带休眠算法的无线传感器网络MAC协议已有很多种,主要分为2大类:一类是以S-MAC协议为代表的基于休眠/监听排程方案来达到节能目的的MAC协议;另一类是以WiseMAC为代表的基于低功率信道检测方案的MAC协议。对现有的主要几种有代表性的带休眠算法的无线传感器网络MAC协议进行了描述,分析了它们各自的优缺点,并进行了对比和总结。 相似文献
6.
针对无线传感器网络中节点能量有限等特点,提高能量利用效率和延长网络寿命是无线传感器网络设计的目标。由于终端节点只负责数据采集,不需要转发其它节点的数据,因此可以减少终端节点的空闲侦听时间,从而进入休眠状态。仿真结果验证了所提方案的能量消耗低于传统非休眠方案的能量消耗,该休眠算法能有效延长网络的生存时间。 相似文献
7.
无线传感器网络中最小化能量广播算法 总被引:4,自引:0,他引:4
在无线传感器网络广播中,为保证所有节点都接收到广播的数据包并调节节点功率以最小化广播总能耗,在Cartigny等人提出的面向相对邻图的广播算法RBOP(relative neighborhood graph broadcast oriented protocol)的基础上,提出了更为节能的增强的面向相对邻图的广播算法ERBOP(enhanced relative neighborhood graph broadcast oriented protocol)。首先在相对邻图上删除较长边得到相对邻图的子图,该子图是连通稀疏图且包含了原图的最小生成树,然后在该子图上构造1-支配的连通支配集,只有支配点才参与数据包转发。仿真显示ERBOP有效节约了能量。 相似文献
8.
传感器网络虚拟骨干构造算法及时钟同步应用 总被引:1,自引:3,他引:1
通过构造虚拟骨干可以大幅度降低无线传感器网络的广播开销和路由协议的复杂度。本文基于连通支配集.提出了一种虚拟骨干分布式构造算法,其最终尺寸、构造过程中的计算复杂度都优于现有算法。并结合虚拟骨干对Su Ping等学者提出的DMTS时钟同步算法进行了改进,降低其同步通信开销60%左右。 相似文献
9.
提出了基于有界增长图的虚拟骨干近似形成算法(VBF).算法采用网络划分机制构建极大独立集,使用染色过程形成簇图;以2分离集合子集递归计算(1 ε)近似局部最小支配集,合并局部最优解构造全局最优解:然后调整簇头传输范围直接以全局最优解形成最小近似连通支配集,无须加入网关节点,降低计算开销.构造的连通支配集具有常量扩展因子和常量度,并且算法运行时节点仅需直接邻域信息.理论分析和仿真比较证明了算法的正确性和有效性. 相似文献
10.
实时性要求是无线传感器网络调度算法性能评价的重要内容。对于实时性要求很高的应用场合,调度算法的首要标准是降低数据包的传输时延。针对无线传感器网络的业务流调度问题,结合传统的加权循环调度算法WRR,着眼于解决无线传感器网络中业务流突发引起的时延性能下降问题,提出了新的调度算法-WSWRR。新算法合理分配传感器节点的数据感知和传输时间,使节点在不需要工作时转入低功耗的休眠模式,且能在满足应用要求服务质量的前提下,高效利用节点能量,延长整个传感器网络的生命周期。通过仿真实验,验证了新算法在调度突发数据包时性能得到了很好的改善,且没有增加网络的整体能耗,证明了WSWRR算法的有效性。 相似文献
11.
Lightweight Deployment-Aware Scheduling for Wireless Sensor Networks 总被引:14,自引:0,他引:14
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major
challenges in constructing such networks is to maintain long network lifetime as well as sufficient sensing areas. To achieve
this goal, a broadly-used method is to turn off redundant sensors. In this paper, the problem of estimating redundant sensing
areas among neighbouring wireless sensors is analysed. We present simple methods to estimate the degree of redundancy without
the knowledge of location or directional information. We also provide tight upper and lower bounds on the probability of complete
redundancy and on the average partial redundancy. With random sensor deployment, our analysis shows that partial redundancy
is more realistic for real applications, as complete redundancy is expensive, requiring up to 11 neighbouring sensors to provide
a 90 percent chance of complete redundancy. Based on the analysis, we propose a scalable Lightweight Deployment-Aware Scheduling
(LDAS) algorithm, which turns off redundant sensors without using accurate location information. Simulation study demonstrates
that the LDAS algorithm can reduce network energy consumption and provide desired QoS requirement effectively.
This research was partially supported by Natural Sciences and Engineering Research Council of Canada.
Kui Wu received his Ph.D. in Computing Science from the University of Alberta, Canada, in 2002. He joined the Department of Computer
Science at the University of Victoria, Canada in the same year and is currently an Assistant Professor there. His research
interests include mobile and wireless networks, network performance evaluation, and network security.
Yong Gao received his Master's degree and Ph.D. degree in computer science from University of Alberta, Canada, in 2000 and 2005 respectively.
He is currently with the Irving K. Barber School of Arts and Sciences, UBC Okanagan, Canada. His research interests include
search algorithms and AI, communication networks, and computational biology.
Yang Xiao worked at Micro Linear as an MAC (Medium Access Control) architect involving the IEEE 802.11 standard enhancement work before
he joined Department of Computer Science at The University of Memphis in 2002. Dr. Xiao is an IEEE Senior member. He was a
voting member of IEEE 802.11 Working Group from 2001 to 2004. He currently serves as Editor-in-Chief for International Journal
of Security and Networks (IJSN) and for International Journal of Sensor Networks (IJSNet). He serves as an associate editor
or on editorial boards for the following refereed journals: (Wiley) International Journal of Communication Systems, (Wiley)
Wireless Communications and Mobile Computing (WCMC), EURASIP Journal on Wireless Communications and Networking, and International
Journal of Wireless and Mobile Computing. He serves as five lead/sole guest editor for five journal special issues. He serves
as a referee/reviewer for many funding agencies, as well as a panelist for NSF. His research interests are Security/ Reliable
Communications, Medium Access Control, Mobility/Location/Paging Managements, Cache Access and Replacement Policies, Quality
of Service, Energy Efficiency, and Routing in wireless networks and mobile computing. 相似文献
12.
13.
14.
构建底层逻辑树能有效降低集中式top-k查询带来的巨大通信开销,针对现有逻辑树都以固定汇聚节点为根节点,导致其附近节点能耗太大、过早死亡的问题,本文在无固定汇聚节点的网络背景下,基于连通支配集,提出一种能耗均衡的top-k查询最优支撑树构建方法,综合节点能量、度数以及与邻节点通信开销,选取能量代价小的作为支配节点负责查询中间数据处理,在每次查询中,节点基于地理位置ID轮流作为根节点,有效均衡节点的能耗.仿真实验表明,与其他逻辑拓扑树相比,基于最优支撑树的top-k查询具有相近的查询时间,但其平均每轮查询能耗更小,多次查询后各节点能耗达到均衡,有效延长了网络生命周期. 相似文献
15.
16.
17.
无线传感器网络中一种能量均衡的基于连通支配集的数据收集算法 总被引:1,自引:0,他引:1
采用连通支配集来构建虚拟骨干可以减轻无线传感器网络的广播风暴问题.目前已有大量工作通过构造最小连通支配集形成网络虚拟骨干来进行高效数据收集.然而,最小连通支配集并不能有效均衡节点的能量耗费,导致网络生命周期较短.提出了一种能量均衡的基于连通支配集的分布式算法EBCDS来进行数据收集,通过选择能量水平和度均比较大的节点组成连通支配集,支配集中的节点组成一个规模不大但具有较高能量水平的网络骨干.网络中的所有数据沿骨干在较小的寻路空间中转发,能够节省节点能量,使骨干节点不会因为能量不足而过早死亡.理论分析表明,EBCDS能以O(nlogn)的消息复杂度构造连通支配集,仿真实验表明,EBCDS能有效节省节点能耗并延长网络生命周期. 相似文献
18.
19.
20.
无线传感器网络是资源受限网络,研究其动态调度与功率控制对于提高网络性能具有重要意义.基于此,提出了一种无线传感器网络中混合式动态调度与功率控制方法.该方法采用集中式时隙调度与分布式功率控制相结合的思想,避免了介质访问控制(MAC)层传输冲突,并支持各传感器节点综合利用各自的队列状态信息和无线信道信息进行跨层优化传输.该... 相似文献