检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]上海理工大学光电信息与计算机工程学院,上海200093
出 处:《计算机应用与软件》2012年第12期265-267,279,共4页Computer Applications and Software
摘 要:LEACH(低功耗自适应集簇分层协议)是无线传感器网络中常用的分簇路由算法。在LEACH算法的基础上,提出一种基于节点剩余能量和区域中心化的算法(LEACH-REC)。该算法从两个方面进行改进,在回合的建立阶段,根据节点的剩余能量和位置选择簇首;在数据传输阶段,将簇首分成不同的区域,某个区域的簇首节点根据weight(i,j)的值选择下一跳,直到数据传输到sink节点。模拟实验表明,对比LEACH和LEACH-ED,该算法(LEACH-REC)传感器网络的生命周期分别延长了600和400回合左右,网络的服务质量有明显的提高。LEACH ( Low Energy Adaptive Clustering Hierarchy) is a popular clustering routing algorithm in WSN. This paper proposes a new algorithm of LEACH based on residual energy and region centralisation, LEACH-REC. This algorithm makes the improvements from two aspects. In the phase of round setup, the cluster head is selected according to node' s residual energy and location; In the phase of data transmission, the cluster heads will be divided into different regions. A cluster head in certain related region selects next hop based on the function value weight (i ,j ), until the data has been transmitted to sink node. Simulation experiment shows that compared with LEACH and LEACH- ED, in algorithm LEACH-REC the life cycle of wireless sensor network extends about 600 and 400 rounds respectively, and the services quality of the network improves remarkably.
关 键 词:LEACH LEACH—REC生命周期 簇首节点 能量消耗
分 类 号:TP393.04[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49