By Topic

Energy Efficient Broadcast in Distributed Ad Hoc Wireless 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

1 Author(s)
Ghosh, S.K. ; Honeywell Technol. Solutions, Bangalore

In this work we present algorithms for minimum energy consumption broadcast subgraph (MECBS) problem. First, we focus on designing distributed algorithms for MECBS. To our knowledge, this is the first work looking into the aspects of designing a distributed approximation algorithm for the MECBS. Given input graph G = (V,E) with |V| = n, our algorithm has approximation ratio of 2Hn-1 with time complexity O(n ldrlambda(G)), where Hn is the nth Harmonic Number, and lambda(G) denotes the diameter of the graph G. Second, we present an improved sequential approximation algorithm for the MECBS problem with arbitrary asymmetric power requirement having performance ratio 1.5 (ln(n-1) + 1t), hence improving all known results for MECBS problem in most general case. Our improvement in MECBS problem also implies that there is a 1.5 ln(n-1) + 2.5 - approximation algorithm for strong connectivity with asymmetric power requirements.

Published in:

Computational Science and Engineering, 2008. CSE '08. 11th IEEE International Conference on

Date of Conference:

16-18 July 2008