基于质心迭代估计的无线传感器网络节点定位算法

针对无线传感器网络非测距定位方法的应用,提出了基于质心迭代估计的节点定位算法.该算法首先计算当前连通信标节点所围成的平面质心的坐标及其与未知节点间的接收信号强度,然后用计算所得质心节点替代距离未知节点最远的连通信标节点,缩小连通信标节点所围成的平面,并通过多次迭代的方法提高节点定位精度.仿真实验结果表明,该算法的各项指标均为良好,适用于无线传感器网络的节点定位.     

Modeling of piezoelectric transducers with combined pseudospectral and finite-difference methods

A new hybrid finite-difference (FD) and pseudospectral (PS) method adapted to the modeling of piezoelectric transducers (PZTs) is presented. The time-dependent equations of propagation are solved using the PS method while the electric field induced in the piezoelectric material is determined through a FD representation. The purpose of this combination is to keep the advantages of both methods in one model: the adaptability of FD representation to model piezoelectric elements with various geometries and materials, and the low number of nodes per wavelength required by the PS method. This approach is implemented to obtain an accurate algorithm to simulate the propagation of acoustic waves over large distances, directly coupled to the calculation of the electric field created inside the piezoelectric material, which is difficult with classical algorithms. These operations are computed using variables located on spatially and temporally staggered grids, which attenuate Gibbs phenomenon and increase the algorithm's accuracy. The two-dimensional modeling of a PZT plate excited by a 50 MHz sinusoidal electrical signal is performed. The results are successfully compared to those obtained using the finite-element (FE) algorithm of ATILA software with configurations spatially and temporally adapted to the FE requirements. The cost efficiency of the FD-PS time-domain method is quantified and verified.     

基于相继故障信息的网络节点重要度演化机理分析

分析了过载机制下节点重要度的演化机理.首先,在可调负载重分配级联失效模型基础上,根据节点失效后其分配范围内节点的负载振荡程度,提出了考虑级联失效局域信息的复杂网络节点重要度指标.该指标具有两个特点:一是值的大小可以清晰地指出节点的失效后果;二是可以依据网络负载分配范围、负载分配均匀性、节点容量系数及网络结构特征分析节点重要度的演化情况.然后,给出该指标的仿真算法,并推导了最近邻择优分配和全局择优分配规则下随机网络和无标度网络节点重要度的解析表达式.最后,实验验证了该指标的有效性和可行性,并深入分析了网络中节点重要度的演化机理,即非关键节点如何演化成影响网络级联失效行为的关键节点.     

模拟复杂网络下子网络节点抗攻击设计

针对复杂网络节点受攻击而出现的安全性问题,提出在模拟复杂网络基础上结合Feistel算法的子网络节点抵抗攻击方法。该方法通过子网络节点定位参数集,建立恶意节点位置模型,并确定定位真实精度;而后利用Feistel算法对节点密文进行加密处理,进而使加密信息恢复成明文信息,完成模拟复杂网络下子网络节点的抗攻击方法改进。结果证明,该方法不仅能够准确的对恶意节点进行定位,而且增强了节点抗攻击性能,提升了网络安全性。     

Improved routing strategy based on gravitational field theory

Routing and path selection are crucial for many communication and logistic applications. We study the interaction between nodes and packets and establish a simple model for describing the attraction of the node to the packet in transmission process by using the gravitational field theory, considering the real and potential congestion of the nodes. On the basis of this model, we propose a gravitational field routing strategy that considers the attractions of all of the nodes on the travel path to the packet. In order to illustrate the efficiency of proposed routing algorithm, we introduce the order parameter to measure the throughput of the network by the critical value of phase transition from a free flow phase to a congested phase,and study the distribution of betweenness centrality and traffic jam. Simulations show that, compared with the shortest path routing strategy, the gravitational field routing strategy considerably enhances the throughput of the network and balances the traffic load, and nearly all of the nodes are used efficiently.     

基于关键路径链和PACGA的网络总线资源调度方法研究

针对传统工业控制网络总线资源调度算法在节点数量逐渐增加时收敛速度慢和搜索精度不高,且准确度及效率低等问题, 提出了一种基于关键路径链和多态蚁群遗传算法(PACGA)的资源调度方法,采用关键路径链的调度算法获取需求调度的节点,不同节点间采用多态蚁群遗传算法进行资源的调度,依据照工业控制网络资源调度的特征,用自适应调整挥发系数增强节点的全局搜索性能,通过候选节点集方法缩小搜索区域提高算法的搜索效率,完成工业控制网络总线资源的高效调度。仿真实验说明,该种方法在工业控制过程中任务数量较多的情况下仍然具备较高的运行效率和精度,并且具有较低的运行时间,具有较强的应用价值。     

