首页> 外文OA文献 >Energy efficient relaying via store-carry and forward within the cell
【2h】

Energy efficient relaying via store-carry and forward within the cell

机译:通过单元中的存储和转发进行节能中继

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In this paper store-carry and forward (SCF) decision policies for relaying within the cell are developed. The key motivation of SCF relaying stems from the fact that energy consumption levels can be dramatically reduced by capitalizing on the inherent mobility of nodes and the elasticity of Internet applications. More specifically, we show how the actual mobility of relay nodes can be incorporated as an additional resource in the system to achieve savings in the required communication energy levels. To this end, we provide a mathematical programming formulation on the aforementioned problem and find optimal routing and scheduling policies to achieve maximum energy savings. By investigating structural properties of the proposed mathematical program we show that optimal solutions can be computed efficiently in time. The trade-offs between energy and delay in the system are meticulously studied and Pareto efficient curves are derived. Numerical investigations show that the achievable energy gains by judiciously storing and carrying information from mobile relays can grow well above 70% for the macrocell scenario when compared to a baseline multihop wireless relaying scheme that uses shortest path routes to the base station.
机译:在本文中,开发了在单元内进行中继的存储携带和转发(SCF)决策策略。 SCF中继的主要动机来自这样一个事实,即可以通过充分利用节点的固有移动性和Internet应用程序的弹性来大幅降低能耗水平。更具体地说,我们展示了如何将中继节点的实际移动性作为系统中的附加资源并入以节省所需的通信能量级别。为此,我们针对上述问题提供了数学编程公式,并找到了最佳的路由和调度策略以实现最大的节能效果。通过研究提出的数学程序的结构性质,我们表明可以及时有效地计算出最优解。认真研究了系统中能量与延迟之间的权衡,得出了帕累托效率曲线。数值研究表明,与使用到基站的最短路径路由的基准多跳无线中继方案相比,通过明智地存储和承载来自移动中继的信息可实现的能量增益对于宏小区方案可以增长到70%以上。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号