Maximizing Network Coverage Under the Presence of Time Constraint by Injecting Most Effective k-Links
Authors: 
Kouzou Ohara, Takayasu Fushimi, Kazumi Saito, Masahiro Kimura, Hiroshi MotodaAuthors Info & Claims
Kouzou Ohara, Takayasu Fushimi, Kazumi Saito, Masahiro Kimura, Hiroshi MotodaAuthors Info & ClaimsPages 421 - 436
Abstract
We focus on a class of link injection problem of spatial network, i.e., finding best places to construct k new roads that save as many people as possible in a time-critical emergency situation. We quantify the network performance by node coverage under the presence of time constraint and propose an efficient algorithm that maximizes the marginal gain by use of lazy evaluation making the best of time constraint. We apply our algorithm to three problem scenarios (disaster evacuation, ambulance call, fire engine dispatch) using real-world road network and geographical information of actual facilities and demonstrate that 1) use of lazy evaluation can achieve nearly two orders of magnitude reduction of computation time compared with the straightforward approach and 2) the location of new roads is intuitively explainable and reasonable.
References
[1]
Akram VK and Dagdeviren O Breadth-first search-based single-phase algorithms for bridge detection in wireless sensor networks Sensors 2013 13 7 8786-8813
[2]
Boldi, P., Vigna, S.: In-core computation of geometric centralities with hyperball: a hunderd billion nodes and beyond. In: Proceedings of the 2013 IEEE 13th International Conference on Data Mining Workshops (ICDMW 2013), pp. 621–628 (2013)
[3]
Brandes U and Erlebach T Network Analysis 2005 Heidelberg Springer
[4]
Brin S and Page L The anatomy of a large-scale hypertextual web search engine Comput. Netw. ISDN Syst. 1998 30 107-117
[5]
Burckhart K and Martin OJ An interpretation of the recent evolution of the city of Barcelona through the traffic maps J. Geogr. Inf. Syst. 2012 4 4 298-311
[6]
Chakrabarti S et al. Mining the web’s link structure IEEE Comput. 1999 32 60-67
[7]
Chaoji, V., Ranu, S., Rastogi, R., Bhatt, R.: Recommendations to boost content spread in social networks. In: Proceedings of the 21th International Conference on World Wide Web (WWW 2012), pp. 529–538 (2012)
[8]
Chierichetti, F., Epasto, A., Kumar, R., Lattanzi, S., Mirrokni, V.: Efficient algorithms for public-private social networks. In: Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2015), pp. 139–148 (2015)
[9]
Cohen, E.: All-distances sketches, revisited: hip estimators for massive graphs analysis. In: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 88–99 (2014)
[10]
Crescenzi, P., D’angelo, G., Severini, L., Velaj, Y.: Greedily improving our own closeness centrality in a network. ACM Trans. Knowl. Discov. Data 11(1), 1–32 (2016)
[11]
Crucitti P, Latora V, and Porta S Centrality measures in spatial networks of urban streets Phys. Rev. E 2006 73 3 036125
[12]
Everett MG and Borgatti SP Carrington PJ, Scott J, and Wasserman S Extending centrality Models and Methods in Social Network Analysis 2005 New York Cambridge University Press 57-76
[13]
Fang YP, Pedroni N, and Zio E Comparing network-centric and power flow models for the optimal allocation of link capacities in a cascade-resilient power transmission network IEEE Syst. J. 2014 99 1-12
[14]
Freeman L Centrality in social networks: conceptual clarification Soc. Netw. 1979 1 215-239
[15]
Grady D, Thiemann C, and Brockmann D Robust classification of salient links in complex networks Nature Commun. 2012 3 864 1-10
[16]
Kimura M, Saito K, and Motoda H Blocking links to minimize contamination spread in a social network ACM Trans. Knowl. Discov. Data 2009 3 9:1-9:23
[17]
Kimura M, Saito K, Ohara K, and Motoda H Speeding-up node influence computation for huge social networks Int. J. Data Sci. Anal. 2015 1 1 3-16
[18]
Koschützki D et al. Brandes U, Erlebach T, et al. Centrality indices Network Analysis 2005 Heidelberg Springer 16-61
[19]
Montis DA, Barthelemy M, Chessa A, and Vespignani A The structure of interurban traffic: a weighted network analysis Environ. Plan. 2007 34 5 905-924
[20]
Newman M The structure and function of complex networks SIAM Rev. 2003 45 167-256
[21]
Ohara K, Saito K, Kimura M, and Motoda H Calders T, Ceci M, and Malerba D Accelerating computation of distance based centrality measures for spatial networks Discovery Science 2016 Cham Springer 376-391
[22]
Ohara, K., Saito, K., Kimura, M., Motoda, H.: Maximizing network performance based on group centrality by creating most effective -links. In: Proceedings of the 4th IEEE Data Science and Advanced Analytics (DSAA2017), pp. 561–570. IEEE Explore (2017).
[23]
Oliveira EL, Portugal LS, and Junior WP Determining critical links in a road network: vulnerability and congestion indicators Proc. Soc. Behav. Sci. 2014 162 158-167
[24]
Opsahl T, Agneessens F, and Skvoretz J Node centrality in weighted networks: generalizing degree and shortest paths Soc. Netw. 2010 32 3 245-251
[25]
Papagelis M Refining social graph connectivity via shortcut edge addition ACM Trans. Knowl. Discov. Data 2015 10 2 1-35
[26]
Park, K., Yilmaz, A.: A social network analysis approach to analyze road networks. In: Proceedings of the ASPRS Annual Conference 2010 (2010)
[27]
Parotsidis, N., Pitoura, E., Tsaparas, P.: Selecting shortcuts for a smaller world. In: Proceedings of the 2015 SIAM International Conference on Data Mining (SDM 2015), pp. 28–36 (2015)
[28]
Parotsidis, N., Pitoura, E., Tsaparas, P.: Centrality-aware link recommendations. In: Proceedings of of the Ninth ACM International Conference on Web Search and Data Mining (WSDM 2016), pp. 503–512 (2016)
[29]
Saito K, Ohara K, Kimura M, and Motoda H Accurate and efficient detection of critical links in network to minimize information loss J. Intell. Inf. Syst. 2018 51 2 235-255
[30]
Saito K, Ohara K, Kimura M, and Motoda H Geng X and Kang B-H Efficient detection of critical links to maintain performance of network with uncertain connectivity PRICAI 2018: Trends in Artificial Intelligence 2018 Cham Springer 282-295
[31]
Saito K, Ohara K, Kimura M, and Motoda H Nayak AC and Sharma A Efficient identification of critical links based on reachability under the presence of time constraint PRICAI 2019: Trends in Artificial Intelligence 2019 Cham Springer 404-418
[32]
Shen Y, Nguyen NP, Xuan Y, and Thai MT On the discovery of critical links and nodes for assessing network vulnerability IEEE/ACM Trans. Netw. 2013 21 3 963-973
[33]
Stojmenovic I, Simplot-Ryl D, Nayak A, and Velaj Y Toward scalable cutvertex and link detection with applications in wireless ad hoc networks IEEE Netw. 2011 25 1 44-48
[34]
Tong, H., Prakash, B.A., Eliassi-Rad, T., Faloutsos, M., Faloutsos, C.: Gelling, and melting, large graphs by edge manipulation. In: Proceedings of the 21st ACM international conference on Information and knowledge management (CIKM 2012), pp. 245–254 (2012)
[35]
Wang P, Hunter T, Bayen AM, Schechtner K, and Gonzalez MC Understanding road usage patterns in urban areas Sci. Rep. 2012 2 1001:1-1001:6
Recommendations
Efficient Identification of Critical Links Based on Reachability Under the Presence of Time Constraint
PRICAI 2019: Trends in Artificial IntelligenceAbstractIn this paper, we focus on an emergency situation in the real-world such as disaster evacuation and propose an algorithm that can efficiently identify critical links in a spatial network that substantially degrade network performance if they fail ...
Dynamic cost-effective emergency network provision
I-TENDER '17: Proceedings of the First CoNEXT Workshop on ICT Tools for Emergency Networks and DisastEr ReliefThe importance to our society of emergency network communications cannot be underestimated. The loss of communication and network systems in a state of emergency denies victims of disaster and city emergency response teams critical information about the ...
Scheduling Non-Urgent Patient Transportation While Maximizing Emergency Coverage
Many ambulance providers operate both advanced life support (ALS) and basic life support (BLS) ambulances. Typically, only an ALS ambulance can respond to an emergency call, whereas non-urgent patient transportation requests can be served by either an ALS ...
Comments
Information & Contributors
Information
Published In
Oct 2020
704 pages
ISBN:978-3-030-61526-0
DOI:10.1007/978-3-030-61527-7
© Springer Nature Switzerland AG 2020.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 19 October 2020
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 17 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in