Particle swarm optimization based network selection in heterogeneous wireless environment

Deployment of heterogeneous wireless networks is spreading throughout the world as users want to be connected anytime, anywhere, and anyhow. Meanwhile, users are increasingly interested in multimedia applications such as audio, video streaming and Voice over IP (VoIP), which require strict Quality of Service (QoS) support. Provisioning of Always Best Connected (ABC) network with such constraints is a challenging task. Considering the availability of various access technologies, it is difficult for a network operator to find reliable criteria to select the best network that ensures user satisfaction while reducing multiple network selection. Designing an efficient Network selection algorithm, in this type of environment, is an important research problem. In this paper, we propose a novel network selection algorithm utilizing signal strength, available bit rate, signal to noise ratio, achievable throughput, bit error rate and outage probability metrics as criteria for network selection. The selection metrics are combined with PSO for relative dynamic weight optimization. The proposed algorithm is implemented in a typical heterogeneous environment of EDGE (2.5G) and UMTS (3G). Switching rate of the user between available networks has been used as the performance metric. Moreover, a utility function is used to maintain desired QoS during transition between networks, which is measured in terms of the throughput. It is shown here that PSO based approach yields optimal network selection in heterogeneous wireless environment.     

Relay selection scheme based on deep reinforcement learning in wireless sensor networks

Cooperative communication technology has realized the enhancement in the wireless communication system’s spectrum utilization rate without resorting to any additional equipment; additionally, it ensures system reliability in transmission, increasingly becoming a research focus within the sphere of wireless sensor networks (WSNs). Since the selection of relay is crucial to cooperative communication technology, this paper proposes two different relay selection schemes subject to deep reinforcement learning (DRL), in response to the issues in WSNs with relay selection in cooperative communications, which can be summarized as the Deep-Q-Network Based Relay Selection Scheme (DQN-RSS), as well as the Proximal Policy Optimization Based Relay Selection Scheme (PPO-RSS); it further compared the commonly used Q-learning relay selection scheme (Q-RSS) with random relay selection scheme. First, the cooperative communication process in WSNs is modeled as a Markov decision process, and DRL algorithm is trained in accordance with the outage probability, as well as mutual information (MI). Under the condition of unknown instantaneous channel state information (CSI), the best relay is adaptively selected from multiple candidate relays. Thereafter, in view of the slow convergence speed of Q-RSS in high-dimensional state space, the DRL algorithm is used to accelerate the convergence. In particular, we employ DRL algorithm to deal with high-dimensional state space while speeding up learning. The experimental results reveal that under the same conditions, the random relay selection scheme always has the worst performance. And compared to Q-RSS, the two relay selection schemes designed in this paper greatly reduce the number of iterations and speed up the convergence speed, thereby reducing the computational complexity and overhead of the source node selecting the best relay strategy. In addition, the two relay selection schemes designed and raised in this paper are featured by lower-level outage probability with lower-level energy consumption and larger system capacity. In particular, PPO-RSS has higher reliability and practicability.     

一种无线传感器网络中的混沌信号重构算法

将无线传感器网络节点观测区域中的一个混沌信号发送到融合中心,进行信号重构.由于节点的通信带宽受限,信号传输之前需要进行量化,给信号带来量化噪声,使得信号重构工作变得更为棘手.本文提出用平方根容积卡尔曼滤波器对融合中心收集的信号进行重构.首先估计观测信号的概率密度函数,使用最优量化器量化观测信号,在有限的量化比特数下,取得最优的信号量化性能.平方根容积卡尔曼滤波器相对无先导卡尔曼算法具有较少的求容积分点,因此具有计算量小的优点,同时迭代过程采用传递误差矩阵的平方根矩阵,保证迭代过程的稳定性和提高数据估计精度.仿真结果表明,该算法能够有效和快速地重构观测信号,并且比基于无先导卡尔曼滤波的算法更快.     

On the security of K-tier heterogeneous cellular networks

Motivated by recent developments in heterogeneous cellular networks and physical-layer security, we aim to characterize the fundamental limits of secure communication in networks. Based on a general model in which both transmitters and receivers are randomly scattered in space, we model the locations of K-tier base stations, users, and potential eavesdroppers as independent two-dimensional Poisson point processes. Using the proposed model, we analyze the achievable secrecy rates for an arbitrarily located mobile user. Assuming that the cell selection is based on achievable-secrecy-rate threshold, we obtain approximations for: (a) secrecy coverage probability and (b) average secrecy load per tier. We also investigate how the network performance is affected by secrecy rate threshold, eavesdropper density, and different access strategies are analyzed, respectively. Finally, our theoretical claims are confirmed by the numerical results.     

