Distributed Voronoi coverage algorithm in wireless sensor networks by XU Peng-fei1, CHEN Zhi-gang1, DENG Xiao-heng1

“…On the hypothesis conditions that wireless sensor networks only covered partial target region and the commu-nication radius was no less than twice of the sensing radius,a coverage-preserved and connected distributed Voronoi cov-erage algorithm was presented.Firstly,a method of detecting coverage redundancy sensors based on the local Voronoi re-gions was proposed,whose computational complexity was unconcerned with the density of sensors.Then,an en-ergy-prior self-scheduling strategy based on local Voronoi neighbors was proposed,where those sensors that were com-munication neighbors but not local Voronoi neighbors could synchronously execute self-scheduling,which improved the astringency of distributed scheduling.The simulation results show that the average number and coverage-degree of active sensors produced by the proposed algorithm are close to the centralized algorithm and smaller than the general distributed algorithm,while the proposed algorithm has more advantages in terms of active sensors’ average energy,scheduling as-tringency and runtime.…”
Get full text

Low-Complexity Decoding Algorithms for Distributed Space-Time Coded Regenerative Relay Systems by Chao Zhang, Huarui Yin

“…Computational complexities of these three decoders are also analyzed. …”
Get full text

Low-complexity despreading scheme with repetition code for wireless body area networks by Yu CHI, Lan CHEN, Chao LV

“…To improve the reliability of data transmission and reduce the complexity of the narrow band receiver for wireless body area networks(WBAN),spreading with repetition code is used in IEEE 802.15.6 standard.A despreading structure in which the metrics of reliability were calculated selectively according to the dynamic threshold was designed.Combined with hard decision,hard threshold-combine and hard threshold-delete despreading methods by simplifying maximal ratio combining and generalized minimum distance principle respectively were proposed,which had low complexity and near-optimal performance.The theoretical analysis and simulation results show that compared to despreading based on maximum likelihood method,the spreading gain of the proposed methods is close to the theoretical value and the computational complexity can be reduced by 86% at most under high SNR circumstances.…”
Get full text

Inverse Tone Mapping Based upon Retina Response by Yongqing Huo, Fan Yang, Vincent Brost

“…Inspired by the property of the human visual system (HVS), this dynamic range expansion scheme performs with a low computational complexity and a limited number of parameters and obtains high-quality HDR results. …”
Get full text

Otsu thresholding method based on projection of cross section for image segmentation by Chao-dong FAN, Hong-lin OUYANG, Le-yi XIAO

“…Due to the disadvantages existing in the conventional three-dimensional Otsu (3D Otsu) method, such as poor anti-noise capability, high computational complexity and difficulty to extend to multilevel thresholding, a new Otsu thresholding method based on projection of cross section was proposed. …”
Get full text

Lightweight privacy protection data auditing scheme for regenerating-coding-based distributed storage by Guangjun LIU, Wangmei GUO, Jinbo XIONG, Ximeng LIU, Changyu DONG

“…To reduce the security implementation cost of the outsourcing data audit mechanism for the regenerating-coding-based distributed storage systems, an orthogonal algebraic coding method was put forward to construct a lightweight privacy-preserving audit scheme based on linear homomorphic authentication.The homomorphic authentication tags were generated with the orthogonalization between the file encoded data and the private secret key vector, and the privacy protection of the auditing response message was achieved by using the random masking that was constructed by randomizing the orthogonal basis vectors of the specific sub-vector of the user’s secret key.The work realized the effective integration of algebraic coding, privacy protection, and security auditing.Theoretical analysis shows that the proposed scheme can realize the information-theoretic security in the regenerating-coding-based storage applications.Compared with the existing works, the proposed scheme is of low computational complexity and communication overhead, and better performance advantages.…”
Get full text

Statistical modeling based fast rate distortion estimation algorithm for HEVC by Xiang MENG, Haibing YIN, Xiaofeng HUANG

