arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1102.1754cs.DC
收藏

移动自组网中基于概率的自适应分簇算法

Probability Based Adaptive Invoked Clustering Algorithm in MANETs

S. Rohini, K. Indumathi

摘要:

移动自组织网络(MANET)是一种通过无线链路连接的移动设备的自配置网络。为了实现稳定的簇,维护簇的簇头应该是稳定的,簇重选的开销最小。本文提出了一种基于概率的自适应加权聚类算法(PAIWCA),该算法将节点的电池电量作为成簇的考虑因素,利用节点的簇头概率选举稳定的簇头,从而提高了簇的稳定性。在这个模拟研究中进行了比较,以衡量我们的算法的性能与最大加权独立集(MWIS)的簇形成的数量,网络的连通性,优势集更新,整个网络的吞吐量和数据包投递率。实验结果表明,该算法的性能优于现有算法,并且对不同的网络环境具有较好的适应性。

英文摘要:

A mobile ad hoc network (MANET), is a self-configuring network of mobile devices connected by wireless links. In order to achieve stable clusters, the cluster-heads maintaining the cluster should be stable with minimum overhead of cluster re-elections. In this paper we propose a Probability Based Adaptive Invoked Weighted Clustering Algorithm (PAIWCA) which can enhance the stability of the clusters by taking battery power of the nodes into considerations for the clustering formation and electing stable cluster-heads using cluster head probability of a node. In this simulation study a comparison was conducted to measure the performance of our algorithm with maximal weighted independent set (MWIS) in terms of the number of clusters formed, the connectivity of the network, dominant set updates,throughput of the overall network and packet delivery ratio. The result shows that our algorithm performs better than existing one and is also tunable to different kinds of network conditions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