一种低时延的短波自组网优化链路状态路由协议

优化链路状态路由(Optimized Link State Routing,OLSR)协议是一种先验式路由协议,网络中的所有节点通过周期性地发送控制消息来计算全网路由信息。在短波自组织网络中,节点周期性地发送控制消息会占据大量的信道资源,大幅增加网络的控制开销,浪费短波有限的带宽资源,导致网络通信性能急剧下降。其次,受到地形地貌、天线方向和接收性能的个体差异等影响,造成无线链路不稳定,导致网络中存在非对称链路,增加了通信端到端时延。为此,提出了一种低时延的短波自组网OLSR协议。该协议在执行MPR(Multipoint Relay)选择算法时综合考虑了节点的连接度和链路可靠性,在优化MPR节点个数的同时选择链路可靠性较大的节点作为MPR节点,在进行路由选择时能够利用网络中的非对称链路。仿真结果表明,该协议能优化数据包投递成功率、吞吐量、端到端时延和网络控制开销等性能指标。     

基于OPNET的3G-ALE多址接入协议仿真分析

由于短波资源有限,研究短波网络多址接入协议尤为重要。介绍了第3代短波自动链路建立协议（3G-ALE）所采用的新技术,然后对3G-ALE协议多址接入算法进行了分析。在OPNET网络仿真平台,独立设计完成了3G-ALE节点模型、相关进程模型及网络模型,对自动链路建立过程进行了仿真,并进行了不同情况下节点建链成功率的仿真分析。结果表明,信道误码率对节点建链成功率影响最明显,信道数量和网络节点数次之,节点业务量对建链影响最小。     

负载作用下相依网络择优恢复方法研究

优选节点实施恢复是控制相依网络级联失效的有效措施。针对以往恢复模型未考虑节点负载的情况,该文首先分析了包含依赖失效和过载失效的级联失效过程,构建了负载作用下相依网络恢复模型。然后,基于共同边界节点的结构和动力学属性,提出一种基于容量和连接边的择优恢复(PRCCL)方法。实验结果表明,在无标度相依网络中,PRCCL方法恢复效果明显好于基准方法,恢复时间更短,恢复后的网络具有更高的平均度和鲁棒性;在Power网和Internet网构成的相依网络中,PRCCL方法恢复效果同样优于基准方法;PRCCL方法的优势与恢复比例、负载控制参数成正比,与容忍系数成反比。实验结果验证了PRCCL方法的有效性,对于现实中相依网络恢复工作具有科学指导价值。     

WSN中一种基于能量效率的协同中继传输方案

本文针对分簇无线传感器网络,提出了一种基于能量效率的协同中继传输方案,该方案中源簇头根据源到邻簇头之间的信道状态信息选择最优中继节点;协同传输数据时,目的节点接收到两个时隙的信号后进行最大比合并,并根据设定的接收信噪比门限范围在确认帧中给中继节点反馈功率调整信息,以减少重传次数或降低中继节点的发射功率,在不增加开销的情况下可以减少系统总的能量消耗。文章利用概率密度函数推导了基于部分信道状态信息选择中继协同的误符号率闭式表达式,最后通过蒙特卡洛仿真进行了验证。结果表明:误符号率的理论推导值与仿真值一致,在相同的接收信噪比门限时,本文所提方案能够明显提高系统的能效性。      

基于流量攻击和边失效的复杂网络脆弱特性

基于流量的攻击可能对复杂网络造成严重破坏,现有研究主要针对节点攻击。该文分析了部分边失效时,复杂网络的脆弱特性。此外,分析了时机策略和网络规模对边失效的影响。通过研究节点负载和度分布特点,发现复杂网络的脆弱特性源于其幂率度分布引起的节点负载的极度非均匀分布。仿真实验表明,复杂网络对随机的边失效具有较强的耐受力,但在一定条件下,攻击极少量重要边就可能引发连锁的节点过载失效,而导致网络溃散。     

微博转发网络中的节点特征和传播模型

微博作为重要的社交网络平台,具有传播快速、平台影响大的特点.微博用户的节点特征决定了其网络影响力.研究了微博转发网络中节点的度值特征和传播模型.首先通过区分信息流动方向构建了微博转发网络;其次分别讨论了出度一入度的均值和方差,明确二者的差异,并分析了考虑节点度值特征的信息传播过程;最后通过仿真验证可以看出:边的有向性对信息传播有着显著的影响,在有向条件下,渗流阈值增加,同样概率下传播范围变小,信息传播更为困难.     

短波IP路由器架构及性能分析

短波IP网络是未来军事短波通信网络的发展方向,短波IP路由器是短波IP网络的关键设备,负责提供本地局域网和短波信道之间的路由转发。通过对国内外现状的研究,提出一种短波IP路由器模型,在其中利用Mnux系统的Tun接口实现了路由转发的功能并对其性能进行了初步分析。     

