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

Enabling Efficient Data Transmission in Wireless Sensor Networks-Based IoT Application

Computers, Materials & Continua 2024年第6期79卷 4197-4218页

作者： Ibraheem Al-Hejri Farag Azzedin Sultan Almuhammadi Naeem Firdous Syed Information and Computer Science Department King Fahd University of Petroleum andMineralsDhahran31261Saudi Arabia Center for Cyber Resilience and Trust(CREST) Deakin UniversityGeelong3220Australia

The use of the Internet of Things(IoT)is expanding at an unprecedented scale in many critical applications due to the ability to interconnect and utilize a plethora of wide range of *** critical infrastructure domains like oil and gas supply,intelligent transportation,power grids,and autonomous agriculture,it is essential to guarantee the confidentiality,integrity,and authenticity of data collected and ***,the limited resources coupled with the heterogeneity of IoT devices make it inefficient or sometimes infeasible to achieve secure data transmission using traditional cryptographic ***,designing a lightweight secure data transmission scheme is becoming *** this article,we propose lightweight secure data transmission(LSDT)scheme for IoT *** consists of three phases and utilizes an effective combination of symmetric keys and the Elliptic Curve Menezes-Qu-Vanstone asymmetric key agreement *** design the simulation environment and experiments to evaluate the performance of the LSDT scheme in terms of communication and computation *** and performance analysis indicates that the LSDT scheme is secure,suitable for IoT applications,and performs better in comparison to other related security schemes.

关键词： IoT lightweight computation complexity communication overhead cybersecurity threats threat prevention secure data transmission Wireless Sensor Networks(WSNs) elliptic curve cryptography

来源：评论

学校读者我要写书评

暂无评论

PC-based gamma knife radiosurgery dose calculation

引用

IEEE ENGINEERING IN MEDICINE AND BIOLOGY MAGAZINE 2003年第5期22卷 92-107页

作者： Tseng, YJ Chang, HH Shiau, CY Chung, WY Pan, DHC Chu, WC Natl Yang Ming Univ Inst Biomed Engn Taipei 112 Taiwan Taichung Vet Gen Hosp Dept Neurosurg Taichung Taiwan

The PC-based dose-calculation system designed for gamma knife radiosurgery introduced in this article delivers desired accuracy and is equipped with a friendly graphical user interface to allow foolproof operations. With the ongoing advancement in PC technology, the performance/cost ratio is expected to continue to rise to render more incentive in developing a PC-based dose-calculation system.

关键词： dosimetry radiation therapy medical computing graphical user interfaces planning computational complexity PC-based dose-calculation system gamma knife radiosurgery friendly graphical user interface performance-cost ratio isodose distribution three-dimensional volume of interest treatment planning low-cost system treatment throughput single-shot irradiation spherically shaped skull phantom irregularly shaped skull phantom computation complexity Dosimetry Gamma Knife Radiosurgery treatment planning Radiotherapy complexity classes medical computing graphical user interfaces Costing systems

来源：评论

学校读者我要写书评

暂无评论

computation and Communication Efficient Key Distribution Protocol for Secure Multicast Communication

引用

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2013年第4期7卷 878-894页

作者： Vijayakumar, P. Bose, S. Kannan, A. Deborah, L. Jegatha Univ Coll Engn Tindivanam Dept Comp Sci & Engn Tindivanam 604001 India Anna Univ Chennai Dept Comp Sci & Engn Madras 600025 Tamil Nadu India Anna Univ Chennai Dept Informat Sci & Technol Madras 600025 Tamil Nadu India

Secure multimedia multicast applications involve group communications where group membership requires secured dynamic key generation and updating operations. Such operations usually consume high computation time and therefore designing a key distribution protocol with reduced computation time is necessary for multicast applications. In this paper, we propose a new key distribution protocol that focuses on two aspects. The first one aims at the reduction of computation complexity by performing lesser numbers of multiplication operations using a ternary-tree approach during key updating. Moreover, it aims to optimize the number of multiplication operations by using the existing Karatsuba divide and conquer approach for fast multiplication. The second aspect aims at reducing the amount of information communicated to the group members during the update operations in the key content. The proposed algorithm has been evaluated based on computation and communication complexity and a comparative performance analysis of various key distribution protocols is provided. Moreover, it has been observed that the proposed algorithm reduces the computation and communication time significantly.

关键词： Multicast Communication Key Distribution One Way Hash Function computation complexity Karatsuba Multiplication

来源：评论

学校读者我要写书评

暂无评论

Guided adaptive interpolation filter

引用

IET IMAGE PROCESSING 2020年第14期14卷 3341-3354页

作者： Waheed, Waseem Al-nasrawi, Mukhalad Deng, Guang La Trobe Univ Dept Engn Melbourne Vic Australia Al Furat Al Awsat Tech Univ Elect Power Engn Tech Kufa Iraq

