检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]河南大学计算机与信息工程学院,河南开封475001
出 处:《郑州轻工业学院学报(自然科学版)》2009年第6期70-74,共5页Journal of Zhengzhou University of Light Industry:Natural Science
基 金:国家863计划项目(2007AA01Z478);河南省自然科学基金项目(0611054700)
摘 要:基于对LEACH,EEUC分簇协议的研究,提出一种基于非均匀分簇的传感器网络低能耗路由协议EERPUC.EERPUC协议选择簇首时综合考虑节点剩余能量和节点相对位置,使剩余能量大的节点成为簇首的可能性大,并使选出的簇首更接近于簇的质心位置.簇间采用多跳路由传输数据,路由构建时不仅考虑节点发送数据的能耗,而且兼顾了转发节点的接收能耗,在把数据直接发送的距离限制在阈值之内的同时,尽量减少数据中转次数;并且每个簇首节点在稳定传输阶段采用动态路由,避免了中继节点因能耗过大而快速死亡.仿真表明,本文提出的新协议能有效地降低网络能耗,更好地均衡网络节点的能耗,显著地延长网络生命周期.After researching on the classical clustering algorithms such as LEACH and EEUC,a novel energy efficient routing algorithm on uneven clustering for sensor networks (EERPUC) was proposed. In EERPUC,cluster head is chosen based on the residual energy and the relative position,the node that has large residual energy has more possibility of becoming cluster head, the cluster head closer to the centroid of cluster. Multi-hop data routing was formed in inter-cluster and routing to build not only considers the energy consumption of nodes send data, but also takes care of forward nodes to receive energy consumption. The distance of the data sending directly is limited within the threshold, at the same time minimizing the number of data transfer. And at the stage of stable transmission each cluster head uses dynamic routing to avoid the rapid death of relay node due to excessive energy consumption. The simulations showed that the new protocol proposed can effectively reduce network energy consumption, better balance the energy consumption of network nodes, significantly extending the network life cycle.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28