Title: A new pruning method for efficient broadcasting in ad hoc networks

Authors: Michael Q. Rieck; Subhankar Dhar

Addresses: Drake University, Des Moines, IA, 50311, USA. ' San José State University, San José, CA, 95192, USA

Abstract: This paper proposes a new 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 the zone routing protocol. In this approach, every node must maintain as awareness of its k-hop neighbourhood, for some constant k ? 3. k-SPP dynamically discovers and exclusively uses forwarding paths having the property that every subpath of length k + 1 connects vertices that are a graph-theoretic distance k + 1 apart in the network graph. Experimental results demonstrate that k-SPP requires fewer transmissions than dominant pruning broadcasting.

Keywords: broadcast efficiency; flooding; pruning; ad hoc networks; routing protocols; broadcasting.

DOI: 10.1504/IJMNDI.2011.042562

International Journal of Mobile Network Design and Innovation, 2011 Vol.3 No.4, pp.209 - 217

Published online: 26 Mar 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article