Multicast Tree Computation for Group Communication in Mobile Networks using Optimization Techniques

N. Gopalan, C. Mala, R. Shriram, S. Agarwal
{"title":"Multicast Tree Computation for Group Communication in Mobile Networks using Optimization Techniques","authors":"N. Gopalan, C. Mala, R. Shriram, S. Agarwal","doi":"10.1109/ISAHUC.2006.4290653","DOIUrl":null,"url":null,"abstract":"Modern group communication based applications require multiple parameters to be considered for routing in a Cellular network. Traditional algorithms fail in the situations where these parameters frequently change due to the dynamism prevailing in the network. A new technique for topology discovery in these types of networks using ant colony optimization (ACO) has been proposed based on the restricted flooding principle. To provide a better quality of service in routing with multiple constraints, a genetic algorithm based routing has been proposed to find optimal routes within a shorter span of time than the traditional deterministic routing algorithms. Moreover, with the exponential growth in the number of mobile users, to enable a large number of users to participate in a group communication, a parallel genetic algorithm (GA) is proposed in this paper. Our simulation results show that the topology discovery using ant colony optimization is faster. The Call service rate using parallel genetic algorithm is more than that of sequential genetic algorithm and the Call blocking rate of parallel genetic algorithm is less than that of sequential genetic algorithm, for large number of routers in the network.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISAHUC.2006.4290653","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Modern group communication based applications require multiple parameters to be considered for routing in a Cellular network. Traditional algorithms fail in the situations where these parameters frequently change due to the dynamism prevailing in the network. A new technique for topology discovery in these types of networks using ant colony optimization (ACO) has been proposed based on the restricted flooding principle. To provide a better quality of service in routing with multiple constraints, a genetic algorithm based routing has been proposed to find optimal routes within a shorter span of time than the traditional deterministic routing algorithms. Moreover, with the exponential growth in the number of mobile users, to enable a large number of users to participate in a group communication, a parallel genetic algorithm (GA) is proposed in this paper. Our simulation results show that the topology discovery using ant colony optimization is faster. The Call service rate using parallel genetic algorithm is more than that of sequential genetic algorithm and the Call blocking rate of parallel genetic algorithm is less than that of sequential genetic algorithm, for large number of routers in the network.
基于优化技术的移动网络组播树计算
现代基于组通信的应用需要考虑蜂窝网络中路由的多个参数。传统的算法在这些参数频繁变化的情况下,由于网络中普遍存在的动态性而失效。基于限制泛洪原理,提出了一种基于蚁群优化的网络拓扑发现新方法。为了在多约束路由中提供更好的服务质量,提出了一种基于遗传算法的路由算法,该算法比传统的确定性路由算法在更短的时间内找到最优路由。此外,随着移动用户数量呈指数级增长,为了使大量用户参与群组通信,本文提出了一种并行遗传算法(GA)。仿真结果表明,采用蚁群算法进行拓扑发现具有较快的速度。当网络中路由器数量较多时,并行遗传算法的呼叫服务率大于顺序遗传算法,并行遗传算法的呼叫阻塞率小于顺序遗传算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信