一种基于簇的无线自组织网络拓扑控制算法

A. Sarrafi, M. H. Firooz, Hassan Barjini
{"title":"一种基于簇的无线自组织网络拓扑控制算法","authors":"A. Sarrafi, M. H. Firooz, Hassan Barjini","doi":"10.1109/ICSNC.2006.1","DOIUrl":null,"url":null,"abstract":"This paper proposes a topology control algorithm for Ad-Hoc networks which have a large scale structure and widely distributed nodes. One of the main problems in topology control is power efficiency with consideration of connectivity. The proposed algorithm is aimed to find a topology with near optimum power consumption within reasonable convergence time. While game theory is exploited to prove convergence property of proposed algorithm, clustering concept is employed to reduce convergence time with the aid of parallel processing.","PeriodicalId":217322,"journal":{"name":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Cluster Based Topology Control Algorithm for Wireless Ad-Hoc Networks\",\"authors\":\"A. Sarrafi, M. H. Firooz, Hassan Barjini\",\"doi\":\"10.1109/ICSNC.2006.1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a topology control algorithm for Ad-Hoc networks which have a large scale structure and widely distributed nodes. One of the main problems in topology control is power efficiency with consideration of connectivity. The proposed algorithm is aimed to find a topology with near optimum power consumption within reasonable convergence time. While game theory is exploited to prove convergence property of proposed algorithm, clustering concept is employed to reduce convergence time with the aid of parallel processing.\",\"PeriodicalId\":217322,\"journal\":{\"name\":\"2006 International Conference on Systems and Networks Communications (ICSNC'06)\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Conference on Systems and Networks Communications (ICSNC'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSNC.2006.1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Conference on Systems and Networks Communications (ICSNC'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSNC.2006.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

针对结构庞大、节点分布广泛的Ad-Hoc网络,提出了一种拓扑控制算法。拓扑控制中的一个主要问题是考虑连通性的功率效率。该算法的目标是在合理的收敛时间内找到接近最优功耗的拓扑结构。在利用博弈论证明算法收敛性的同时,利用聚类的概念通过并行处理来缩短收敛时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Cluster Based Topology Control Algorithm for Wireless Ad-Hoc Networks
This paper proposes a topology control algorithm for Ad-Hoc networks which have a large scale structure and widely distributed nodes. One of the main problems in topology control is power efficiency with consideration of connectivity. The proposed algorithm is aimed to find a topology with near optimum power consumption within reasonable convergence time. While game theory is exploited to prove convergence property of proposed algorithm, clustering concept is employed to reduce convergence time with the aid of parallel processing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信