IEEE International Performance Computing and Communications Conference (2011)
Orlando, FL, USA
Nov. 17, 2011 to Nov. 19, 2011
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.
S. Bressan, I. Nikolaidis, M. A. Nascimento and B. Malhotra, "Biased shortest path trees in wireless networks," IEEE International Performance Computing and Communications Conference(PCCC), Orlando, FL, USA, 2011, pp. 1-6.