The method used for cluster formation and CH selection in any clustering algorithm is very important to achieve stability. In a graph representation of a network of vehicles, a vehicle node is connected to two other vehicle nodes. This graphical representation might work well in areas with low population density, such as highways or sparsely populated cities. In contrast, graph theory does not apply in dense urban environments where a vehicle is always connected to more than two other vehicles. A good way to represent dense vehicle networks is with hypergraphs.
Author(s) Details:
Mays Kareem Jabbar,
Faculty of Engineering, University of Misan, Al Amarah City, Misan Province, 62001, Iraq and CES_Lab, Ecole National d’Ingénieurs de Sfax (ENIS), Sfax University, Tunisia.
Hafedh Trabelsi,
CES_Lab, Ecole National d’Ingénieurs de Sfax (ENIS), Sfax University, Tunisia.
