By Topic

Minimum-Energy Multicast Using Random Linear Network Coding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ying Cai ; Dept. of Comput. Sci. & Technol., Beijing Inf. Sci. & Technol. Univ., Beijing, China ; Lina Zhang

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.

Published in:

Mobile Ad-hoc and Sensor Networks (MSN), 2011 Seventh International Conference on

Date of Conference:

16-18 Dec. 2011