认知多跳水下声学网络的干扰约束调度

IF 3.8 2区 工程技术 Q1 ENGINEERING, CIVIL
Chen Peng;Urbashi Mitra
{"title":"认知多跳水下声学网络的干扰约束调度","authors":"Chen Peng;Urbashi Mitra","doi":"10.1109/JOE.2023.3336462","DOIUrl":null,"url":null,"abstract":"This article investigates optimal scheduling for a cognitive multihop underwater acoustic network (UAN) with a primary user interference constraint. The network consists of primary and secondary users, with multihop transmission adopted for both user types to provide reliable communications. Critical characteristics of underwater acoustic channels, including significant propagation delay, distance-and-frequency dependent attenuation, half-duplex modem, and interhop interference, are taken into account in the design and analysis. In particular, time-slot allocation is found to be more effective than frequency-slot allocation due to the underwater channel model. The goal of the network scheduling problem is to maximize the end-to-end throughput of the overall system while limiting the throughput loss of primary users. Both centralized and decentralized approaches are considered. A partially observable Markov decision processes (POMDP) framework is applied to formulate the optimization problem, and an optimal dynamic programming algorithm is derived. However, the optimal dynamic programming (DP) solution is computationally intractable. Key properties are shown for the objective function, enabling the design of approximate schemes with significant complexity reduction. Numerical results show that the proposed schemes significantly increase system throughput while maintaining the primary throughput loss constraint. Under certain traffic conditions, the throughput gain over frequency-slot allocation schemes can be as high as 50%.","PeriodicalId":13191,"journal":{"name":"IEEE Journal of Oceanic Engineering","volume":"49 2","pages":"507-521"},"PeriodicalIF":3.8000,"publicationDate":"2024-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Interference-Constrained Scheduling of a Cognitive Multihop Underwater Acoustic Network\",\"authors\":\"Chen Peng;Urbashi Mitra\",\"doi\":\"10.1109/JOE.2023.3336462\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article investigates optimal scheduling for a cognitive multihop underwater acoustic network (UAN) with a primary user interference constraint. The network consists of primary and secondary users, with multihop transmission adopted for both user types to provide reliable communications. Critical characteristics of underwater acoustic channels, including significant propagation delay, distance-and-frequency dependent attenuation, half-duplex modem, and interhop interference, are taken into account in the design and analysis. In particular, time-slot allocation is found to be more effective than frequency-slot allocation due to the underwater channel model. The goal of the network scheduling problem is to maximize the end-to-end throughput of the overall system while limiting the throughput loss of primary users. Both centralized and decentralized approaches are considered. A partially observable Markov decision processes (POMDP) framework is applied to formulate the optimization problem, and an optimal dynamic programming algorithm is derived. However, the optimal dynamic programming (DP) solution is computationally intractable. Key properties are shown for the objective function, enabling the design of approximate schemes with significant complexity reduction. Numerical results show that the proposed schemes significantly increase system throughput while maintaining the primary throughput loss constraint. Under certain traffic conditions, the throughput gain over frequency-slot allocation schemes can be as high as 50%.\",\"PeriodicalId\":13191,\"journal\":{\"name\":\"IEEE Journal of Oceanic Engineering\",\"volume\":\"49 2\",\"pages\":\"507-521\"},\"PeriodicalIF\":3.8000,\"publicationDate\":\"2024-01-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Journal of Oceanic Engineering\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10403107/\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, CIVIL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Journal of Oceanic Engineering","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/10403107/","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, CIVIL","Score":null,"Total":0}
引用次数: 0

摘要

研究了具有主用户干扰约束的认知多跳水声网络的最优调度问题。网络由主用用户和从用用户组成,两种用户均采用多跳传输,提供可靠的通信。在设计和分析中考虑了水声信道的关键特性,包括显著的传播延迟、与距离和频率相关的衰减、半双工调制解调器和跳间干扰。由于水下信道模型的存在,时隙分配比频隙分配更有效。网络调度问题的目标是最大化整个系统的端到端吞吐量,同时限制主用户的吞吐量损失。中心化和去中心化两种方法都被考虑。将部分可观察马尔可夫决策过程框架应用于优化问题的表述,推导出一种最优动态规划算法。然而,最优动态规划解在计算上是难以解决的。显示了目标函数的关键属性,使近似方案的设计具有显着的复杂性降低。数值结果表明,所提方案在保持原吞吐量损失约束的前提下,显著提高了系统吞吐量。在一定的业务条件下,频率时隙分配方案的吞吐量增益可高达50%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Interference-Constrained Scheduling of a Cognitive Multihop Underwater Acoustic Network
This article investigates optimal scheduling for a cognitive multihop underwater acoustic network (UAN) with a primary user interference constraint. The network consists of primary and secondary users, with multihop transmission adopted for both user types to provide reliable communications. Critical characteristics of underwater acoustic channels, including significant propagation delay, distance-and-frequency dependent attenuation, half-duplex modem, and interhop interference, are taken into account in the design and analysis. In particular, time-slot allocation is found to be more effective than frequency-slot allocation due to the underwater channel model. The goal of the network scheduling problem is to maximize the end-to-end throughput of the overall system while limiting the throughput loss of primary users. Both centralized and decentralized approaches are considered. A partially observable Markov decision processes (POMDP) framework is applied to formulate the optimization problem, and an optimal dynamic programming algorithm is derived. However, the optimal dynamic programming (DP) solution is computationally intractable. Key properties are shown for the objective function, enabling the design of approximate schemes with significant complexity reduction. Numerical results show that the proposed schemes significantly increase system throughput while maintaining the primary throughput loss constraint. Under certain traffic conditions, the throughput gain over frequency-slot allocation schemes can be as high as 50%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Journal of Oceanic Engineering
IEEE Journal of Oceanic Engineering 工程技术-工程:大洋
CiteScore
9.60
自引率
12.20%
发文量
86
审稿时长
12 months
期刊介绍: The IEEE Journal of Oceanic Engineering (ISSN 0364-9059) is the online-only quarterly publication of the IEEE Oceanic Engineering Society (IEEE OES). The scope of the Journal is the field of interest of the IEEE OES, which encompasses all aspects of science, engineering, and technology that address research, development, and operations pertaining to all bodies of water. This includes the creation of new capabilities and technologies from concept design through prototypes, testing, and operational systems to sense, explore, understand, develop, use, and responsibly manage natural resources.
×
引用
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学术官方微信