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

Priority-Aware Scheduling for High-Dense Healthcare IoT (H-IoT) Networks Using message-passing algorithm

IEEE INTERNET OF THINGS JOURNAL 2024年第12期11卷 21604-21619页

作者： Dewa, Gilang Raka Rayuda Park, Cheolsoo Sohn, Illsoo Seoul Natl Univ Sci & Technol Dept Comp Sci & Engn Seoul 01811 South Korea Kwangwoon Univ Dept Comp Engn Seoul 01897 South Korea

Healthcare Internet of Things (H-IoT) has been rigorously extending its applications to hospitals to deliver important medical data remotely and continuously with various types of smart medical sensors. Medical data of patients should be treated with different urgency levels. Specifically, critical medical data, such as data pertaining, to heart failure or fall risk must be transmitted first with the highest priority. Thus, priority-aware scheduling for H-IoT networks is required to improve the quality of medical services. However, due to the high-dense nature of H-IoT networks, interference and packet collisions can make finding the optimal priority-aware scheduling very challenging. To tackle these practical issues, we develop a priority-aware scheduling algorithm based on a message-passing framework. With a message-passing procedure that relies on a max-product rule, the proposed algorithm simultaneously maximizes the priority metric and throughput of the network. In addition, the proposed algorithm efficiently finds the best scheduling configuration without a central coordinator by enabling low complexity and autonomous decisions of each network node. Our simulation results verify that the proposed algorithm outperforms conventional schemes in terms of priority awareness, throughput performance, and network scalability.

关键词： Healthcare Internet of Things (H-IoT) medical data delivery message-passing algorithm priority-aware scheduling

来源：评论

学校读者我要写书评

暂无评论

Iterative message passing algorithm for Vertex-Disjoint Shortest Paths

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2022年第6期68卷 3870-3878页

作者： Dai, Guowei Guo, Longkun Gutin, Gregory Zhang, Xiaoyan Zhang, Zan-Bo Nanjing Normal Univ Sch Math Sci Nanjing 210023 Peoples R China Nanjing Normal Univ Inst Math Nanjing 210023 Peoples R China Qilu Univ Technol Dept Comp Sci Jinan 250353 Peoples R China Fuzhou Univ Ctr Discrete Math & Theoret Comp Sci Fuzhou 350116 Peoples R China Royal Holloway Univ London Dept Comp Sci Egham TW20 0EY Surrey England Guangdong Univ Finance & Econ Sch Stat & Math Guangzhou 510320 Peoples R China Guangdong Univ Finance & Econ Inst Artificial Intelligence & Deep Learning Guangzhou 510320 Peoples R China

As an algorithmic framework, message passing is extremely powerful and has wide applications in the context of different disciplines including communications, coding theory, statistics, signal processing, artificial intelligence and combinatorial optimization. In this paper, we investigate the performance of a message-passing algorithm called min-sum belief propagation (BP) for the vertex-disjoint shortest k-path problem (k-VDSP) on weighted directed graphs, and derive the iterative message-passing update rules. As the main result of this paper, we prove that for a weighted directed graph G of order n, BP algorithm converges to the unique optimal solution of k -VDSP on G within O(n(2) w(max)) iterations, provided that the weight we is nonnegative integral for each arc e is an element of E(G), where w(max) = max{w(e) : e is an element of E(G)}. To the best of our knowledge, this is the first instance where BP algorithm is proved correct for NP-hard problems. Additionally, we establish the extensions of k-VDSP to the case of multiple sources or sinks.

关键词： Belief propagation message-passing algorithm iterative algorithms vertex-disjoint shortest path

来源：评论

学校读者我要写书评

暂无评论

A novel patent technology characterization method based on heterogeneous network message passing algorithm and patent classification system

引用

EXPERT SYSTEMS WITH APPLICATIONS 2024年 256卷

