{"title":"基于泊松点过程模型的认知机器对机器网络的两跳延迟分析","authors":"Jing Gao, Changchuan Yin, Ran Cai","doi":"10.1109/ICT.2014.7575073","DOIUrl":null,"url":null,"abstract":"End-to-end delay is an important metric for network performance. This paper studies the end-to-end delay in a two-hop Cognitive Machine-to-Machine (CM2M) network, where a pair of primary users (PUs) coexist with a secondary (SR) network with many two-hop line M2M communication links. The occupancy of the licensed channel by PUs is modelled as a continuous-time two-state (busy and idle) Markov process. Secondary (SR) network is composed of many two-hop line routes, each of which consists of a source node, a relay node and a destination. The locations of the source nodes are assumed to be the realizations of independent Poisson Point Process in each time slot. Secondary users (SUs) deploy a combination of TDMA and ALOHA medium access control (MAC) protocol. We first quantify the packet success probability for single-hop when the channel is idle for SUs, where the capture of a packet is determined by signal-to-interference ratio (SIR) experienced by the receiver. We then evaluate the delays of each hop (1st hop and 2nd hop delay) and the two-hop delay. Numerical results show that a better end-to-end performance could be obtained through proper network parameters settings. Simulation results verify the correctness of theoretical analysis.","PeriodicalId":154328,"journal":{"name":"2014 21st International Conference on Telecommunications (ICT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Two-hop delay analysis in cognitive machine-to-machine networks with poisson point process model\",\"authors\":\"Jing Gao, Changchuan Yin, Ran Cai\",\"doi\":\"10.1109/ICT.2014.7575073\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"End-to-end delay is an important metric for network performance. This paper studies the end-to-end delay in a two-hop Cognitive Machine-to-Machine (CM2M) network, where a pair of primary users (PUs) coexist with a secondary (SR) network with many two-hop line M2M communication links. The occupancy of the licensed channel by PUs is modelled as a continuous-time two-state (busy and idle) Markov process. Secondary (SR) network is composed of many two-hop line routes, each of which consists of a source node, a relay node and a destination. The locations of the source nodes are assumed to be the realizations of independent Poisson Point Process in each time slot. Secondary users (SUs) deploy a combination of TDMA and ALOHA medium access control (MAC) protocol. We first quantify the packet success probability for single-hop when the channel is idle for SUs, where the capture of a packet is determined by signal-to-interference ratio (SIR) experienced by the receiver. We then evaluate the delays of each hop (1st hop and 2nd hop delay) and the two-hop delay. Numerical results show that a better end-to-end performance could be obtained through proper network parameters settings. Simulation results verify the correctness of theoretical analysis.\",\"PeriodicalId\":154328,\"journal\":{\"name\":\"2014 21st International Conference on Telecommunications (ICT)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-05-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 21st International Conference on Telecommunications (ICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICT.2014.7575073\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 21st International Conference on Telecommunications (ICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICT.2014.7575073","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
端到端延迟是衡量网络性能的一个重要指标。本文研究了两跳认知机对机(CM2M)网络中一对主用户(pu)与一个具有多条两跳线路M2M通信链路的从网络(SR)共存的端到端延迟问题。利用连续时间的两状态(繁忙和空闲)马尔可夫过程对许可通道的占用进行建模。SR (Secondary network)网络由许多两跳线路路由组成,每条路由由源节点、中继节点和目的节点组成。假设源节点的位置是每个时隙中独立泊松点过程的实现。辅助用户(Secondary user)部署TDMA和ALOHA MAC (medium access control)协议的组合。我们首先量化了单跳通道空闲时的数据包成功概率,其中数据包的捕获由接收方经历的信号干扰比(SIR)决定。然后我们评估每一跳的延迟(第一跳和第二跳延迟)和两跳延迟。数值结果表明,通过适当的网络参数设置可以获得更好的端到端性能。仿真结果验证了理论分析的正确性。
Two-hop delay analysis in cognitive machine-to-machine networks with poisson point process model
End-to-end delay is an important metric for network performance. This paper studies the end-to-end delay in a two-hop Cognitive Machine-to-Machine (CM2M) network, where a pair of primary users (PUs) coexist with a secondary (SR) network with many two-hop line M2M communication links. The occupancy of the licensed channel by PUs is modelled as a continuous-time two-state (busy and idle) Markov process. Secondary (SR) network is composed of many two-hop line routes, each of which consists of a source node, a relay node and a destination. The locations of the source nodes are assumed to be the realizations of independent Poisson Point Process in each time slot. Secondary users (SUs) deploy a combination of TDMA and ALOHA medium access control (MAC) protocol. We first quantify the packet success probability for single-hop when the channel is idle for SUs, where the capture of a packet is determined by signal-to-interference ratio (SIR) experienced by the receiver. We then evaluate the delays of each hop (1st hop and 2nd hop delay) and the two-hop delay. Numerical results show that a better end-to-end performance could be obtained through proper network parameters settings. Simulation results verify the correctness of theoretical analysis.