优化组播路由以提高移动自组织网络的生存性

J. Thriveni, K.R. Vishwanath, V. Jayashree, S. Neelima, B. M. Parinitha, K. Sneha, K. Shaila, K. Venugopal, L. Patnaik
{"title":"优化组播路由以提高移动自组织网络的生存性","authors":"J. Thriveni, K.R. Vishwanath, V. Jayashree, S. Neelima, B. M. Parinitha, K. Sneha, K. Shaila, K. Venugopal, L. Patnaik","doi":"10.1109/ICCEE.2008.100","DOIUrl":null,"url":null,"abstract":"A Wireless Ad hoc Network consists of mobile nodes with energy constrained batteries. In this paper, we have proposed an Optimized Lifetime Multicast Tree (OLMT) algorithm that constructs a minimum energy multicast tree resulting in minimum total transmission power consumption,thereby increasing the lifetime of the network. We observe that, simulations carried on NS2 provides significant improvement in the number of multicast requests realised when compared with earlier works.","PeriodicalId":365473,"journal":{"name":"2008 International Conference on Computer and Electrical Engineering","volume":"57 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Optimized Multicast Routing for Improved Survivability of Mobile Ad Hoc Networks\",\"authors\":\"J. Thriveni, K.R. Vishwanath, V. Jayashree, S. Neelima, B. M. Parinitha, K. Sneha, K. Shaila, K. Venugopal, L. Patnaik\",\"doi\":\"10.1109/ICCEE.2008.100\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A Wireless Ad hoc Network consists of mobile nodes with energy constrained batteries. In this paper, we have proposed an Optimized Lifetime Multicast Tree (OLMT) algorithm that constructs a minimum energy multicast tree resulting in minimum total transmission power consumption,thereby increasing the lifetime of the network. We observe that, simulations carried on NS2 provides significant improvement in the number of multicast requests realised when compared with earlier works.\",\"PeriodicalId\":365473,\"journal\":{\"name\":\"2008 International Conference on Computer and Electrical Engineering\",\"volume\":\"57 \",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Computer and Electrical Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCEE.2008.100\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Computer and Electrical Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCEE.2008.100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

无线自组织网络由具有能量限制电池的移动节点组成。本文提出了一种优化生存期组播树(OLMT)算法,该算法构造能量最小的组播树,使总传输功耗最小,从而提高网络的生存期。我们观察到,与早期的工作相比,在NS2上进行的模拟在实现的多播请求数量方面提供了显着的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimized Multicast Routing for Improved Survivability of Mobile Ad Hoc Networks
A Wireless Ad hoc Network consists of mobile nodes with energy constrained batteries. In this paper, we have proposed an Optimized Lifetime Multicast Tree (OLMT) algorithm that constructs a minimum energy multicast tree resulting in minimum total transmission power consumption,thereby increasing the lifetime of the network. We observe that, simulations carried on NS2 provides significant improvement in the number of multicast requests realised when compared with earlier works.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信