Poster: Social mobility based routing in crowdsourced systems

Abstract

Copyright © 2014 ACM. In this paper, we formulate a generalized optimization problem to meet the profit problem for crowdsourced systems with considering three aspects of connectivity, profit and risk. We also propose a routing algorithm for this special scenario, featured by dynamic mobility and social graph. This algorithm has two parts: social graph extraction and social mobility based routing. The first part extracts each patrician's social graph to get the social knowledge. The second part gives a policy for the decider to assign the passages to the leaving nodes according to their social graph. We applied our algorithm into the realistic traces, and compare it with several existing methods. The result shows the competitive performance of this routing algorithm, both in connectivity, profit and risk.