作者： Chang, Zhi-Xing Guo, Wei Wang, Lei Fu, Zhong-Lin Ma, Jian Zhang, Guan-Wei Wang, Zi-Liang Tianjin Univ Key Lab Mech Theory & Equipment Design Minist Educ Tianjin Peoples R China Tianjin Renai Coll Tianjin Peoples R China

Patents are widely recognized as important data for generating innovation. Accurate and rational characterizing patent technology content is a prerequisite for applying innovation generation algorithms. Existing research widely employs classification codes that annotate the technology content of patents to represent patents. However, the oversight of technology similarity information within patent classification systems results in deficiencies in the accuracy and effectiveness of their representations. To fill this research gap, we analyze the hierarchical structure of patent classification systems to extract the technology similarity information embedded within them. Then, we propose a novel patent technology characterization method based on the heterogeneous network message passing algorithm, which integrates the technology similarity information in the classification code co-occurrence information and the patent classification system to obtain a more accurate patent characterization. Subsequently, several evaluation experiments were conducted to compare our method with typical existing methods. The results demonstrate that our method outperforms these methods in accuracy and effectiveness. Finally, we conducted a case study to validate the reliability and practicality of our approach. In summary, our method exhibited superior performance, thereby providing robust support for innovation generation methods based on patent characterization, with high application value and extension prospects.

关键词： Heterogeneous network message-passing algorithm Technology topic Clustering algorithm Patent characterization

来源：评论

学校读者我要写书评

暂无评论

Improved message-passing algorithm For Counting Short Cycles in Bipartite Graphs

Improved Message-Passing Algorithm For Counting Short Cycles...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Li, Juane Lin, Shu Abdel-Ghaffar, Khaled Univ Calif Davis Davis CA 95616 USA

ISBN: (纸本)9781467377041

Recently, Karimi and Banihashemi proposed an algorithm based on message-passing to count cycles in a graph of lengths less than double its girth. The algorithm uses only integer additions and subtractions to compute messages at the nodes of the graph that are passed to adjacent nodes. The complexity of the algorithm, when applied to a bipartite graph of girth g that has E edges, is O(gE(2)). The algorithm is superior to many other existing algorithms in the literature. In this paper, an improvement of this algorithm is presented that cuts both the complexity and the computing time by a factor of two. The improved algorithm is also applied to Tanner graphs of quasi-cyclic codes and, in this case, the complexity can be further cut by a factor of p, where p is the size of the circulants in the parity-check matrix of the quasi-cyclic code.

关键词： Bipartite graph Counting cycles LDPC code message-passing algorithm Tanner graph

来源：评论

学校读者我要写书评

暂无评论

Low-Complexity Grant-Free Detection With Enhanced message-passing in LEO Satellite-IoT

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2024年第12期23卷 19317-19332页

作者： Li, Yang Chen, Shuyi Meng, Weixiao Wang, Jiangzhou Commun Res Ctr Harbin Inst Technol Harbin 150001 Peoples R China Univ Kent Sch Engn Canterbury CT2 7NT England

Low earth orbit (LEO) satellites are expected to play an important role in enhancing terrestrial Internet of Things. This paper focuses on the challenge of joint terminal activity detection (TAD) and channel estimation (CE) in grant-free non-orthogonal random access (GF-NORA)-enabled LEO communication networks. To leverage the dominant line-of-sight (LoS) path and the limited angular spread characteristic of terrestrial-satellite links, we propose a two-stage joint TAD and CE (TS-JDE) detection scheme aimed to achieve lower computational overhead. This scheme utilizes a high-accuracy algorithm for LoS path estimation and leverages the channel correlations for low-complexity NLoS paths estimation. Specifically, in LoS estimation stage, to mitigate the inaccuracies caused by Taylor expansion errors, we propose an enhanced message-passing algorithm, termed TaMP-LoS. This algorithm exploits the structured sparsity in the delay-Doppler domain and incorporates the Lagrange remainder to evaluate the expansion error, thereby enhancing estimation accuracy. In the NLoS estimation stage, we develop a sparse Bayesian learning-based algorithm, named SBL-NLoS, designed to estimate NLoS channels characterized by the limited residuals of delay and Doppler. Simulation results show that our proposed algorithm can achieve better detection performance than the existing approaches for GF-NORA-enabled LEO networks.

