作者: Sayan Sen Sarma , Koushik Sinha , Satya R. Das , Bhabani P. Sinha
DOI: 10.1109/VTCFALL.2019.8891600
关键词: Computer network 、 Routing (electronic design automation) 、 Grid 、 Natural disaster 、 Computer science 、 Center (algebra and category theory) 、 Road networks
摘要: We address the problem of evacuation people in a natural disaster or some other emergency situations. In such scenario, traffic from different parts city start moving simultaneously towards nearest safe location. propose here an optimal routing algorithm 'almost' grid-structured network to reach location minimum time, which is based on novel technique successively partitioning suitable sub-networks tackle issue missing links grid. Simulation results with road Manhattan show that our proposed performs better terms average time center than any existing techniques.