3,123 research outputs found
Coordinated Multicasting with Opportunistic User Selection in Multicell Wireless Systems
Physical layer multicasting with opportunistic user selection (OUS) is
examined for multicell multi-antenna wireless systems. By adopting a two-layer
encoding scheme, a rate-adaptive channel code is applied in each fading block
to enable successful decoding by a chosen subset of users (which varies over
different blocks) and an application layer erasure code is employed across
multiple blocks to ensure that every user is able to recover the message after
decoding successfully in a sufficient number of blocks. The transmit signal and
code-rate in each block determine opportunistically the subset of users that
are able to successfully decode and can be chosen to maximize the long-term
multicast efficiency. The employment of OUS not only helps avoid
rate-limitations caused by the user with the worst channel, but also helps
coordinate interference among different cells and multicast groups. In this
work, efficient algorithms are proposed for the design of the transmit
covariance matrices, the physical layer code-rates, and the target user subsets
in each block. In the single group scenario, the system parameters are
determined by maximizing the group-rate, defined as the physical layer
code-rate times the fraction of users that can successfully decode in each
block. In the multi-group scenario, the system parameters are determined by
considering a group-rate balancing optimization problem, which is solved by a
successive convex approximation (SCA) approach. To further reduce the feedback
overhead, we also consider the case where only part of the users feed back
their channel vectors in each block and propose a design based on the balancing
of the expected group-rates. In addition to SCA, a sample average approximation
technique is also introduced to handle the probabilistic terms arising in this
problem. The effectiveness of the proposed schemes is demonstrated by computer
simulations.Comment: Accepted by IEEE Transactions on Signal Processin
Low Cost Quality of Service Multicast Routing in High Speed Networks
Many of the services envisaged for high speed networks, such as B-ISDN/ATM, will support real-time applications with large numbers of users. Examples of these types of application range from those used by closed groups, such as private video meetings or conferences, where all participants must be known to the sender, to applications used by open groups, such as video lectures, where partcipants need not be known by the sender. These types of application will require high volumes of network resources in addition to the real-time delay constraints on data delivery. For these reasons, several multicast routing heuristics have been proposed to support both interactive and distribution multimedia services, in high speed networks. The objective of such heuristics is to minimise the multicast tree cost while maintaining a real-time bound on delay. Previous evaluation work has compared the relative average performance of some of these heuristics and concludes that they are generally efficient, although some perform better for small multicast groups and others perform better for larger groups. Firstly, we present a detailed analysis and evaluation of some of these heuristics which illustrates that in some situations their average performance is reversed; a heuristic that in general produces efficient solutions for small multicasts may sometimes produce a more efficient solution for a particular large multicast, in a specific network. Also, in a limited number of cases using Dijkstra's algorithm produces the best result. We conclude that the efficiency of a heuristic solution depends on the topology of both the network and the multicast, and that it is difficult to predict. Because of this unpredictability we propose the integration of two heuristics with Dijkstra's shortest path tree algorithm to produce a hybrid that consistently generates efficient multicast solutions for all possible multicast groups in any network. These heuristics are based on Dijkstra's algorithm which maintains acceptable time complexity for the hybrid, and they rarely produce inefficient solutions for the same network/multicast. The resulting performance attained is generally good and in the rare worst cases is that of the shortest path tree. The performance of our hybrid is supported by our evaluation results. Secondly, we examine the stability of multicast trees where multicast group membership is dynamic. We conclude that, in general, the more efficient the solution of a heuristic is, the less stable the multicast tree will be as multicast group membership changes. For this reason, while the hybrid solution we propose might be suitable for use with closed user group multicasts, which are likely to be stable, we need a different approach for open user group multicasting, where group membership may be highly volatile. We propose an extension to an existing heuristic that ensures multicast tree stability where multicast group membership is dynamic. Although this extension decreases the efficiency of the heuristics solutions, its performance is significantly better than that of the worst case, a shortest path tree. Finally, we consider how we might apply the hybrid and the extended heuristic in current and future multicast routing protocols for the Internet and for ATM Networks.
Optimized Network-coded Scalable Video Multicasting over eMBMS Networks
Delivery of multicast video services over fourth generation (4G) networks
such as 3GPP Long Term Evolution-Advanced (LTE-A) is gaining momentum. In this
paper, we address the issue of efficiently multicasting layered video services
by defining a novel resource allocation framework that aims to maximize the
service coverage whilst keeping the radio resource footprint low. A key point
in the proposed system mode is that the reliability of multicast video services
is ensured by means of an Unequal Error Protection implementation of the
Network Coding (UEP-NC) scheme. In addition, both the communication parameters
and the UEP-NC scheme are jointly optimized by the proposed resource allocation
framework. Numerical results show that the proposed allocation framework can
significantly increase the service coverage when compared to a conventional
Multi-rate Transmission (MrT) strategy.Comment: Proc. of IEEE ICC 2015 - Mobile and Wireless Networking Symposium, to
appea
GreenDelivery: Proactive Content Caching and Push with Energy-Harvesting-based Small Cells
The explosive growth of mobile multimedia traffic calls for scalable wireless
access with high quality of service and low energy cost. Motivated by the
emerging energy harvesting communications, and the trend of caching multimedia
contents at the access edge and user terminals, we propose a paradigm-shift
framework, namely GreenDelivery, enabling efficient content delivery with
energy harvesting based small cells. To resolve the two-dimensional randomness
of energy harvesting and content request arrivals, proactive caching and push
are jointly optimized, with respect to the content popularity distribution and
battery states. We thus develop a novel way of understanding the interplay
between content and energy over time and space. Case studies are provided to
show the substantial reduction of macro BS activities, and thus the related
energy consumption from the power grid is reduced. Research issues of the
proposed GreenDelivery framework are also discussed.Comment: 15 pages, 5 figures, accepted by IEEE Communications Magazin
- …