无线传感器网络MAC协议的研究与分析

针对不同的传感器网络应用,研究人员从不同方面提出多个无线传感器网络介质访问控制（MAC）协议,其中包括S-MAC,PMAC,DEANA,EMACs,Z—MAC以及AIMRP等协议。通过分析各类MAC典型协议特点,归纳其设计原则和分类方法,比较各协议间的性能差异,结果证明无线传感器网络MAC协议呈现多样性的特点,设计MAC协议需要兼顾能量效能和网络性能2个方面。给出MAC协议的设计策略。     

基于XML与数据库技术的权限管理

在基于角色的访问控制（RBAC）模型的基础上,结合XML应用特性,对权限管理中的系统和用户权限信息分别应用XML和数据库技术,设计并实现了将XML与数据库技术相结合的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.     

Admission control for a responsive distributed middleware using decision trees to model run-time parameters

The software in modern systems has become too complex to make accurate predictions about their performance under different configurations. Real-time or even responsiveness requirements cannot be met because it is not possible to perform admission control for new or changing tasks if we cannot tell how their execution affects the other tasks already running. Previously, we proposed a resource-allocation middleware that manages the execution of tasks in a complex distributed system with real-time requirements. The middleware behavior can be modeled depending on the configuration of the tasks running, so that the performance of any given configuration can be calculated. This makes it possible to have admission control in such a system, but the model requires knowledge of run-time parameters. We propose the utilization of machine-learning algorithms to obtain the model parameters, and be able to predict the system performance under any configuration, so that we can provide a full admission control mechanism for complex software systems. In this paper, we present such an admission control mechanism, we measure its accuracy in estimating the parameters of the model, and we evaluate its performance to determine its suitability for a real-time or responsive system.     

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

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