SWAPS:一种基于Small World的文件搜索算法

资源发现是P2P应用所面临的最核心问题之一.无结构P2P方面的已有工作主要采用了查询消息泛洪和信息索引机制,这会造成严重的网络带宽负担以及巨大的索引维护开销.提出了一种无结构P2P环境下能够节约带宽、易维护的自适应搜索算法,即SWAPS.SWAPS根据用户的访问历史抽取用户的兴趣属性,并遵循用户的访问行为模式,以自发的方式组织基于用户兴趣属性的应用层SmallWorld覆盖网络,然后基于覆盖网络实现了高效的文件定位.分析了影响搜索性能的关键因素,针对Small World网络特点分别设计了基于兴趣度、基于本体距离和基于兴趣宽度等有效的查询消息转发策略.最后实验显示,SWAPS以其高成功率、低带宽消耗和很小的响应时间能够显著的提高搜索性能,而且对用户的访问行为体现出良好适应性.

基于Small world模型的提高网络安全性的方法研究

论文研究目的是用smallworld模型,提高动态计算机网络的安全性。文章介绍了SmallWorld现象及理论研究状况。提出一种更能够反映现实中和计算机网络环境中组成单元间关系的smallworld模型。最后对用建立的新模型提高计算机网络的安全性的应用技术进行了探讨。

Small World Properties Generated by a New Algorithm Under Same Degree of All Nodes

Based on the model of the same degree of all nodes we proposed before, a new algorithm, the so-called “spread all over vertices” （SAV） algorithm, is proposed for generating small-world properties from a regular ring lattices. During randomly rewiring connections the SAV is used to keep the unchanged number of links. Comparing the SAV algorithm with the Watts-Strogatz model and the “spread all over boundaries” algorithm, three methods can have the same topological properties of the small world networks. These results offer diverse formation of small world networks. It is helpful to the research of some applications for dynamics of mutual oscillator inside nodes and interacting automata associated with networks.

一种基于Small World的P2P覆盖网络的研究

Small World网络的两个主要特性是平均路径长度小和聚集系数大,参照Small World网络的两个主要特性,提出了一种基于Small World的P2P覆盖网络模型(SWPP),并在SWPP中定义了一套DHT协议,以该协议为基础,提出了SWPP的路由算法及路由容错算法,分析了路由长度及路由优化方法,最后通过数值实验分析了SWPP性能。

Immunizations on small worlds of tree-based wireless sensor networks

The sensor virus is a serious threat,as an attacker can simply send a single packet to compromise the entire sensor network.Epidemics become drastic with link additions among sensors when the small world phenomena occur.Two immunization strategies,uniform immunization and temporary immunization,are conducted on small worlds of tree-based wireless sensor networks to combat the sensor viruses.With the former strategy,the infection extends exponentially,although the immunization effectively reduces the contagion speed.With the latter strategy,recurrent contagion oscillations occur in the small world when the spatial-temporal dynamics of the epidemic are considered.The oscillations come from the small-world structure and the temporary immunization.Mathematical analyses on the small world of the Cayley tree are presented to reveal the epidemic dynamics with the two immunization strategies.

基于无结构P2P网络拓扑平衡的Small World模型探讨

无结构P2P网络中某些共享资源高的节点容易出现网络阻塞和瓶颈问题.针对此问题引入小世界思想,建立具有小世界特征的网络模型.实验证明该模型不仅能阻止P2P网络中形成星形结构,还达到网络负载平衡和避免网络拥塞,并将用户获取的服务与其提供的共享资源联系起来,体现一定的公平性.

Nonlinear Dynamical Behavior in Neuron Model Based on Small World Network with Attack and Repair Strategy

In this paper, we investigate the effect due to the change of topology structure of network on the nonlinear dynamical behavior, by virtue of the OFC neuron evolution model with attack and repair strategy based on the small world. In particular, roles of various parameters relating to the dynamical behavior are carefully studied and analyzed. In addition, the avalanche and EEC-like wave activities with attack and repair strategy are also explored in detail in this work.

