26
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Three Schemes for Wireless Coded Broadcast to Heterogeneous Users

      Preprint
      , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          We study and compare three coded schemes for single-server wireless broadcast of multiple description coded content to heterogeneous users. The users (sink nodes) demand different number of descriptions over links with different packet loss rates. The three coded schemes are based on the LT codes, growth codes, and randomized chunked codes. The schemes are compared on the basis of the total number of transmissions required to deliver the demands of all users, which we refer to as the server (source) delivery time. We design the degree distributions of LT codes by solving suitably defined linear optimization problems, and numerically characterize the achievable delivery time for different coding schemes. We find that including a systematic phase (uncoded transmission) is significantly beneficial for scenarios with low demands, and that coding is necessary for efficiently delivering high demands. Different demand and error rate scenarios may require very different coding schemes. Growth codes and chunked codes do not perform as well as optimized LT codes in the heterogeneous communication scenario.

          Related collections

          Most cited references10

          • Record: found
          • Abstract: not found
          • Article: not found

          Raptor codes

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            General broadcast channels with degraded message sets

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Birthday paradox, coupon collectors, caching algorithms and self-organizing search

                Bookmark

                Author and article information

                Journal
                18 May 2012
                Article
                1205.4233
                15fab955-9105-415e-95e9-c56b3b60398e

                http://creativecommons.org/licenses/by-nc-sa/3.0/

                History
                Custom metadata
                accepted by Elsevier PhyCom NetCod Special Issue
                cs.NI cs.IT math.IT

                Comments

                Comment on this article