基于大区域异构无线网络中移动基站的节点基数估计

Sachin Kadam, G. Kasbekar
{"title":"基于大区域异构无线网络中移动基站的节点基数估计","authors":"Sachin Kadam, G. Kasbekar","doi":"10.1109/SPCOM50965.2020.9179541","DOIUrl":null,"url":null,"abstract":"We consider the problem of estimation of the node cardinality of each node type in a heterogeneous wireless network with T types of nodes deployed over a large region, where $T\\geq 2$ is an integer. A mobile base station (MBS), such as that mounted on an unmanned aerial vehicle (UAV), is used in such cases since a single static base station is not sufficient to cover such a large region. The MBS moves around in the region, and makes multiple stops, and at the last stop, it is able to estimate the node cardinalities for the entire region. In this paper, we propose two schemes, viz., HSRC-MI and HSRC-M2, to rapidly estimate the number of nodes of each type. Both the schemes have two phases and they are performed at each stop. We prove that the node cardinality estimates computed using our proposed schemes equal and hence are as accurate as the estimates that would have been obtained if a well known estimation protocol designed for homogeneous networks in prior work is separately executed T times. Using simulations, we show that the numbers of slots required by the proposed schemes, viz., HSRC-MI and HSRCM2, for computing the node cardinality estimates are significantly less than the number of slots required for T separate executions of the above estimation protocol for homogeneous networks.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"238 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Node Cardinality Estimation Using a Mobile Base Station in a Heterogeneous Wireless Network Deployed Over a Large Region\",\"authors\":\"Sachin Kadam, G. Kasbekar\",\"doi\":\"10.1109/SPCOM50965.2020.9179541\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of estimation of the node cardinality of each node type in a heterogeneous wireless network with T types of nodes deployed over a large region, where $T\\\\geq 2$ is an integer. A mobile base station (MBS), such as that mounted on an unmanned aerial vehicle (UAV), is used in such cases since a single static base station is not sufficient to cover such a large region. The MBS moves around in the region, and makes multiple stops, and at the last stop, it is able to estimate the node cardinalities for the entire region. In this paper, we propose two schemes, viz., HSRC-MI and HSRC-M2, to rapidly estimate the number of nodes of each type. Both the schemes have two phases and they are performed at each stop. We prove that the node cardinality estimates computed using our proposed schemes equal and hence are as accurate as the estimates that would have been obtained if a well known estimation protocol designed for homogeneous networks in prior work is separately executed T times. Using simulations, we show that the numbers of slots required by the proposed schemes, viz., HSRC-MI and HSRCM2, for computing the node cardinality estimates are significantly less than the number of slots required for T separate executions of the above estimation protocol for homogeneous networks.\",\"PeriodicalId\":208527,\"journal\":{\"name\":\"2020 International Conference on Signal Processing and Communications (SPCOM)\",\"volume\":\"238 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on Signal Processing and Communications (SPCOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPCOM50965.2020.9179541\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Signal Processing and Communications (SPCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPCOM50965.2020.9179541","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

我们考虑了一个异构无线网络中每个节点类型的节点基数的估计问题,该网络在一个大的区域内部署了T个节点类型,其中$T\geq 2$是一个整数。在这种情况下,需要使用安装在无人机(UAV)上的移动基站(MBS),因为单个静态基站不足以覆盖如此大的区域。MBS在区域内移动,并进行多次停止,在最后一站,它能够估计整个区域的节点基数。在本文中,我们提出了HSRC-MI和HSRC-M2两种方案来快速估计每种类型的节点数量。这两种方案都有两个阶段,并在每个站点执行。我们证明,使用我们提出的方案计算的节点基数估计等于,因此与如果在先前的工作中为同质网络设计的众所周知的估计协议单独执行T次所获得的估计一样准确。通过模拟,我们表明,所提出的方案(即HSRC-MI和HSRCM2)用于计算节点基数估计所需的插槽数量明显少于在同质网络中单独执行上述估计协议所需的插槽数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Node Cardinality Estimation Using a Mobile Base Station in a Heterogeneous Wireless Network Deployed Over a Large Region
We consider the problem of estimation of the node cardinality of each node type in a heterogeneous wireless network with T types of nodes deployed over a large region, where $T\geq 2$ is an integer. A mobile base station (MBS), such as that mounted on an unmanned aerial vehicle (UAV), is used in such cases since a single static base station is not sufficient to cover such a large region. The MBS moves around in the region, and makes multiple stops, and at the last stop, it is able to estimate the node cardinalities for the entire region. In this paper, we propose two schemes, viz., HSRC-MI and HSRC-M2, to rapidly estimate the number of nodes of each type. Both the schemes have two phases and they are performed at each stop. We prove that the node cardinality estimates computed using our proposed schemes equal and hence are as accurate as the estimates that would have been obtained if a well known estimation protocol designed for homogeneous networks in prior work is separately executed T times. Using simulations, we show that the numbers of slots required by the proposed schemes, viz., HSRC-MI and HSRCM2, for computing the node cardinality estimates are significantly less than the number of slots required for T separate executions of the above estimation protocol for homogeneous networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信