Optimizing the process of OLSR clustering based on mobility and density in ad hoc networks
Optimizing the process of OLSR clustering based on mobility and density in ad hoc networks
复制标题
DOI：
10.1109/icmcs.2012.6320238
复制
发表时间：
2012-05
期刊：
影响因子：
--
通讯作者：
A. Loutfi;M. Elkoutbi
中科院分区：
文献类型：
--
作者：
A. Loutfi;M. Elkoutbi
提出的主要ad hoc路由协议通常只在平面网络上运行。然而，由于可扩展性和可扩展性的原因，IP网络一直是分层的。在本文中，我们提出了一种新的分簇算法的OLSR的基础上的密度和移动性的节点。我们的算法考虑到节点的移动性，并给出了重大改进的当选簇头的数量。我们的目标是选出一个减少和较少的移动的簇头，将提供层次路由使用OLSR。
The main ad hoc routing protocols that were proposed generally operate only on flat networks. However the IP networks have always been of a hierarchical nature, for scalability and manageability reasons. In this paper, we propose a novel clustering algorithm for OLSR based on the density and mobility of nodes. Our algorithm takes into account the node mobility and gives major improvements regarding the number of elected cluster heads. Our objective is to elect a reduced and less mobile cluster heads that will serve for provide hierarchical routing using OLSR.