...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Computer networks >File distribution via proximity group communications in LTE-advanced public safety networks
【24h】

File distribution via proximity group communications in LTE-advanced public safety networks

机译：在LTE先进的公共安全网络中通过邻近组通信分发文件

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

A primary technological challenge after a disaster is rapid deployment of temporary infrastructure to provide communications for disaster management workers. 3GPP Release 12 defines proximity service (ProSe) to allow direct communications within users for Long Term Evolution-Advanced (LTE-A) public safety. To support group communications, each group members have to receive data sent from the group application server (GAS) maintained in ProSe. This paper discusses the use of vehicle-mounted mobile base station to provide group communications over a two-tier heterogeneous architecture with the aid of GAS and ProSe links. In this method, each vehicle-mounted mobile base station (BS) works in a cell breathing manner to expand or shrink the cell coverage periodically. This way can ensure GAS having the up-to-date proximity knowledge of all users while the part of high-cost group data traffic due to the users located far from the BS can be offloaded to low-cost ProSe links instead. We formulate the minimum cost problem of the ProSe-based File Distribution (PFD) in such architecture. We prove the minimum PFD problem is NP-complete and then proposes three sources selection algorithms for PFD, namely Greedy algorithm, Defer algorithm, and Recursive algorithm. Extensive simulation study is conducted to evaluate performance of the proposed algorithms. (C) 2018 Elsevier B.V. All rights reserved.
机译：灾难后的主要技术挑战是快速部署临时基础架构以为灾难管理人员提供通信。 3GPP版本12定义了接近服务（ProSe），以允许用户内部进行直接通信，以实现高级长期演进（LTE-A）公共安全。为了支持组通信，每个组成员必须接收从ProSe中维护的组应用服务器（GAS）发送的数据。本文讨论了使用车载移动基站借助GAS和ProSe链路在两层异构架构上提供组通信的方法。在该方法中，每个车载移动基站（BS）以小区呼吸的方式工作以周期性地扩大或缩小小区覆盖范围。这种方式可以确保GAS拥有所有用户的最新近距离知识，同时由于用户远离BS而导致的部分高成本组数据流量可以卸载到低成本ProSe链接上。我们在这种架构中制定了基于ProSe的文件分发（PFD）的最小成本问题。我们证明了最小PFD问题是NP完全的，然后提出了PFD的三种信源选择算法，即贪婪算法，Defer算法和递归算法。进行了广泛的仿真研究，以评估所提出算法的性能。 （C）2018 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号