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
Conference Name	2013 IEEE International Conference on Communications, ICC 2013
Pages	1816-1820
Conference Date	June 9, 2013 - June 13, 2013
Conference Place	Budapest, Hungary
Indexed Type	EI
Publish Place	Institute of Electrical and Electronics Engineers Inc., 445 Hoes Lane / P.O. Box 1331, Piscataway, NJ 08855-1331, United States
ISSN	15503607
ISBN	9781467331227
Department	(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
English Abstract	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.
Language	英语
Content Type	会议论文
URI	http://ir.iscas.ac.cn/handle/311060/16655
Collection	中国科学院软件研究所
Corresponding Author	Chen, W.
Recommended Citation 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.

Files in This Item:
There are no files associated with this item.

If you have any objections to this item, please fill out the form below and the administrator will contact you as soon as possible.
Content:
Email：	*
Institution:
Verification Code:	Refresh

Any comments and suggestions are welcomed.
Title:	*
Content:
Email：	*
Verification Code:	Refresh

中国科学院软件研究所机构知识库