有限步传播范围期望指标判别节点传播影响力

在线社交网络逐渐成为人们不可或缺的重要工具,识别网络中具有高影响力的节点作为初始传播源,在社会感知与谣言控制等方面具有重要意义.本文基于独立级联模型,给出了一个描述有限步传播范围期望的指标-传播度,并设计了一种高效的递推算法.该指标在局部拓扑结构信息的基础上融合了传播概率对影响力进行刻画,能够较好地反映单个节点的传播影响力.对于多传播源影响力极大化问题,本文提出了一种基于传播度的启发式算法-传播度折扣算法,使得多个传播源的联合影响力最大.最后,将上述方法应用到三个真实网络中,与经典指标和方法相比,该方法不需要知道网络的全局结构信息,而是充分了利用网络的局部结构信息,可以较快地筛选出高传播影响力的传播源.     

一种通用的时隙环网时隙调度机制

提出一种新颖的时隙环网公平机制——环分布式时隙调度(DTSR), 该机制是分布式的, 适合所有目的节点剥离业务的时隙环网。DTSR通过在单向信道上循环传输的时隙控制头(TCH)内增加一个简单的域, 实现对环上“饿死”节点信息的动态收集, 协调各个节点占用资源的时间, 确保各节点之间的公平性; 在发现环上有“饿死”节点后, DTSR利用时隙环网空间重用的特性, 调度相关节点向不经过“饿死”节点的其他节点发送数据, 充分利用了环网资源; 此外DTSR机制具有良好的算法收敛性, 且接入时延较传统算法更小。最后,对DTSR的性能进行仿真, 并和几个典型的时隙环网的公平机制进行了比较。     

LPA-MNI: An Improved Label Propagation Algorithm Based on Modularity and Node Importance for Community Detection

Community detection is of great significance in understanding the structure of the network. Label propagation algorithm (LPA) is a classical and effective method, but it has the problems of randomness and instability. An improved label propagation algorithm named LPA-MNI is proposed in this study by combining the modularity function and node importance with the original LPA. LPA-MNI first identify the initial communities according to the value of modularity. Subsequently, the label propagation is used to cluster the remaining nodes that have not been assigned to initial communities. Meanwhile, node importance is used to improve the node order of label updating and the mechanism of label selecting when multiple labels are contained by the maximum number of nodes. Extensive experiments are performed on twelve real-world networks and eight groups of synthetic networks, and the results show that LPA-MNI has better accuracy, higher modularity, and more reasonable community numbers when compared with other six algorithms. In addition, LPA-MNI is shown to be more robust than the traditional LPA algorithm.     

Optimal power allocation for maximizing the energy efficiency of NOMA enabled full-duplex coordinated direct and relay transmission (CDRT) system with SWIPT

In this paper, we investigate the energy efficiency (EE) performance of non-orthogonal multiple access (NOMA) enabled full-duplex (FD) coordinated direct and relay transmission (CDRT) system (i.e., NOMA-FD-CDRT system). Firstly, we consider a two-user scenario, where the base station (BS) can directly communicate with the near user, while it requires the help of a dedicated FD relay node to communicate with the far user. In the second part, we consider that there are two near users and two far users in the system. To improve the EE, we consider integrating the simultaneous wireless information and power transfer (SWIPT) technique at the FD relay. We formulate an analytical expression for the overall EE of the SWIPT-assisted NOMA-FD-CDRT system. We determine optimal power allocation (OPA) for the downlink users at the BS that maximizes the EE. An iterative algorithm based on Dinkelbach method is proposed to determine the OPA vector. With the help of detailed numerical and simulation investigations, it is demonstrated that the proposed OPA can provide significant enhancement of EE of the considered SWIPT-assisted NOMA-FD-CDRT system.     

分数阶微分对盐渍土野外光谱预处理精度提升的机理分析

