一种构建高能效无线自组网的拓扑控制算法

Szu-Chi Wang, David S. L. Wei, S. Kuo
{"title":"一种构建高能效无线自组网的拓扑控制算法","authors":"Szu-Chi Wang, David S. L. Wei, S. Kuo","doi":"10.1109/GLOCOM.2003.1258446","DOIUrl":null,"url":null,"abstract":"In this paper, we present a localized algorithm for constructing power efficient topology for wireless ad hoc networks. Each mobile node determines its own transmission power based only on local information. The proposed algorithm first constructs the constrained Gabriel graph from the given unit disk graph and then reduces the total transmission power by allowing each node individually excises some replaceable links. The constructed topology is sparse, has a constant bounded power stretch factor, and the total transmission power is lower than those obtained from other proposed algorithms. In addition, compared with others, our algorithm requires lower time complexity to generate a solution, and can thus further save the energy for each mobile node. We demonstrate the performance improvements of our algorithm through simulations.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"A topology control algorithm for constructing power efficient wireless ad hoc networks\",\"authors\":\"Szu-Chi Wang, David S. L. Wei, S. Kuo\",\"doi\":\"10.1109/GLOCOM.2003.1258446\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a localized algorithm for constructing power efficient topology for wireless ad hoc networks. Each mobile node determines its own transmission power based only on local information. The proposed algorithm first constructs the constrained Gabriel graph from the given unit disk graph and then reduces the total transmission power by allowing each node individually excises some replaceable links. The constructed topology is sparse, has a constant bounded power stretch factor, and the total transmission power is lower than those obtained from other proposed algorithms. In addition, compared with others, our algorithm requires lower time complexity to generate a solution, and can thus further save the energy for each mobile node. We demonstrate the performance improvements of our algorithm through simulations.\",\"PeriodicalId\":301154,\"journal\":{\"name\":\"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2003.1258446\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2003.1258446","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

摘要

在本文中,我们提出了一种局部算法来构建无线自组织网络的节能拓扑结构。每个移动节点仅根据本地信息确定自己的传输功率。该算法首先从给定的单元磁盘图构造约束的Gabriel图,然后通过允许每个节点单独切除一些可替换的链路来降低总传输功率。所构建的拓扑结构稀疏,具有恒定的有界功率拉伸因子,并且总传输功率低于其他算法。此外,与其他算法相比,我们的算法生成解所需的时间复杂度更低,从而进一步节省了每个移动节点的能量。通过仿真验证了算法的性能改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A topology control algorithm for constructing power efficient wireless ad hoc networks
In this paper, we present a localized algorithm for constructing power efficient topology for wireless ad hoc networks. Each mobile node determines its own transmission power based only on local information. The proposed algorithm first constructs the constrained Gabriel graph from the given unit disk graph and then reduces the total transmission power by allowing each node individually excises some replaceable links. The constructed topology is sparse, has a constant bounded power stretch factor, and the total transmission power is lower than those obtained from other proposed algorithms. In addition, compared with others, our algorithm requires lower time complexity to generate a solution, and can thus further save the energy for each mobile node. We demonstrate the performance improvements of our algorithm through simulations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信