关键词： Low earth orbit satellites Estimation Satellites Delays Approximation algorithms Doppler shift Channel estimation Bayes methods Accuracy Wireless communication GF-NORA LEO satellite communications Taylor expansion error message-passing algorithm sparse Bayesian learning

来源：评论

学校读者我要写书评

暂无评论

message-passing Based User Association and Bandwidth Allocation in HetNets With Wireless Backhaul

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2023年第1期22卷 704-717页

作者： Lee, Hongju Park, Junhee Lee, Sang Hyun Lee, Inkyu Korea Univ Sch Elect Engn Seoul 02841 South Korea Samsung Elect Suwon 16677 South Korea

This work presents a joint design of user association and resource allocation in a heterogeneous network, which is comprised of a single macro base station and a group of small base stations interconnected through wireless backhaul. In such a configuration, we optimize user association and resource allocation so that the total sum of generalized utilities is maximized. This problem is cast as a combinatorial formulation with a fractional objective. To handle this design challenge, we develop a novel message-passing framework to obtain an efficient joint autonomous solution for user association and resource allocation. The simulation results show that the proposed algorithm outperforms existing techniques with various network utility functions.

关键词： message-passing algorithm heterogeneous network (HetNet) user association bandwidth allocation

来源：评论

学校读者我要写书评

暂无评论

message-passing-Based Joint User Association and Time Allocation for Wireless Powered Communication Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2022年第1期21卷 34-47页

作者： Lee, Hongju Moon, Jihwan Song, Changick Lee, Sang Hyun Lee, Inkyu Korea Univ Sch Elect Engn Seoul 02841 South Korea Chosun Univ Dept Informat & Commun Engn Gwangju 61452 South Korea Korea Natl Univ Transportat Dept Elect Engn Chungju 27469 South Korea

This work develops a joint design of user association and time allocation for wireless powered communication networks. A harvest-then-transmit protocol is applied with base stations (BSs) transfer wireless energy to users in the first downlink phase. Then, the users utilize the harvested energy for their information transmission to the BS in the subsequent uplink phase. In this configuration, we employ a general alpha-fair utility to maximize the network throughput. In particular, the maximization of sum-rate, proportional fairness and minimum rate are investigated individually. We introduce a new message-passing based framework to provide an efficient distributed solution for the user association and optimize the time allocation between the downlink and uplink phase. To achieve this joint goal, each user selects a BS in a distributed manner to maximize the alpha-fair utility. After identifying the user association, the time allocation is determined by an efficient line search technique. Simulation results show that the proposed algorithm outperforms existing approaches.

关键词： Wireless powered communication networks message-passing algorithm user association time allocation

来源：评论

学校读者我要写书评

暂无评论

Parallel Decoding of IRSA with Noise 33

Parallel Decoding of IRSA with Noise

引用

33rd IEEE Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Chiang, Yun-Hsin Lin, Yi-Jheng Chang, Cheng-Shang Hong, Y. -W. Peter Natl Tsing Hua Univ Inst Communicat Engn Hsinchu 300044 Taiwan

ISBN: (数字)9781665480536

ISBN: (纸本)9781665480536

