一种自适应广播周期的移动Ad Hoc网络分簇方法
Clustering of Mobile Ad Hoc Networks: An Adaptive Broadcast Period Approach
摘要：
组织，可扩展性和路由已被确定为关键问题，阻碍移动自组织网络的可行性和商业成功。在不同的域之间的移动节点的集群已被提出作为一种有效的方法来解决这些问题。在这项工作中，我们引入了一个有效的分布式聚类算法，使用集群形成的位置和能量指标。我们提出的解决方案主要解决集群稳定性，可扩展性和能源效率问题。此外，与现有的主动分簇方法不同，我们的算法减轻了网络不必要的控制消息广播的负担，特别是对于相对静态的网络拓扑结构。这是通过根据移动节点的移动性模式调整广播周期来实现的。我们的算法对替代方法的效率，可扩展性和能力已通过仿真结果证明。
英文摘要：
Organization, scalability and routing have been identified as key problems hindering viability and commercial success of mobile ad hoc networks. Clustering of mobile nodes among separate domains has been proposed as an efficient approach to address those issues. In this work, we introduce an efficient distributed clustering algorithm that uses both location and energy metrics for cluster formation. Our proposed solution mainly addresses cluster stability, manageability and energy efficiency issues. Also, unlike existing active clustering methods, our algorithm relieves the network from the unnecessary burden of control messages broadcasting, especially for relatively static network topologies. This is achieved through adapting broadcast period according to mobile nodes mobility pattern. The efficiency, scalability and competence of our algorithm against alternative approaches have been demonstrated through simulation results.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
