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

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

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.     

基于联合分步APIT定位算法的改进

本文研究了无线传感网络( Wireless Sensor Network,WSNs)的节点定位问题,并针对APIT由于锚节点在低密度环境下的节点误判和节点失效等问题给出了改进,在APICT定位算法的基础提出了联合分步定位算法UNION-APICT(Union Approximate Point-In-Circumcircle Test),该算法是结合连通性的测距技术,RSSI测距技术以及质心定位和APICT等技术,来联合解决对未知节点定位问题。通过仿真实验结果表明,改进后的UNION-APICT在APICT算法的基础之上平均定位误差减少了10%-25%,定位性能有了明显的提升;随着通信半径R和最大探测距离rmax的增加,定位误差也在逐渐减小,该算法较APIT和APICT定位算法在锚节点密度、节点覆盖率和定位精度上都有所提高。     

自适应在线模型校准的RSS实时定位算法*

针对传统的RSS定位方法对环境因素要求过高,在设计校准和运行操作阶段工作量大效率不高的问题,提出一种基于锚节点RSS在线建模校准的无线传感器网络定位算法。首先,利用标准偏差阈值方法对信号强度不确定度较大的锚节点进行过滤,并对锚节点和未知节点间的距离与接收信号强度的关系进行在线建模。其次,采用周期校准方式对在线模型进行实时修正,然后利用加权平均的方式对未知节点进行定位,建立对环境因素的自适应机制实现节点的实时准确定位。最后,通过仿真显示该方法能够有效对无线传感器网络未知节点进行定位且精度满足要求,算法简单易于实现具有实际应用价值。     

A Spherical Band-based DV-Hop localization technique for three-dimensional wireless sensor network

Wireless Sensor Networks have been the focal point of research for many years due to their wide range of application areas. Such networks consist of resource-constrained sensor nodes that are generally not equipped with any positioning component due to cost issues. This requires the adoption of suitable methodologies to infer the location of the deployed sensor nodes. Location information of such sensor nodes can be obtained with the help of some location-aware nodes. Numerous localization algorithms exist in the literature. Amongst them, Distance Vector Hop (DV-Hop) is a computationally less expensive algorithm that uses hop count values between sensor nodes and anchor nodes for location estimation of the deployed sensor nodes. However, the traditional DV-Hop algorithm produces a larger positioning deviation for a higher hop count value. Several existing works attempt to address this issue by either modifying the hop size or optimizing the estimated position resulting in comparatively higher localization errors and computationally expensive. This paper aims to solve the issue by modifying the hop size by dividing it into equal-sized spherical bands (SB). Sensor nodes use this SB value for computing their distances from anchor nodes and non-coplanar anchor nodes for location estimation. The simulation results demonstrate that the mean localization error of the proposed approach has reduced approximately by 75%, 66%, and 47% in comparison to traditional DV-Hop, 3D PSODV-Hop, and 3D GAIDV-Hop respectively.     

Distributed sound source localization algorithm with sound velocity calibration in windy environments

A new sound source localization method with sound speed compensation is proposed to reduce the wind influence on the performance of conventional TDOA(Time Difference of Arrival) algorithms. First, the sound speed is described as a set of functions of the unknown source location, to approximate the acoustic velocity field distribution in the wind field. Then,they are introduced into the TDOA algorithm, to construct nonlinear equations. Finally, the particle swarm optimization algorithm is used to estimate the source location. The simulation results show that the proposed algorithm can significantly improve the localization accuracy for different wind velocities, source locations and test area sizes. The experimental results show that the proposed method can reduce localization errors to about 40% of the original error in a four nodes localization system.     

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.     

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

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

基于节点相关性的网络不动点理论研究

现代复杂的通信网络内部存在着广泛的幂律现象，网络节点之间存在相关特性. 根据这种相关特性，提出了网络不动点理论. 将Banach不动点理论引入网络模型，证明了网络不动点理论的正确有效性. 证明过程是把通信网络看作由路径预测算法产生的似马尔可夫链的路由节点迭代序列形成的网络空间. 由节点相关性可知，此空间中的节点序列相对越长就越能折射出搜索的目标所在，预测准确率也会逐步增加，可以更好地进行目标定位、数据挖掘等. 通过某种路由准则的算子从源节点最终映射到的目的节点与Banach空间的不动点相对应，即为网络空间的不动点. 当网络发展到能为用户提供真正的无处不在的连接时，网络不动点理论的物理特性将非常明显. 因为网络规模越大，节点间的群体作用越显著，就越能显现网络不动点理论的物理特性. 关键词： 计算机网络 长程相关 不动点 幂律     