基于OPNET的高频通信协议仿真与分析

由于电离层信道具有不可摧毁性,在应急通信领域研究短波通信协议就显得尤为重要。文中在第三代短波自动链路协议基础上,采用新技术对多址接入技术进行了研究分析,并利用OPNET Modeler 14.5网络仿真平台验证方案的可行性。在短波通信网络模型中,管道机制利用长期信道预测软件VOACAP获取电离层信道质量参数进行无线信道建模;核心函数和C编程语言进行3G-ALE节点模型及相关进程模型、网络模型的建模。对不同场景进行的仿真实验表明,信道质量对网络节点间建链成功率影响最明显,网络节点个数及两节点间距离对建链成功率影响次之。     

车载自组织网络中网络连通特性研究

研究了3个典型车辆移动模型和真实车辆行驶轨迹对车载自组织网络连通特性的影响,评价了车辆移动模型的合理性。仿真结果表明,相邻车辆的速度相关性对连接持续时间产生显著影响;交通“热点”和红绿灯规则造成的节点聚簇行为增强了网络连通度;节点分布不均匀使得车载自组织网络具有较高中心度的结论。     

LEACH协议最佳群首个数的研究

低能耗自适应分簇(LEACH)协议随机循环地选择群首并将网络能量消耗平均分配给每个节点,但没有考虑选择的群首个数是否在最佳群首范围内。为了避免网络中群首节点数较少或较多而导致节点过早死亡,结合节点数据融合率并以单跳与多跳相结合的方式将数据发送给基站的方法确定最佳群首个数。当网络中的分群个数与最佳群首个数相同时,可以提高网络生命周期,节约网络能耗。     

Data Transmission Strategy Based on Node Motion Prediction IoT System in Opportunistic Social Networks

With the rapid popularization of mobile smart devices in the IoT and the 5G environment, nodes’ requirements for network response speed are constantly increasing. Edge computing uses edge servers to perform simple processing when data is transmitted, increasing the response speed of devices and reducing the pressure on network traffic. However, the random movement of many nodes in an opportunistic social network easily leads to dynamic changes in the network structure and unstable transmission links. Therefore, this research proposes a data transmission strategy based on node motion prediction in opportunistic social networks (MPDTS). Any node will be assigned to a different cluster depending on how likely it is to meet other nodes. Messages are forwarded within and between clusters using different judgment indicators. This method effectively combines the connection between nodes, the node’s activity level, and sports characteristics successfully reduces the waste of resources for invalid message delivery. Simultaneously, it improves the possibility of message forwarding to the target node. Comparative experiments with several methods show that the MPDTS method has more outstanding performance.

     

Selection of test paths for solder joint intermittent connection faults under DC stimulus

The test path of solder joint intermittent connection faults under direct-current stimulus is examined in this paper. According to the physical structure of the circuit, a network model is established first. A network node is utilised to represent the test node. The path edge refers to the number of intermittent connection faults in the path. Then, the selection criteria of the test path based on the node degree index are proposed and the solder joint intermittent connection faults are covered using fewer test paths. Finally, three circuits are selected to verify the method. To test if the intermittent fault is covered by the test paths, the intermittent fault is simulated by a switch. The results show that the proposed method can detect the solder joint intermittent connection fault using fewer test paths. Additionally, the number of detection steps is greatly reduced without compromising fault coverage.     

基于改进SSA优化WSN分簇协议

无线传感器网络(Wireless Sensor Networks,WSN)的路由协议是无线传感器网络领域中的一个研究热点.针对LEACH协议的不足,提出一种基于自适应t分布改进麻雀搜索算法(Improved Sparrow Search Algorithm,ISSA)的改进LEACH协议(LEACH?ISSA),以解决...     

社会属性感知的边缘计算任务调度策略

边缘计算服务器的负载不均衡将严重影响服务能力,该文提出一种适用于边缘计算场景的任务调度策略(RQ-AIP)。首先,根据服务器的负载分布情况衡量整个网络的负载均衡度,结合强化学习方法为任务匹配合适的边缘服务器,以满足传感器节点任务的资源差异化需求;进而,构造任务时延和终端发射功率的映射关系来满足物理域的约束,结合终端用户社会属性,为任务不断地选择合适的中继终端,通过终端辅助调度的方式实现网络的负载均衡。仿真结果表明,所提出的策略与其他负载均衡策略相比能有效地缓解边缘服务器之间的负载和核心网的流量,降低任务处理时延。     

基于接收信噪比和网络寿命的最优中继选择

为了增大网络寿命,降低误符号率,优化无直传链路协作通信系统的性能,本文提出基于接收信噪比和网络寿命的最优中继选择算法。由于网络寿命的问题无法直接求解,将其转化为中继节点剩余能量与目的节点达到接收信噪比门限时发射功率的比值。首先计算各个中继在目的节点的接收信噪比,将大于信噪比门限加入候选中继,然后依次计算候选中继的联合优化函数值并排序,值最大者即为最优中继。理论推导了系统误符号率的上下界,仿真表明理论值与仿真值较为吻合,验证了系统在保证较低误符号率的基础上延长了网络寿命。     

