检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]杭州电子科技大学通信工程学院,杭州310018
出 处:《传感技术学报》2012年第7期993-998,共6页Chinese Journal of Sensors and Actuators
摘 要:针对无线传感器网络探测网络环境的自适应休眠算法(Probing Environment and Adaptive Sleeping,PEAS)在节点调度过程中,存在节点能耗不均衡、网络的生命周期较短的问题,提出一种基于加权的优化覆盖算法。该算法对最小频繁项的目标所对应的传感节点按能量高低进行划分集合,使各集合能够独立覆盖最小频繁项的目标,以达到局部的优化。考虑到传感节点覆盖目标数和剩余能量对无线传感网络生存周期的影响,对边缘未覆盖的目标节点采用加权的方式进行覆盖。仿真结果表明:该算法能够均衡网络节点的能耗,有效地延长了网络的生命周期。We propose an optimized coverage algorithm based on weighting,which is aimed at the problems of the unbalanced energy consumption of nodes and the shorter life cycle.These problems are derived from node scheduling process of the PEAS(Probing Environment and Adaptive Sleeping)algorithm in wireless sensor network.In this algorithm,the nodes corresponding to the minimum frequent items are divided into sets according to different energy levels,these sets will cover the minimum frequent items independently in order to achieve suboptimization.Then,Considering the influence of covered number of sensor nodes and surplus energy to the life cycle of wireless sensor network,we cover the uncovered edge nodes in the weighting way.Simulation result shows that new algorithm could balance the energy consumption of network node and prolong the life cycle of the network effectively.
关 键 词:无线传感器网络 集合 最小频繁项 加权 PEAS算法
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.195