Identifying Important Nodes in Complex Networks Based on Node Propagation Entropy

In recent years, the identification of the essential nodes in complex networks has attracted significant attention because of their theoretical and practical significance in many applications, such as preventing and controlling epidemic diseases and discovering essential proteins. Several importance measures have been proposed from diverse perspectives to identify crucial nodes more accurately. In this paper, we propose a novel importance metric called node propagation entropy, which uses a combination of the clustering coefficients of nodes and the influence of the first- and second-order neighbor numbers on node importance to identify essential nodes from an entropy perspective while considering the local and global information of the network. Furthermore, the susceptible–infected–removed and susceptible–infected–removed–susceptible epidemic models along with the Kendall coefficient are used to reveal the relevant correlations among the various importance measures. The results of experiments conducted on several real networks from different domains show that the proposed metric is more accurate and stable in identifying significant nodes than many existing techniques, including degree centrality, betweenness centrality, closeness centrality, eigenvector centrality, and H-index.     

基于自规避随机游走的节点排序算法

评估复杂网络系统的节点重要性有助于提升其系统抗毁性和结构稳定性. 目前, 定量节点重要性的排序算法通常基于网络结构的中心性指标如度数、介数、紧密度、特征向量等. 然而, 这些算法需要以知晓网络结构的全局信息为前提, 很难在大规模网络中实际应用. 基于自规避随机游走的思想, 提出一种结合网络结构局域信息和标签扩散的节点排序算法. 该算法综合考虑了节点的直接邻居数量及与其他节点之间的拓扑关系, 能够表征其在复杂网络系统中的结构影响力和重要性. 基于三个典型的实际网络, 通过对极大连通系数、网络谱距离数、节点连边数和脆弱系数等评估指标的实验对比, 结果表明提出的算法显著优于现有的依据局域信息的节点排序算法.     

风场环境中声速修正的分布式声源定位算法

为减小声速误差对定位精度的影响,提出了一种基于声速修正的分布式声源定位方法。首先,将声速表示为未知声源位置的函数,逼近风场中的声速场分布,然后将其代入TDOA (Time Differences of Arrival)算法中,构建非线性超定方程组,最后采用粒子群优化算法求解声源位置。对不同风速、不同声源位置及不同测试区域进行仿真,结果表明:修正后的定位精度比修正前有明显提高,尤其对于大范围并且声源靠近测试区域边缘位置的定位系统,改善更加明显;4个节点的定位系统实验结果表明,修正后的定位误差可降至修正前的4l%,该方法能更好的应用于风场中的定位系统。     

Scalably Using Node Attributes and Graph Structure for Node Classification

The task of node classification concerns a network where nodes are associated with labels, but labels are known only for some of the nodes. The task consists of inferring the unknown labels given the known node labels, the structure of the network, and other known node attributes. Common node classification approaches are based on the assumption that adjacent nodes have similar attributes and, therefore, that a node’s label can be predicted from the labels of its neighbors. While such an assumption is often valid (e.g., for political affiliation in social networks), it may not hold in some cases. In fact, nodes that share the same label may be adjacent but differ in their attributes, or may not be adjacent but have similar attributes. In this work, we present JANE (Jointly using Attributes and Node Embeddings), a novel and principled approach to node classification that flexibly adapts to a range of settings wherein unknown labels may be predicted from known labels of adjacent nodes in the network, other node attributes, or both. Our experiments on synthetic data highlight the limitations of benchmark algorithms and the versatility of JANE. Further, our experiments on seven real datasets of sizes ranging from 2.5K to 1.5M nodes and edge homophily ranging from 0.86 to 0.29 show that JANE scales well to large networks while also demonstrating an up to 20% improvement in accuracy compared to strong baseline algorithms.     

The Self-Information Weighting-Based Node Importance Ranking Method for Graph Data

