基于蚁群优化的DBN转移网络结构学习算法

针对动态贝叶斯转移网络的特点,以I-ACO-B为基础,提出基于蚁群优化的分步构建转移网络的结构学习算法ACO-DBN-2S。算法将转移网络的结构学习分为时间片之间和时间片内2个步骤进行,通过改进隔代优化策略,减少无效优化次数。标准数据集下的大量实验结果证明,该算法能更有效地处理大规模数据,学习精度和速度有较大改进。     

移动基站无线传感器网络2个参数的优化

针对一种移动基站协助数据收集模式,研究移动基站最佳缓冲区位置的设计问题,得出节点在发射半径r=R的情况下,当移动基站缓冲区的中心位于2／3R时,网络的总能量消耗最小,当中心位于1／2R时,网络的寿命最长。在r〈〈R的情况下,节点的发射功率可选择{l..k}中的一种传送数据,并给出通过插值作图法得到最佳基站缓冲区位置的设置与节点最佳发射功率的计算方法,相比采用固定功率发射方法,能够将网络寿命提高5倍。     

P2P环境下基于双层代理的服务发现模型

以集中式注册中心为核心的面向服务体系结构和以服务提供商为中心的服务组织模式容易导致用户发现和订阅服务的难度随着服务的增加而增加。针对上述问题,该文提出一种P2P环境下基于双层代理的语义Web服务发现模型。该模型通过双层代理机制实现基于语义的Web服务的发现和匹配,并提供服务质量协商机制。实验表明该模型具有较高的查全率和查准率。     

无线传感器网络中的选择转发攻击检测

针对无线传感器网络中现有检测攻击方法需要节点协同或检测硬件的缺点,对选择转发攻击进行研究,提出一种基于信任度与丢包行为的检测方法。通过节点收发数据包的情况,计算节点的信任度,结合节点丢包行为评估,判断节点是否发动攻击。这种检测方法的计算与存储开销都集中于基站,且不需增加额外的检测设备。实验结果表明,这种方法较之现有检测方法,检测率更高。     

Explicit synchronisation of heterogeneous dynamics networks via three-layer communication framework

This paper addresses the explicit synchronisation of heterogeneous dynamics networks via three-layer communication framework. The main contribution is to propose an explicit synchronisation algorithm, in which the synchronisation errors of all the agents are decoupled. By constructing a three-layer node model, the proposed algorithm removes the assumptions that the topology is fixed and the synchronisation process is coupled. By introducing appropriate assumptions, the algorithm leads to a class of explicit synchronisation protocols based on the states of agents in different layers. It is proved in the sense of Lyapunov that, if the dwell time is larger than a threshold, the explicit synchronisation can be achieved for closed-loop heterogeneous dynamics networks under switching topologies. The results are further extended to the cases in which the switching topologies are only frequently but not always connected. Simulation results are presented with four single-link manipulators to verify the theoretical analysis.     

Reconfiguring existing pollutant monitoring stations by increasing the value of the gathered information

The objective of this study is to provide a framework for relocating or reconfiguring existing pollution monitoring station networks by using feature selection and data mining techniques. This methodology enables a partial redesign based on the maximization of the available information that is gathered by the pollution networks by the optimal data mining technique. It also considers requirements of the decision makers, like potential target places, etc.Since this methodology is based on the quality of forecasting, it can also be useful for auditing and forecasting. A case study is included in this paper. In light of the prediction results, a new way to relocate the existing monitoring station is proposed.     

Testbed results of an opportunistic routing for multi-robot wireless networks

Opportunistic routing is a candidate for multihop wireless routing where the network topology and radio channels vary rapidly. However, there are not many opportunistic routing algorithms that can be implemented in a real multihop wireless network while exploiting the node mobility. It motivates us to implement an opportunistic routing, random basketball routing (BR), in a real multi-robot network to see if it can enhance the capacity of the multihop network as mobility increases. For implementation purposes, we added some features, such as destination RSSI measuring, a loop-free procedure and distributed relay probability updating, to the original BR. We carried out the experiments on a real multi-robot network and compared BR with AODV combined with CSMA/CA (routing + MAC protocol). We considered both static and dynamic scenarios. Our experiments are encouraging in that BR outperforms AODV + CSMA/CA, particularly in dynamic cases; the throughput of BR is 6.6 times higher than that of AODV + CSMA/CA. BR with dynamic networks shows 1.4 times higher throughput performance than BR with static networks. We investigate the performance of BR in the large-scale network using NS-2 simulation. We verify the effect of node density, speed, destination beacon signal and loop-free procedure. According to the large-scale simulation, the end-to-end throughput grows with the node speed.     

Simulations, models, and testbeds: A mutual catalysis

Recent developments in the area of decentralized and infrastructureless systems opened avenues for novel applications. Along with these new technologies, new questions regarding their operational bounds in terms of e.g. scalability and security arose. Due to the sparse presence of real-world decentralized and infrastructureless systems, new protocols and applications have to be scrutinized by means of simulation, in (small-scale) testbeds, and by analytical models. In this paper, we discuss challenges of evaluating security mechanisms for mobile ad hoc networks and peer-to-peer systems. We focus on harmonizing predictions of analytical models and results obtained from simulation studies and testbed experiments.     

Scheduling gain for frequency-selective Rayleigh-fading channels with application to self-organizing packet scheduling

This paper investigates packet scheduling in the context of Self-Optimizing Networks, and demonstrates how to improve coverage dynamically by adjusting the scheduling strategy. We focus on α-fair schedulers, and we provide methods for calculating the scheduling gain, including several closed form formulas. Scheduling gain is analyzed for different fading models, with a particular focus on the frequency-selective channel. We then propose a coverage-capacity self-optimization algorithm based on α-fair schedulers. A use case illustrates the implementation of the algorithm and simulation results show that important coverage gains are achieved at the expense of very little computing power.     

面向高速工业无线网络的TDMA MAC协议设计与实现

随着无线技术的发展,在工业自动化中引入无线技术已经成为一种潮流,同时TDMA机制由于可以完全避免冲突,因此在大规模高实时要求的面向车间的无线技术研究中受到了广泛关注,但现在面向车间的高速实时无线技术的研究大都局限于软件仿真。通过在商用802.11硬件上设计并实现面向车间级工业应用的高速工业无线TDMAMAC层协议,建立了一个基于TDMA的面向工业应用的高速无线网络原型系统,实验结果表明实验平台完全能够支撑毫秒级时隙调度的TDMA应用。