Sökning: onr:"swepub:oai:DiVA.org:liu-131560" >
Connectivity-optima...
Connectivity-optimal Shortest Paths Using Crowdsourced Data
-
- Hultman, Tim (författare)
- Linköpings universitet,Programvara och system,Tekniska fakulteten
-
- Boudjadar, Abdeldjalil (författare)
- Linköpings universitet,Programvara och system,Tekniska fakulteten,Real-time Systems Laboratory
-
- Asplund, Mikael, 1981- (författare)
- Linköpings universitet,Programvara och system,Tekniska fakulteten,Real-time Systems Laboratory
-
(creator_code:org_t)
- IEEE Computer Society, 2016
- 2016
- Engelska.
-
Ingår i: 2016 IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops). - : IEEE Computer Society. - 9781509019410 ; , s. 1-6
- Relaterad länk:
-
https://liu.diva-por... (primary) (Raw object)
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- With the increasing dependency of ubiquitous connectivity for applications ranging from multimedia entertainment to intelligent transportation systems, having good signal coverage becomes vital. Therefore, route planners and navigation systems should take into account not only the physical distance, but also the characteristics and availability of the cellular network on the potential routes. In this paper we present a route planning tool that finds the connectivity-aware shortest paths based on crowdsourced data from OpenStreetMap and OpenSignal. The tool calculates optimal paths and allows physical distance tobe traded against signal quality. The evaluation shows that a 15% increase of the physical path length can achieve an 8.7dBm improvement of worst-case signal strength.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas