Centre dedocumentation
scientifique

Introducing diversion graph for real-time spatial data analysis with location based social networks / Sameera Kannangara (2021)  

Public Titre : Introducing diversion graph for real-time spatial data analysis with location based social networks Type de document : Article/Communication Auteurs : Sameera Kannangara, Auteur ; Hairuo Xie, Auteur ; Egemen Tanin, Auteur ; Aaron Harwood, Auteur ; Shanika Karunasekera, Auteur Editeur : Leibniz [Allemagne] : Schloss Dagstuhl – Leibniz-Zentrum für Informatik Année de publication : 2021 Conférence : GIScience 2021, 11th International Conference on Geographic Information Science 27/09/2021 30/09/2021 Poznań Pologne Open Access Proceedings Note générale : bibliographie Langues : Français (fre) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] chemin le plus court, algorithme du [Termes IGN] graphe [Termes IGN] image Flickr [Termes IGN] objet mobile [Termes IGN] réseau social géodépendant [Termes IGN] temps réel [Termes IGN] triangulation de Delaunay [Termes IGN] Twitter Résumé : (auteur) Neighbourhood graphs are useful for inferring the travel network between locations posted in the Location Based Social Networks (LBSNs). Existing neighbourhood graphs, such as the Stepping Stone Graph lack the ability to process a high volume of LBSN data in real time. We propose a neighbourhood graph named Diversion Graph, which uses an efficient edge filtering method from the Delaunay triangulation mechanism for fast processing of LBSN data. This mechanism enables Diversion Graph to achieve a similar accuracy level as Stepping Stone Graph for inferring travel networks, but with a reduction of the execution time of over 90%. Using LBSN data collected from Twitter and Flickr, we show that Diversion Graph is suitable for travel network processing in real time. Numéro de notice : C2021-079 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Communication DOI : 10.4230/LIPIcs.GIScience.2021.I.7 Date de publication en ligne : 25/09/2020 En ligne : https://doi.org/10.4230/LIPIcs.GIScience.2021.I.7 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=100930

Route intersection reduction with connected autonomous vehicles / Sadegh Motallebi in Geoinformatica, vol 25 n° 1 (January 2021)  

Public [article]  inGeoinformatica > vol 25 n° 1 (January 2021) . - pp 99 - 125 Titre : Route intersection reduction with connected autonomous vehicles Type de document : Article/Communication Auteurs : Sadegh Motallebi, Auteur ; Hairuo Xie, Auteur ; Egemen Tanin, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 99 - 125 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] calcul d'itinéraire [Termes IGN] carrefour [Termes IGN] chemin le plus court, algorithme du [Termes IGN] gestion de trafic [Termes IGN] optimisation (mathématiques) [Termes IGN] réseau routier [Termes IGN] trafic routier Résumé : (Auteur) A common cause of traffic congestions is the concentration of intersecting vehicle routes. It can be difficult to reduce the intersecting routes in existing traffic systems where the routes are decided independently from vehicle to vehicle. The development of connected autonomous vehicles provides the opportunity to address the intersecting route problem as the route of vehicles can be coordinated globally. We prototype a traffic management system for optimizing traffic with connected autonomous vehicles. The system allocates routes to the vehicles based on streaming traffic data. We develop two route assignment algorithms for the system. The algorithms can help to mitigate traffic congestions by reducing intersecting routes. Extensive experiments are conducted to compare the proposed algorithms and two state-of-the-art route assignment algorithms with both synthetic and real road networks in a simulated traffic management system. The experimental results show that the proposed algorithms outperform the competitors in terms of the travel time of the vehicles. Numéro de notice : A2021-093 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s10707-020-00420-z Date de publication en ligne : 23/08/2020 En ligne : https://doi.org/10.1007/s10707-020-00420-z Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96933 [article]

Opportunistic sampling-based query processing in wireless sensor networks / Muhammad Umer in Geoinformatica, vol 17 n° 4 (October 2013)  

Public [article]  inGeoinformatica > vol 17 n° 4 (October 2013) . - pp 567 - 597 Titre : Opportunistic sampling-based query processing in wireless sensor networks Type de document : Article/Communication Auteurs : Muhammad Umer, Auteur ; Egemen Tanin, Auteur ; Lars Kulik, Auteur Année de publication : 2013 Article en page(s) : pp 567 - 597 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] modélisation spatio-temporelle [Termes IGN] requête (informatique) [Termes IGN] réseau de capteurs [Termes IGN] télécommunication sans fil [Termes IGN] transmission de données Résumé : (Auteur) High resolution sampling of physical phenomenon is a prime application of large scale wireless sensor networks (WSNs). With hundreds of nodes deployed over vast tracts of land, monitoring data can now be generated at unprecedented spatio-temporal scales. However, the limited battery life of individual nodes in the network mandates smart ways of collecting this data by maximizing localized processing of information at the node level. In this paper, we propose a WSN query processing method that enhances localized information processing by harnessing the two inherent aspects of WSN communication, i.e., multihop and multipath data transmission. In an active WSN where data collection queries are regularly processed, multihop and multipath routing leads to a situation where a significant proportion of nodes relay and overhear data generated by other nodes in the network. We propose that nodes opportunistically sample this data as they communicate. We model the data communication process in a WSN and show that opportunistic sampling during data communication leads to surprisingly accurate global knowledge at each node. We present an opportunistic query processing system that uses the accumulated global knowledge to limit the data collection requirements for future queries while ensuring temporal freshness of the results. Numéro de notice : A2013-510 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/SOCIETE NUMERIQUE Nature : Article DOI : 10.1007/s10707-012-0170-y Date de publication en ligne : 05/10/2012 En ligne : https://doi.org/10.1007/s10707-012-0170-y Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32648 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2013041	RAB	Revue	Centre de documentation	En réserve L003	Disponible

Spatial interpolation in wireless sensor networks: localized algorithms for variogram modeling and kriging / M. Umer in Geoinformatica, vol 14 n° 1 (January 2010)  

Public [article]  inGeoinformatica > vol 14 n° 1 (January 2010) . - pp 101 - 134 Titre : Spatial interpolation in wireless sensor networks: localized algorithms for variogram modeling and kriging Type de document : Article/Communication Auteurs : M. Umer, Auteur ; Lars Kulik, Auteur ; Egemen Tanin, Auteur Année de publication : 2010 Article en page(s) : pp 101 - 134 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] corrélation [Termes IGN] interpolation spatiale [Termes IGN] krigeage [Termes IGN] lissage de données [Termes IGN] traitement de données localisées [Termes IGN] variogramme Résumé : (Auteur) Wireless sensor networks (WSNs) are rapidly emerging as the prominent technology for monitoring physical phenomena. However, large scale WSNs are known to suffer from coverage holes, i.e., large regions of deployment area where no sensing coverage can be provided. Such holes are the result of hardware failures, extensive costs for redeployment or the hostility of deployment areas. Coverage holes can adversely affect the accurate representation of natural phenomena that are monitored by a WSN. In this work, we propose to exploit the spatial correlation of physical phenomena to make monitoring systems more resilient to coverage holes. We show that a phenomenon can be interpolated inside a coverage hole with a high level of accuracy from the available nodal data given a model of its spatial correlation. However, due to energy limitations of sensor nodes it is imperative to perform this interpolation in an energy efficient manner that minimizes communication among nodes. In this paper, we present highly energy efficient methods for spatial interpolation in WSNs. First, we build a correlation model of the phenomenon being monitored in a distributed manner. Then, a purely localized and distributed spatial interpolation scheme based on Kriging interpolates the phenomenon inside coverage holes. We test the cost and accuracy of our scheme with extensive simulations and show that it is significantly more energy efficient than global interpolations and remarkably more accurate than simple averaging. Numéro de notice : A2010-011 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-009-0078-3 Date de publication en ligne : 24/02/2009 En ligne : https://doi.org/10.1007/s10707-009-0078-3 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81113 [article]

Réservation

Réserver ce document

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
057-2010011	RAB	Revue	Centre de documentation	En réserve L003	Disponible