A Modified Earthquake Model of Self-Organized Criticality on Small World Networks

A modified Olami Feder-Christensen model of self-organized criticality on a square lattice with the properties of small world networks has been studied.We find that our model displays power-law behavior and the exponent τ of the model depends on φ,the density of long-range connections in our network.

A Multifractal Detrended Fluctuation Analysis of the Ising Financial Markets Model with Small World Topology

We present a multifractal detrended fluctuation analysis （MFDFA） of the time series of return generated by our recently-proposed Ising financial market model with underlying small world topology. The result of the MFDFA shows that there exists obvious multifractal scaling behavior in produced time series. We compare the MFDFA results for original time series with those for shuffled series, and find that its multifractal nature is due to two factors： broadness of probability density function of the series and different correlations in small- and large-scale fluctuations. This may provide new insight to the problem of the origin of multifractality in financial time series.

Dynamics in small worlds of tree topologies of wireless sensor networks

Tree topologies, which construct spatial graphs with large characteristic path lengths and small clustering coefficients, are ubiquitous in deployments of wireless sensor networks. Small worlds are investigated in tree-based networks. Due to link ad- ditions, characteristic path lengths reduce rapidly and clustering coefficients increase greatly. A tree abstract, Cayley tree, is con- sidered for the study of the navigation algorithm, which runs auto- matically in the small worlds of tree-based networks. In the further study, epidemics in the small worlds of tree-based wireless sen- sor networks on the large scale are studied, and the percolation threshold is calculated, at which the outbreak of the epidemic takes place. Compared with Cayley tree, there is a smaller percolation threshold suffering from the epidemic.

Complex Behavior in a Selective Aging Neuron Model Based on Small World Networks

Complex behavior in a selective aging simple neuron model based on small world networks is investigated. The basic elements of the model are endowed with the main features of a neuron function. The structure of the selective aging neuron model is discussed. We also give some properties of the new network and find that the neuron model displays a power-law behavior. If the brain network is small world-like network, the mean avalanche size is almost the same unless the aging parameter is big enough.

Self-organized Criticality and Synchronization in a Pulse-coupled Integrate-and-Fire Neuron Model Based on Small World Networks＊

A lattice model for a set of pulse-coupled integrate-and-fire neurons with small world structure is introduced.We find that our model displays the power-law behavior accompanied with the large-scale synchronized activities among the units. And the different connectivity topologies lead to different behaviors in models of integrate-and-fire neurons.

Effects of Aging and Self-organized Criticality in a Pulse-Coupled Integrate-and-Fire Neuron Model Based on Small World Networks

Effects of aging and self-organized criticality in a pulse-coupled integrate-and-fire neuron model based on small world networks have been studied. We give the degree distribution of aging network, average shortest path length, the diameter of our network, and the clustering coefficient, and find that our neuron model displays the power-law behavior, and with the number of added links increasing, the effects of aging become smaller and smaller. This shows that if the brain works at the self-organized criticality state, it can relieve some effects caused by aging.

Effects of Different Connectivity Topologies in Small World Networks on EEG-Like Activities

Based on our previously pulse-coupled integrate-and-fire neuron model in small world networks, we investigate the effects of different connectivity topologies on complex behavior of electroencephalographic-like signals produced by this model. We show that several times series analysis methods that are often used for analyzing complex behavior of electroencephalographic-like signals, such as reconstruction of the phase space, correlation dimension, fractal dimension, and the Hurst exponent within the rescaled range analysis （R/S）. We lind that the different connectivity topologies lead to different dynamical behaviors in models of integrate-and-fire neurons.

Using probabilistic cache scheme to construct the small world network

