Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kaibo Fu

dblp:206/9279 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2017
0009-0006-6812-0553ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Internet of things and sensor networks · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Smart cities and intelligent transportation · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
iot application development
0.312017
TinyLink: A Holistic System for Rapid Development of IoT Applications · MobiCom 2017
Internet of things and sensor networks
mobile sensing
0.312017
Multihop calibration for mobile sensing: K-hop Calibratability and reference sensor deployment · INFOCOM 2017
Internet of things and sensor networks › wireless sensor network › sensor network management
sensor calibration
0.312017
Multihop calibration for mobile sensing: K-hop Calibratability and reference sensor deployment · INFOCOM 2017
Internet of things and sensor networks
wireless sensor network
0.312017
Multihop calibration for mobile sensing: K-hop Calibratability and reference sensor deployment · INFOCOM 2017
Embedded and real-time systems › model-based design
code generation
0.312017
TinyLink: A Holistic System for Rapid Development of IoT Applications · MobiCom 2017

Methods — techniques the papers use, named apart from their topics

unified API · 0.6top-down design · 0.6set cover formulation · 0.6rendezvous connection graph · 0.6algorithm design · 0.6
YearPublicationVenuePosition
2017 Multihop calibration for mobile sensing: K-hop Calibratability and reference sensor deployment
abstract
Mobile vehicles, equipped with low-cost sensors, can provide unprecedented opportunities for urban monitoring with a wide coverage. The quality of collected data is very important for many applications. The low-cost mobile sensors can, however, suffer from limited accuracy, high instability, and sensor drift. Therefore, they need to be frequently calibrated to preserve a good data quality. Frequent sensor calibration can be achieved by deploying static high-precision sensors (called reference sensors) and exploiting meeting points (i.e., rendezvous) between the reference sensors and mobile sensors. A calibrated mobile sensor can also be used to calibrate an uncalibrated mobile sensor when they meet, referred to as multihop calibration. In this paper, we introduce a novel concept, k-hop calibratability, in the context of multihop calibration: a sensor is k-hop calibratable if the calibration path is no larger than k. We consider the problem of how to deploy the reference sensors to ensure that all sensors in the network are k-hop calibratable. To address this problem, we formally define the rendezvous connection graph to precisely describe the relationship between mobile sensors and (virtual) reference sensors. Based on this definition, we formulate the reference sensor deployment problem as a set cover problem. We also extend our problem to consider practical deployment requirements. We propose efficient algorithms and conduct an extensive evaluation in the context of mobile air quality monitoring. We present a detailed prototype implementation of the mobile sensors and reference sensors. Evaluations using real-world datasets show the effectiveness of the algorithms.
Kaibo Fu, Wei Dong 0001
INFOCOM1
2017 TinyLink: A Holistic System for Rapid Development of IoT Applications
abstract
Rapid development is essential for IoT (Internet of Things) application developers to obtain first-mover advantages and reduce the development cost. In this paper, we present TinyLink, a holistic system for rapid development of IoT applications. The key idea of TinyLink is to use a top-down approach for designing both the hardware and the software of IoT applications. Developers write the application code in a C-like language to specify the key logic of their applications, without dealing with the details of the specific hardware components. Taking the application code as input, TinyLink automatically generates the hardware configuration as well as the binary program executable on the target hardware platform. TinyLink provides unified APIs for applications to interact with the underlying hardware components. We implement TinyLink and evaluate its performance using real-world IoT applications. Results show that: (1) TinyLink achieves rapid development of IoT applications, reducing 52.58% of lines of code in average compared with traditional approaches; (2) TinyLink searches a much larger design space and thus can generate a superior solution for the hardware configuration, compared with the state-of-the-art approach; (3) TinyLink incurs acceptable overhead in terms of execution time and program memory.
Gaoyang Guan, Wei Dong 0001, Yi Gao 0001, Kaibo Fu, Zhihao Cheng
MobiCom4