机会网络中自私行为影响的分析与调节

以往针对机会网络中节点自私性影响评估的研究,建立了多种分析模型,然而并未考虑如何应用这些理论模型.本文分别在网络无TTL限制和有TTL限制两种情况下,利用评估模型对自私节点的影响进行分析,并提出一种基于消息分类的自私模型,评估了自私节点对延迟和消息投递率的影响.分析表明,机会网络受自私节点的影响不仅与自私节点的数目有关,而且与节点的移动速度,消息传输范围有关.因此,可以通过调节这些参数提高网络的性能,减少自私节点的影响.首先,通过理论推导分别得出了2-hop路由和传染病路由在延迟保证下的合作节点数目和消息传输范围以及传染病路由在消息投递率保证下消息的TTL.随后,通过ONE仿真平台对自私节点影响的评估,证明自私行为影响下网络性能的理论值与实验值近似,并且证明了通过理论分析获得的参数值也与实验值近似.     

容迟网络中基于社会网络的可靠路由

针对容迟网络中存在较多自私节点的问题,提出了一种基于社会网络的可靠路由方法,以确保消息有效可靠地传递到目的节点.利用社会网络中节点间的关系评估方法,计算出团队间的关系强度矩阵.消息源节点的团队依据关系强度矩阵选择适合的成员节点作为中继节点向目的节点传递消息,避免了网络中自私节点抛弃所转交消息的可能.同时,结合容迟网络间断性连通的特点,在消息转交过程中采用基于身份的密码体制方法,保证了消息转交的安全性.实验表明,所提出的方法在自私节点较多的容迟网络里能保证消息高效、安全地传递到目的节点.     

基于Gossip网络协议的前置消息验证

针对联盟链中Gossip网络协议的冗余现象,文中提出了一种采用多项式证明和布隆过滤器进行前置验证的算法GP与GB。其核心思路为以Gossip网络传播协议为基础,在消息传播到新节点之前进行简短的消息验证,只传播新节点不包含的消息,通过前置验证来降低消息冗余现象。实验表明,在通过Gossip网络协议进行传播消息时,通过前置消息验证可以显著降低整个网络的使用带宽。     

一种基于Waters-IBE的在线/离线加密方案

针对无线传感器网络中传感器节点能量和计算能力的局限性,本文在Waters-IBE的基础上,提出了一种基于身份的在线/离线加密算法.该算法将加密过程划分为两个阶段:离线阶段和在线阶段.离线阶段由PKG或基站完成,在获得接收者身份和将要加密的消息之前可进行大量复杂运算;在线阶段在节点中只需进行简单运算就可加密消息.在完全模型下可证明算法是CPA安全的.仿真实验表明,算法减轻了节点中的运算量并降低了运算时间,从而更加适用于无线传感器网络.     

基于图神经网络的复杂网络关键节点检测算法

针对复杂网络关键节点检测算法准确性低及可靠性不足的问题，结合图神经网络(Graph Neural Network, GNN)模型提出了一种新的复杂网络关键节点检测算法。将复杂网络建模为图模型，通过注意力机制学习每个邻居节点的权重；利用GNN强大的图学习和推理能力，评估网络中节点与连接的关键性评分；采用强化学习(Reinforcement Learning, RL)搜索GNN的超参数，从而提高关键节点检测算法的可扩展性及可靠性。仿真实验结果表明，由该算法检测的关键节点具有较高的准确性，并且具有较快的运算速度。     

基于网络超链接信息熵的节点重要性序结构演化建模分析

动态复杂网络在时空演化过程中,网络节点重要性层内交互关系和层间耦合关系可以更为准确对时序网络节点序结构演化进行分析.本文提出基于网络超链接信息熵的节点重要性序结构演化模型.分析时序网络层内节点超链接信息熵重要性排序结果,得到时序网络节点相邻时间层与跨时间层节点重要性排序模型.节点超链接信息熵总结相邻时间层与跨时间层节点相似性耦合效应.通过SIR(Susceptible Infected Recovered)模型检验节点传播效率进行实证网络仿真,结果与经典时序网络模型相比,本文模型Kendall’sτ值在各时间层均有提高,最高为11.310%.     

