A new pruning method for efficient broadcasting in ad hoc networks

摘要: This paper proposes a new multi-hop wireless broadcast method called k-shortest path pruning (k-SPP). It is based on the dominant of Lim and Kim, improves upon it in context certain routing protocols, such as zone protocol. In this approach, every node must maintain awareness its k-hop neighbourhood, for some constant k ? 3. k-SPP dynamically discovers exclusively uses forwarding paths having property that subpath length + 1 connects vertices are graph-theoretic distance apart network graph. Experimental results demonstrate requires fewer transmissions than broadcasting.