By Topic

Incremental minimality: A property of optimal solutions for the minimum power broadcast tree problem in wireless ad hoc networks

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
$33 $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)
Manki Min ; Dept. of EECS, South Dakota State University, Brookings, SD 57007, USA ; C. Neupane Bipin

In this paper, we explore the structures of the optimal solutions for the minimum power broadcast tree problem in wireless ad hoc networks. We investigate the common properties of the optimal solutions found by the algorithms based on integer programming and use the found features to describe the property of optimal solutions. We also present a series of theoretically rigorous study of the found property, named as incremental minimality. We provide the conditions of optimal solutions represented by the incrementally minimal transmissions. An algorithm based on the found properties is introduced and compared with other algorithms in the literature by computational experiments.

Published in:

International Performance Computing and Communications Conference

Date of Conference:

9-11 Dec. 2010