Joint Multi-hop Clustering and Routing in VANETs using Array of Doubly Linked List

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Shamaei Chaharsough amin; Avokh Avid

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Modeling in Engineering Year:2022 | Volume:19 | Issue:67 Page(s): 13-32

Download Full-Text

Persian Verion

View:

Download:

Cites:

Information Journal Paper

Title

Joint Multi-hop Clustering and Routing in VANETs using Array of Doubly Linked List

Author(s)

Shamaei Chaharsough amin | Avokh Avid | Issue Writer Certificate

Keywords

VANET

Multi-hop Clustering

routing

delay

Overhead

Abstract

This paper addresses the problems of Multi-hop Clustering, Cluster Head (CH) selection, and routing in vehicular ad-hoc networks. We propose an efficient algorithm called Joint Multi-hop Clustering and routing (JMCR) to improve the performance of the network. JMCR uses only local information to cluster vehicles in such a way that not only reduces the total number of clusters, but also maximizes the stability of clusters. It considers both relative speed and Euclidean distance factors to select an appropriate CH for each cluster. In order to update the routing database of each node, an array of doubly linked list is used in which the creation of different routing paths starts from the boundary nodes and continues to CH. Compatibility with reactive clustering and the ability to dynamically follow the network conditions are another advantages of the proposed intra-cluster routing method. Simulation results conducted in NS2 confirm the efficiency of the proposed method in terms of end-to-end delay, Overhead, and packet delivery rate.

Cites

No record.

References

No record.

Cite

APA: Copy

Shamaei Chaharsough, amin, & Avokh, Avid. (2022). Joint Multi-hop Clustering and Routing in VANETs using Array of Doubly Linked List. JOURNAL OF MODELING IN ENGINEERING, 19(67 ), 13-32. SID. https://sid.ir/paper/993117/en

Vancouver: Copy

Shamaei Chaharsough amin, Avokh Avid. Joint Multi-hop Clustering and Routing in VANETs using Array of Doubly Linked List. JOURNAL OF MODELING IN ENGINEERING[Internet]. 2022;19(67 ):13-32. Available from: https://sid.ir/paper/993117/en

IEEE: Copy

amin Shamaei Chaharsough, and Avid Avokh, “Joint Multi-hop Clustering and Routing in VANETs using Array of Doubly Linked List,” JOURNAL OF MODELING IN ENGINEERING, vol. 19, no. 67 , pp. 13–32, 2022, [Online]. Available: https://sid.ir/paper/993117/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops