Please use this identifier to cite or link to this item: https://doi.org/10.1109/PCCC.2011.6108114
Title: Biased shortest path trees in wireless networks
Authors: Malhotra, B.
Nikolaidis, I.
Nascimento, M.A.
Bressan, S. 
Issue Date: 2011
Source: Malhotra, B.,Nikolaidis, I.,Nascimento, M.A.,Bressan, S. (2011). Biased shortest path trees in wireless networks. Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference. ScholarBank@NUS Repository. https://doi.org/10.1109/PCCC.2011.6108114
Abstract: 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. © 2011 IEEE.
Source Title: Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference
URI: http://scholarbank.nus.edu.sg/handle/10635/41393
ISBN: 9781467300100
DOI: 10.1109/PCCC.2011.6108114
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

1
checked on Dec 13, 2017

Page view(s)

55
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.