Hierarchical and Scalable Routing in Infrastructure-based Vehicular Networks

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.

Ravaei Bahman; RahimiZadeh Keyvan; MoshrefZadeh Sadegh

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

Journal Paper

Paper Information

Journal: JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT) Year:2023 | Volume:12 | Issue:1 Page(s): 1-15

Download Full-Text

Persian Verion

View:

Download:

Cites:

Information Journal Paper

Title

Hierarchical and Scalable Routing in Infrastructure-based Vehicular Networks

Author(s)

Ravaei Bahman | RahimiZadeh Keyvan | MoshrefZadeh Sadegh | Issue Writer Certificate

Keywords

Vehicular networks

Vehicular delay tolerant network

Landmark-based routing

Hierarchical Routing

Abstract

Vehicular delay tolerant networks (VDTNs), as a special type of Vehicular networks, there is no end-to-end path exists between vehicle nodes. In this paper, a novel and scalable landmark-based forwarding method named Two-Layer Vehicular Delay Tolerant Routing (TLVDTR) is introduced that routes messages between regions and landmarks instead of performing routing between nodes. This method maps the network to a two-layer model. At the upper layer, the network operation area is divided to some regions by using the edge betweenness centrality and in the lower layer; a network of landmarks is organized to track vehicles' movement between popular places. Then, each Landmark finds the shortest path to other landmarks in its region and constructs an inter-landmark routing table. After that, by exploiting a distance vector algorithm and advertising routes mechanism, the routing table will be extended to store routes to landmarks of other regions. Beside the network structure organization, probabilities of transition between landmarks are computed by using nodes historical movement trajectory. Finally, by using both routing table and transition probabilities, our proposed method can select the suitable relays for carrying messages toward target landmarks. The evaluation results show the superiority of our proposed method in terms of delivering ratio (16%), average delay (17%) and forwarding cost (4%).

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans