Energy efficient minimum connected dominating set algorithm for MANETs

Chakradhar P Research, P Yogesh
{"title":"Energy efficient minimum connected dominating set algorithm for MANETs","authors":"Chakradhar P Research, P Yogesh","doi":"10.1109/ICRTIT.2013.6844215","DOIUrl":null,"url":null,"abstract":"In this paper we proposed a new Minimum Connected Dominating Set [MCDS] algorithm. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem[1]. The connected dominating set (CDS) is widely used as a virtual backbone in mobile ad-hoc networks. Here the MCDS is a distributed algorithm based on Unit Disk Graph[7]. The node's mobility and residual energy are considered as parameters in construction of stable MCDS. The time complexity of this algorithm is O(n) and the message complexity is O(n). The performance evaluation of this algorithm yields better results in dense networks as well as sparse networks. Size of the MCDS is also small compared to other distributed algorithms[8][9][10].","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRTIT.2013.6844215","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this paper we proposed a new Minimum Connected Dominating Set [MCDS] algorithm. This algorithm achieves energy efficiency by minimizing the Broadcast Storm Problem[1]. The connected dominating set (CDS) is widely used as a virtual backbone in mobile ad-hoc networks. Here the MCDS is a distributed algorithm based on Unit Disk Graph[7]. The node's mobility and residual energy are considered as parameters in construction of stable MCDS. The time complexity of this algorithm is O(n) and the message complexity is O(n). The performance evaluation of this algorithm yields better results in dense networks as well as sparse networks. Size of the MCDS is also small compared to other distributed algorithms[8][9][10].
能源高效的最小连接控制集算法
本文提出了一种新的最小连通支配集算法。该算法通过最小化广播风暴问题来实现能源效率[1]。连接支配集(CDS)作为虚拟骨干网在移动自组网中得到了广泛的应用。这里的MCDS是一种基于单位磁盘图的分布式算法[7]。将节点的迁移率和剩余能量作为构建稳定MCDS的参数。该算法的时间复杂度为O(n),消息复杂度为O(n)。该算法的性能评估在密集网络和稀疏网络中都取得了较好的结果。与其他分布式算法相比,MCDS的大小也较小[8][9][10]。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信