In this paper, we proposed a multi-hop wireless broadcast method called k-Shortest Path Pruning (k-SPP). It is based on the Dominant Pruning method of Lim and Kim, and improves upon it in the context of certain routing protocols, such as Zone Routing Protocol. In our approach, every node must know about its k-hop neighborhood, for some constant k ≥ 3. Experimental results demonstrate that our technique requires fewer transmissions than Dominant Pruning broadcasting. © 2010 Springer.
CITATION STYLE
Rieck, M. Q., & Dhar, S. (2010). Efficient multi-hop broadcasting in wireless networks using k-shortest path pruning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5935 LNCS, pp. 283–294). https://doi.org/10.1007/978-3-642-11322-2_30
Mendeley helps you to discover research relevant for your work.