检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《传感技术学报》2007年第4期908-911,共4页Chinese Journal of Sensors and Actuators
基 金:国家自然科学基金资助(60573050)
摘 要:针对无线传感器网络节点能耗受限和不同节点能量开销不平衡的问题,对于分层结构的无线传感器网络提出了一种分簇规模约束算法.该算法是通过对簇内节点数量设置上下限的方式,对簇规模大小进行限制.如果簇中节点的数量超过上限(U),该簇就被划分为两个簇;如果簇中节点的数量低于下限(L),该簇就会和邻居簇相结合.在自组簇的形成过程中采用该算法,可减少节点能量开销和增加簇的稳定性.To the energy limit of nodes and imbalance energy consuming among nodes, this paper propose a scale of cluster restriction algorithm for hierarchical wireless sensor networks. The algorithm uses a method that the number of nodes in each cluster is bounded by two constants called upper and lower bounds to restrict the scale of cluster. If the number of nodes in a cluster exceeds the upper bound, the cluster is divided into two clusters. If the number of nodes in a cluster becomes less than the lower bound, the cluster merges itself with one of its neighboring clusters. The algorithm not only reduce the energy consuming of nodes, but also increase the stability of cluster.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222