| Abstract |
|
Recently, there have been papers indicating that the maximal
ratio combiner device can result in energy savings in
wireless ad hoc networks by using Hitch-hiking. We study
the Min-Energy Broadcast with Hitch-hiking problem, an
idealized version of broadcast using hitch-hiking, a problem
studied experimentally in the INFOCOM 2004 paper
of Agarwal et. al. Min-Energy Broadcast with Hitch-hiking
captures the maximum savings one can achieve in broadcasting
using maximal ratio combiners. We show that the
optimum of the classical Min-Energy Broadcast problem
is at most O(log2 n) times the optimum of Min-Energy
Broadcast with Hitch-hiking, where n is the number of
nodes in the networks. We show that this bound is tight up
to a constant. Moreover, the same bounds hold for Unicast.
|
 Additional Information
|
Citation:
Gruia Calinescu,
"Broadcast with Hitch-hiking in Wireless Ad-Hoc Networks (Invited Talk Abstract),"
snpd-sawn,
p. 225,
Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06),
2006
|
