Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
THE MINIMUM POWER BROADCAST PROBLEM IN WIRELESS NETWORKS : AN ANT COLONY SYSTEM APPROACH
 

Summary: THE MINIMUM POWER BROADCAST PROBLEM IN WIRELESS
NETWORKS : AN ANT COLONY SYSTEM APPROACH
Short Paper
Arindam K. Das, Robert J. Marks, Mohamed El-Sharkawi, Payman Arabshahi, Andrew Gray
ABSTRACT
Wireless multicast/broadcast sessions, unlike wired net-
works, inherently reaches several nodes with a single trans-
mission. For omnidirectional wireless broadcast to a node, all
nodes closer will also be reached. Heuristics for constructing
minimum power trees in wireless networks have been proposed
by Wieselthier et al [1] and Stojmenovic et al [2]. In this pa-
per, we present an Ant Colony System algorithm for solving the
minimum power broadcast (MPB) trees in wireless networks.
Experiments on randomly generated 10, 25 and 50-node net-
works indicate that significantly better results can be obtained
using the proposed algorithm, and in very little computation
time.
I. INTRODUCTION
Broadcasting/multicasting in wireless networks is fun-
damentally different as compared to wired networks, since

  

Source: Arabshahi, Payman - Applied Physics Laboratory & Department of Electrical Engineering, University of Washington at Seattle

 

Collections: Engineering