检索结果-内蒙古大学图书馆

Geometrically Shaped Constellation in Short-Packet Visible Light communications for IIoT Applications

IEEE Internet of Things Journal 2025年第11期12卷 18220-18234页

作者： Guo, Jia-Ning Zhang, Jian Gong, Chen Li, Longguang Yang, Xu Zhou, Jing Chen, Ru-Han information engineering university Henan Province 450000 China The CAS Key Laboratory of Wireless-Optical Communications School of Information Science and Technology University of Science and Technology of China Hefei230027 China The SJTU Paris Elite Institute of Technology Shanghai Jiao Tong University Shanghai200240 China Sixty-Third Research Institute National University of Defense Technology Nanjing China Dept. Computer Science and Engineering Shaoxing University Shaoxing China

Due to the high data rates, license-free operations and inherent security, visible light communication (VLC) is highly valued in industrial Internet of Things (IIoT) applications. Short packet communication, which offers ultra-low latency and efficient resource utilization, is suitable for the low-latency and massive connectivity demand of the IIoT system. It adopts finite blocklength codewords for data transmissions. In this paper, we present a general framework of designing geometrically shaped constellations in short-packet VLC with peak and average intensity constraints for IIoT applications. By leveraging tools from large deviation theory, we first characterize the second-order asymptotics of the optimal constellation shaping region under aforementioned intensity constraints, which serves as a good performance metric for the best geometric shaping in finite blocklength. To further incorporate a sufficiently large coding gain and a nearly maximum shaping gain, we construct multidimensional constellations by the nested structure of Construction B lattices, where the constellation shaping is implemented by controlling the boundary of the embedded sublattice, i.e., a strategy called coarsely shaping and finely coding. Fast algorithms for constellation mapping and demodulation are presented as well. As an illustrative example, we present an energy-efficient 24-dimensional constellation design based on the Leech lattice, whose superiority over existing constellation designs is verified by numerical results. © 2014 IEEE.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Joint Spectrogram Separation and TDOA Estimation using Optimal Transport

arXiv

引用

arXiv 2025年

作者： Fabiani, Linda Schlecht, Sebastian J. Haasler, Isabel Elvander, Filip Dept. of Information and Communications Engineering Aalto University Finland Dept. of Electrical and Computer Engineering Friedrich-Alexander-Universität Erlangen-Nürnberg Germany Dept. of Information Technology Uppsala University Sweden

Separating sources is a common challenge in applications such as speech enhancement and telecommunications, where distinguishing between overlapping sounds helps reduce interference and improve signal quality. Additionally, in multichannel systems, correct calibration and synchronization are essential to separate and locate source signals accurately. This work introduces a method for blind source separation and estimation of the Time Difference of Arrival (TDOA) of signals in the time-frequency domain. Our proposed method effectively separates signal mixtures into their original source spectrograms while simultaneously estimating the relative delays between receivers, using Optimal Transport (OT) theory. By exploiting the structure of the OT problem, we combine the separation and delay estimation processes into a unified framework, optimizing the system through a block coordinate descent algorithm. We analyze the performance of the OT-based estimator under various noise conditions and compare it with conventional TDOA and source separation methods. Numerical simulation results demonstrate that our proposed approach can achieve a significant level of accuracy across diverse noise scenarios for physical speech signals in both TDOA and source separation tasks. Copyright © 2025, The Authors. All rights reserved.

关键词： Blind source separation

来源：评论

学校读者我要写书评

暂无评论

Lightweight Task-Oriented Semantic Communication Empowered by Large-Scale AI Models

引用

IEEE Transactions on Vehicular technology 2025年

作者： Liu, Chuanhong Guo, Caili Yang, Yang Chen, Mingzhe Quek, Tony Q. S. Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing100876 China Beijing University of Posts and Telecommunications Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing100876 China University of Miami Department of Electrical and Computer Engineering Institute for Data Science and Computing Coral GablesFL United States Singapore University of Technology and Design Dept. of Information Systems Technology and Design 487372 Singapore

