• DocumentCode
    2846895
  • Title

    Minimum-Energy Multicast Using Random Linear Network Coding

  • Author

    Cai, Ying ; Zhang, Lina

  • Author_Institution
    Dept. of Comput. Sci. & Technol., Beijing Inf. Sci. & Technol. Univ., Beijing, China
  • fYear
    2011
  • fDate
    16-18 Dec. 2011
  • Firstpage
    470
  • Lastpage
    474
  • Abstract
    Conventional routing ways of wireless multicast advantage application in reduce energy consumption is generally used to establish a "minimum-energy multicast tree" to achieve the minimum energy multicast. However, the problem of constructing a minimum-energy multicast tree in a wireless ad hoc network is NP-hard. By using network coding, this problem is transformed into linear or convex programming problem. In this paper, we adopt the description of minimum-energy multicast proposed by Wu, and transform the methods proposed by Shuling Che, at last, get a random linear network coding model based on wireless multicast advantage to achieve the minimum-energy multicast. Thus, it can get a better information flow distribution, and the energy consumption of each bit under the layered model is minimized.
  • Keywords
    ad hoc networks; convex programming; linear codes; multicast communication; network coding; optimisation; radio networks; telecommunication network routing; NP-hard; Shuling Che; convex programming; energy consumption reduction; linear programming; minimum-energy multicast; random linear network coding; wireless ad hoc network; wireless multicast advantage application; Ad hoc networks; Encoding; Energy consumption; Network coding; Receivers; Wireless networks; Minimum-Energy Multicast; Random Linear Network Coding; Wireless Multicast Advantage;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Mobile Ad-hoc and Sensor Networks (MSN), 2011 Seventh International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4577-2178-6
  • Type

    conf

  • DOI
    10.1109/MSN.2011.47
  • Filename
    6117467