manet中连通控制集构造的改进算法

O. Chaturvedi, Parmeet Kaur, Nishtha Ahuja, T. Prakash
{"title":"manet中连通控制集构造的改进算法","authors":"O. Chaturvedi, Parmeet Kaur, Nishtha Ahuja, T. Prakash","doi":"10.1109/CONFLUENCE.2016.7508182","DOIUrl":null,"url":null,"abstract":"The paper proposes two distributed algorithms for the construction of a connected dominating set (CDS) in a mobile ad hoc network. The CDS can be used as a virtual backbone for efficient communication in the ad hoc networks and consequently allow scalability of distributed algorithms implemented for these networks. The proposed algorithms organize the entire network topology into clusters and the CDS is formed out of the nodes acting as the cluster heads (CHs). The paper proposes improvements in some existing algorithms to yield a smaller sized CDS or cause a low message overhead during CDS construction. The simulation results verify the effectiveness of the proposed algorithms as compared to the existing algorithms.","PeriodicalId":299044,"journal":{"name":"2016 6th International Conference - Cloud System and Big Data Engineering (Confluence)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Improved algorithms for construction of connected dominating set in MANETs\",\"authors\":\"O. Chaturvedi, Parmeet Kaur, Nishtha Ahuja, T. Prakash\",\"doi\":\"10.1109/CONFLUENCE.2016.7508182\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper proposes two distributed algorithms for the construction of a connected dominating set (CDS) in a mobile ad hoc network. The CDS can be used as a virtual backbone for efficient communication in the ad hoc networks and consequently allow scalability of distributed algorithms implemented for these networks. The proposed algorithms organize the entire network topology into clusters and the CDS is formed out of the nodes acting as the cluster heads (CHs). The paper proposes improvements in some existing algorithms to yield a smaller sized CDS or cause a low message overhead during CDS construction. The simulation results verify the effectiveness of the proposed algorithms as compared to the existing algorithms.\",\"PeriodicalId\":299044,\"journal\":{\"name\":\"2016 6th International Conference - Cloud System and Big Data Engineering (Confluence)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 6th International Conference - Cloud System and Big Data Engineering (Confluence)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CONFLUENCE.2016.7508182\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 6th International Conference - Cloud System and Big Data Engineering (Confluence)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONFLUENCE.2016.7508182","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

针对移动自组网中连接支配集的构造问题,提出了两种分布式算法。CDS可以用作自组织网络中有效通信的虚拟主干,从而允许为这些网络实现的分布式算法的可扩展性。提出的算法将整个网络拓扑组织成簇,CDS由作为簇头(CHs)的节点组成。本文提出了一些现有算法的改进,以产生更小的CDS或在CDS构建过程中降低消息开销。仿真结果验证了所提算法与现有算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improved algorithms for construction of connected dominating set in MANETs
The paper proposes two distributed algorithms for the construction of a connected dominating set (CDS) in a mobile ad hoc network. The CDS can be used as a virtual backbone for efficient communication in the ad hoc networks and consequently allow scalability of distributed algorithms implemented for these networks. The proposed algorithms organize the entire network topology into clusters and the CDS is formed out of the nodes acting as the cluster heads (CHs). The paper proposes improvements in some existing algorithms to yield a smaller sized CDS or cause a low message overhead during CDS construction. The simulation results verify the effectiveness of the proposed algorithms as compared to the existing algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信