基于自归一化神经网络的脉冲星候选体选择

脉冲星候选体选择是脉冲星搜寻任务中的重要步骤.为了提高脉冲星候选体选择的准确率,提出了一种基于自归一化神经网络的候选体选择方法.该方法采用自归一化神经网络、遗传算法、合成少数类过采样这三种技术提升对脉冲星候选体的筛选能力.利用自归一化神经网络的自归一化性质克服了深层神经网络训练中梯度消失和爆炸的问题,大大加快了训练速度.为了消除样本数据的冗余性,利用遗传算法对脉冲星候选体的样本特征进行选择,得到了最优特征子集.针对数据中真实脉冲星样本数极少带来的严重类不平衡性,采用合成少数类过采样技术生成脉冲星候选体样本,降低了类不平衡率.以分类精度为评价指标,在3个脉冲星候选体数据集上的实验结果表明,本文提出的方法能有效提升脉冲星候选体选择的性能.     

无线传感网中基于质心的高效坐标压缩算法

鉴于无线传感网中有限的通信带宽和计算资源, 传感器节点传送压缩后的数据对于系统节能具有十分重要的意义. 本文提出一种利用反正切函数构建的非线性坐标压缩策略来降低系统的数据传输量. 得益于反正切函数的非线性特点, 在质心附近压缩率低, 离质心越远, 压缩率越高. 仿真结果显示, 所提算法特别适应于在质心附近具有高频分量的信号类型. 所提算法具有以下几个特点: 1)采样间隔是非均匀的; 2)可以在采样前实现压缩, 类似于压缩感知; 3)计算复杂度低, 算法简单易实现, 在实际应用中更具有优势. 关键词： 无线传感器网络 坐标压缩 非线性 质心     

Survivable routing and wavelength assignment algorithm for multiple link failures in wavelength-routed all-optical WDM networks

In this paper, we have investigated the problem of enhancing multiple-fault restorability in the path protected wavelength-routed all-optical WDM networks. The system architecture considered is circuit-switched with dynamic arrival of session requests. We have proposed a mechanism, which is used to combat multiple link failures. A survivable routing and wavelength assignment algorithm has been proposed which is very efficient for the networks having multiple failures. This algorithm deals with the optical networks with multiple faults and is effective for the varying load applied to nodes. This algorithm works well for the load applied to the nodes varying from low to high.     

Fault-tolerant routing and wavelength assignment algorithm for multiple link failures in wavelength-routed all-optical WDM networks

In this paper, we investigate the problem of enhancing multiple-fault restorability in the path protected wavelength-routed all-optical WDM networks. The system architecture considered is circuit-switched with dynamic arrival of session requests. We propose a mechanism, which is used to combat multiple link failures. A routing and wavelength assignment algorithm has been proposed with the name of fault-tolerant routing and wavelength assignment algorithm. The comparison of this algorithm has also been made with the best-fit and first-fit algorithms. This algorithm deals with the optical networks with multiple faults and is effective for the varying load applied to nodes. This algorithm works well for the load applied to the nodes varying from low to high.     

一种基于势博弈的无线传感器网络拓扑控制算法

在实际的应用中,无线传感器网络常常由大量电池资源有限的传感器节点组成.如何降低网络功耗,最大化网络生存时间,是传感器网络拓扑控制技术的重要研究目标.随着传感节点的运行,节点的能量分布可能越来越不均衡,需要在考虑该因素的情况下,动态地调整节点的网络负载以均衡节点的能耗,达到延长网络生存时间的目的.该文引入博弈理论和势博弈的概念,综合考虑节点的剩余能量和节点发射功率等因素,设计了一种基于势博弈的拓扑控制模型,并证明了该模型纳什均衡的存在性.通过构造兼顾节点连通性和能耗均衡性的收益函数,以确保降低节点功耗的同时维持网络的连通性.通过提高邻居节点的平均剩余能量值以实现将剩余能量多的节点选择作为自身的邻居节点,提高节点能耗的均衡性.在此基础上,提出了一种分布式的能耗均衡拓扑控制算法.理论分析证明了该算法能保持网络的连通性.与现有基于博弈理论的DIA算法和MLPT算法相比,本算法形成的拓扑负载较重、剩余能量较小的瓶颈节点数量较少,节点剩余能量的方差较小,网络生存时间更长.     