Due to its simplicity and scalability, the Irregular Repetition Slotted ALOHA (IRSA) system that uses the successive interference cancellation (SIC) technique is a promising solution for uncoordinated multiple access of a massive number of Internet-of-Things (IoT) devices. However, the peeling (iterative) decoder for IRSA is sequential in nature, and it might lead to cascading errors due to imperfect SIC. In this paper, we propose a parallel decoding algorithm for IRSA in an Additive White Gaussian Noise (AWGN) channel. Inspired by a recent advance in collision resolution for random access, our approach is to find a SIC-decoupling matrix so that the receiver can perform interference cancellation based on the received signals only. We propose a message-passing algorithm to find the optimal SIC-decoupling matrix when the induced user-slot bipartite graph of an IRSA system is acyclic. This includes the Contention Resolution Diversity Slotted ALOHA (CRDSA) system that sends exactly two copies for each packet. Using a random graph analysis, we derive the throughput for parallel decoding of CRDSA in a threshold-based decoding model. We also conduct various numerical experiments to illustrate the tradeoffs between sequential decoding with a limited number of iterations and parallel decoding with a predefined signal-to-noise ratio (SNR) threshold. Our numerical results show that one can significantly reduce the decoding time and achieve comparable throughput by parallel decoding when the SNR is substantially larger than the decoding threshold.

关键词： Internet-of-Things multiple access successive interference cancellation parallel decoding message-passing algorithm

来源：评论

学校读者我要写书评

暂无评论

Belief Propagation for Unbalanced Assignment Problem

引用

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH 2023年第6期40卷 2250037-2250037页

作者： Wang, Yajing Liang, Dongyue Yang, Weihua Taiyuan Univ Technol Dept Math Taiyuan 030024 Peoples R China Taiyuan Univ Technol Sch Math Taiyuan Peoples R China

The unbalanced assignment problem (UAP) aims to distribute a set of jobs to some workers. The cost of the jobs is different when they are distributed to different workers. The goal is: (1) minimizing the total cost of arranging jobs to workers;(2) making the distribution of jobs as even as possible among all the workers. We transform the UAP into a min-cost network flow problem with squared terms, and apply the belief propagation (BP) algorithm to deal with it. We prove that, when the min-cost network flow problem has a unique optimal solution, the BP algorithm converges to the optimal solution within O(beta n/?? ) iterations, where n represents the number of vertices of the flow network, ?? is the difference between value of the optimal solution and the second optimal solution and beta is the maximum value of the terms of the objective function. Next, we prove that BP converges to the optimal solution in O(beta(2)n(2)mu mlog n) operations, where m represents the number of edges and mu is the tight upper bound of the slope of the terms of the objective function.

关键词： Belief propagation (BP) message-passing algorithm unbalanced assignment problem min-cost network flow problem pseudo-polynomial time

来源：评论

学校读者我要写书评

暂无评论

DESIGN OF A LOW-COMPLEXITY RECEIVER FOR UPLINK SCMA WITH MULTIPLE RECEIVE ANTENNAS 21

DESIGN OF A LOW-COMPLEXITY RECEIVER FOR UPLINK SCMA WITH MUL...

引用

IEEE Statistical Signal Processing Workshop (SSP)

作者： da Silva, Bruno Fontana Inacio, Juliana Camilo Scharf, Ana Luiza Uchoa-Filho, Bartolomeu Ferreira Inst Fed Sul Rio Grandense DEPEX SG BR-93804870 Sapiranga Brazil Univ Fed Santa Catarina Dept Elect & Elect Engn BR-88040900 Florianopolis SC Brazil

ISBN: (纸本)9781728157672

Sparse Code Multiple Access (SCMA) has been proposed as a potential scheme to increase the spectral efficiency in overloaded scenarios. Most SCMA receivers are based on the message-passing algorithm (MPA) because of the intrinsic graph structure of the resource allocation. In this paper, we discuss two low-complexity receivers that reduce the MPA complexity order. The first is a threshold-based edge-selection, which is an extension of results from a previous work to systems with multiple receive antennas. The second is a selection of receive antennas that minimizes the signal-to-interference ratio of the observed signal during the MPA calculations. Numerical simulation results show that each technique has its own advantages depending on the system parameters and signal-to-noise ratio (SNR) range of operation.

关键词： SCMA multiple access uplink message-passing algorithm MIMO

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：