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...Show MoreMetadata
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.
Published in: Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.
Date of Conference: 17-19 October 2005
Date Added to IEEE Xplore: 31 October 2005
Print ISBN:0-7803-9428-3
Print ISSN: 1095-2055