IET Communications最新文献

{"title":"A composite spread spectrum sequence for underwater acoustic signal acquisition","authors":"Chenyu Zhang,&nbsp;Huabing Wu","doi":"10.1049/cmu2.12782","DOIUrl":"10.1049/cmu2.12782","url":null,"abstract":"<p>Spread spectrum technology has been widely employed for positioning and communicating with autonomous underwater vehicles (AUVs), but conventional spread spectrum sequences lack confidentiality and reliability in UWA channel. Considering the limitations of conventional sequences and the characteristics of underwater acoustic (UWA) channel, a composite chaotic orthogonal sequence (CCOS) based on the UWA channel is proposed. The confidentiality of the CCOS is superior to that of the m-sequence, while the autocorrelation performance of the CCOS is superior to that of the orthogonal sequence. Moreover, the CCOS can compensate for the imbalance of logistic chaotic sequence when assigned certain initial values. Acquisition is a crucial component of accessing the spread spectrum signal; therefore, the acquisition performance indicates the applicability of the CCOS. The source–target model is established to simulate communication with an underwater moving target. To simulate the acquisition process, a parallel algorithm based on fast Fourier transform is adopted, and the entire simulation process is completed based on the BELLHOP ray acoustic model. Through data processing, the Doppler shift error is less than half of the frequency-search element. Furthermore, the acquisition probabilities of the CCOS with different numbers of bits are over 90%, which demonstrates the reliability of the CCOS.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2024-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12782","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141374336","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Joint optimization of deployment, user association, channel, and resource allocation for fairness-aware multi-UAV network","authors":"Weihao Sun,&nbsp;Hai Wang,&nbsp;Zhen Qin,&nbsp;Zichao Qin","doi":"10.1049/cmu2.12791","DOIUrl":"10.1049/cmu2.12791","url":null,"abstract":"<p>This paper studies the problem of joint deployment, user association, channel, and resource allocation in unmanned aerial vehicle-enabled access network. Since different user equipments performing different tasks and have different data rate requirements, the priority-based traffic fairness problem is investigated. This problem, however, is a mixed integer nonlinear programming problem with NP-hard complexity, making it challenging to be solved. To address this issue, a self-organized and distributed framework “sense-as-you-fly” based on the decomposition process, which divides the original problem into several subproblems, is proposed. Assuming without central controller, we derive the closed-form resource allocation scheme and propose distributed many-to-one matching to optimize user association subproblem. Considering the coupled characteristics, the multi-unmanned aerial vehicle deployment and channel allocation subproblems are modelled as a local altruistic game. The existence of Nash equilibrium is proved with the aid of exact potential game and efficient best response learning-based algorithm is proposed. The original problem is finally addressed by solving the sub-problems alternately and iteratively. Simulation results verify its effectiveness. By jointly optimizing multidimensional variables, the proposed algorithm unlocks network performance gains, especially in resource-limited regimes.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2024-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12791","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141381726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Secondary cluster head based SEP in heterogeneous WSNs for IoT applications","authors":"Arif Hossan,&nbsp;Jahidul Islam","doi":"10.1049/cmu2.12780","DOIUrl":"10.1049/cmu2.12780","url":null,"abstract":"<p>A wireless sensor network (WSN) consists of specialized sensor nodes that perform sensing services for Internet of Things devices with limited battery power. As the replacement or recharging of batteries is not possible, energy consumption becomes the most important design issue in WSNs. The energy-efficient routing protocol gets the most priority in such energy-constrained networks. The utilization of clustering-based routing protocols like stable election protocol (SEP) has gained much attention as the network's lifetime is significantly improved due to the clustering of sensor nodes. Moreover, the inclusion of a secondary CH (SCH) is beneficial when the member node with the most remaining energy performs data aggregation and reduces the energy burden of the CH. This article characterizes SEP and Prolong SEP (P-SEP) protocols and then extends them by incorporating SCH, which ensures balanced energy consumption. The performance of the proposed Extended SEP and Extended P-SEP protocols has been analysed regarding stability period, network lifetime, energy usage and throughput. The simulation results demonstrate that the proposed protocols outperform state-of-the-art protocols like P-SEP, Modified SEP (M-SEP) and SEP. In particular, the stability period of Extended SEP and Extended P-SEP has improved up to 42% and 89%, respectively, compared to M-SEP.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2024-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12780","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141384118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Channel estimation for backscatter communication systems with retrodirective arrays","authors":"Yunping Mu,&nbsp;Chaochao Yao,&nbsp;Dian Fan,&nbsp;Yongjun Xu,&nbsp;Gongpu Wang,&nbsp;Marjan Milošević,&nbsp;Bo Ai","doi":"10.1049/cmu2.12777","DOIUrl":"10.1049/cmu2.12777","url":null,"abstract":"<p>Backscatter communications, which originated from World War II, have been widely applied in the logistics domain, and recently attract emerging interest from both academic and industrial circles. Here, the backscatter communication systems equipped with retrodirective arrays that can re-transmit the impinging signals back toward the direction of incidence are studied so as to reduce the power loss of the signals. Specifically, the authors consider the tag is equipped with retrodirective arrays to improve reliability and enhance communication range. The probability density function of channel coefficients is then derived. Next, a channel estimator based on Bayesian theory is proposed to acquire the modulus values of channel parameters and calculate its Bayesian Cramer–Rao Lower Bound. Finally, simulation results are provided to corroborate these theoretical studies.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2024-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12777","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141269993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Doppler spread analysis for suppressing channel time variation in high-mobility massive MIMO V2V communications","authors":"Zeyu Yan,&nbsp;Weile Zhang,&nbsp;Fuqiang Li","doi":"10.1049/cmu2.12696","DOIUrl":"https://doi.org/10.1049/cmu2.12696","url":null,"abstract":"<p>Here, fast time-varying channels of high-mobility vehicle-to-vehicle communications for massive multiple-input multiple-output orthogonal frequency division multiplexing systems are considered. Large-scale uniform linear arrays are configured at the transmitter and receiver to separate multiple angle domain Doppler frequency offsets based on transmit and receive beamforming with high spatial resolution. Then, each beamforming branch comprises only one dominant Doppler frequency offset. Next, the conventional channel estimation method is performed for each beamforming branch, and carry out maximum-ratio-combining for data detection. Power spectrum density and Doppler spread of the equivalent link between the transmitter and receiver are derived and regarded as the criterion for assessing the residual channel time variation caused by limited antennas in practice. Interestingly, a scaling law between the asymptotic Doppler spread and the number of transceiver antennas shows that asymptotic Doppler spread is proportional to the maximum Doppler frequency offset and decreases at the rate of <span></span><math>\u0000 <semantics>\u0000 <msqrt>\u0000 <mrow>\u0000 <mfrac>\u0000 <mn>1</mn>\u0000 <msup>\u0000 <msub>\u0000 <mi>N</mi>\u0000 <mi>T</mi>\u0000 </msub>\u0000 <mn>2</mn>\u0000 </msup>\u0000 </mfrac>\u0000 <mo>+</mo>\u0000 <mfrac>\u0000 <mn>1</mn>\u0000 <msup>\u0000 <msub>\u0000 <mi>N</mi>\u0000 <mi>R</mi>\u0000 </msub>\u0000 <mn>2</mn>\u0000 </msup>\u0000 </mfrac>\u0000 </mrow>\u0000 </msqrt>\u0000 <annotation>$sqrt {frac{1}{{{N_T}^2}} + frac{1}{{{N_R}^2}}}$</annotation>\u0000 </semantics></math>, where <span></span><math>\u0000 <semantics>\u0000 <msub>\u0000 <mi>N</mi>\u0000 <mi>T</mi>\u0000 </msub>\u0000 <annotation>${N_T}$</annotation>\u0000 </semantics></math> and <span></span><math>\u0000 <semantics>\u0000 <msub>\u0000 <mi>N</mi>\u0000 <mi>R</mi>\u0000 </msub>\u0000 <annotation>${N_R}$</annotation>\u0000 </semantics></math> are the number of transmit and receive antennas, respectively. Simulation results confirm the validity of the proposed Doppler suppression framework in high-mobility vehicle-to-vehicle communications.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2024-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12696","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141537050","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Clustered DTN routing based on sensing node relationship strength","authors":"Hongsheng Chen,&nbsp;Chunhui Wu","doi":"10.1049/cmu2.12785","DOIUrl":"10.1049/cmu2.12785","url":null,"abstract":"<p>Delay tolerant networks (DTNs) is a network evolved from mobile networks. Differing from the traditional network, which has a stable end-to-end transmission path, DTNs are sparse and intermittently connected mobile ad hoc network, which are widely used in harsh environments, such as battlefields, seabed, space communication networks, and so on. In DTNs, intermittent connectivity, partitioned network, long delays and node mobility characteristics make the network fail to communicate frequently, therefore, how to successfully forward the message is of extreme importance. Up to now, almost all the traditional models in DTNs use the store-carry-forward method. This paper proposes a novel clustered DTN routing model based on sensing node relationship strength. The routing mechanism takes advantage of the number of other nodes encountered by the nodes in the process of movement and the changes in the number of nodes to calculate the strength of the relationship between nodes, and clusters DTN routing according to the strength of the relationship between nodes. Moreover, the relationship between nodes in a cluster and other clusters is used to transmit messages between clusters, and messages are transmitted within clusters according to the strength of the relationship between nodes. Simulation results show that the routing mechanism not only increases the success rate of message transmission, but also reduces the transmission delay of messages and improves network performance.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2024-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12785","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141098878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A chaotic time series combined prediction model for improving trend lagging","authors":"Fang Liu,&nbsp;Yuanfang Zheng,&nbsp;Lizhi Chen,&nbsp;Yongxin Feng","doi":"10.1049/cmu2.12783","DOIUrl":"10.1049/cmu2.12783","url":null,"abstract":"<p>Chaotic time series prediction is a prediction method based on chaos theory, and has important theoretical and application value. At present, most prediction methods only pursue digital fitting and do not consider the directional trend. In addition, using the single model will not achieve better prediction results. Therefore, a chaotic time series combined prediction model for improving trend lagging (ITL) is proposed. An improved dual-stage attention-based long short-term memory model with the improved training objective fuction is designed to solve the trend lagging problem. Then, an auto regressive moving average model with the sliding window is established to mine other characteristics of the time series except nonlinear characteristic. Finally, the idea of optimization algorithm is introduced to construct a time series combined prediction model with high accuracy based on the above two models, so as to perform the chaotic time series prediction from multiple perspectives. Multiple datasets are selected as experimental datasets, and the proposed method is compared with common prediction methods. The results show that the proposed method can achieve single-step prediction with high accuracy and effectively improve the lagging of chaotic time series prediction. This research can provide theoretical support for the complex chaotic time series prediction.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2024-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12783","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141098991","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Multi-view synergistic enhanced fault recording data for transmission line fault classification","authors":"Minghui Jia,&nbsp;Xiaohu Huang,&nbsp;Fengjun Han,&nbsp;Dequan Yan,&nbsp;Wei Wang,&nbsp;Guochao Zhu,&nbsp;Lin Zhang,&nbsp;Chao Pan,&nbsp;Haifeng Ma,&nbsp;Jidong Wei","doi":"10.1049/cmu2.12784","DOIUrl":"10.1049/cmu2.12784","url":null,"abstract":"<p>Fault recorded data has been proven to be effective for fault diagnosis of overhead transmission lines. Utilizing deep learning to mine potential fault patterns in fault recording data is an inevitable trend. However, it is usually difficult to obtain massive labeled fault recording data, which results in deep learning-based fault diagnosis models not being adequately trained. Although data augmentation methods provide ideas for expanding the training data, existing data augmentation algorithms (e.g. random perturbation-based augmentation) may lead to distortion of multi-view data, that is, time domain data and frequency domain data of the fault recorded data, which results in the inconsistency of physical properties and statistical distributions of the generated data and the actual recording data, and misguides the training of the models. Hence, this study proposes a transmission line fault classification method via the multi-view synergistic enhancement of fault recording data. The methodology proposes to start with a synergistic enhancement of multi-view data such as time and frequency domains of fault recording data, and utilizes contrastive learning to further improve the performance of the fault classification model while ensuring that the generated data is not distorted. Experimental results on three real-world datasets validate the effectiveness of the proposed method.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2024-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12784","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141099309","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A blockchain-based secure framework for data management","authors":"Ozan Zorlu,&nbsp;Adnan Ozsoy","doi":"10.1049/cmu2.12781","DOIUrl":"10.1049/cmu2.12781","url":null,"abstract":"<p>Data management is a crucial requirement due to the autonomous and constrained nature of Unmanned Aerial Vehicles (UAVs), Internet of Things (IoTs), and the aviation domain. The autonomous and restricted nature of these sectors increases the need for a shared, distributed database, strong access control management, consensus in autonomous decision-making, and effective communication across diverse protocols and devices. This research presents a comprehensive approach and offers a new viewpoint to the field of blockchain while establishing a fundamental baseline for future improvements in data management systems and addressing the shortcomings of previously proposed existing frameworks in order to fulfill the complex needs of secure data management. This study contributes to the advancement of secure and efficient data management systems by implementing robust data monitoring for error detection, ensuring data integrity, and enabling encrypted or anonymous data sharing based on sensitivity levels. Additionally, the integration of diverse devices, enforcement of immutable regulations compliance, and development of permissioned blockchain systems for identity management further enhance the system's capabilities, offering comprehensive solutions for modern data management challenges. In the tests, the proposed framework showed increased successful transactions in all rate controllers. Besides, effect of the validator number on throughput and latency is tested and analyzed thoroughly.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12781","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140965466","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A back-to-back coordination-based learning scheme for deceiving reactive jammers in distributed networks","authors":"Yihang Du,&nbsp;Yu Zhang,&nbsp;Pengzhi Qian,&nbsp;Panfeng He,&nbsp;Wei Wang,&nbsp;Yifei Chen,&nbsp;Yong Chen","doi":"10.1049/cmu2.12758","DOIUrl":"10.1049/cmu2.12758","url":null,"abstract":"<p>Reactive jammers select jamming strategies according to the users’ responses; thus, conventional anti-jamming methods such as frequency hopping are inadequate to defeat the jamming attack. In this article, the authors propose a novel uncoupled deception scheme to trap the reactive jammer into attacking a decoy channel in distributed networks. Specifically, the authors design a multi-functional network utility for every user to mislead the jammer with a minimum energy consumption while achieving the highest network throughput. Based on the network utility, the anti-jamming problem is formulated as an exact potential game such that the existence of Nash equilibrium can be guaranteed theoretically. The authors further propose a back-to-back coordination-based learning algorithm to reach the optimal channel selection and power adaption in a non-cooperative way. To alleviate the lack of mutual information exchange, the back-to-back coordination mechanism derives all users to deceive the jammer by inferring others’ strategies based on a shared belief. Simulation results show that the proposed algorithm yields higher network throughput and efficiency-cost ratio compared to the state-of-the-art cooperative schemes.</p>","PeriodicalId":55001,"journal":{"name":"IET Communications","volume":null,"pages":null},"PeriodicalIF":1.6,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/cmu2.12758","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140999839","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}