“…To reduce the coding computational complexity of the rate and distortion calculations in HEVC, a fast TU level rate model with higher accuracy was proposed.The contribution percentages of different syntax elements in entropy coding were evaluated, and syntax element-wise accurate rate models were individually developed to construct the whole TU level model.In addition, coefficient levels were weighted adaptively to distinguish the nonuniform contributions of different coefficients in terms of rate profiling.Moreover, position-wise parameter was defined to depict the distribution patterns for possible non-zero coefficients within one block.The final linear rate model was developed by fine-tuning the model parameters from great amounts of samples in a statistical way.Finally, the transform domain distortion model was also established to bypass unnecessary reconstruction process.Experimental results show that the proposed algorithm can achieve 49.76% complexity reduction with 1.74% BD-BR increase for RA configuration.…”
Get full text

A low-complexity detection algorithm for quadrature spatial modulation systems by Kai LUO, Junwei HUANG, Pengguang ZHOU, Hao XU, Can WU

“…To tackle the issues of the uncertainty number of the activated antennas and high computational complexity of maximum likelihood (ML) detection algorithm in quadrature spatial modulation (QSM),a low-complexity detec-tion algorithm was proposed.Firstly,the system model was reconstructed into a new model suitable for low-complexity detection algorithms in fixed active antennas systems based on compressed sensing (CS) signal re-construction theory.Then,based on the idea of orthogonal matching pursuit (OMP) algorithm and reconstructed model,a candidate set of activated antennas was obtained.Lastly,using ML algorithm to search the candidate,the index of activated antennas and the modulation symbol were selected.Simulation results show that the proposed de-tector is capable of achieving about 90% reduction in complexity with low performance loss compared with ML al-gorithm.…”
Get full text

Design scheme of physical layer security for intelligent reflecting surface-assisted MISO communication system by Xiaorong JING, Zhenyuan SONG, Wei GAO, Weijia LEI, Qianbin CHEN

“…Intelligent reflecting surface (IRS) improves the physical layer security of the communication systems by adjusting the phases of the reflecting units.A scheme of physical layer security design based on alternative iteration was proposed for IRS-assisted multiple input single output (MISO) communication system.Firstly, aiming at maximizing the secrecy rate, a non-convex objective function with non-convex constraints was constructed.Secondly, the Dinkelbach algorithm and Riemannian manifold optimization algorithm were adopted to transform the non-convex problem into a series of solvable sub-problems.Finally, the alternate iteration method was used to achieve the optimization design of transmit beamforming and IRS phase shift matrix.The simulation results show that, compared with the several existing schemes, the proposed scheme can achieve a better tradeoff between computational complexity and system security rate.…”
Get full text

A study on Pufferfish privacy algorithm based on Gaussian mixture models by Weisan Wu

“…Furthermore, we conduct a detailed analysis of the algorithm’s computational complexity, ensuring its efficiency in practical applications. …”
Get full text

Scheduling-Based Optimization for Motion Coordination of Autonomous Vehicles at Multilane Intersections by Mehmet Ali Guney, Ioannis A. Raptis

“…A complete account of the computational complexity of the algorithm, parameterized by the configuration parameters of the problem, is provided. …”
Get full text

Generalized approximate message passing based SrCMA satellite receiver by Le YU, Lidong ZHU, Liang JIN, Jiali LI, Yilun LIU, Cheng GUO

“…In order to satisfy the requirements of the transmission rate and spectrum resource for various terminals and equipment in the satellite internet, a generalized approximation-based message passing optimization satellite receiver was designed.Considering the multi-user detection in the satellite network using the non-orthogonal multiple access, a factor graph was established based on the graph model, and the factor graph was used to analyze the message passing model of the system and a message passing algorithm was proposed.Based on the generalized approximate message passing method, the complexity of the traditional multi-user detector based on message passing was further reduced.Under satellite channel condition, generalized approximate messaging satellite receivers were studied.The simulation results show that the proposed algorithm can effectively solve the signal coexistence problem of multi-users, and reduce the computational complexity of the algorithm.…”
Get full text

Beamforming design for energy-constrained full-duplex two-way relaying system by Wei WANG, Liyuan AN, Guoan ZHANG, Shibing ZHANG

