检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安航空学院机械工程系,西安710077 [2]西安理工大学自动化与信息工程学院,西安710048
出 处:《计算机应用》2012年第10期2700-2703,共4页journal of Computer Applications
摘 要:低功耗自适应分簇(LEACH)协议随机循环地选择群首节点将网络能耗平均分配到每个传感器节点中,但并没有考虑每个节点的剩余能量。为了避免能量较少节点因为当选为群首较快消耗能量而过早死亡,提出了一种LEACH-New节能算法,根据能量概率选取剩余能量较多的节点作为群首并确定最佳群首个数,群首收集数据并融合后采用单跳和多跳相结合的方式将数据转发给基站。这样解决了LEACH协议能量较少节点当选为群首和群首负载过重的问题,从而延长网络生存时间。仿真结果表明,改进后算法有效地减少了网络能量消耗,保证了网络负载的平衡。Lower Energy Adaptive Clustering Hierarchy (LEACH) protocol randomly and circularly selects the cluster- head node and evenly distributes network energy consumption to each sensor node, but it does not consider the remaining energy of each node. In order to avoid premature death of the less energy node that was selected as the cluster-head node, an advanced algorithm named LEACH-New was proposed, which was based on the energy probability to select those nodes with more energy as cluster-head and to determine the optimal number of the cluster-head nodes. The cluster-head node collected, fused, then sent the data to the base station by the combined mode of single-hop and muhi-hop. This algorithm resolved the problem that less energy node was selected to be cluster-head and cluster-bead's energy overloaded in LEACH protocol, so it can prolong the lifetime of whole network. The simulation results show that the improved algorithm effectively reduces the network energy consumption and ensure network load balance.
关 键 词:无线传感器网络 低功耗自适应分簇协议 生命周期 随机数 最佳群首个数
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28