检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]浙江工业大学信息工程学院,杭州310023 [2]温州大学瓯江学院,浙江温州325000
出 处:《传感技术学报》2010年第2期245-250,共6页Chinese Journal of Sensors and Actuators
基 金:国家高科技研究发展计划863项目资助(2009AA04Z138);国家自然科学基金项目资助(60774021)
摘 要:均衡网络能量消耗并提高网络生存周期是无线传感器网络路由研究的一大挑战。针对现有分簇路由算法的不足,本文提出了一种新的基于竞争机制的无线传感器网络分簇路由协议(CMCRP)。该路由协议在簇头选择中引入竞争机制,当节点剩余能量高于网络平均能量设定值时,节点竞争为候选簇头,同时引入节点间的拟物力作用对阈值加以调整,以均衡网络中簇的分布;在簇形成过程中,普通节点根据通信代价及与簇头的拟物力依概率成簇。与现有协议比较结果表明,CMCRP算法在均衡网络负载,延长网络寿命等方面具有良好的性能。One of the challenges in the study of the routing of wireless sensor network is to balance the network energy consumption and improve the network lifetime.In view of the drawbacks of the existing clustering routing algorithms,this paper proposes a novel one called CMCRP based on competition mechanism.This routing protocol introduces competition mechanism in head selection.When the node residual energy is higher than the set point of the average energy of the network,the node competes to become a candidate of the cluster head and the application of quasi physical-force between the nodes adjusts the threshold in order to balance the distribution of the network cluster.While forming of the formating cluster,ordinary nodes are considered to consist of cluster formation according to communication cost or the cluster-head to quasi physical-force by probability.Comparing with the existing protocols,the result shows that CMCRP algorithm has a better performance in balancing network load and extending the network lifetime.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145