一种实用的基于生成树的MANET路由算法

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI:10.1109/ICCCN.2005.1523799

W. Peng, Zhuo Li, F. Haddix

{"title":"一种实用的基于生成树的MANET路由算法","authors":"W. Peng, Zhuo Li, F. Haddix","doi":"10.1109/ICCCN.2005.1523799","DOIUrl":null,"url":null,"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.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A practical spanning tree based MANET routing algorithm\",\"authors\":\"W. Peng, Zhuo Li, F. Haddix\",\"doi\":\"10.1109/ICCCN.2005.1523799\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":379037,\"journal\":{\"name\":\"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2005.1523799\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2005.1523799","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

提出了一种新的、实用的基于生成树的移动自组网路由算法。该算法名为LCMRMGCS，扩展并显著增强了w.p eng al.，(2003)先前提出的LCMRMG MANET路由算法。LCMRMGCS MANET中的主机形成不重叠的树。仿真结果表明，LCMRMGCS在维护成本和交付率方面始终优于LCMRMG。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A practical spanning tree based MANET routing algorithm

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.

自引率

0.00%

发文量