• DocumentCode
    153891
  • Title

    Maximizing Multicast Throughput in a Single-Hop Multi-channel Wireless Network

  • Author

    Wasserman, David R. ; Hulbert, Douglas S.

  • Author_Institution
    Space & Naval Warfare Syst. Center Pacific, San Diego, CA, USA
  • fYear
    2014
  • fDate
    6-8 Oct. 2014
  • Firstpage
    1207
  • Lastpage
    1212
  • Abstract
    This paper studies multicast traffic in a wireless network in which all nodes are within communication range of each other and share multiple independent channels. A node in this network cannot simultaneously transmit and receive, and can only transmit on one channel at a time, but when not transmitting it can simultaneously receive all channels. It is shown that increased throughput may be achieved by using erasure coding, which eliminates the requirement that all recipients listen at the same time. For any given set of multicast sessions, throughput may be optimized subject to a fairness constraint by solving a certain linear programming problem.
  • Keywords
    linear programming; multicast communication; telecommunication traffic; wireless channels; erasure coding; linear programming problem; multicast throughput maximization; multicast traffic; single-hop multi-channel wireless network; Encoding; Linear programming; Reed-Solomon codes; Schedules; Throughput; Vectors; Wireless networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Military Communications Conference (MILCOM), 2014 IEEE
  • Conference_Location
    Baltimore, MD
  • Type

    conf

  • DOI
    10.1109/MILCOM.2014.202
  • Filename
    6956922