By Topic

Minimum hop multicasting in broadcast wireless networks with omni-directional antennas

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)
A. K. Das ; Dept. of Electr. Eng., Univ. of Washington, Seattle, WA, USA ; M. El-Sharkawi

We consider the problem of minimum-hop multicasting in wireless networks. We first present a mixed integer linear programming model of the problem, followed by a discussion of a (sub-optimal) sequential shortest path heuristic algorithm with "node unwrapping". This sequential algorithm is amenable to distributed implementation. The node unwrapping part of the algorithm is used to modify the weight matrix of the underlying graph after each iteration and exploits the inherently broadcast nature of wireless transmissions. Simulation results are presented which indicate that reasonably good solutions can be obtained using the proposed heuristic algorithm.

Published in:

Military Communications Conference, 2004. MILCOM 2004. 2004 IEEE  (Volume:2 )

Date of Conference:

31 Oct.-3 Nov. 2004