首页> 外文会议>IEEE International Conference on Communications >Power efficient multicast for multiple description media in wireless mesh networks
【24h】

Power efficient multicast for multiple description media in wireless mesh networks

机译:无线网状网络中用于多种描述媒体的高能效组播

获取原文
获取外文期刊封面目录资料

摘要

In this paper, we study multicasting media traffic that uses multiple description coding (MDC) in a wireless mesh network (WMN), where an access point (AP) transmits multiple descriptions to the mobile stations (MSs) through relay stations (RSs). The MSs have different quality of service (QoS) requirements in terms of number of required descriptions, and each RS can forward at most one description. All RSs forwarding the same descriptions form a multicast tree. Our objective is to minimize total transmission power of the RSs, subject to satisfying the QoS requirements of the MSs. We study two problems, building node-disjoint multicast trees and allocating transmission power. The former is to decide which RSs should forward the same description, and the latter is to determine an adequate transmission power level for each RS. An optimization problem is first formulated, and two heuristic schemes are then proposed. The first scheme is a greedy method that iteratively adds new paths to individual multicast trees and assigns transmission power to RSs, and the second one is a simplified version of the first. Numerical results demonstrate that both schemes achieve much lower power consumption compared to a spanning-tree-based scheme that builds the multicast trees one after another, and the power consumption of the first scheme is much lower than the second one at a price of higher complexity.
机译:在本文中,我们研究了在无线网状网络(WMN)中使用多描述编码(MDC)的多播媒体流量,其中接入点(AP)通过中继站(RS)将多个描述发送到移动站(MS)。 MS在所需描述的数量方面具有不同的服务质量(QoS)要求,并且每个RS最多可以转发一个描述。转发相同描述的所有RS形成一个组播树。我们的目标是在满足MS的QoS要求的前提下,最小化RS的总传输功率。我们研究两个问题,建立节点不相交的多播树和分配传输功率。前者将决定哪些RS应该转发相同的描述,而后者将为每个RS确定适当的发射功率水平。首先提出一个优化问题,然后提出两种启发式方案。第一种方案是一种贪婪方法,该方法将新路径迭代地添加到各个多播树并为RS分配传输功率,第二种方案是第一种的简化版本。数值结果表明,与基于生成树的方案相比,这两种方案都可实现更低的功耗,而后者是一个又一个地构建多播树的方案,并且第一个方案的功耗要比第二个方案低得多,但代价是复杂度更高。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号