Edge-aware smoothing has proved to be a fundamental technique for various image processing and computer vision tasks. In this study, the authors introduce a local, non-iterative, and effective edge-preserving filter namely guided adaptive interpolation filter (GAIF). GAIF can be used as a post-processing step after any smoothing filter to improve its edge preservation performance without reformulation. GAIF has an O(N) computation complexity, where N is the total number of pixels in the image. To further increase the efficiency of GAIF at edge-preservation, two techniques are introduced and demonstrated. GAIF efficiency is demonstrated and compared to state-of-the-art techniques on a number of tasks including image smoothing, flash/no-flash image denoising/fusion, single image dehazing, and image details enhancement.

关键词： smoothing methods computer vision image enhancement image denoising image restoration iterative methods image fusion interpolation adaptive filters computational complexity guided adaptive interpolation filter edge-aware smoothing fundamental technique image processing computer vision tasks effective edge-preserving filter post-processing step smoothing filter edge preservation performance computation complexity GAIF efficiency image smoothing single image dehazing image details enhancement no-flash image denoising flash image denoising no-flash image fusion flash image fusion

来源：评论

学校读者我要写书评

暂无评论

Distributed linear-quadratic regulator control for discrete-time multi-agent systems

引用

IET CONTROL THEORY AND APPLICATIONS 2017年第14期11卷 2279-2287页

作者： Wang, Wei Zhang, Fangfang Han, Chunyan Shandong Univ Sch Control Sci & Engn Jinan Shandong Peoples R China Zhengzhou Univ Sch Elect Engn Zhengzhou Henan Peoples R China Univ Jinan Sch Elect Engn Jinan Shandong Peoples R China

This study will investigate the distributed linear quadratic (LQ) control problem for discrete identical uncoupled multi-agent systems with a global performance index coupling the behaviour of the multiple agents. An existence condition to the optimal distributed LQ controller is given first. In general, such condition can be checked by solving a discrete algebraic Riccati equation through a numerical method. When the condition fails to hold, a suboptimal distributed controller design method is proposed for a class of LQ performance. The solution can be obtained by solving two local algebraic Riccati equations whose dimension is the same as a single agent. The stability condition is given in terms of the spectrum of a matrix representing the desired sparsity pattern of the distributed controller. Comparing to the centralised control, the computation and communication complexity is much lesser. Finally, the suboptimality is parameterised, and can be measured by solving a Lyapunov equation.

关键词： distributed control linear quadratic control discrete time systems multi-robot systems Riccati equations matrix algebra control system synthesis Lyapunov methods communication complexity distributed linear-quadratic regulator control problem distributed LQ controller discrete-time multiagent systems discrete identical uncoupled multiagent systems global performance index coupling discrete algebraic Riccati equation numerical method suboptimal distributed controller design method sparsity pattern computation complexity communication complexity Lyapunov equation

来源：评论

学校读者我要写书评

暂无评论

Efficient method for the field-programmable gate arrays calculation of Wigner-Ville distribution

引用

IET SIGNAL PROCESSING 2019年第6期13卷 589-595页

作者： Zhang, Xiao-Wei Zuo, Lei Huang, Wen-Zhun Guo, Jian-Xin Xijing Univ Sch Informat Engn Xian Shaanxi Peoples R China Xidian Univ Natl Lab Radar Signal Proc Xian Shaanxi Peoples R China

Various signals of finite length are often analysed by the Wigner-Ville distribution (WVD). Thus, this article deals with the implementation of their discrete WVDs on field-programmable gate arrays (FPGAs). For the discrete WVD, its calculation procedures are composed of the autocorrelation function and Fourier transform. Since the autocorrelation procedure is the most time-consuming step in the entire computation process, the authors analyse the calculation procedure of autocorrelation function in detail. Here the proposed efficient method just calculates partial non-zero elements of the autocorrelation matrices in order to reduce the computation complexity. The FFT (built-in FPGAs) is then utilised to acquire the discrete WVD. In addition, the idea of the fully-pipelined and parallelism is borrowed to reduce the running time but at the cost of recourses. Finally, the authors provide implementations of both authors proposed method and two other algorithms on different FPGAs. The experimental results show that the Intel Arria-10 FPGA families are the better choice in the floating point arithmetic and that authors method has the best performance.

关键词： fast Fourier transforms field programmable gate arrays Wigner distribution floating point arithmetic time-frequency analysis discrete WVD running time different FPGAs authors method efficient method field-programmable gate arrays calculation Wigner-Ville distribution finite length calculation procedure autocorrelation function autocorrelation procedure time-consuming step entire computation process nonzero elements autocorrelation matrices computation complexity

来源：评论

学校读者我要写书评

暂无评论

Fractional-pel Interpolation Algorithm Based on Adaptive Filter

引用

INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE 2020年第8期34卷

作者： Wang, Gang Chen, Hexin Chen, Mianshu Zhao, Qiang Song, Yingjie Baicheng Normal Univ Sch Mech Engn Baicheng 137000 Peoples R China Jilin Univ Coll Commun Engn Changchun 130012 Peoples R China Changchun Univ Sch Mech & Vehicle Engn Changchun 130022 Peoples R China