Recently some P2P systems have constructed the small world network using the small world model so as to improve the routing performance.In this paper,we propose a novel probabilistic cache scheme to construct the small world network based on the small world model and use it to improve CAN,that is,PCCAN(Probabilistic Cache-based CAN).PCCAN caches the long contact.It uses the worm routing replacing mechanism and probabilistic replacing strategy on the cache.The probabilistic cache scheme proves to be an efficient approach to model the small world phenomenon.Experiments in both the static and the dynamic network show that PCCAN can converge to the steady state with the cache scheme,and the routing performance is significantly improved with additional low overheads in the network compared with CAN.

Small World Effects in a Harmonious Unifying Hybrid Preferential Model Networks

Small worm effects in the harmonious unifying hybrid preferential model （HUHPM） networks are studied both numerically and analytically. The idea and method of the HUHPM is applied to three typical examples of unweighted BA model, weighted BBV model, and the TDE rnodel, so-called HUHPM-BA, HUHPM-BBV and HUHPM- TDE networks. Comparing the HUHPM with current typical models above, it is found that the HUHPM networks has the smallest average path length and the biggest average clustering coefficient. The results demonstrate that the HUHPM is more suitable not only for the un-iveighted models but also for the weighted models.

Power-Aware Anycast Routing in Wireless Sensor Network Exploiting Small World Effect

By considering energy-efficient anycast routing in wireless sensor network （WSN）, and combining small world characteristics of WSN with the properties of the ant algorithm, a power-aware anycast routing algorithm （SWPAR） with multi-sink nodes is pro- posed and evaluated. By SWPAR, the optimal sink node is found and the problem of routing path is effectively solved. Simulation results show that compared with the sink-based anycast routing protocol （SARP） and the hierarchy-based anyeast routing protocol （HARP）, the proposed algorithm improves network lifetime and reduces power consumption.

用Small-World设计无组织P2P系统的路由算法

由于peer-to-peer系统在文件共享方面有着巨大的应用前景,peer-to-peer搜索问题已成为目前学术界重点的研究问题之一.对于缺乏缓存机制的无组织P2P系统,已有的分布式路由算法缺乏全局导航能力,属于无序搜索.为此,提出一种key clustering算法,将路由空间分为HUB和AUT两层,从全局角度进行有序搜索.为提高key clustering算法的可扩展性,借鉴Small-world领域的研究成果,在路由表中以一定概率插入连接远距离节点的快捷连接,以缩短平均路径长度.初步仿真实验表明,引入快捷连接的key clustering算法具有良好的搜索能力和扩展性.

一种具有small world特性的ESN结构分析与设计

针对回声状态网络(ESN)结构设计复杂、参数选择难度大的问题,提出一种具有small world特性的ESN(SWESN).首先采用神经元空间增长算法在平面区域生成small world拓扑网络;然后根据网络节点与基准点的Euclidean距离将网络节点进行重新排序,并将平面上的物理节点及其连接映射为SWESN的内部神经元连接矩阵,从而使动态神经元池具有small world特性.实验表明,SWESN动力学特性比常规ESN更为丰富,在鲁棒性、抗干扰能力等方面均优于常规的ESN.

基于Small-World网络的非结构化DHT算法

目前,非结构化的P2P路由算法面临着搜索效率低下的严峻问题,这严重影响了非结构算法的应用领域.提出一种基于关键字聚类的分布式哈希表算法,主要思路是将环状关键字空间分成上下两层,下层(AUT层)负责关键字管理,上层(HUB层)负责节点路由.每个节点用一个随机数值作为它的聚类中心,从过往的路由消息中本地节点将抽取文件关键字和节点聚类中心,以聚类原则将这些数据记录到本地路由表中.除了改进非结构化算法的数据组织无序性,另一个目标是提高搜索效率.于是,上述算法的增强算法利用了small-world理论,在HUB层中加入远距离节点的聚类中心,将确定性聚类转化为概率性聚类,故能保证路由长度为O(log2N).