RiskOracle: A Minute-level Citywide Traffic Accident Forecasting Framework

Real-time traffic accident forecasting is increasingly important for public safety and urban management (e.g., real-time safe route planning and emergency response deployment). Previous works on accident forecasting are often performed on hour levels, utilizing existed neural networks with static region-wise correlations taken into account. However, it is still challenging when the granularity of forecasting step improves as the highly dynamic nature of road network and inherent rareness of accident records in one training sample, which leads to biased results and zero-inflated issue. In this work, we propose a novel framework RiskOracle, to improve the prediction granularity to minute levels. Specifically, we first transform the zero-risk values in labels to fit the training network. Then, we propose the Differential Time-varying Graph neural network (DTGN) to capture the immediate changes of traffic status and dynamic inter-subregion correlations. Furthermore, we adopt multi-task and region selection schemes to highlight citywide most-likely accident subregions, bridging the gap between biased risk values and sporadic accident distribution. Extensive experiments on two real-world datasets demonstrate the effectiveness and scalability of our RiskOracle framework.Comment: 8 pages, 4 figures. Conference paper accepted by AAAI 202

Quality of service aware data dissemination in vehicular Ad Hoc networks

Des systèmes de transport intelligents (STI) seront éventuellement fournis dans un proche avenir pour la sécurité et le confort des personnes lors de leurs déplacements sur les routes. Les réseaux ad-hoc véhiculaires (VANETs) représentent l'élément clé des STI. Les VANETs sont formés par des véhicules qui communiquent entre eux et avec l'infrastructure. En effet, les véhicules pourront échanger des messages qui comprennent, par exemple, des informations sur la circulation routière, les situations d'urgence et les divertissements. En particulier, les messages d'urgence sont diffusés par des véhicules en cas d'urgence (p.ex. un accident de voiture); afin de permettre aux conducteurs de réagir à temps (p.ex., ralentir), les messages d'urgence doivent être diffusés de manière fiable dans un délai très court. Dans les VANETs, il existe plusieurs facteurs, tels que le canal à pertes, les terminaux cachés, les interférences et la bande passante limitée, qui compliquent énormément la satisfaction des exigences de fiabilité et de délai des messages d'urgence. Dans cette thèse, en guise de première contribution, nous proposons un schéma de diffusion efficace à plusieurs sauts, appelé Dynamic Partitioning Scheme (DPS), pour diffuser les messages d'urgence. DPS calcule les tailles de partitions dynamiques et le calendrier de transmission pour chaque partition; à l'intérieur de la zone arrière de l'expéditeur, les partitions sont calculées de sorte qu'en moyenne chaque partition contient au moins un seul véhicule; l'objectif est de s'assurer que seul un véhicule dans la partition la plus éloignée (de l'expéditeur) est utilisé pour diffuser le message, jusqu'au saut suivant; ceci donne lieu à un délai d'un saut plus court. DPS assure une diffusion rapide des messages d'urgence. En outre, un nouveau mécanisme d'établissement de liaison, qui utilise des tonalités occupées, est proposé pour résoudre le problème du problème de terminal caché. Dans les VANETs, la Multidiffusion, c'est-à-dire la transmission d'un message d'une source à un nombre limité de véhicules connus en tant que destinations, est très importante. Par rapport à la diffusion unique, avec Multidiffusion, la source peut simultanément prendre en charge plusieurs destinations, via une arborescence de multidiffusion, ce qui permet d'économiser de la bande passante et de réduire la congestion du réseau. Cependant, puisque les VANETs ont une topologie dynamique, le maintien de la connectivité de l'arbre de multidiffusion est un problème majeur. Comme deuxième contribution, nous proposons deux approches pour modéliser l'utilisation totale de bande passante d'une arborescence de multidiffusion: (i) la première approche considère le nombre de segments de route impliqués dans l'arbre de multidiffusion et (ii) la seconde approche considère le nombre d'intersections relais dans l'arbre de multidiffusion. Une heuristique est proposée pour chaque approche. Pour assurer la qualité de service de l'arbre de multidiffusion, des procédures efficaces sont proposées pour le suivi des destinations et la surveillance de la qualité de service des segments de route. Comme troisième contribution, nous étudions le problème de la congestion causée par le routage du trafic de données dans les VANETs. Nous proposons (1) une approche de routage basée sur l’infonuagique qui, contrairement aux approches existantes, prend en compte les chemins de routage existants qui relaient déjà les données dans les VANETs. Les nouvelles demandes de routage sont traitées de sorte qu'aucun segment de route ne soit surchargé par plusieurs chemins de routage croisés. Au lieu d'acheminer les données en utilisant des chemins de routage sur un nombre limité de segments de route, notre approche équilibre la charge des données en utilisant des chemins de routage sur l'ensemble des tronçons routiers urbains, dans le but d'empêcher, dans la mesure du possible, les congestions locales dans les VANETs; et (2) une approche basée sur le réseau défini par logiciel (SDN) pour surveiller la connectivité VANET en temps réel et les délais de transmission sur chaque segment de route. Les données de surveillance sont utilisées en entrée de l'approche de routage.Intelligent Transportation Systems (ITS) will be eventually provided in the near future for both safety and comfort of people during their travel on the roads. Vehicular ad-hoc Networks (VANETs), represent the key component of ITS. VANETs consist of vehicles that communicate with each other and with the infrastructure. Indeed, vehicles will be able to exchange messages that include, for example, information about road traffic, emergency situations, and entertainment. Particularly, emergency messages are broadcasted by vehicles in case of an emergency (e.g., car accident); in order to allow drivers to react in time (e.g., slow down), emergency messages must be reliably disseminated with very short delay. In VANETs, there are several factors, such as lossy channel, hidden terminals, interferences and scarce bandwidth, which make satisfying reliability and delay requirements of emergency messages very challenging. In this thesis, as the first contribution, we propose a reliable time-efficient and multi-hop broadcasting scheme, called Dynamic Partitioning Scheme (DPS), to disseminate emergency messages. DPS computes dynamic partition sizes and the transmission schedule for each partition; inside the back area of the sender, the partitions are computed such that in average each partition contains at least a single vehicle; the objective is to ensure that only a vehicle in the farthest partition (from the sender) is used to disseminate the message, to next hop, resulting in shorter one hop delay. DPS ensures fast dissemination of emergency messages. Moreover, a new handshaking mechanism, that uses busy tones, is proposed to solve the problem of hidden terminal problem. In VANETs, Multicasting, i.e. delivering a message from a source to a limited known number of vehicles as destinations, is very important. Compared to Unicasting, with Multicasting, the source can simultaneously support multiple destinations, via a multicast tree, saving bandwidth and reducing overall communication congestion. However, since VANETs have a dynamic topology, maintaining the connectivity of the multicast tree is a major issue. As the second contribution, we propose two approaches to model total bandwidth usage of a multicast tree: (i) the first approach considers the number of road segments involved in the multicast tree and (ii) the second approach considers the number of relaying intersections involved in the multicast tree. A heuristic is proposed for each approach. To ensure QoS of the multicasting tree, efficient procedures are proposed for tracking destinations and monitoring QoS of road segments. As the third contribution, we study the problem of network congestion in routing data traffic in VANETs. We propose (1) a Cloud-based routing approach that, in opposition to existing approaches, takes into account existing routing paths which are already relaying data in VANETs. New routing requests are processed such that no road segment gets overloaded by multiple crossing routing paths. Instead of routing over a limited set of road segments, our approach balances the load of communication paths over the whole urban road segments, with the objective to prevent, whenever possible, local congestions in VANETs; and (2) a Software Defined Networking (SDN) based approach to monitor real-time VANETs connectivity and transmission delays on each road segment. The monitoring data is used as input to the routing approach

