首页> 外文会议>45th Southeastern Symposium on System Theory >Relay positioning for energy saving in cooperative networks
【24h】

Relay positioning for energy saving in cooperative networks

机译:中继定位以节省协作网络中的能源

获取原文
获取原文并翻译 | 示例

摘要

The number of Access Points (AP) in a network is much smaller than the network users. Hence, some users may be far from Aps requiring more power to transmit data. Cooperative communication has been proposed, which uses the broadcast nature of the wireless medium to exploit the spatial diversity in wireless networks. Users in cooperative communication system work cooperatively by relaying the packets through a relay node(RN). One issue is to find an near optimal positions for the limited number of available relays to reduce energy consumption of the users. In this paper, we investigate the position of the relays and its effect on energy saving in cooperative wireless networks. Initially, we use a greedy algorithm to determine the position of the relays and determine the energy saving achieved from this algorithm. Then, we use our improved iterative algorithm to place the relays. Using simulations, we compare both the algorithms in terms of average energy consumption, average number of hops and average r-cover (RNs form an r-cover if each user is within distance at most r from the RN). It is evident from the simulation results that the improved algorithm outperforms the greedy algorithm in all the above mentioned aspects. The results provide us an insight into positioning of the relays in a cooperative wireless network to reduce energy consumption of the users.
机译:网络中的接入点(AP)的数量比网络用户少得多。因此,某些用户可能与需要更多功率来传输数据的Ap距离很远。已经提出了协作通信,其利用无线介质的广播性质来利用无线网络中的空间分集。协作通信系统中的用户通过中继节点(RN)中继数据包来协同工作。一个问题是为有限数量的可用继电器找到接近最佳的位置,以减少用户的能耗。在本文中,我们研究了中继的位置及其对协作无线网络中节能的影响。最初,我们使用贪婪算法来确定继电器的位置,并确定通过该算法实现的节能效果。然后,我们使用改进的迭代算法放置继电器。使用模拟,我们在平均能耗,平均跳数和平均r-cover(如果每个用户距RN最多r的距离内,RN形成r-cover)方面比较了两种算法。从仿真结果可以看出,在所有上述方面,改进算法的性能均优于贪心算法。结果为我们提供了在协作无线网络中减少中继器位置以减少用户能耗的见解。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号