Congestion Control in Spatial Networks During Disasters
J. Shiva Prashanth1, Shaik. Gousiya Begum2
1J. Shivaprashanth, Assistant Professor, Department of Computer Science and Engineering, Anurag Group of Institutions, Hyderabad, India.
2Shaik Gousiya Begum, P.G Student, Department of Computer Science and Engineering, Anurag Group of Institutions, Hyderabad, India.
Manuscript received on 10 December 2018 | Revised Manuscript received on 17 December 2018 | Manuscript Published on 30 December 2018 | PP: 233-239 | Volume-8 Issue- 2S December 2018 | Retrieval Number: BS2709128218/19©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
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.
Keywords: Congestion Control, Event Dependent Network, Path Planning and Disaster Management.
Scope of the Article: Computer Science and Its Applications