检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西南交通大学电气化自动化研究所 [2]西南交通大学电气工程学院
出 处:《传感器世界》2006年第10期30-34,共5页Sensor World
摘 要:针对目前提出的许多基于簇的无线传感器网络路由协议均让簇头间或簇头与基站能直接通信,致使成簇规模和数据融合度较小,不利于能量的节省的特点,本文提出了一种基于节点最大通信范围形成较大的分布式簇,通过网关节点保持簇之间的连通,形成簇间路由的算法,文中详细介绍了簇建立和簇间路由的过程,通过仿真验证了该算法对于能量节省等性能较DD路由算法有较大提高。Now many routing protocol based on cluster have presented in wireless sensor network, in which one duster head can directly communicate with another or cluster head can directly communicate with base station o Thus the clustering scale is small and the degree of data fusion is finite ,which limit energy saving. A distributed clustering algorithm based on maximal communication scope of clustering head is brought out in this article, which keep connectivity between clusters and between cluster and base station by gateway nodes o The process about setting up cluster and routing between clusters are introduced in detail. Furthermore, this algorithm is simulated by NS2 and its performance such as energy saving is proved to be more effective than DD o
分 类 号:TN929.5[电子电信—通信与信息系统] TP212.9[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249