loading...
Broadcast with Hitch-hiking in Wireless Ad-Hoc Networks (Invited Talk Abstract)
Las Vegas, Nevada June 19-June 20
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SNPD-SAWN.2006.25Seventh ACIS International Conference ...
 This Article 
 
PURCHASE ARTICLE: $0
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Gruia Calinescu, "Broadcast with Hitch-hiking in Wireless Ad-Hoc Networks (Invited Talk Abstract)," Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, International Conference on & Self-Assembling Wireless Networks, International Workshop on, pp. 225, Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/SNPD-SAWN.2006.25,
author = {Gruia Calinescu},
title = {Broadcast with Hitch-hiking in Wireless Ad-Hoc Networks (Invited Talk Abstract)},
journal ={Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, International Conference on & Self-Assembling Wireless Networks, International Workshop on},
volume = {0},
year = {2006},
isbn = {0-7695-2611-X},
pages = {225},
doi = {http://doi.ieeecomputersociety.org/10.1109/SNPD-SAWN.2006.25},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, International Conference on & Self-Assembling Wireless Networks, International Workshop on
TI - Broadcast with Hitch-hiking in Wireless Ad-Hoc Networks (Invited Talk Abstract)
SN - 0-7695-2611-X
SP
EP
A1 - Gruia Calinescu,
PY - 2006
KW - null
VL - 0
JA - Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, International Conference on & Self-Assembling Wireless Networks, International Workshop on
ER -
 
Gruia Calinescu, Illinois Institute of Technology
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.
Citation:
Gruia Calinescu, "Broadcast with Hitch-hiking in Wireless Ad-Hoc Networks (Invited Talk Abstract)," snpd-sawn, pp.225, Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.