Vehicular Ad hoc networks are a subset of mobile Ad hoc networks in which vehicles are considered as network nodes. Their major difference is rapid mobility of nodes which causes the quick change of topology in this network. Quick changes in the topology of the network More
Vehicular Ad hoc networks are a subset of mobile Ad hoc networks in which vehicles are considered as network nodes. Their major difference is rapid mobility of nodes which causes the quick change of topology in this network. Quick changes in the topology of the network are considered as a big challenge For routing in these networks, routing protocols must be robust and reliable. AODV Routing protocol is one of the known routing protocols in vehicular ad hoc networks. There are also some problems in applying this routing protocol on the vehicular ad hoc networks. The number of control massages increases with increasing the scale of the network and the number of nodes . One way to reduce the overhead in AODV routing protocol is clustering the nodes of the network. In this paper , the modified K-means algorithm has been used for clustering the nodes and particle swarm optimization has been used for selecting cluster head. The results of the proposed method improved normalized routing load and the increase of the packet delivery rate compared to AODV routing protocol.
Manuscript profile
Intercarous networks are a subset of mobile networks in which vehicles are considered as network nodes. The main difference with case mobile networks is the rapid mobility of nodes, which causes rapid topology change in this network
It becomes. Rapid changes in network More
Intercarous networks are a subset of mobile networks in which vehicles are considered as network nodes. The main difference with case mobile networks is the rapid mobility of nodes, which causes rapid topology change in this network
It becomes. Rapid changes in network topology are a major challenge for routing, for routing in these networks, routing protocols must be robust and reliable. One of the well-known routing protocols in intercity networks is the AODV routing protocol. The application of this routing protocol on intercity networks also has problems that increase the number of control messages in the network by increasing the scale of the network and the number of nodes. One way to reduce overhead in the AODV protocol is to cluster network nodes. In this paper, the modified K-Means algorithm is used to cluster the nodes and the particle swarm algorithm is used to select the cluster head. The results of the proposed method improve the normal routing load and increase the packet delivery rate compared to the AODV routing protocol.
Manuscript profile
