Minimum cost collaborative sensing network with mobile phones

ISCAS OpenIR

	Minimum cost collaborative sensing network with mobile phones
	Lu, Xianling (1); Li, Deying (1); Xu, Biaofei (1); Chen, Wenping (1); Ding, Zhiming (3); Chen, W.
	2013
会议名称	2013 IEEE International Conference on Communications, ICC 2013
页码	1816-1820
会议日期	June 9, 2013 - June 13, 2013
会议地点	Budapest, Hungary
收录类别	EI
出版地	Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331, Piscataway, NJ 08855-1331, United States
ISSN	15503607
ISBN	9781467331227
部门归属	(1) School of Information, Renmin University of China, Beijing 100872, China; (2) Zhengzhou Information Science and Technology Institute, Zhengzhou 450004, China; (3) Institute of Software, Chinese Academy of Sciences, Beijing 100190, China
摘要	Mobile phones with a rich set of embedded sensors have been applied in various collaborative sensing applications. In some applications, to encourage mobile phone users performing collaborative sensing tasks, the data demanders may pay mobile phone users. However, none of the existing works takes into account it. In this paper, we study the Minimum Cost of Attaining the Required Data with mobile phones (MCARD) problem in collaborative sensing network. Given sensing regions R = {R1, R2,&mellip;, Rm}, the set of requisite data Di for each sensing region Ri and a set of mobile phones M, the MCARD problem is how to select mobile phones to get all the required data such that the total cost on paying mobile phone users is minimized. We first formally define the MCARD problem. Then, we propose an approximation algorithm for the MCARD problem with the determinate trajectories of mobile phones and a heuristic algorithm for that trajectories are unknown respectively. Simulation results demonstrate our algorithms are efficient. © 2013 IEEE.; Mobile phones with a rich set of embedded sensors have been applied in various collaborative sensing applications. In some applications, to encourage mobile phone users performing collaborative sensing tasks, the data demanders may pay mobile phone users. However, none of the existing works takes into account it. In this paper, we study the Minimum Cost of Attaining the Required Data with mobile phones (MCARD) problem in collaborative sensing network. Given sensing regions R = {R1, R2,&mellip;, Rm}, the set of requisite data Di for each sensing region Ri and a set of mobile phones M, the MCARD problem is how to select mobile phones to get all the required data such that the total cost on paying mobile phone users is minimized. We first formally define the MCARD problem. Then, we propose an approximation algorithm for the MCARD problem with the determinate trajectories of mobile phones and a heuristic algorithm for that trajectories are unknown respectively. Simulation results demonstrate our algorithms are efficient. © 2013 IEEE.
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16655
专题	中国科学院软件研究所
通讯作者	Chen, W.
推荐引用方式 GB/T 7714	Lu, Xianling ,Li, Deying ,Xu, Biaofei ,et al. Minimum cost collaborative sensing network with mobile phones[C]. Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331, Piscataway, NJ 08855-1331, United States,2013:1816-1820.