目前分数阶微分在野外实测光谱中的应用和光谱反演盐渍土盐分的最优波段机理解释尚未见到。针对传统整数阶微分造成位于分数阶次的光谱信息丢失和模型精度降低的问题。以新疆阜康市盐渍土盐分和野外光谱为数据源,对原始光谱及常见4种变换进行0～2阶（阶数间隔取0.1）的共21阶分数阶微分处理,以探讨盐渍土光谱预处理精度提升的机理。结果表明：（1）分数阶微分因阶数连续能精确显示出求导中的光谱变换细节,提升光谱谱峰间的分辨率;且因阶数增加逐渐改变谱峰的峰形轮廓和去峰形化操作,导致盐渍土分数阶微分曲线逐渐向曲线斜率的变化率靠近,即详细刻画出了0阶到一阶微分和斜率与曲率间的细微差异。（2）五种光谱变换的分数阶微分值与含盐量的相关系数,通过0.01显著性水平检验,且大于整数阶（1阶、2阶）的相关系数最大绝对值的,主要集中在1.3,1.4,1.5阶。其中,1.4阶1/lgR和1.3阶1/R的相关系数提升百分比最大,分别为12.78%和13.03%。（3）不论何种光谱变换,各分数阶微分值与含盐量最大相关系数对应的波段均出现在598 nm（1/R）和618 nm（R,,1/lgR和lgR）,且均在1.3或1.4阶。（4）研究区Na+占阳离子总量的65.74%,与总盐的相关性达0.738,钠原子的主要谱线是589.3 nm是造成各种光谱变换与土壤含盐量相关性最佳的波段位于598和618 nm最主要的原因。     

基于热释电红外传感器的多节点定位系统研究与设计

针对热释电红外传感器(PIR)在人体探测领域中越来越广泛的应用,研究设计了一种基于PIR的检测定位系统,可实时完成对人员目标入侵探测区域时的检测与定位,并预推出人员目标的行进轨迹;该系统由多个PIR感知节点组成,每个感知节点通过传感在动、静两种状态下对探测区域进行信息采集;最终融合多节点与不同状态下传感器采集的数据,算出各个传感器的探测角度值,以交叉定位的算法,得到目标的定位坐标;经实验证明,该系统运行稳定,检测灵敏,定位效果很好,拓宽了热释电传感器在定位定向方面的使用范围。     

一种基于可变扇区的非均匀分簇算法

针对LEACH协议中簇首分布不均匀,网络能耗不均衡的问题,提出一种基于可变扇区的非均匀分簇的算法（UCBVS）。首先,利用可变扇区和同心圆将网络合理的动态划分,使得距离基站近的区域分区较小;其次,选取簇内权值大的节点作为簇头,根据权值的大小判断是否进行簇头轮换;最后采用单跳和多跳相结合的方式进行网络通信。仿真结果表明,改进算法能够保证簇头节点能耗均匀,延长了网络生命周期。     

Two-dimensional finite element mesh generation algorithm for electromagnetic field calculation

Two-dimensional finite element mesh generation algorithm for electromagnetic field calculation is proposed in this paper to improve the efficiency and accuracy of electromagnetic calculation. An image boundary extraction algorithm is developed to map the image on the geometric domain. Identification algorithm for the location of nodes in polygon area is proposed to determine the state of the node. To promote the average quality of the mesh and the efficiency of mesh generation, a novel force-based mesh smoothing algorithm is proposed. One test case and a typical electromagnetic calculation are used to testify the effectiveness and efficiency of the proposed algorithm. The results demonstrate that the proposed algorithm can produce a high-quality mesh with less iteration.     

A modified tetrahedron shape measure and its application for 3D trilateration localization in mobile cluster networks

In the error analysis of 3D trilateration localization, we constructed a new tetrahedron shape measurement method based on the condition number of the tetrahedron. This method uses algebraic operations, which is simpler than the previous methods based on complex geometric operations, and is also suitable for the shape measurement of triangle. For the trilateration localization problem in 3D space, based on tetrahedron shape measurement (TSM), we designed an algorithm of selecting anchor nodes on the hollow sphere centered at the unknown node. Extensive simulation experiments show that the tetrahedron shape measurement method proposed in this paper is effective. The anchor node selection algorithm based on tetrahedron shape measurement (TSM) can effectively suppress the iterative error problem in trilateration localization. Furthermore, the calculation of the tetrahedron condition number can be used for the deployment of anchor nodes in trilateration localization.     

一种基于效率矩阵的网络节点重要度评价算法

