Please use this identifier to cite or link to this item:
|Title:||Biased shortest path trees in wireless networks|
|Citation:||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|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 10, 2018
checked on Nov 24, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.