中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
optimal infostation deployment for spatio-temporal information dissemination

文献类型:会议论文

作者Xiong Yongping ; Tian Rui ; Ma Jian ; Liu Yan ; Sun Limin
出版日期2010
会议名称15th IEEE Symposium on Computers and Communications, ISCC 2010
会议日期37429
会议地点Riccione, Italy
关键词Heuristic algorithms Optimization Polynomial approximation Sales
页码120-122
英文摘要A growing number of applications require disseminating information around specific geographical areas within a limited valid time. For example, the store in the mall area expects to publish the time-limited sales promotion to all the potential clients in the nearby area, before the discount activity end. In this paper, we study the problem of deploying infostation for geographical information dissemination. It aims to achieve the desired dissemination ratio under the given time constraint and to minimize the infostation deployment cost. Inspired by several observations in recent studies on realistic mobility model, we build a mobility graph to reflect the statistical characteristic of users movement in a area. Based on this graph, we formulate the infostation deployment problem as an optimization problem. Then, we prove it is NP-hard by reducing it to the classical vertex cover problem and then develop a greedy heuristic algorithm DGREEDY with the polynomial time complexity. Extensive simulations based on the real human mobility traces have been carried out to show the efficacy of our approach.1 © 2010 IEEE.
会议主办者IEEE; IEEE Computer Society; IEEE Communications Society
会议录Proceedings - IEEE Symposium on Computers and Communications
会议录出版地United States
ISSN号15301346
ISBN号9781420000000
源URL[http://124.16.136.157/handle/311060/8848]  
专题软件研究所_基础软件国家工程研究中心_会议论文
推荐引用方式
GB/T 7714
Xiong Yongping,Tian Rui,Ma Jian,et al. optimal infostation deployment for spatio-temporal information dissemination[C]. 见:15th IEEE Symposium on Computers and Communications, ISCC 2010. Riccione, Italy. 37429.

入库方式: OAI收割

来源:软件研究所

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

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