摘要
基于簇的无线传感器网络路由协议,是目前国际上研究的重点之一。在目前研究中,往往假设簇首之间可以直接通信,忽略了簇间路由的建立过程。在讨论簇间路由问题域及其形式化描述的基础上,提出了一种簇间路由算法,着重对算法的设计思想和工作过程,包括簇间连通性、簇间路由建立与维护,以及簇间路由链路质量评估等问题进行了分析和论述。算法充分考虑了簇首选举和簇重组对簇间路由建立造成的影响,对动态簇组织协议有很好的支持能力,符合当前基于动态簇的无线传感器网络协议设计方向。
Cluster-based routing protocol of wireless sensor networks (WSN)is a hotspot in international research,but a hypothesis is always made that the direct communication lies between adjacent cluster heads,and the building process of routings between adjacent clusters is ignored.After discussing the question domain of adjacent clusters routing and its formalization,this paper brings forward a routing algorithm of adjacent clusters,the design and work process of it is analyzed and discussed,which includes the connectivity analysis and the link quality evaluation between adjacent clusters,the building and maintenance of routings.Because of taking into account the election of cluster heads and the rebuilding of clusters,the algorithm have a good support to the dynamic cluster organization protocols,and is adapted to the trend of dynamic cluster-based network protocol design of WSN in the world.
出处
《计算机工程与应用》
CSCD
北大核心
2005年第30期125-129,152,共6页
Computer Engineering and Applications
基金
国家自然科学基金(编号:60472074)
部委基础科研计划
关键词
算法
路由
簇
无线传感器网络
algorithm,routing,cluster,Wireless Sensor Networks(WSN)