Cart (Loading....) | Create Account
Close category search window
 

Virtual Center: A characteristic of minimum power broadcast trees 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
$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)
Min, M. ; Dept. of Electr. Eng. & Comput. Sci., South Dakota State Univ., Brookings, SD, USA ; Neupane, B.C.

In this paper, we explore the structure of optimal solutions of minimum power broadcast tree problem in wireless ad hoc networks and present a new algorithm based on the findings. Our previous work shows that the optimal solutions have common characteristic (Incremental Minimality) which makes it reasonable to design an incremental algorithm to find the minimum power broadcast trees. In this work, we identify one more characteristic (Virtual Center) which complements the incremental minimality. The optimal solutions tend to have a major subtree which can be obtained by an incremental method starting from a center node which may not be the source node of the broadcast. Our finding is about the center node (called as virtual center) and the major subtree (called as virtually centered subtree) rooted at the virtual center. We propose a new algorithm which is based on the concept of virtual center by dynamically changing the center to find the best candidate for the virtual center. The proposed algorithm effectively utilizes the Virtual Center characteristic and the empirical computation results support the validity of the characteristic by superior performance compared to algorithms in literature.

Published in:

Performance Computing and Communications Conference (IPCCC), 2009 IEEE 28th International

Date of Conference:

14-16 Dec. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.