摘要
提出了一个传感网络中基于位置信息的成簇思想,并基于该思想给出了一种传感网络中基于位置信息的分布式多播路由算法。该算法首先利用相邻节点的位置信息分布式成簇,然后各簇头利用蚂蚁算法分布式地找到一条具有最短总跳数的到目的节点组的实际路径。最后,由簇头负责收集本簇内的传感信息,并在对这些信息进行汇聚处理后,沿找到的最优路径将汇聚数据分别发送到各目的节点。理论分析和仿真结果表明,该算法能有效地节约能量,具有较好的路由性能。
An innovative distributed multicast routing algorithm for sensor networks is presented, based on nodes' location information. The main ideas of this new algorithm are the followings: At first, it forms clusters according to nodes' location information distributedly. And then, by using ant algorithm, every cluster head distributedly obtains the optimal path of the minimal total hops from itself to the destination nodes. Fina-lly, after having collected and aggregated the related data in its own cluster, every cluster head sends the aggregated data to the destination nodes separately along its selected optimal paths. Theoretic analysis and simulation results show that the new algorithm is energy efficient and has good routing performances.
出处
《计算机工程与设计》
CSCD
北大核心
2009年第4期830-833,848,共5页
Computer Engineering and Design
关键词
传感网络
位置信息
多播
蚂蚁算法
分布式
sensor networks
location information
multicast
ant algorithm
distributed