摘要
在大规模的ad hoc网络中,设计分簇式路由算法可以解决节点数目增长带来的可扩展性问题.给出分簇式多播算法的超图模型,提出基于Steiner超树模型的ad hoc多播路由的集中式算法和分布式算法,并对两种算法的复杂度和通信开销做出分析.
Clustering routing method can solve the scalability problem incurred by the increasing of node number in large ad hoc networks.The hypergraph model of clustering multicasting in ad hoc networks is proposed.Two centralized/distributed multicasting routing algorithms are introduced based on Steiner Hypertree model.Complication and communication cost of the two algorithms are analyzed.
出处
《郑州大学学报(理学版)》
CAS
2007年第3期59-63,共5页
Journal of Zhengzhou University:Natural Science Edition
基金
教育部博士学科点基金资助项目
编号20030056007