| | |
Summary: Minimum Power Broadcast Trees for Wireless Networks:
Optimizing Using the Viability Lemma
Arindam K. Das, Robert J. Marks, Mohamed El-Sharkawi
Department of Electrical Engineering
University of Washington
Box 352500
Seattle, WA 98195.
Payman Arabshahi, Andrew Gray
Jet Propulsion Laboratory
4800 Oak Grove Drive, MS 238-343
Pasadena, CA 91109.
Abstract-- Wireless multicast/broadcast sessions, unlike wired
networks, inherently reaches several nodes with a single transmis-
sion. For omnidirectional wireless broadcast to a node, all nodes
closer will also be reached. An algorithm for constructing the
minimum power tree in wireless networks was first proposed by
Wieselthier Ø Ð. The ÖÓ ×Ø Ò Ö Ñ ÒØ Ð ÔÓÛ Ö (BIP) al-
gorithm suggested by them is a "node-based" minimum-cost tree
algorithm for wireless networks. We propose an alternate search
based paradigm wherein minimum-cost trees in wireless networks
|
