检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京科技大学信息工程学院,北京100083 [2]中国石油大学(华东)石油仪器仪表研究所,山东东营257061
出 处:《计算机应用》2007年第8期1839-1841,1845,共4页journal of Computer Applications
摘 要:提出一种新的可用于无线自组传感器网络路由中的能量高效的虚拟骨干网构造算法。该算法将网络中的节点按照地理距离最近的原则划分为若干簇,簇头与簇成员的距离为k-hop,增大了簇的规模,减少了通信开销;利用最小连通支配集理论优化簇内结构,选择新的参数作为权值,在保证骨干网规模的同时,优先选择剩余能量高的节点担任骨干节点,均衡了网络的能量消耗,从而延长了网络寿命。仿真结果表明,该算法构造的虚拟骨干网规模较小,对降低路由复杂度、延长传感器网络寿命有较好的效果。An energy-efficient algorithm for virtual backbone construction that could be used for Wireless Sensor Network (WSN) routing was proposed. The network nodes were divided into a number of clusters according to the geographical distance between them, the distance of the cluster head and members was k - hop. While the size of cluster was increased, the cost of communication was reduced. Using the smallest connected dominating set theory to optimize within the cluster structure, choosing a new parameter value as a right, making the nodes with higher energy be key nodes while guarantee the size of the network backbone, the energy consumption was balanced, and the life of the network was prolonged. Simulation results show that the algorithm can reduce the network scale and routing complexity, and extend the life of WSN.
分 类 号:TP212[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117