检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《微电子学与计算机》2012年第1期93-96,101,共5页Microelectronics & Computer
摘 要:本文提出了能耗高效的非均匀分簇路由协议(EERP).核心为由远及近依次求取各层成簇半径值,使得靠近sink节点的成簇半径小于远离sink节点的成簇半径;以节点剩余能量和相对距离为每个节点确定簇首竞争能力;簇间采用动态路由;依据接收比特值和簇首节点剩余能量发起簇重构.在Omnet++仿真平台下模拟实验结果显示,EERP有效的均衡了全网节点能耗,显著延长了网络生命周期.In this paper,it present an Energy Efficient Routing Protocol(EERP).The main idea is to strike a value of cluster radius in every level from the most far level to the nearest one,and make the radius of the clusters near the sink node less than the radius far from the sink node.The node's ability to be cluster head is determined based on the residual energy and their relative distance;inter-cluster using dynamic routing;cluster is rebuilding based on received bit value and the residual energy of cluster head.The results of simulations in OMNET++ show that EERP improves obviously in balancing energy consumption between nodes and prolonging network's life period.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.175