In order to further improve fractional-pel interpolation image quality of video sequence with different resolutions and reduce algorithm complexity, the fractional-pel interpolation algorithm based on adaptive filter (AF_FIA) is proposed. This algorithm adaptively selects the interpolation filters with different orders according to the three video sequence regions with different resolutions;in the three video sequence regions with different resolutions, the high-order interpolation filter is replaced by low-order interpolation filter according to the correlation between pixels to realize the adaptive selection of filter. The complexity analysis results show that compared with other algorithms, this algorithm reduces space complexity and computation complexity, thus reducing the storage access and coding time. The simulation results indicate that compared with other algorithms, this algorithm has good coding performance and robustness for video sequences with different resolutions.

关键词： Adaptive filter resolution computation complexity peak signal noise ratio code rate

来源：评论

学校读者我要写书评

暂无评论

Fast block-based image restoration employing the improved best neighborhood matching approach

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS 2005年第4期35卷 546-555页

作者： Li, W Zhang, D Liu, ZY Qiao, XZ Inner Mongolia Univ Dept Comp Sci Hohhot 010021 Peoples R China Hong Kong Polytech Univ Dept Comp Kowloon Hong Kong Peoples R China Chinese Acad Sci Inst Comp Technol Natl Res Ctr Intelligent Comp Syst Beijing 100080 Peoples R China

The best neighborhood matching (BNM) algorithm is an efficient approach for image restoration. However, its high computation overhead imposes an obstacle to its application. In this paper, a fast image restoration approach named jump and look around BNM (JLBNM) is proposed to reduce computation overhead of the BNM. The main idea of JLBNM is to employ two kinds of search mechanisms so that the whole search process can be sped up. Some optimization techniques for the restoration algorithm JLBNM are also developed, including adaptive threshold in the matching stage, the terminal threshold in the searching stage, and the application of an appropriate matching function in both the matching and recovering stages. Theoretical analysis and experiment results have shown that JLBNM not only can provide high quality for image restoration but also has low computation overhead.

关键词： best neighborhood matching (BNM) algorithm block-based coding image computation complexity image restoration transmission error

来源：评论

学校读者我要写书评

暂无评论

Securing transmissions by friendly jamming scheme in wireless networks

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 2020年 144卷 260-267页

作者： Li, Guangshun Sheng, Xiaofei Wu, Junhua Yu, Haili Qufu Normal Univ Sch Informat Sci & Engn Rizhao Shandong Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China

In this paper, we focus on the design of optimal relay and jammer selection strategy in relay-aided wireless networks. Different from previous works, assuming that the channel state information (CSI) of illegitimate nodes was available and only an eavesdropper existed, we first analyze disadvantages of joint relay and jammer selection (JRJS), average optimal relay selection (AORS), traditional maximum relay selection (TMRS) schemes. Then, we design an optimal relay and jammer selection strategy where the ratio of received SNRs at the destination generated by any two relays is maximized. By applying proposed strategy, computation complexity can be reduced. Moreover, we derive the lower and upper bounds of the secrecy outage probability based on the assumptions of existence of only illegitimate node and symmetric case for mathematical convenience. Finally, simulation shows that the proposed strategy operating with no CSI of illegitimate nodes can work efficiently compared with JRJS, TMRS and AORS strategies. (C) 2020 The Author(s). Published by Elsevier Inc.

关键词： Physical layer security CSI of illegitimate nodes computation complexity Secrecy outage probability

来源：评论

学校读者我要写书评

暂无评论

Relay selection based on coalitional game for secure wireless networks

引用

IET COMMUNICATIONS 2014年第8期8卷 1355-1363页

作者： Liu, Zhongjian Shang, Yong Zhang, Rongqing Xiang, Haige Peking Univ State Key Lab Adv Opt Commun Syst & Networks Sch Elect Engn & Comp Sci Beijing 100871 Peoples R China

In this study, a two-stage decode-and-forward cooperative network is investigated consisting of a source, a corresponding destination, an eavesdropper and several intermediate nodes. In this study, the authors present an analysis of overall secrecy rate considering both distributed relay selection and secure beamforming problems. The achievable rate constraint is newly included into the system model. This modelling framework offers a more reliable approximation of the practical wireless channel. The relay selection is formulated as a coalitional game with transferable utility, which decreases the computation complexity in solving the distributed relay selection problem. A new Max-Pareto order' is constructed, which not only considers the player value, but also reflects the dominated weight of coalition value. Moreover, a distributed merge-and-split coalition formation algorithm is presented in this study. This algorithm achieves the system performance close to the theoretical upper limit, but it requires much less computation consumption.

关键词： relay networks (telecommunication) wireless channels decode and forward communication cooperative communication game theory coalitional game secure wireless networks two-stage decode-and-forward cooperative network overall secrecy rate secure beamforming problems approximation practical wireless channel computation complexity distributed relay selection problem Max-Pareto order distributed merge-and-split coalition formation algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：