On the critical total power for asymptotic k-connectivity in wireless networks

Honghai Zhang, J. Hou
{"title":"On the critical total power for asymptotic k-connectivity in wireless networks","authors":"Honghai Zhang, J. Hou","doi":"10.1109/INFCOM.2005.1497915","DOIUrl":null,"url":null,"abstract":"In this paper, we investigate the minimum total power (termed as critical total power) required to ensure asymptotic k-connectivity in heterogeneous wireless networks where nodes may transmit using different levels of power. We show that under the assumption that wireless nodes form a homogeneous Poisson point process with density /spl lambda/ on a unit square region [0, 1]/sup 2/ and the Toroidal model [M.D. Penrose, 1997], the critical total power required for maintaining k-connectivity is /spl theta/((/spl Gamma/(e/2+k))/((k-1)l)/spl lambda//sup 1-e/2/) with probability approaching one as /spl lambda/ goes to infinity, where e is the path loss exponent. Compared with the results that all nodes use a common critical transmission power for maintaining k-connectivity [M.D. Penrose, 1999], [P.-J. Wan and C. Yi, 2004], we show that the critical total power can be reduced by an order of (log /spl lambda/)e/2 by allowing nodes to optimally choose different levels of transmission power. This result is not subject to any specific power/topology control algorithm, but rather a fundamental property in wireless networks.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"86 1","pages":"466-476 vol. 1"},"PeriodicalIF":0.0000,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"47","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.2005.1497915","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 47

Abstract

In this paper, we investigate the minimum total power (termed as critical total power) required to ensure asymptotic k-connectivity in heterogeneous wireless networks where nodes may transmit using different levels of power. We show that under the assumption that wireless nodes form a homogeneous Poisson point process with density /spl lambda/ on a unit square region [0, 1]/sup 2/ and the Toroidal model [M.D. Penrose, 1997], the critical total power required for maintaining k-connectivity is /spl theta/((/spl Gamma/(e/2+k))/((k-1)l)/spl lambda//sup 1-e/2/) with probability approaching one as /spl lambda/ goes to infinity, where e is the path loss exponent. Compared with the results that all nodes use a common critical transmission power for maintaining k-connectivity [M.D. Penrose, 1999], [P.-J. Wan and C. Yi, 2004], we show that the critical total power can be reduced by an order of (log /spl lambda/)e/2 by allowing nodes to optimally choose different levels of transmission power. This result is not subject to any specific power/topology control algorithm, but rather a fundamental property in wireless networks.
无线网络渐近k-连通性的临界总功率
在本文中,我们研究了保证异构无线网络中节点可能使用不同水平的功率进行传输的渐近k-连通性所需的最小总功率(称为临界总功率)。假设无线节点在单位平方区域[0,1]/sup 2/上形成密度为/spl λ /的齐次泊松点过程,圆环模型[md . d .Penrose, 1997],维持k连接所需的临界总功率为/spl theta/((/spl Gamma/(e/2+k))/((k-1)l)/spl lambda//sup 1-e/2/),当/spl lambda/趋于无穷时,概率接近1,其中e为路径损耗指数。与所有节点使用一个共同的临界传输功率来维持k-连通性的结果相比[M.D.][j]; [j]。Wan和C. Yi, 2004],我们表明,通过允许节点最优地选择不同的传输功率水平,临界总功率可以降低一个数量级(log /spl lambda/)e/2。该结果不受任何特定功率/拓扑控制算法的影响,而是无线网络的基本特性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信