一种传感器网络的分布式多播路由优化算法
doi: 10.3724/SP.J.1146.2013.00056
Distributed Multicast Routing Optimal Algorithm in Sensor Networks
-
摘要: 传感器感知的信息需要通过网络传送给感兴趣目标节点,传统网络中的多播技术往往能耗高、实时性不够理想,不利于在传感器网络中使用。针对WSN中节点对网络拓扑未知,该文先将多播路由问题演化为最优多播路径问题,通过启发式算法求解分布式最优路径,并通过一种基于贪婪思想的裁剪合并策略优化多播路由树,直至整个网络得到最优路径,最后并结合了节点区域集中以及无线多播特性,提出了DCast路由算法。最后通过仿真实验与uCast, SenCast等经典的传感器网络的多播路由算法仿真比较,可以得出其算法在时延性以及能耗等方面性能有优势。Abstract: Information of sensor percept are send to interested target node through sensor network. The multicast technology in traditional networks are usually more energy consumption, worse real-time. It is not fitted in sensor network. For nodes is unknown of network topology, multicast routing issue is converted to the optimal multicast path issue firstly, and it is solved through the heuristic algorithm. The multicast routing tree is optimized through cutting merger strategy with greedy, the optimal path is got in the entire network. Finally, combined with the node area concentration and wireless multicast characteristics, a routing algorithm, named DCast, is proposed. Finally, simulation results demonstrate the advantages of energy consumption and delay compared with other classic multicast routing algorithm such as uCast, SenCast.
-
Key words:
- Sensor network /
- Multicast routing /
- Distributed /
- NP-hard problem /
- Greedy algorithm /
- Cutting merger strategy
计量
- 文章访问数: 2212
- HTML全文浏览量: 76
- PDF下载量: 961
- 被引次数: 0