Abstract: In this paper, we study the physical crowd-sensing problem and draw the connection to the vertex cover problem in graph theory.

Apr 27, 2017 · The motivation is to assign the sensing task to a more "socialized" device to obtain better sensing coverage. We perform comprehensive ...

Abstract—In this paper, we study the physical crowd-sensing problem and draw the connection to the vertex cover problem in graph theory.

In this paper, we study the physical crowd-sensing problem and draw the connection to the vertex cover problem in graph theory. Since finding the optimal ...

This paper presents our effort that toward context-aware mobile crowd sensing in VSNs. First, we introduce a novel application-oriented service collaboration ( ...

In this paper, we study the physical crowd-sensing problem and draw the connection to the vertex cover problem in graph theory. Since finding the optimal ...

In this paper, we study the physical crowd-sensing problem and draw the connection to the vertex cover problem in graph theory. Since finding the optimal ...

The motivation is to assign the sensing task to a more "socialized" device to obtain better sensing coverage. We perform comprehensive experiments on real-world ...

, Context-Aware Crowd-Sensing in Opportunistic Mobile Social Networks. ; Institute of Electrical and Electronics Engineers, author, issuing body. ;. , ISBN: 1 ...

This paper designs an Opportunistic Crowd Computing system (OCC) for mobile social networks (MSNs), and presents an optimal user group algorithm (OUGA) that ...