This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
30th IEEE International Performance Computing and Communications Conference
Biased shortest path trees in wireless networks
Orlando, FL, USA
November 17-November 19
ISBN: 978-1-4673-0010-0
ASCII Text
x 
 
Baljeet Malhotra, Ioanis Nikolaidis, Mario A. Nascimento, Stephane Bressan, "Biased shortest path trees in wireless networks," IEEE International Performance Computing and Communications Conference, pp. 1-6, 30th IEEE International Performance Computing and Communications Conference, 2011.
 
 
BibTex
x
 
@article{ 10.1109/PCCC.2011.6108114,
author = {Baljeet Malhotra and Ioanis Nikolaidis and Mario A. Nascimento and Stephane Bressan},
title = {Biased shortest path trees in wireless networks},
journal ={IEEE International Performance Computing and Communications Conference},
volume = {0},
year = {2011},
isbn = {978-1-4673-0010-0},
pages = {1-6},
doi = {http://doi.ieeecomputersociety.org/10.1109/PCCC.2011.6108114},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - IEEE International Performance Computing and Communications Conference
TI - Biased shortest path trees in wireless networks
SN - 978-1-4673-0010-0
SP1
EP6
A1 - Baljeet Malhotra,
A1 - Ioanis Nikolaidis,
A1 - Mario A. Nascimento,
A1 - Stephane Bressan,
PY - 2011
VL - 0
JA - IEEE International Performance Computing and Communications Conference
ER -
 
Baljeet Malhotra, Centre for Maritime Studies National Univ. of Singapore
Ioanis Nikolaidis, Dept. of Computing Science, Univ. of Alberta, Canada
Mario A. Nascimento, Dept. of Computing Science, Univ. of Alberta, Canada
Stephane Bressan, School of Computing, National Univ. of Singapore
Broadcasting is an elementary problem in wireless networks. Energy -- efficient broadcasting is important, e.g., to coordinate the distributed computing operations by sending periodic messages in a network of Automatic Identification System installed on energy constrained maritime lighthouses. To that end logical tree topologies that are based on Connected Dominating Sets have been proposed vigorously in the literature. In this paper we present Biased Shortest Path Tree (BISPT), a new logical tree topology for efficient broadcasting in wireless networks. In simulations we find that BISPT outperforms state-of-the-art solutions.
Citation:
Baljeet Malhotra, Ioanis Nikolaidis, Mario A. Nascimento, Stephane Bressan, "Biased shortest path trees in wireless networks," pccc, pp.1-6, 30th IEEE International Performance Computing and Communications Conference, 2011
Usage of this product signifies your acceptance of the Terms of Use.