Optimising message broadcasting in opportunistic networks

[EN] Message Broadcasting in Opportunistic Networks is based on the opportunity of establishing contacts among mobiles nodes for message exchange. Nevertheless, as the amount of information transmitted in a contact is limited by the transmission speed and the contact duration, large messages are less likely to be exchanged, and thus their diffusion is severely limited. Furthermore, these failed transmissions can also lead to an important waste of network resources, since the message transmission is aborted when the contact ends and the message needs to be transmitted again in the next contact. Therefore, in this paper we study the impact that contact duration has on the broadcast of messages, showing that splitting a large message into smaller parts can improve its diffusion. Based on this idea, we propose an extension of the epidemic protocol called Xpread. The efficiency of this protocol mainly depends on how the original message is partitioned. Thus, in order to evaluate the impact and the efficiency of the partition scheme, we have developed an analytical model based on Population Processes, showing that a fixed size partition is the best option, while also providing a simple expression to obtain the optimal size. The Xpread has been evaluated exhaustively using four different mobiles traces, comprising both pedestrian and vehicular scenarios. The results show that the diffusion of large messages is improved up to four times with a slight reduction in the delivery time and overhead, minimising also message forwarding failures.This work was partially supported by the Ministerio de Ciencia, Innovacion y Universidades, Spain, under Grant RTI2018-096384-B-I00; and the Secretaria Nacional de Educacion Superior, Ciencia, Tecnologia e Innovacion del Ecuador (SENESCYT), Ecuador.Chancay-García, L.; Hernández-Orallo, E.; Manzoni, P.; Vegni, AM.; Loscrí, V.; Cano, J.; Tavares De Araujo Cesariny Calafate, CM. (2020). Optimising message broadcasting in opportunistic networks. Computer Communications. 157:162-178. https://doi.org/10.1016/j.comcom.2020.04.031S162178157Udugama, A., Dede, J., Förster, A., Kuppusamy, V., Kuladinithi, K., Timm-Giel, A., & Vatandas, Z. (2019). My Smartphone tattles: Considering Popularity of Messages in Opportunistic Data Dissemination. Future Internet, 11(2), 29. doi:10.3390/fi11020029Benamar, N., Singh, K. D., Benamar, M., El Ouadghiri, D., & Bonnin, J.-M. (2014). Routing protocols in Vehicular Delay Tolerant Networks: A comprehensive survey. Computer Communications, 48, 141-158. doi:10.1016/j.comcom.2014.03.024Yong Li, Depeng Jin, Zhaocheng Wang, Lieguang Zeng, & Sheng Chen. (2013). Exponential and Power Law Distribution of Contact Duration in Urban Vehicular Ad Hoc Networks. IEEE Signal Processing Letters, 20(1), 110-113. doi:10.1109/lsp.2012.2231412Kim, S.-H., Jeong, Y., & Han, S.-J. (2014). Use of contact duration for message forwarding in intermittently connected mobile networks. Computer Networks, 64, 38-54. doi:10.1016/j.comnet.2014.01.007E. Hernández-Orallo, L. Chancay-García, P. Manzoni, C. Calafate, J.-C. Cano, Assessing social aspects of urban vehicular scenarios for improving message diffusion, in: 28th International Conference on Computer Communication and Networks, ICCCN, 2019, pp. 1–8.Zhang, X., Neglia, G., Kurose, J., & Towsley, D. (2007). Performance modeling of epidemic routing. Computer Networks, 51(10), 2867-2891. doi:10.1016/j.comnet.2006.11.028De Abreu, C. S., & Salles, R. M. (2014). Modeling message diffusion in epidemical DTN. Ad Hoc Networks, 16, 197-209. doi:10.1016/j.adhoc.2013.12.013Karagiannis, G., Altintas, O., Ekici, E., Heijenk, G., Jarupan, B., Lin, K., & Weil, T. (2011). Vehicular Networking: A Survey and Tutorial on Requirements, Architectures, Challenges, Standards and Solutions. IEEE Communications Surveys & Tutorials, 13(4), 584-616. doi:10.1109/surv.2011.061411.00019A.M. Vegni, A. Stramacci, E. Natalizio, SRB: A selective reliable broadcast protocol for safety applications in VANETs, in: 2012 International Conference on Selected Topics in Mobile and Wireless Networking, 2012, pp. 89–94.Jing Zhao, Yang Zhang, & Guohong Cao. (2007). Data Pouring and Buffering on the Road: A New Data Dissemination Paradigm for Vehicular Ad Hoc Networks. IEEE Transactions on Vehicular Technology, 56(6), 3266-3277. doi:10.1109/tvt.2007.906412Y. Wang, L. Huang, T. Gu, H. Wei, K. Xing, J. Zhang, Data-driven traffic flow analysis for vehicular communications, in: IEEE INFOCOM 2014 - IEEE Conference on Computer Communications, 2014, pp. 1977–1985.Cheng, P.-C., Lee, K. C., Gerla, M., & Härri, J. (2009). GeoDTN+Nav: Geographic DTN Routing with Navigator Prediction for Urban Vehicular Environments. Mobile Networks and Applications, 15(1), 61-82. doi:10.1007/s11036-009-0181-6Nzouonta, J., Rajgure, N., Guiling Wang, & Borcea, C. (2009). VANET Routing on City Roads Using Real-Time Vehicular Traffic Information. IEEE Transactions on Vehicular Technology, 58(7), 3609-3626. doi:10.1109/tvt.2009.2014455X. Lin, R. Lu, X. Liang, X. Shen, STAP: A social-tier-assisted packet forwarding protocol for achieving receiver-location privacy preservation in VANETs, in: 2011 Proceedings IEEE INFOCOM, 2011, pp. 2147–2155.F. Cunha, A. Carneiro Vianna, R. Mini, A. Loureiro, How effective is to look at a vehicular network under a social perception? in: Wireless and Mobile Computing, Networking and Communications, WiMob, 2013 IEEE 9th International Conference on, 2013, pp. 154–159.Ning, Z., Xia, F., Ullah, N., Kong, X., & Hu, X. (2017). Vehicular Social Networks: Enabling Smart Mobility. IEEE Communications Magazine, 55(5), 16-55. doi:10.1109/mcom.2017.1600263T. Le, M. Gerla, Contact duration-aware routing in delay tolerant networks, in: 2017 International Conference on Networking, Architecture, and Storage, NAS, 2017, pp. 1–8.Brachman, B. J., & Chanson, S. T. (1988). Fragmentation in store-and-forward message transfer. IEEE Communications Magazine, 26(7), 18-27. doi:10.1109/35.7642M. Pitkanen, A. Keranen, J. Ott, Message fragmentation in opportunistic DTNs, in: 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks, 2008, pp. 1–7.Kim, M., Kim, Y. G., Chung, S. W., & Kim, C. H. (2014). Measuring Variance between Smartphone Energy Consumption and Battery Life. Computer, 47(7), 59-65. doi:10.1109/mc.2013.293T. Le, Q. Zhao, M. Gerla, Fragmented data routing based on exponentially distributed contacts in delay tolerant networks, in: International Conference on Computing, Networking and Communications, ICNC 2019, Honolulu, HI, USA, February 18-21, 2019, 2019, pp. 1039–1043.G. Sandulescu, S. Nadjm-Tehrani, Optimising replication versus redundancy in window-aware opportunistic routing, in: 2010 Third International Conference on Communication Theory, Reliability, and Quality of Service, 2010, pp. 192–201.Calafate, C. T., Fortino, G., Fritsch, S., Monteiro, J., Cano, J.-C., & Manzoni, P. (2012). An efficient and robust content delivery solution for IEEE 802.11p vehicular environments. Journal of Network and Computer Applications, 35(2), 753-762. doi:10.1016/j.jnca.2011.11.008Xu, Q., Su, Z., Zhang, K., Ren, P., & Shen, X. S. (2015). Epidemic Information Dissemination in Mobile Social Networks With Opportunistic Links. IEEE Transactions on Emerging Topics in Computing, 3(3), 399-409. doi:10.1109/tetc.2015.2414792Whitbeck, J., Conan, V., & de Amorim, M. D. (2011). Performance of Opportunistic Epidemic Routing on Edge-Markovian Dynamic Graphs. IEEE Transactions on Communications, 59(5), 1259-1263. doi:10.1109/tcomm.2011.020811.090163Chancay-Garcia, L., Hernandez-Orallo, E., Manzoni, P., Calafate, C. T., & Cano, J.-C. (2018). Evaluating and Enhancing Information Dissemination in Urban Areas of Interest Using Opportunistic Networks. IEEE Access, 6, 32514-32531. doi:10.1109/access.2018.2846201M. Piorkowski, N. Sarafijanovoc-Djukic, M. Grossglauser, A parsimonious model of mobile partitioned networks with clustering, in: The First International Conference on COMmunication Systems and NETworkS, COMSNETS, , 2009.Tsai, T.-C., & Chan, H.-H. (2015). NCCU Trace: social-network-aware mobility trace. IEEE Communications Magazine, 53(10), 144-149. doi:10.1109/mcom.2015.7295476Haas, Z. J., & Small, T. (2006). A new networking model for biological applications of ad hoc sensor networks. IEEE/ACM Transactions on Networking, 14(1), 27-40. doi:10.1109/tnet.2005.863461Passarella, A., & Conti, M. (2013). Analysis of Individual Pair and Aggregate Intercontact Times in Heterogeneous Opportunistic Networks. IEEE Transactions on Mobile Computing, 12(12), 2483-2495. doi:10.1109/tmc.2012.213Hernández-Orallo, E., Cano, J. C., Calafate, C. T., & Manzoni, P. (2016). New approaches for characterizing inter-contact times in opportunistic networks. Ad Hoc Networks, 52, 160-172. doi:10.1016/j.adhoc.2016.04.003Hernandez-Orallo, E., Herrera-Tapia, J., Cano, J.-C., Calafate, C. T., & Manzoni, P. (2015). Evaluating the Impact of Data Transfer Time in Contact-Based Messaging Applications. IEEE Communications Letters, 19(10), 1814-1817. doi:10.1109/lcomm.2015.2472407Hernández-Orallo, E., Murillo-Arcila, M., Calafate, C. T., Cano, J. C., Conejero, J. A., & Manzoni, P. (2016). Analytical evaluation of the performance of contact-Based messaging applications. Computer Networks, 111, 45-54. doi:10.1016/j.comnet.2016.07.006Dede, J., Forster, A., Hernandez-Orallo, E., Herrera-Tapia, J., Kuladinithi, K., Kuppusamy, V., … Vatandas, Z. (2018). Simulating Opportunistic Networks: Survey and Future Directions. IEEE Communications Surveys & Tutorials, 20(2), 1547-1573. doi:10.1109/comst.2017.2782182A. Keränen, J. Ott, T. Kärkkäinen, The ONE simulator for DTN protocol evaluation, in: Proceedings of SIMUTools’09, 2009, pp. 55:1–55:10.J. Herrera-Tapia, E. Hernández-Orallo, A. Tomás, P. Manzoni, C.T. Calafate, J. Cano, Selecting the optimal buffer management for opportunistic networks both in pedestrian and vehicular contexts, in: 2017 14th IEEE Annual Consumer Communications Networking Conference, CCNC, 2017, pp. 395–400