liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Connectivity-optimal Shortest Paths Using Crowdsourced Data
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering. (Real-time Systems Laboratory)
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering. (Real-time Systems Laboratory)ORCID iD: 0000-0003-1916-3398
2016 (English)In: 2016 IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops), IEEE Computer Society, 2016, 1-6 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
IEEE Computer Society, 2016. 1-6 p.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-131560DOI: 10.1109/PERCOMW.2016.7457106ISI: 000381790800059ISBN: 978-1-5090-1941-0 (print)OAI: oai:DiVA.org:liu-131560DiVA: diva2:974387
Conference
2016 IEEE International Conference on Pervasive Computing and Communication Workshops (PerCom Workshops), Sydney, Australia, March 14-18, 2016
Funder
Linköpings universitet, CENIIT 14.04
Available from: 2016-09-26 Created: 2016-09-26 Last updated: 2016-10-13Bibliographically approved

Open Access in DiVA

fulltext(263 kB)113 downloads
File information
File name FULLTEXT03.pdfFile size 263 kBChecksum SHA-512
76dcfce4f813341c0af2837254fce28a0ea30b8d35cf277de0bab4bc96a61ce0c2a73d1c129325121338fc10f7875e6bae202c976e1ea4469f8164199fb88234
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Hultman, TimBoudjadar, AbdeldjalilAsplund, Mikael
By organisation
Software and SystemsFaculty of Science & Engineering
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 113 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 48 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf