具有集群中心数据采集器的集群无线传感器网络中的干扰和中断

Hung-Yun Hsieh, Hong-Chen Huang
{"title":"具有集群中心数据采集器的集群无线传感器网络中的干扰和中断","authors":"Hung-Yun Hsieh, Hong-Chen Huang","doi":"10.1109/ICCCHINA.2018.8641162","DOIUrl":null,"url":null,"abstract":"In many wireless sensor networks, the distribution of sensor nodes involved in data transmission may be clustered as induced by the underlying geographical factor or protocol design. Instead of using the homogeneous Poisson Point Process (PPP), related work has investigated the Poisson Cluster Process (PCP) for modeling the location distribution of sensor nodes and obtaining analytical results such as the aggregate interference and outage probability for such networks. Many research endeavors, however, assume that data collectors are randomly deployed independently of the sensor nodes. While such an assumption lends itself for mathematical tractability, it is not typically how data collectors are deployed to relay data from sensor nodes to the backbone network. To address this pitfall, in this paper we consider the scenario where data collectors are deployed at the centers, or parent points, of the clusters in PCP. Since the locations of data collectors and sensor nodes are correlated, the independence assumption adopted in most related work cannot be applied. We first derive the analytical expression of the Laplace transform of the aggregate interference at each data collector and then obtain the closed-form lower bound of the transmission success probability for each sensor node to transmit data to the nearby data collector. Numerical evaluation shows that the derived lower bound matches the simulation results very well. In addition, we have also shown that placing data collectors at cluster centers, while mathematically involved for analysis, can achieve significant performance gain compared to conventional scenarios where data collectors and sensor nodes are distributed independently without any coordination.","PeriodicalId":170216,"journal":{"name":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Interference and Outage in Clustered Wireless Sensor Networks with Cluster-Centric Data Collectors\",\"authors\":\"Hung-Yun Hsieh, Hong-Chen Huang\",\"doi\":\"10.1109/ICCCHINA.2018.8641162\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In many wireless sensor networks, the distribution of sensor nodes involved in data transmission may be clustered as induced by the underlying geographical factor or protocol design. Instead of using the homogeneous Poisson Point Process (PPP), related work has investigated the Poisson Cluster Process (PCP) for modeling the location distribution of sensor nodes and obtaining analytical results such as the aggregate interference and outage probability for such networks. Many research endeavors, however, assume that data collectors are randomly deployed independently of the sensor nodes. While such an assumption lends itself for mathematical tractability, it is not typically how data collectors are deployed to relay data from sensor nodes to the backbone network. To address this pitfall, in this paper we consider the scenario where data collectors are deployed at the centers, or parent points, of the clusters in PCP. Since the locations of data collectors and sensor nodes are correlated, the independence assumption adopted in most related work cannot be applied. We first derive the analytical expression of the Laplace transform of the aggregate interference at each data collector and then obtain the closed-form lower bound of the transmission success probability for each sensor node to transmit data to the nearby data collector. Numerical evaluation shows that the derived lower bound matches the simulation results very well. In addition, we have also shown that placing data collectors at cluster centers, while mathematically involved for analysis, can achieve significant performance gain compared to conventional scenarios where data collectors and sensor nodes are distributed independently without any coordination.\",\"PeriodicalId\":170216,\"journal\":{\"name\":\"2018 IEEE/CIC International Conference on Communications in China (ICCC)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE/CIC International Conference on Communications in China (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCHINA.2018.8641162\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCHINA.2018.8641162","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在许多无线传感器网络中,参与数据传输的传感器节点的分布可能由于潜在的地理因素或协议设计而聚类。相关工作研究了泊松聚类过程(PCP)来代替齐次泊松点过程(PPP)来建模传感器节点的位置分布,并获得了此类网络的总干扰和中断概率等分析结果。然而,许多研究工作都假设数据收集器是随机部署的,独立于传感器节点。虽然这样的假设在数学上是可追溯的,但它通常不是部署数据收集器以将数据从传感器节点中继到骨干网络的方式。为了解决这个问题,在本文中,我们考虑将数据收集器部署在PCP集群的中心或父点的场景。由于数据采集器和传感器节点的位置是相互关联的,所以大多数相关工作中采用的独立性假设不能适用。首先推导出每个数据采集器上的聚合干扰的拉普拉斯变换解析表达式,然后得到每个传感器节点向附近的数据采集器传输数据成功概率的封闭下界。数值计算表明,所得下界与仿真结果吻合较好。此外,我们还表明,将数据收集器放置在集群中心,虽然涉及数学分析,但与数据收集器和传感器节点在没有任何协调的情况下独立分布的传统场景相比,可以获得显着的性能提升。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Interference and Outage in Clustered Wireless Sensor Networks with Cluster-Centric Data Collectors
In many wireless sensor networks, the distribution of sensor nodes involved in data transmission may be clustered as induced by the underlying geographical factor or protocol design. Instead of using the homogeneous Poisson Point Process (PPP), related work has investigated the Poisson Cluster Process (PCP) for modeling the location distribution of sensor nodes and obtaining analytical results such as the aggregate interference and outage probability for such networks. Many research endeavors, however, assume that data collectors are randomly deployed independently of the sensor nodes. While such an assumption lends itself for mathematical tractability, it is not typically how data collectors are deployed to relay data from sensor nodes to the backbone network. To address this pitfall, in this paper we consider the scenario where data collectors are deployed at the centers, or parent points, of the clusters in PCP. Since the locations of data collectors and sensor nodes are correlated, the independence assumption adopted in most related work cannot be applied. We first derive the analytical expression of the Laplace transform of the aggregate interference at each data collector and then obtain the closed-form lower bound of the transmission success probability for each sensor node to transmit data to the nearby data collector. Numerical evaluation shows that the derived lower bound matches the simulation results very well. In addition, we have also shown that placing data collectors at cluster centers, while mathematically involved for analysis, can achieve significant performance gain compared to conventional scenarios where data collectors and sensor nodes are distributed independently without any coordination.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Adaptive Power Allocation for D2D Assisted Cooperative Relaying System with NOMA Hybrid Transmission Time Intervals for TCP Slow Start in Mobile Edge Computing System UE Computation Offloading Based on Task and Channel Prediction of Single User A Modified Unquantized Fano Sequential Decoding Algorithm for Rateless Spinal Codes Cooperative Slotted Aloha with Reservation for Multi-Receiver Satellite IoT Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1