为了实现对网络节点重要性的有效评价,提出一种基于网络效率矩阵的节点重要度评价算法.该方法综合考虑节点的度值(局部重要度)和网络节点之间的重要性贡献(全局重要度),利用节点的度和效率矩阵表征网络节点的重要度贡献,克服重要性贡献矩阵法中节点只依赖于邻接节点的不足.考虑实际网络的稀疏性,该算法的时间复杂度为O(n²).通过算例分析验证了该算法的可行性和有效性,结果表明:该算法能够更加直观、简单有效地区分节点的重要度差异,并且对于大型复杂网络具有较理想的计算能力.     

An artificial hummingbird algorithm based localization with reduced number of reference nodes for wireless sensor networks

Wireless Sensor Networks (WSN) are widely used in recent years due to the advancements in wireless and sensor technologies. Many of these applications require to know the location information of nodes. This information is useful to understand the collected data and to act on them. Existing localization algorithms make use of a few reference nodes for estimating the locations of sensor nodes. But, the positioning and utilization of reference nodes increase the cost and complexity of the network. To reduce the dependency on reference nodes, in this paper, we have developed a novel optimization based localization method using only two reference nodes for the localization of the entire network. This is achieved by reference nodes identifying a few more nodes as reference nodes by the analysis of the connectivity information. The sensor nodes then use the reference nodes to identify their locations in a distributive manner using Artificial Hummingbird Algorithm (AHA). We have observed that the localization performance of the reported algorithm at a lower reference node ratio is comparable with other algorithms at higher reference node ratios.     

IKN-CF: An Approach to Identify Key Nodes in Inter-Domain Routing Systems Based on Cascading Failures

Inter-domain routing systems is an important complex network in the Internet. Research on the vulnerability of inter-domain routing network nodes is of great support to the stable operation of the Internet. For the problem of node vulnerability, we proposed a method for identifying key nodes in inter-domain routing systems based on cascading failures (IKN-CF). Firstly, we analyzed the topology of inter-domain routing network and proposed an optimal valid path discovery algorithm considering business relationships. Then, the reason and propagation mechanism of cascading failure in the inter-domain routing network were analyzed, and we proposed two cascading indicators, which can approximate the impact of node failure on the network. After that, we established a key node identification model based on improved entropy weight TOPSIS (EWT), and the key node sequence in the network can be obtained through EWT calculation. We compared the existing three methods in two real inter-domain routing networks. The results indicate that the ranking results of IKN-CF are high accuracy, strong stability, and wide applicability. The accuracy of the top 100 nodes of the ranking result can reach 83.6%, which is at least 12.8% higher than the average accuracy of the existing three methods.     

Suspicion Distillation Gradient Descent Bit-Flipping Algorithm

We propose a novel variant of the gradient descent bit-flipping (GDBF) algorithm for decoding low-density parity-check (LDPC) codes over the binary symmetric channel. The new bit-flipping rule is based on the reliability information passed from neighboring nodes in the corresponding Tanner graph. The name SuspicionDistillation reflects the main feature of the algorithm—that in every iteration, we assign a level of suspicion to each variable node about its current bit value. The level of suspicion of a variable node is used to decide whether the corresponding bit will be flipped. In addition, in each iteration, we determine the number of satisfied and unsatisfied checks that connect a suspicious node with other suspicious variable nodes. In this way, in the course of iteration, we “distill” such suspicious bits and flip them. The deterministic nature of the proposed algorithm results in a low-complexity implementation, as the bit-flipping rule can be obtained by modifying the original GDBF rule by using basic logic gates, and the modification is not applied in all decoding iterations. Furthermore, we present a more general framework based on deterministic re-initialization of the decoder input. The performance of the resulting algorithm is analyzed for the codes with various code lengths, and significant performance improvements are observed compared to the state-of-the-art hard-decision-decoding algorithms.     

无线传感器网络中继节点布居算法的研究

本文表述的是在该应用背景下引入多约束条件, 并采用枚举法与贪婪寻优算法相结合的方法, 解决了在可以作为中继节点设置位置的预设中继节点位置集合内, 合理选择中继节点设置位置以及既存网络因添加新传感器节点所引起的中继节点追加的问题. 仿真实验表明, 本文提出的中继节点布居与追加优化算法能够保证多约束条件下网络的容错性. 同时提出的基于最小网络距离因子评价标准, 有效提高了中继节点布居算法的能效性.