| | |
Summary: MINIMUM HOP MULTICASTING IN BROADCAST WIRELESS NETWORKS
WITH OMNI-DIRECTIONAL ANTENNAS
Arindam K. Das, Mohamed El-Sharkawi
Department of Electrical Engineering
University of Washington, Box 352500, Seattle, WA 98195.
email: {arindam,elsharkawi}@ee.washington.edu
Robert J. Marks
Rogers Engineering and Computer Science Building
Baylor University, 1311 S. 5th Street, Waco, TX 76798-7356.
email: Robert Marks@Baylor.edu
Payman Arabshahi, Andrew Gray
Jet Propulsion Laboratory
4800 Oak Grove Drive, MS 238-343, Pasadena, CA 91109.
email: {payman,gray}@jpl.nasa.gov
ABSTRACT
In this paper, 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 sequen-
|