Global analysis of multiple routes of disease transmission on heterogeneous networks

In this paper, we propose and study an SIS epidemic model with multiple transmission routes on heterogeneous networks. We focus on the dynamical evolution of the prevalence. Through mathematical analysis, we obtain the basic reproduction number _R0$R_0$ by investigating the local stability of the disease-free equilibrium and also investigate the effects of various immunization schemes on disease spread. We further obtain that the disease will die out independent of the initial infections if the basic reproduction number is less than one, otherwise if the basic reproduction number is larger than one, the system converges to a unique endemic equilibrium, which is globally stable and thus the disease persists in the population. Our theoretical results are conformed by a series of numerical simulations and suggest a promising way for the control of infectious diseases with multiple routes.     

Interference suppression algorithm based R-TDD for multi-user MIMO heterogeneous network

Aiming at the problem of uplink co-channel interference in multi-user multi-input multi-output (MIMO) heterogeneous network, a reversed time division duplex (R-TDD)-based method is used to improve the performance of interference rejection combining (IRC) algorithm. This method overcomes the difficulty of IRC algorithm in obtaining the interference noise covariance matrix by utilizing the R-TDD transmission scheme. On the premise that the spectrum efficiency is guaranteed, through combining R-TDD with spatial modulation, the transmission complexity is significantly reduced and the uplink co-channel interference is effectively controlled, so as to improve the system performance. Simulation results demonstrate that the R-TDD-based scheme can improve the performance of IRC algorithm in terms of spectrum efficiency.     

A spectrum auction algorithm based on joint power control and beamforming in small cell networks

Spectrum auction is considered as a suitable approach to efficiently allocate spectrum among unlicensed users. However, in previous studies of spectrum auction, competition can hardly be reflected in the traditional spectrum allocation and the spectrum efficiency is still not high after the allocation. In this paper, we enhance the factor of competition in the auctions, in which bidders need to pay for the competition and the interference to macro cell users (MUs). We consider a communication system with one macro cell and several small cells, thus a licensed radio spectrum is shared by both MUs and small cell users (SUs). A truthful auction algorithm is proposed for spectrum allocation and the spectrum is divided into multiple channels in different time slots, so that SUs can make their choice for bidding under the guidance of history. In order to raise the communication quality, we propose a power control and beamforming algorithm in the heterogeneous network to enhance the system performance. Simulation results are presented to verify the effectiveness of the proposed algorithm in the small cell network.     

RSSI-based hybrid algorithm for real-time tracking in underground mining by using RFID technology

Knowing the precise and real-time location of underground mining workers is essential for their health and safety in any emergency. However, the standard Global Positioning System (GPS) is insufficient for such indoor environments as it requires new infrastructure based on different technologies and algorithms. Instead, Radio Frequency Identification (RFID)-based real-time indoor localization systems and a hybrid algorithm are developed. The received-signal-strength (RSS) based positioning techniques are investigated and applied in indoor environments. A unique hybrid approach based on fingerprinting is proposed and developed to solve the disadvantages of the existing techniques. Consequently, the accuracy of this one-of-a-kind algorithm is found to be 2.52 m in an office and 3.13 m in an underground mine. We also compared the proposed hybrid algorithm to the Weighted K-Nearest Neighbor (WKNN). WKNN, on the other hand, has an accuracy of 4.01 m in the office and 4.33 m in underground mining environments.     

The roles of heterogeneous investment mechanism in the public goods game on scale-free networks

The public goods game is an important theoretical model for investigating the emergence of cooperation in the multi-player social dilemma. It has been proven that scale-free networks can significantly promote cooperation, but fail to sustain cooperation when the player obtains the normalized payoff. In this paper, we introduce heterogeneous investment mechanism into the public goods game on scale-free networks, and study the evolution of cooperation in both cases of accumulated and normalized payoff. Our research reveals that the heterogeneous investment mechanism can obviously facilitate cooperation as the adjusted parameter α increases. The increase of α allows cooperators to emerge under lower values of r. In the case of accumulated payoff, cooperators always firmly occupy the hubs, and the population keeps high cooperation level. In the case of normalized payoff, the increase of α changes the situation that the hubs are easily invaded by defectors, and inhibits the spread of defectors.     

基于无线传感器网络的地震信号特征提取方法研究