Recent studies have focused on leveraging large-scale artificial intelligence (LAI) models to improve semantic representation and compression capabilities. However, the substantial computational demands of LAI models pose significant challenges for real-time communication scenarios. To address this, this paper proposes utilizing knowledge distillation (KD) techniques to extract and condense knowledge from LAI models, effectively reducing model complexity and computation latency. Nevertheless, the inherent complexity of LAI models leads to prolonged inference times during distillation, while their lack of channel awareness compromises the distillation performance. These limitations make standard KD methods unsuitable for task-oriented semantic communication scenarios. To address these issues, we propose a fast distillation method featuring a pre-stored compression mechanism that eliminates the need for repetitive inference, significantly improving efficiency. Furthermore, a channel adaptive module is incorporated to dynamically adjust the transmitted semantic information based on varying channel conditions, enhancing communication reliability and adaptability. In addition, an information bottleneck-based loss function is derived to guide the fast distillation process. Simulation results verify that the proposed scheme outperform baselines in term of task accuracy, model size, computation latency, and training data requirements. © 1967-2012 IEEE.

关键词： NP-hard

来源：评论

学校读者我要写书评

暂无评论

Searching Candidate Sequences for RNA Aptamers Using Quantum Computation

Searching Candidate Sequences for RNA Aptamers Using Quantum...

引用

IEEE International Conference on Consumer Electronics (ICCE)

作者： Sora Tomita Tatsuhiko Shirai Michiaki Hamada Tatsuo Adachi Nozomu Togawa Dept. of Computer Science and Communications Engineering Waseda University Shinjuku-ku Tokyo Japan Waseda Institute for Advanced Study Waseda University Shinjuku-ku Tokyo Japan National Institute of Advanced Industrial Science and Technology Chiyoda-ku Tokyo Japan RIBOMIC Inc. Minato-ku Tokyo Japan

ISBN: (数字)9798331521165

ISBN: (纸本)9798331521172

Addressing the problems of increasing time and cost for drug discovery is becoming more and more important. RiboNucleic Acid (RNA) aptamers have recently attracted attention as an emerging class of medium-molecule pharmaceuticals. However, searching the candidate sequences with conventional computers within a realistic timeframe is difficult due to the large search space. To overcome this problem, we employ Ising machines such as annealing quantum computers, which solve combinatorial optimization problems formulated as Quadratic Unconstrained Binary Optimization (QUBO) problems. In this study, we formulated the aptamer-sequence search problem as a QUBO problem based on the Systematic Evolution of Ligands by EXponential enrichment (SELEX) experimental data. We demonstrated that candidate RNA sequences were generated from a real Ising machine experiment and that those sequences can bind to the target protein. We concluded that our method is an efficient way to discover aptamers.

关键词： computers Proteins Systematics Costs RNA Search problems Quantum annealing Drug discovery Optimization Pharmaceuticals

来源：评论

学校读者我要写书评

暂无评论

DFTBC: Data fusion and tree-based clustering routing protocol for energy-efficient in wireless sensor networks 6

DFTBC: Data fusion and tree-based clustering routing protoco...

引用

6th International Conference on Knowledge and Systems engineering, KSE 2014

作者： Tan, Nguyen Duy Viet, Nguyen Dinh Dept. of Networks and Computer Communications University of Engineering and Technology VNU-HN Hanoi Viet Nam

ISBN: (纸本)9783319116792

Energy efficiency is a unique challenge for designing routing protocols in wireless sensor network (WSN) to extend the lifetime of the entire network because sensor nodes are power constrained devices. To solve this problem, in this paper, we propose a data fusion and tree-based clustering routing algorithm (DFTBC). DFTBC designing consists of two main works. In the first work, tree-based clustering routing technique is used to connect the nodes in a cluster to form a minimum spanning tree, where each node communicates only with its nearest neighbor using distance and remaining energy of nodes to decide which node will be the cluster head (CH). In the second work, we fuse one or more packets to generate a packet with a smaller size based on the Dempster-Shafer and Slepian-Wolf theory. Our simulation results show that the network lifetime with using of our proposed protocol can be improved about 350% and 35% compared to low-energy adaptive clustering hierarchy (LEACH) and power-efficient gathering in sensor information system (PEGASIS), respectively. © Springer International Publishing Switzerland 2015.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Greedy geographic routing with path optimization in wireless sensor networks