机会网络中基于节点暂态社区的消息转发策略

当前机会网络中消息转发策略大多是基于节点间的历史相遇消息选取与其他节点累积相遇能力强的节点作为中继节点。此类策略对节点能力的估计默认采用均匀量化的方式,但经观察发现节点中继能力并非均匀的,主要体现在节点移动模式在时间和地理位置上呈现出极强的聚集性,我们称之为节点的暂态特性。针对上述问题,本文提出了一种基于节点暂态特性的消息转发策略,将具有相似暂态特性的节点聚合成暂态社区,利用暂态社区内节点间的强连通性和不同暂态社区的时序特性来改善机会网络性能。仿真结果表明本文提出的策略能够有效提升消息的投递率,降低投递延时和网络开销。     

社交网络中用户区域影响力评估算法研究

以人人网为例对在线社交网络的分析,从区域信息传播的角度出发,研究社交网络中,信息传播的微观过程.通过真实测量用户的信息传播行为,完成用户信息传播网络的构建和测量.发现区域信息传播网络中少量核心节点覆盖了大部分的网络传播行为.针对这些核心节点,文中提出了一种基于节点传播意愿和传播能力综合考察的节点传播影响力识别算法InfluenceRank,并通过与多种相关算法进行比对,验证了算法的有效性.     

基于树核度的社交网络影响最大化问题

社交网络中的影响最大化问题是指对于给定的k值,寻找k个在特定传播模型下能够使得传播范围达到最大的节点.此问题在常用的几种传播模型中都是NP-难的.目前虽然已经有很多近似求解的算法,但如何在较低的算法时间复杂度下,保证较大的传播范围仍然是求解该问题的一个挑战.为此,本文提出了一种新颖的基于图的树核度理论的方法来求解社交网络影响最大化问题,并相应地给出了一个多项式时间的算法.所提算法综合考虑了网络的结构特征和传播特征.另外,我们将该算法与传统的随机、度以及贪心算法进行了比较.实验结果表明,所提算法可以较快地找到能够使得传播范围较大的节点集合.     

电子系统电磁脉冲易损性评估的分层贝叶斯网络模型

针对电子系统电磁脉冲易损性评估问题,提出了基于分层贝叶斯网络的电子系统电磁脉冲易损性评估模型建模方法.分析了电子系统分层结构特征及其电磁脉冲效应的特点,应用电磁拓扑理论中的相互作用顺序图分析系统电磁耦合途径,确定系统内底层屏蔽区域节点,研究了相互作用顺序图与系统分层贝叶斯网络的拓扑关联关系,在系统分层贝叶斯网络模型中增加底层屏蔽区域节点层,从而建立系统易损性评估模型,并给出了相应的建模步骤.最后以某电子机械传动系统电磁脉冲易损性评估问题为例说明了建模和计算过程.     

Algebraic gossip: a network coding approach to optimal multiple rumor mongering

The problem of simultaneously disseminating k messages in a large network of n nodes, in a decentralized and distributed manner, where nodes only have knowledge about their own contents, is studied. In every discrete time-step, each node selects a communication partner randomly, uniformly among all nodes and only one message can be transmitted. The goal is to disseminate rapidly, with high probability, all messages to all nodes. It is shown that a random linear coding (RLC) based protocol disseminates all messages to all nodes in time ck+/spl Oscr/(/spl radic/kln(k)ln(n)), where c<3.46 using pull-based dissemination and c<5.96 using push-based dissemination. Simulations suggest that c<2 might be a tighter bound. Thus, if k/spl Gt/(ln(n))/sup 3/, the time for simultaneous dissemination RLC is asymptotically at most ck, versus the /spl Omega/(klog/sub 2/(n)) time of sequential dissemination. Furthermore, when k/spl Gt/(ln(n))/sup 3/, the dissemination time is order optimal. When k/spl Lt/(ln(n))/sup 2/, RLC reduces dissemination time by a factor of /spl Omega/(/spl radic/k/lnk) over sequential dissemination. The overhead of the RLC protocol is negligible for messages of reasonable size. A store-and-forward mechanism without coding is also considered. It is shown that this approach performs no better than a sequential approach when k=/spl prop/n. Owing to the distributed nature of the system, the proof requires analysis of an appropriate time-varying Bernoulli process.     