“…A beamforming design was proposed under simultaneous wireless information and power transfer (SWIPT) protocol.A utility optimization problem was considered aiming to maximize the harvested energy by jointly optimizing the beamforming matrix,the power splitting ratio at the relay and the transmit powers at the sources.Since the formulated joint optimization problem was nonconvex,it was difficult or even intractable to obtain the global optimal solution.To overcome this issue,the objective problem into three subproblems was decoupled which could be solved by the proposed semidefinite relaxation technique and the derived constraints activation solution,respectively.The solution was finally obtained with the proposed convergent iterative algorithm.Simulation results show that the proposed joint optimization scheme achieves the optimal performance.Compared with the traditional half-duplex (HD) algorithm,the proposed algorithm can obtain 2~3 times energy harvesting (EH) efficiency improvement,while the computational complexity increases slightly.…”
Get full text

Time-varying channel estimation for LTE uplink SC-FDMA system with multi-user by Li-hua YANG, Long-xiang YANG, Hong-bo ZHU

“…A novel transform-domain based time-varying channel estimation method is proposed for the long term evolu-tion (LTE) uplink single carrier-frequency division multiple access (SC-FDMA) systems with multi-user.In the transform domain,the channel parameters of the two block pilots were firstly estimated,then the decision-directed (DD) based non-linear interpolation method was employed to estimate the channel parameters of the data symbols.To convenient equalization in the frequency domain,the transform expression of the transform-domain channel and frequency-domain channel was derived,by which the channel estimation in the frequency domain could be directly obtained.Simulation re-sults show that the performance of the proposed method is much better than those of the available methods,and the pro-posed method has a low computational complexity.…”
Get full text

D3D-MDS: A Distributed 3D Localization Scheme for an Irregular Wireless Sensor Network Using Multidimensional Scaling by Jin Fan, Baohui Zhang, Guojun Dai

“…This distributed localization scheme also demonstrates a low computational complexity compared with other centralized localization algorithms.…”
Get full text

IoT-based cloud monitoring system for building fires by Pan Guanhong, Xie Yanzhang, Yang Qingping

“…The system features an artificial neural network model that reduces computational complexity and response time, achieving >95% accuracy in fire prediction. …”
Get full text

Malicious attack-resistant secure localization algorithm for wireless sensor network by Kun XU, Hong-li LIU, Jie ZHAN, Zi-ji MA

“…On the assumption of unknown transmit power, which is undoubtedly approximate to the fact of WSN, a novel secure location probability model was introduced for single-target and multi-target sensor networks, respectively. Taking the computational complexity of RSRSL into account, the nonlinear and non-convex optimization problem was simplified into a semidefinite programming problem. …”
Get full text

Brain Age Prediction Using a Lightweight Convolutional Neural Network by Fatma Eltashani, Mario Parreno-Centeno, James H. Cole, Joao Paulo Papa, Fumie Costen

“…However, data availability, acquisition protocols diversity and models’ computational complexity remain limiting factors for clinical adoption. …”
Get full text

Range-Free Localization Scheme in Wireless Sensor Networks Based on Bilateration by Chi-Chang Chen, Chi-Yu Chang, Yan-Nong Li

“…Simulation results show that the proposed scheme outperforms the DV-Hop method in localization accuracy, communication cost, and computational complexity.…”
Get full text

Hybrid precoding based on distributed partially-connected structure for multiuser massive MIMO by Lei ZHANG, Qin WANG

“…For multiuser massive multiple-input multiple-output (MIMO) systems, to solve the problem of underutilized spatial resources caused by centralized partially-connected structure (PCS) and fixed-matching phase-control algorithm in conventional schemes, a low complexity phased zero-forcing (PZF) hybrid precoding scheme based on distributed PCS was proposed.The logical antenna subarrays with more than the number of radio frequency (RF) chains were designed, so that each RF chain could be connected to multiple distributed subarrays to provide higher spatial diversity gain.Further, by analyzing the influence of phase-control analog precoding on zero-forcing digital precoding, a phase-control analog precoding algorithm via successively maximizing users’ total subarray gains was proposed to maximize the upper bound of system spectral efficiency.Analysis and simulation results show that, compared with the conventional schemes, the proposed scheme can significantly improve the system spectral efficiency while slightly increases the computational complexity, and it is also insensitive to imperfect channel state information.…”
Get full text