传感器网络中基于连通支配集的路由算法  

CDS-based routing algorithm for sensor networks

作　　者：黄元江[1] 汤德佑[1] 

机构地区：[1]株洲工学院计算机系,湖南株洲412008

出　　处：《计算机工程与设计》2005年第6期1572-1575,共4页Computer Engineering and Design

摘　　要：针对传感器网络节点资源有限的特点,结合连通支配集的概念,提出了基于最小连通支配集的路由算法。算法通过高效地构造最小连通支配集形成一个虚拟骨干网,使得数据转发可以高效地进行,而且算法是层次式的,具有良好的可扩展性。模拟实验和理论分析也表明算法具有良好的性能。According to the characters of sensor networks, a new routing algorithm was proposed based on minimum connected domi- nating set (MCDS) combining the concept of CDS. The new algorithm could improve data effectively through constructing a virtual backbone network. Because new algorithm was distributed, it could be scalable easily. Theoretic analysis and simulation show that new algorithm has better performance.

关 键 词：传感器网络 连通支配集 路由 虚拟骨干网 

分 类 号：TN915.9[电子电信—通信与信息系统]