Due to their wide application in many disciplines, how to make an efficient ranking for nodes, especially for nodes in graph data, has aroused lots of attention. To overcome the shortcoming that most traditional ranking methods only consider the mutual influence between nodes but ignore the influence of edges, this paper proposes a self-information weighting-based method to rank all nodes in graph data. In the first place, the graph data are weighted by regarding the self-information of edges in terms of node degree. On this base, the information entropy of nodes is constructed to measure the importance of each node and in which case all nodes can be ranked. To verify the effectiveness of this proposed ranking method, we compare it with six existing methods on nine real-world datasets. The experimental results show that our method performs well on all of these nine datasets, especially for datasets with more nodes.     

An extended improved global structure model for influential node identification in complex networks

Accurate identification of influential nodes facilitates the control of rumor propagation and interrupts the spread of computer viruses. Many classical approaches have been proposed by researchers regarding different aspects. To explore the impact of location information in depth, this paper proposes an improved global structure model to characterize the influence of nodes. The method considers both the node's self-information and the role of the location information of neighboring nodes. First, degree centrality of each node is calculated, and then degree value of each node is used to represent self-influence, and degree values of the neighbor layer nodes are divided by the power of the path length, which is path attenuation used to represent global influence. Finally, an extended improved global structure model that considers the nearest neighbor information after combining self-influence and global influence is proposed to identify influential nodes. In this paper, the propagation process of a real network is obtained by simulation with the SIR model, and the effectiveness of the proposed method is verified from two aspects of discrimination and accuracy. The experimental results show that the proposed method is more accurate in identifying influential nodes than other comparative methods with multiple networks.     

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

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

LCH: A local clustering H-index centrality measure for identifying and ranking influential nodes in complex networks

Identifying influential nodes in complex networks is one of the most significant and challenging issues, which may contribute to optimizing the network structure, controlling the process of epidemic spreading and accelerating information diffusion. The node importance ranking measures based on global information are not suitable for large-scale networks due to their high computational complexity. Moreover, they do not take into account the impact of network topology evolution over time, resulting in limitations in some applications. Based on local information of networks, a local clustering H-index (LCH) centrality measure is proposed, which considers neighborhood topology, the quantity and quality of neighbor nodes simultaneously. The proposed measure only needs the information of first-order and second-order neighbor nodes of networks, thus it has nearly linear time complexity and can be applicable to large-scale networks. In order to test the proposed measure, we adopt the susceptible-infected-recovered (SIR) and susceptible-infected (SI) models to simulate the spreading process. A series of experimental results on eight real-world networks illustrate that the proposed LCH can identify and rank influential nodes more accurately than several classical and state-of-the-art measures.     

Detecting local community structures in complex networks based on local degree central nodes

Detecting local communities in real-world graphs such as large social networks, web graphs, and biological networks has received a great deal of attention because obtaining complete information from a large network is still difficult and unrealistic nowadays. In this paper, we define the term local degree central node whose degree is greater than or equal to the degree of its neighbor nodes. A new method based on the local degree central node to detect the local community is proposed. In our method, the local community is not discovered from the given starting node, but from the local degree central node that is associated with the given starting node. Experiments show that the local central nodes are key nodes of communities in complex networks and the local communities detected by our method have high accuracy. Our algorithm can discover local communities accurately for more nodes and is an effective method to explore community structures of large networks.     

Joint Optimization of Data Freshness and Fidelity for Selection Combining-Based Transmissions

Motivated by big data applications in the Internet of Things (IoT), abundant information arrives at the fusion center (FC) waiting to be processed. It is of great significance to ensure data freshness and fidelity simultaneously. We consider a wireless sensor network (WSN) where several sensor nodes observe one metric and then transmit the observations to the FC using a selection combining (SC) scheme. We adopt the age of information (AoI) and minimum mean square error (MMSE) metrics to measure the data freshness and fidelity, respectively. Explicit expressions of average AoI and MMSE are derived. After that, we jointly optimize the two metrics by adjusting the number of sensor nodes. A closed-form sub-optimal number of sensor nodes is proposed to achieve the best freshness and fidelity tradeoff with negligible errors. Numerical results show that using the proposed node number designs can effectively improve the freshness and fidelity of the transmitted data.