A group-based data-driven approach for data synchronization in unstructured mobile P2P systems

This paper addresses the problem of data consistency on mobile peer-to-peer (MP2P) systems (or MP2P networks). The considered MP2P system is based on a mobile ad-hoc network, where the energy and connectivity on the mobile devices are limited. Since different mobile nodes may store copies of shared information, data synchronization on an MP2P system becomes crucial and challenging due to frequent disconnection and change on network topology caused by node mobility. We propose an effective approach to improving the performance of data synchronization with a dynamic inverted data indexing structure and group-based data-driven consistency management. The proposed approach can effectively synchronize the data items without using a central cache node in each group (or cluster) and perform well in terms of the coverage of successfully synchronized nodes and the number of redundant messages. Last, the proposed approach is validated through extensive simulation experiments.     

Transmission scheduling in a multi‐channel wireless network with bidirectional relaying links

Using network coding in a wireless network can potentially improve the network throughput. On the other hand, it increases the complexity of resource allocations as the quality of one transmission is affected by the link conditions of the transmitter to multiple receivers. In this work, we study time slot scheduling and channel allocations jointly for a network with bidirectional relaying links, where the two end nodes of each link can exchange data through a relay node. Two scenarios are considered when the relay node forwards packets to the end nodes. In the first scenario, the relay node always forwards network‐coded packets to both end nodes simultaneously; in the second scenario, the relay node opportunistically uses network coding for two‐way relaying and traditional one‐way relaying. For each scenario, an optimization problem is first formulated for maximizing the total network throughput. The optimum scheduling is not causal because it requires future information of channel conditions. We then propose heuristic scheduling schemes. The slot‐based scheduling maximizes the total transmission rate of all the nodes at each time slot, and the node‐based scheduling schedules transmissions based on achievable transmission rates of individual nodes at different channels. The node‐based one has lower complexity than the slot‐based one. Our results indicate that although the node‐based scheduling achieves slightly lower throughput than the slot‐based one, both the proposed scheduling schemes are very effective in the sense that the difference between their throughput and the optimum scheduling is relatively small in different network settings. Copyright © 2015 John Wiley & Sons, Ltd.     

基于有向拓扑势的用户角色分析方法

真实世界中存在大量有向、加权、动态的网络。针对有向加权网络的节点角色分析问题,提出了一种基于有向拓扑势的节点角色分析方法,该方法根据节点的行为模式及局部影响力将节点划分成4种角色。然后介绍了基于节点角色的动态网络演化分析方法,它能对角色行为进行动力学建模,展示了随时间连接模式的变化,并能检测较大影响的事件。实验结果表明,本方法能有效估计节点角色并检测动态网络的演化。     

On the Geometrical Characteristic of Wireless Ad-Hoc Networks and its Application in Network Performance Analysis

A wireless ad-hoc network can be roughly considered as one consisting of a collection of mobile nodes distributed in a finite region, which adopts a non-centralized and self-organized structure. In such networks, messages are transmitted, received and forwarded in a finite geometrical region. In addition, the transmission of messages is highly dependent on the locations of the mobile nodes. As a result, the geometrical relationships between the nodes, and especially the distance between them are of fundamental importance. In this paper, we propose a space decomposition method to analyze the probability distribution of the distance between nodes in an ad-hoc network. In particular, we derive two theoretical expressions for the probability distribution of the distance between nodes under the assumption that the nodes are independently and uniformly distributed in either a rectangular region or hexagonal region. Further results on the node degree distribution and max-flow capacity of the network are then presented based upon these expressions     

Multiantenna Bidirectional Broadcast Channels— Optimal Transmit Strategies

