Abstract
Clustering is an important research topic in wireless networks, because cluster structures can facilitate resource reuse and increase system capacity. In this paper, we present a new clustering algorithm that considers both node position and node mobility in vehicular ad hoc environments. The proposed algorithm intends to create stable clusters by reducing reclustering overhead, prolonging cluster lifetime, and shortening the average distance between cluster heads and their cluster members. Most important, this algorithm supports single and multiple cluster heads. Simulation results show the superiority of our clustering algorithm over the other three well-known algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computer Theory and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