Priority differentiated multicast flow scheduling method in Ceph cloud storage network

In order to solve the problem that existing flow scheduling method is difficult to meet the different multicast scheduling requirements of multi-service flows in the Ceph cloud storage network,a service priority-based multicast flow scheduling method was tailored.First,the network status was obtained via software defined network (SDN) to support flow scheduling.Then,a multicast task was decomposed into multiple attribute decision problems for multiple unicast path selection,and a method of unicast path selection based on technique for order preference by similarity to ideal solution (TOPSIS) was proposed.The unicast path selection method was used to find the optimal unicast path set for the service flow based on the flow’s network performance requirements.Then,the multicast distribution node was determined by the maximum common sub-path among the optimal unicast path sets for construct a multicast transmission path.The experiment results show that the proposed method can reduce the transmission delay of high priority flows while reduce the redundant traffic and better balance the traffic loads compared with the existing methods.     

A fuzzy decision scheme for relay selection in cooperative wireless sensor network

In energy‐constrained military wireless sensor networks, minimizing the bit error rate (BER) with little compromise on network lifetime is one of the most challenging issues. This paper presents a new relay selection based on fuzzy logic (RSFL) scheme which provides balance between these parameters. The proposed scheme considers node's residual energy and path loss of the relay‐destination link as the input parameters for the selection of the relay node. The relay node selection by fuzzy logic is based on prioritizing higher residual energy and minimum path loss. To evaluate the performance on wireless sensor network, we compare the proposed scheme with the three existing relay selection strategies, ie, random, maximum residual energy based relay selection (MaxRes), and minimum energy consumption based relay selection (MinEnCon). The simulation results of the proposed scheme in terms of network lifetime, BER, Network Survivability Index (NSI), and average energy of network nodes have been presented and compared with different relay selection schemes. The simulation results show that the proposed RSFL scheme has the lowest BER, moderate network lifetime, average energy, and NSI.     

Set pair three-way overlapping community discovery algorithm for weighted social internet of things

There are many problems in Social Internet of Things(IoTs), such as complex topology information, different degree of association between nodes and overlapping communities. The idea of set pair information grain computing and clustering is introduced to solve the above problems so as to accurately describe the similarity between nodes and fully explore the multi-community structure. A Set Pair Three-Way Overlapping Community Discovery Algorithm for Weighted Social Internet of Things (WSIoT-SPTOCD) is proposed. In the local network structure, which fully considers the topological information between nodes, the set pair connection degree is used to analyze the identity, difference and reverse of neighbor nodes. The similarity degree of different neighbor nodes is defined from network edge weight and node degree, and the similarity measurement method of set pair between nodes based on the local information structure is proposed. According to the number of nodes' neighbors and the connection degree of adjacent edges, the clustering intensity of nodes is defined, and an improved algorithm for initial value selection of k-means is proposed. The nodes are allocated according to the set pair similarity between nodes and different communities. Three-way community structures composed of a positive domain, boundary domain and negative domain are generated iteratively. Next, the overlapping node set is generated according to the calculation results of community node membership. Finally, experiments are carried out on artificial networks and real networks. The results show that WSIoT-SPTOCD performs well in terms of standardized mutual information, overlapping community modularity and F1.     

基于总变分的干涉成像高度计相位滤波方法

宽幅干涉成像高度计采用双天线近天底角短基线干涉测高技术,实现对海洋亚中尺度现象的高时空分辨率与高精度观测.在反演海面高度(SSH)的过程中,干涉相位滤波处理是抑制随机相位噪声,保持相位边缘细节的重要环节.该文针对成像高度计干涉相位随机噪声方差在刈幅范围内分布不均匀的特点,基于宽幅干涉成像高度计相位模型,提出一种改进的总...     

A fixed clustering protocol based on random relay strategy for EHWSN

In Energy Harvesting Wireless Sensor Networks (EHWSN), the communication protocol will directly affect the final performance of the network, so it is necessary to study the communication protocol based on EHWSN. In this paper, for the low-cost fixed clustering problem, a fixed clustering protocol RRCEH is based on random relaying. Our proposed RRCEH abandons the inefficient inter-cluster communication method of the traditional fixed clustering protocol. To coordinate the data upload of the cluster head, RRCEH allocates different random relay vectors to each ring area of the network, and combines all the random relay vectors into a random relay matrix of RRCEH. In each communication round, the cluster head node randomly selects its relay target node to send data according to the probability distribution in the random relay vector in the area. For two different cluster head configuration scenarios, by optimizing the random relay matrix, RRCEH can effectively reduce the network's configuration requirements for cluster head energy harvesting capability, thus reducing the deployment cost of EHWSN.