We consider a three-node network where a relay node establishes a bidirectional communication between the two other nodes using a spectrally efficient decode-and-forward protocol. In the first phase we have the classical multiple-access channel where both nodes transmit a message to the relay node, which then decodes the messages. In the second phase the relay broadcasts a re-encoded composition of them based on the network coding idea. This means that each receiving node uses the same data stream to infer on its intended message. We characterize the optimal transmit strategy for the broadcast phase where either the relay node or the two other nodes are equipped with multiple antennas. Our main result shows that beamforming into the subspace spanned by the channels is always an optimal transmit strategy for the multiple-input single-output bidirectional broadcast channel. Thereby, it shows that correlation between the channels is advantageous. Moreover, this leads to a parametrization of the optimal transmit strategy which specifies the whole capacity region. In retrospect the results are intuitively clear since the single-beam transmit strategy reflects the single stream processing due to the network coding approach.     

一种高效可扩展的自组织邻域故障检测协议

在面向大规模化、强动态性、可靠性要求较高的网络节点间故障检测中,传统的故障消息传递模式会引起网络阻塞、时延不稳等问题,导致检测系统可扩展性变差,检测有效性降低。该文提出一种基于故障消息随机散播的自组织邻域检测协议SONFDP。从自组织的思想出发构造了节点检测邻域,在每一邻域中自动生成用于域间检测的代理节点;设计了邻域内基于随机散播故障检测模式的检测算法,继而利用代理节点进行域间节点检测。另外,为防止故障消息随机散播时目标选择的盲目性,还设计了冗余消息避免机制,进一步减少了检测所产生的冗余故障消息数。对该协议的正确性进行了理论分析及证明,并在广域网环境中进行实验,结果表明SONFDP协议在避免泛洪引起网络拥塞的同时,能显著降低检测的系统耗费,增强传统故障检测方法的可扩展性和有效性。     

Dynamic scheduling protocol for variable-sized messages in aWDM-based local network

In a single-hop star network based on wavelength division multiplexing (WDM), a protocol is needed for the transmitter and receiver to coordinate message transmission. This paper proposes a dynamic scheduling protocol which can efficiently support variable-sized messages, where a control channel is used to coordinate transmissions on data channels. The protocol does not require any global information. Therefore, it can operate independently of the change of the number of nodes, and any new node can join the network at any time without requiring network initialization. Moreover, with the protocol, one can avoid data channel and destination conflicts. The protocol is analyzed with a finite population model and the throughput-delay characteristics are investigated as performance measures     

Modeling epidemic data diffusion for wireless mobile networks

Data/content dissemination among the mobile devices is the fundamental building block for all the applications in wireless mobile collaborative computing, known as mobile peer‐to‐peer. Different parameters such as node density, scheduling among neighboring nodes, mobility pattern, and node speed have a tremendous impact on data diffusion in a mobile peer‐to‐peer environment. In this paper, we develop analytical models for object diffusion time/delay in a wireless mobile network to apprehend the complex interrelationship among these different parameters. In the analysis, we calculate the probabilities of transmitting a single object from one node to multiple nodes using the epidemic model of spread of disease. We also incorporate the impact of node mobility, radio range, and node density in the networks into the analysis. Utilizing these transition probabilities, we estimate the expected delay for diffusing an object to the entire network both for single object and multiple object scenarios. We then calculate the transmission probabilities of multiple objects among the nodes in the wireless mobile network considering network dynamics. Through extensive simulations, we demonstrate that the proposed scheme is efficient for data diffusion in the wireless mobile network. Copyright © 2012 John Wiley & Sons, Ltd.     

基于节点社会特征的机会网络最优发送策略

建立了基于节点社会特征的机会网络信息传输模型,使用庞特里亚金极大值定理求得最优发送策略,该策略服从阈值形式,设停止时间为h,当t < h时,节点以最大概率发送信息,当t > h时,节点停止发送信息。实验表明,该策略优于最优静态策略。进一步分析发现,节点的平均朋友数目越多,最优发送策略的停止时间越小,同时,其性能也越好。