在信息和通信基础设施有限的地区进行数据传输
Opportunistic Data Ferrying in Areas with Limited Information and Communications Infrastructure
摘要:
由于全球城市化的兴起和现代城市的大规模仪表化,人们对智慧城市的兴趣正在迅速上升。由于建立智能城市和智能社区的基础设施成本相当高,研究人员正在探索使用道路上现有的车辆作为智能社区应用的交通数据的“信息渡轮”,以避免安装新的通信基础设施的成本。在本文中,我们提出了一个机会主义的数据渡轮选择算法,努力选择车辆,可以最大限度地减少从一个源到一个给定的目的地的数据传输的整体延迟。我们提出的机会主义算法利用在线招聘算法,这是一起运行在被动模式,选择在最近的历史上表现最好的在线招聘算法的合奏。建议的集成为基础的算法进行评估经验使用现实世界的痕迹,从出租车在中国上海的路线,其性能进行比较,对基线的四个国家的最先进的在线招聘算法。大量的实验进行,我们的结果表明,该算法可以减少整体延迟相比,基线的一个令人印象深刻的13%至258%。
英文摘要:
Interest in smart cities is rapidly rising due to the global rise in urbanization and the wide-scale instrumentation of modern cities. Due to the considerable infrastructural cost of setting up smart cities and smart communities, researchers are exploring the use of existing vehicles on the roads as "message ferries" for the transport data for smart community applications to avoid the cost of installing new communication infrastructure. In this paper, we propose an opportunistic data ferry selection algorithm that strives to select vehicles that can minimize the overall delay for data delivery from a source to a given destination. Our proposed opportunistic algorithm utilizes an ensemble of online hiring algorithms, which are run together in passive mode, to select the online hiring algorithm that has performed the best in recent history. The proposed ensemble based algorithm is evaluated empirically using real-world traces from taxies plying routes in Shanghai, China, and its performance is compared against a baseline of four state-of-the-art online hiring algorithms. A number of experiments are conducted and our results indicate that the proposed algorithm can reduce the overall delay compared to the baseline by an impressive 13% to 258%.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。