检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王毅[1] 张德运[1] 马新新[1] 梁涛涛[1]
机构地区:[1]西安交通大学电子与信息工程学院,西安710049
出 处:《吉林大学学报(工学版)》2008年第4期880-885,共6页Journal of Jilin University:Engineering and Technology Edition
基 金:'863'国家高技术研究发展计划项目(2003AA1Z2610)
摘 要:提出了一种新的传感器节点动态功耗管理方法。首先理论推导了节点在各个休眠状态的休眠阈值,建立了网络监测事件到达模型,采用Possion分布得到了网络事件发生的到达概率,利用无线传感器网络中存在大量冗余节点导致节点多重覆盖的特性,分析了传感器节点进入或脱离各休眠状态须满足的条件及保持各状态的最小时长等问题。最后,根据实际应用归纳了传感器节点的三种唤醒策略。实验结果表明,该方法在满足网络性能约束的前提下,利用无线传感器网络的冗余覆盖的特点,可动态调整节点的休眠深度,可减少约28%的传感器节点能量开销,37%的动态功耗管理切换时延,提高约52%的切换成功率,从而有效地延长节点工作寿命及传感器网络寿命。A novel dynamic power management (DPM) algorithm is proposed for the sensor node of wireless sensor networks (WSNs), in which the sleeping threshold of each node in sleeping status is deduced theoretically and the probability of event arrival is investigated using Possion distribution on the basis of the event arrival processing model. Furthermore, on the premise of no effect on performance of WSNs, the M-duplicate-covered concept is introduced to abstract the cover redundancy in WSNs, and the characteristics of each sleep state of sensor node are analyzed. Based on these researches, the conditions of entering or escaping a state and the time interval of keeping the state are analyzed. Finally, we propose three asynchronous awakening schemes so that each node is free to power on or off its components based on the statistics. The simulation results show that the DPM algorithm can dynamically regulate the sleep depth of nodes while satisfying the network performances, reduce about 28% of the energy consumption and about 37% switching latency of DPM, and increase about 52% of the success ratio of switching, thereby the sensor node's lifetime as well as the WSNs' lifetime is effectively improved.
关 键 词:计算机系统结构 传感器节点 动态功耗管理 网络寿命
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.200