A practical spanning tree based MANET routing algorithm

Abstract

We present a new and practical spanning tree based routing algorithm for mobile ad hoc networks (MANET). The algorithm, named LCMRMGCS, extends and significantly enhances the LCMRMG MANET routing algorithm previously proposed in W. Peng et al., (2003). Hosts in a LCMRMGCS MANET form non-overlapping trees. Our simulation results show that LCMRMGCS consistently outperforms LCMRMG in both maintenance cost and delivery ratio.