Greedy geographic routing with path optimization in wireless...

引用

2010 8th IEEE-RIVF International Conference on Computing and Communication Technologies: Research, Innovation and Vision for the Future, RIVF 2010

作者： Le Dinh, Thanh Nguyen, Dai Tho Dept. of Networks and Computer Communications University of Engineering and Technology VNU-HN Hanoi Viet Nam

ISBN: (纸本)9781424480753

In this paper, we propose Greedy with Path Optimization Routing (GPOR), a novel geographic routing protocol for wireless sensor networks. GPOR finds initial routing paths by following a greedy with recovery strategy, then uses a follow-up technique to optimize the paths. An attempt is also made to create routing entries applicable to destination areas rather than individual nodes. Main advantages of GPOR are path optimization and void avoidance capacities. We implement GPOR in ns-2 and present simulation results. ©2010 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Secure Mobile Crowdsensing Based on Deep Learning

引用

China communications 2018年第10期15卷 1-11页

作者： Liang Xiao Donghua Jiang Dongjin Xu Wei Su Ning An Dongming Wang Dept. of Communications Engineering Xiamen University Xiamen 361005 China Dept. of Computer and Information Hefei University of Technology Hefei 230009 China National Mobile Communications Research Lab. Southeast University Nanjing 211189 China

To improve the quality of multimedia services and stimulate secure sensing in Internet of Things applications, such as healthcare and traffic monitoring, mobile crowdsensing(MCS) systems must address security threats such as jamming, spoofing and faked sensing attacks during both sensing and information exchange processes in large-scale dynamic and heterogeneous networks. In this article, we investigate secure mobile crowdsensing and present ways to use deep learning(DL) methods, such as stacked autoencoder, deep neural networks, convolutional neural networks, and deep reinforcement learning, to improve approaches to MCS security, including authentication, privacy protection, faked sensing countermeasures, intrusion detection and anti-jamming transmissions in MCS. We discuss the performance gain of these DLbased approaches compared to traditional security schemes and identify the challenges that must be addressed to implement these approaches in practical MCS systems.

关键词： mobile crowdsensing security deep learning reinforcement learning faked sensing

来源：评论

学校读者我要写书评

暂无评论

SSTBC: Sleep scheduled and tree-based clustering routing protocol for energy-efficient in wireless sensor networks

SSTBC: Sleep scheduled and tree-based clustering routing pro...

引用

2015 International Conference on Computing and Communication Technologies: Research, Innovation, and Vision for Future, IEEE RIVF 2015

作者： Tan, Nguyen Duy Viet, Nguyen Dinh Faculty of Information Technology Hung Yen University of Technology Education Viet Nam Dept. of Networks and Computer Communications University of Engineering and Technology VNU-HN Hanoi Viet Nam

ISBN: (纸本)9781479980437

Since sensor nodes are battery power constrained devices in wireless sensor network (WSN), so how to use the energy of sensor nodes efficiently to prolong the network lifetime is a chief challenge for designing routing protocols. To solve this problem, in this paper, we propose sleep scheduled and tree-based clustering approach routing algorithm (SSTBC) for energy-efficient in WSN. SSTBC preserves energy by turning off radio (entering sleep mode) of either impossible or unnecessary nodes, which observe almost the same information, base on their location information to remove redundant data. In addition, to further reduce energy dissipation of communication in network, we build minimum spanning tree with the root as the cluster head (CH) from active nodes in a cluster to forward data packets to base station (BS). Our simulation results show that the network lifetime with using of our proposed protocol can be improved about 250% and 23% compared to low-energy adaptive clustering hierarchy (LEACH) and power-efficient gathering in sensor information system (PEGASIS), respectively. © 2015 IEEE.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Design and Performance Analysis of a 38 GHz Microstrip Patch Antenna with Slits Loading for 5G Millimeter-Wave communications 3

