Congestion control in spatial networks during disasters

ISSN: 22783075
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

Abstract

Extensive quantities of algorithms have been proposed to solve shortest path inquiry issues for static or time dependent spatial networks; be that as it may, these algorithms don’t perform well to discover the nearest shelter with fastest paths in a disaster circumstances. In a disasters, path figured through existing algorithms and saved as the fastest may end up harmed. ONSC approach provides optimal path in a disaster circumstance however doesn’t manage with congestion control. To tackle this issue, this paper proposes a strategy to diminish the travelling time with an existing dynamic network:display, which is called an Event dependent network, to represent a spatial network in a disaster which assist the general population with choose the optimal path by giving weight-factor(in percentage) of the congestion in the road network.

Cite

CITATION STYLE

APA

Shiva Prashanth, J., & Begum, S. G. (2018). Congestion control in spatial networks during disasters. International Journal of Innovative Technology and Exploring Engineering, 8(2S), 233–239.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free