357 research outputs found

    Scheduling of Multicast and Unicast Services under Limited Feedback by using Rateless Codes

    Full text link
    Many opportunistic scheduling techniques are impractical because they require accurate channel state information (CSI) at the transmitter. In this paper, we investigate the scheduling of unicast and multicast services in a downlink network with a very limited amount of feedback information. Specifically, unicast users send imperfect (or no) CSI and infrequent acknowledgements (ACKs) to a base station, and multicast users only report infrequent ACKs to avoid feedback implosion. We consider the use of physical-layer rateless codes, which not only combats channel uncertainty, but also reduces the overhead of ACK feedback. A joint scheduling and power allocation scheme is developed to realize multiuser diversity gain for unicast service and multicast gain for multicast service. We prove that our scheme achieves a near-optimal throughput region. Our simulation results show that our scheme significantly improves the network throughput over schemes employing fixed-rate codes or using only unicast communications

    Network coding-based retransmission for relay aided multisource multicast networks

    Get PDF
    This paper considers the reliable transmission for wireless multicast networks where multiple sources want to distribute information to a set of destinations with assistance of a relay. Basically, the reliability of a communication link is assured via automatic repeat request (ARQ) protocols. In the context of multisource multicast networks, the challenge is how to retransmit the lost or erroneous packets efficiently. In traditional approaches, the retransmission of lost packets from a single source is treated separately, and thus it may cause a considerable delay. To solve this problem, we propose the relay detects, combines, and forwards the packets which are lost at destinations using network coding. In the proposed ARQ protocol, the relay detects packets from different sources and combines the lost packets using NC. In particular, two packet-combination algorithms are developed to guarantee that all lost packets are retransmitted with the smallest number of retransmissions. Furthermore, we analyze the transmission bandwidth and provide the numerical results to demonstrate the superior performance of the proposed ARQ protocol over some existing schemes

    Isn't Hybrid ARQ Sufficient?

    Full text link
    In practical systems, reliable communication is often accomplished by coding at different network layers. We question the necessity of this approach and examine when it can be beneficial. Through conceptually simple probabilistic models (based on coin tossing), we argue that multicast scenarios and protocol restrictions may make concatenated multi-layer coding preferable to physical layer coding alone, which is mostly not the case in point-to-point communications.Comment: Paper presented at Allerton Conference 201

    Efficient Multicast in Next Generation Mobile Networks

    Get PDF

    Performance evaluation of multicast MISO-OFDM systems

    Get PDF
    In this paper, we analyze the performance of multicast orthogonal frequency division multiplexing (OFDM) systems with single and multiple transmit antennas. We show that the resource allocation that includes the subcarrier allocation, bit loading, and the precoding vector selection in the multiple-input single-output (MISO) case is a difficult optimization problem. Consequently, we propose suboptimal algorithms based on the maximization of the sum data rate and the maximization of the minimum user data rate criteria. For practical application, we consider a complete transmission chain by combining powerful erasure codes with the proposed algorithms. Using this scheme, we guarantee that each user receives the same amount of information to decode the same data. Simulation results show that, for both single-input single-output (SISO)-OFDM and MISO-OFDM cases, the proposed multicast OFDM systems achieve gains over the worst user case algorithm.FP6-IYTE wireless project and Euripides European project SMAR
    corecore