A Novel Clustering Mechanism for Cluster-Tree Networks

摘要：

In this paper, we analyze the current clustering algorithms and introduce the cluster-tree network model; then benefiting from the good organization of cluster-tree networks, we propose a novel clustering mechanism that conceptually seperate the whole networks into clusters according to serveral formulas. Then we not only make use of the advantages of cluster routing but avoid the computation and memory usage for forming and maintaining clusters. We also exploit the proposed novel clustering mechanism in wellknown AODV routing. Simulation results that our clustering mechanism largely reduces routing overhead and average end-to-end delay, and performs better in terms of packets delivery ratio than AODV routing without logical clusters for cluster-tree networks, which will make the real-time and dense mesh networks more efficient and scalable.

关键词： Clustering mechanism Routing AODV.

作者: Xianghua Xu Daomin Yuan Jian Wan

作者单位: Grid and Services Computing Lab,Hangzhou Dianzi University,Hangzhou,China

会议类型: 国际会议

会议名称: The IET 2nd International Conference on Wireless,Mobile & Multimedia Networks(第二届IET国际无线移动多媒体网络会议)

会议地点: 北京

会议语种:英文

在线出版日期: 2008-10-12（万方平台首次上网日期，不代表论文的发表时间）