为解决野外古墓葬安防网络中高采样率会缩短无线传感器网络寿命的问题, 提出了使用功率谱二次处理对地震信号进行特征提取的方法. 并通过三类地面活动数据采集进行对比识别实验, 分析了低采样率条件下地震信号特征提取方法的性能. 结果表明, 使用功率谱二次分析的特征提取方法能够降低网络通信能耗, 延长网络寿命, 提高系统目标识别的准确性.该方法已应用于秦始皇兵马俑野外文物安防系统, 经实践检验, 收到了良好的效果. 关键词： 地震信号 特征提取 功率谱二次处理 无线传感器网络     

An enhanced RSS-distance-angle weighted geometric filter for device-free localization

Device-free localization and tracking as an emerging technology has attracted substantial research attention in wireless sensor networks. However, there is much room for improvement in localization and tracking accuracy. In this paper, by using received signal strength (RSS) measurements we propose an enhanced geometric filter which consists of a series of weights corresponding to RSS, distance, and angle, respectively. Specifically, RSS-based weights are dependent on the change in RSS of communication links to remove improbable target locations. To ensure robust tracking performance, distance-based weights are assigned to probable target locations. Angle-based weights are used to ensure the correct direction of motion. Experimental results demonstrate that the proposed geometric filter could improve the accuracy of positioning by up to 50.8% for non-straight path and 48.3% for straight path over some state-of-the-art methods.     

Group mobility assisted network selection framework in 5G vehicular cognitive radio networks

The heterogeneity nature of networks is the most eminent characteristic in 5G vehicular cognitive radio networks across complex radio environments. Since multiple communicating radios may be in motion at the same time in a vehicle. So, group mobility is the most prominent characteristic that requires to be a deep investigation. Therefore, different communication radios that are moving on a train/bus needed to select the networks simultaneously. Without considering the group mobility feature, there is a possibility that the same network may be selected by each moving node and cause congestion in a particular network. To overcome this problem, a novel network selection technique considering the group mobility feature is proposed to improve the throughput of the network. In this work, a 5G vehicular cognitive radio network scenario is also realized using USRP-2954 and LabVIEW communications system design suite testbed. The performance metrics like transmission delay, packet loss rate, reject rate and, channel utilization for vehicular nodes, are gained to analyze the proposed technique in vehicular cognitive radio networks environment. The proposed technique demonstrates a remarkable improvement in channel utilization for vehicular nodes and outperformed conventional schemes.     

Network sum-rate maximization via joint power allocation and antenna selection for clustered downlink/uplink NOMA networks

This paper considers the problem of joint power allocation and antenna selection (J-PA-AS) for downlink (DL) and uplink (UL) clustered non-orthogonal multiple-access (NOMA) networks. In particular, the goal is to perform antenna selection for each user cluster and allocate transmit power to its users so as to maximize the network sum-rate in the DL and UL directions, while satisfying quality-of-service (QoS) requirements. The formulated problem happens to be non-convex and NP-hard, and thus, there is no systematic or computationally-efficient approach to solve it directly. In turn, a low-complexity two-stage algorithm is proposed. Specifically, the first stage optimally solves the sum-rate maximizing power allocation for each (antenna, user cluster) pair. After that, antenna selection is optimally solved in polynomial-time complexity via the Kuhn–Munkres with backtracking (KMB) algorithm. Extensive simulation results are provided to validate the proposed algorithm, which is shown to efficiently yield the optimal network sum-rate in each link direction, in comparison to the optimal J-PA-AS scheme (solved via a global optimization package), and superior to other benchmark schemes. Light is also shed on the impact of spatial-diversity on the network sum-rate, where it is shown that the greater the number of base-station antennas is, the higher the network sum-rate, and the lower the outage events. Additionally, the significance of decoupling antenna selection in each link direction on the network sum-rate is highlighted. Lastly, the cases of imperfect channel state information (CSI) and imperfect successive interference cancellation (SIC) have been investigated, where it is demonstrated that spatial-diversity gains reduce the adverse effects of imperfect CSI and SIC on the network sum-rate.     

复杂网络牵制控制优化选点算法及节点组重要性排序

本文研究复杂网络动力学模型的无向网络牵制控制的优化选点及节点组重要性排序问题.根据牵制控制的同步准则,网络的牵制控制同步取决于网络的Laplacian删后矩阵的最小特征值.因此,通过合理选择受控节点集得到一个较大的Laplacian删后矩阵最小特征值,是牵制控制优化选点问题的核心所在.基于Laplacian删后矩阵最小...