Design and Performance Analysis of a 38 GHz Microstrip Patch...

引用

3rd International Conference on Emerging Smart Technologies and Applications, eSmarTA 2023

作者： Ali, Mohammed A. M. Gaid, AbdulGuddoos S. A. Saeed, Mamoon M. Saeed, Rashid A. Taiz University Faculty of Engineering & Information Technology Dept. of Communications & Computer Taiz Yemen Faculty of Engineering Dept. of Communications & Electronics Engineering Sana'a Yemen College of Computers and Information Technology Taif University Dept. of Computer Engineering Taif21944 Saudi Arabia

ISBN: (纸本)9798350305333

In this paper, we present a compact, rectangular microstrip patch antenna with small rectangular slits designed for 5G wireless applications in the 38GHz band. The antenna is built on a Roger RT duroid 5880 substrate with a relative permittivity of 2.2, a height of 0.381 mm, and a loss tangent of 0.0009. The microstrip line technique is utilized for power feeding to the radiating patch. To enhance the antenna's performance, three slits are incorporated into the front side of the radiating patch. The design, simulations, and optimizations are conducted using the High-Frequency Structure Simulator (HFSS), while computer Simulation technology (CST) is used for validating the HFSS results. The antenna has a compact overall size of 6.12 × 6 × 0.381 mm3. Moreover, the proposed antenna exhibits impressive characteristics, including a resonance frequency of 38.67 GHz, a reflection coefficient (S11) of - 47.82 dB, and an impedance bandwidth of 2.35 GHz (37.45 GHz - 39.8 GHz). In addition, the antenna's gain varies from 7.84 dBi at the lower frequency of the operational band to 7.9 dBi at the higher frequency, with a maximum gain of 8.037 dBi at the resonance frequency. Likewise, the radiation efficiency is above 99% across the operational band. The results obtained from both simulators are in a good agreement and surpass those of many previously published antennas, indicating that the proposed antenna is a promising solution for 5G wireless communication applications. © 2023 IEEE.

关键词： Millimeter waves

来源：评论

学校读者我要写书评

暂无评论

SCBC: Sector-chain based clustering routing protocol for energy efficiency in heterogeneous wireless sensor network 8

SCBC: Sector-chain based clustering routing protocol for ene...

引用

8th International Conference on Advanced Technologies for communications, ATC 2015

作者： Tan, Nguyen Duy Dinh Viet, Nguyen Faculty of Information Technology Hung Yen University of Technology Education Hungyen Viet Nam Dept. of Networks and Computer Communications University of Engineering and Technology VNU-HN Hanoi Viet Nam

ISBN: (纸本)9781467383745

One of the most important challenges in heterogeneous wireless sensor network (WSN) is to design a routing protocol that use energy efficiently to prolong the lifetime of the entire network due to the limited battery power of sensor nodes. To solve this problem, in this paper, we propose Sector-Chain Based Clustering (SCBC) Routing Protocol, in which, entire network area is divided into sectors (clusters), which balance to the number of nodes. SCBC further reduces energy dissipation of communication in network by constructing chain for each cluster with the chain leader as the cluster head (CH) or secondary cluster head (SCH) that has high residual energy and the shortest distance between candidate nodes and base station (BS) in network. In addition, SCBC improves energy efficiency by calculating the time length of each round in the steady data transmission phase for CHs or SCHs but still guarantee that it is alive in next round. Our simulation results show that the network lifetime of our proposed protocol can be improved about 70% and 20% in comparison with PEGASIS (Power-Efficient Gathering in Sensor Information System) and IEEPB (An Improved Energy-Efficient PEGASIS-Based) protocols, respectively. © 2015 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：