中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 软件研究所
  3. 软件所图书馆
  4. 会议论文
Minimum cost collaborative sensing network with mobile phones

文献类型：会议论文

作者Lu, Xianling (1) ; Li, Deying (1) ; Xu, Biaofei (1) ; Chen, Wenping (1) ; Ding, Zhiming (3)
出版日期2013
会议名称2013 IEEE International Conference on Communications, ICC 2013
会议日期June 9, 2013 - June 13, 2013
会议地点Budapest, Hungary
页码1816-1820
通讯作者Chen, W.
中文摘要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.
收录类别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
源URL[http://ir.iscas.ac.cn/handle/311060/16655]  
专题软件研究所_软件所图书馆_会议论文
推荐引用方式
GB/T 7714		 Lu, Xianling ,Li, Deying ,Xu, Biaofei ,et al. Minimum cost collaborative sensing network with mobile phones[C]. 见:2013 IEEE International Conference on Communications, ICC 2013. Budapest, Hungary. June 9, 2013 - June 13, 2013.

入库方式： OAI收割

来源：软件研究所

浏览0
下载0
收藏0
其他版本

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。