DocumentCode :
2276555
Title :
A practical spanning tree based MANET routing algorithm
Author :
Peng, Wuxu ; Li, Zhuojing ; Haddix, Furman
Author_Institution :
Dept. of Comput. Sci., Texas State Univ., San Marcos, TX, USA
fYear :
2005
fDate :
17-19 Oct. 2005
Firstpage :
19
Lastpage :
24
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.
Keywords :
ad hoc networks; mobile radio; telecommunication network routing; trees (mathematics); LCMRMGCS; MANET; mobile ad hoc network; spanning tree based routing algorithm; Computer crashes; Computer science; Costs; Degradation; Mobile ad hoc networks; Network topology; Routing protocols; Statistics; Telecommunication traffic; Time factors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Communications and Networks, 2005. ICCCN 2005. Proceedings. 14th International Conference on
ISSN :
1095-2055
Print_ISBN :
0-7803-9428-3
Type :
conf
DOI :
10.1109/ICCCN.2005.1523799
Filename :
1523799
Link To Document :
بازگشت