森林火灾无线监测预警系统的设计与实现

针对传统森林火灾监测措施实时性差、实际应用受限的问题,利用无线传感网络技术,构建了基于ZigBee和GPRS的森林火灾监测预警系统.介绍了系统的结构,给出了主要功能模块的硬件设计方法和ZigBee无线传感网络中各功能节点的软件设计.同时,对传统的无线传感网的自组网方案进行了改进,并在分布式组网方案基础上实现了ZigBee无线传感网络节点的分簇置放.实践证明,该系统实现了森林火灾监测和预警的功能,提高了系统中数据传输的实时性、可靠性以及系统的可扩展性.     

有环网络编码关键理论问题研究

同无环网络编码研究相比,有环网络编码的理论存在更多研究空白.在实际网络中,网络编码信息流很可能交错形成环路,造成环路中链路之间逻辑因果关系混乱,时延的引入成为必须.因此,有环网络中网络编码呈现出与无环网络中不一样的特性.由于有环网络编码是网络编码实用化研究的一个关键和难点,而且有环有时延网络更接近实际网络情况,因而有环网络的研究具有较大理论和实用意义.本文从有环网络编码的数学理论框架、有环网络编码容量、码构造算法、多源有环网络编码等几个方面综述了有环网络编码的研究现状和需要进一步研究的方向.     

一种适用于Ad hoc网络的动态多组异步多信道MAC协议

提出一种基于节点物理地址为初始分配信道的动态多组异步多信道媒介访问控制协议(DMAM-MAC).在该协议中,各节点根据自己的物理地址确定初始主信道,并且与同处在一个主信道上的相邻节点构成一个信道组;随着网络运行,各节点根据自身的业务流,动态改变主信道,加入新的信道组,从而有效提高了频率空间复用度.仿真试验证明,与IEEE802.11、AM-CP相比,DMAM-MAC协议在显著提高Ad hoc网络平均吞吐量的同时,还能有效降低数据包平均延迟.     

集群计算环境下基于复杂网络的社会学仿真负载划分优化算法

负载划分是决定集群计算环境下基于复杂网络的并行社会学仿真性能的核心因素之一.由于背景负载等因素的影响,集群系统中往往需要根据实际可用计算资源非均匀分配仿真任务,而现有针对无标度特性拓扑结构的并行仿真负载划分算法无法适应集群环境下计算负载非均匀划分的需求.针对这一问题,提出了一个基于集散节点聚合的负载划分算法,将集群计算...     

基于复杂网络的 Internet 流量分析

基于复杂网络理论对 Internet 网络结构进行分析,模拟 Internet 网络中选择服务器的过程,建立一个基于距离和流量的 Internet 自组织网络结构模型(FDM).通过仿真Internet 网络数据传输过程,分析比较 FDM 与 BBV 模型的丢包率,研究 Interact 网络中心连接节点的缓存器容量、...     

异构无线融合网络统一接入认证研究

不同网络同时维护多套认证设施会大幅降低异构融合网络的接入效率,多套认证机制中的短板效应也会降低融合网络中的安全性能。为此,提出基于用户、位置、寻址的信息分离技术,从移动通信系统对安全的需求出发,分析并借鉴3G网络认证与密钥分配协议,在异构无线网络环境中建立基于统一用户标识的的认证方案。仿真测试结果表明,该方案实现了异构网络和移动终端的统一接入及安全 认证。     

Properties and performance modelling of finite buffer M/G/1/K networks

Finite buffer, single-server queueing systems and networks are difficult to analyze since the length of time a customer spends in the system does not follow the Markovian property. A two-moment approximation schema is developed for the probability distribution of M/G/1/K systems and extended to the analysis of M/G/1/K   queueing networks. The general purpose of this paper is to develop a flexible and practical transform-free approach for computing the probability distribution and performance measures of the system as well as identify the underlying properties of these systems. It is shown that for most performance measures, a sigmoid or S-shaped curve with an inflection point at ρ=1$\rho =1$ appears as K→∞$K\to \infty$. This has direct implications for the analysis and optimization of such systems. The performance modelling of the M/G/1/K queueing networks of general topologies along with extensive numerical results accompany the paper along with the linear concave performance measures for these systems.     

Admission control mechanism and performance analysis based on stochastic automata networks formalism

IEEE 802.16 has been designed to support QoS (Quality of Service) in Wireless broadband Metropolitan Networks (WMAN), and specifically in the access networks. To achieve this, the IEEE 802.16.e amendment introduces the service differentiation by five service classes (UGS, ertPS, rtPS, nrtPS and BE). To maintain the QoS of active connections and to avoid any congestion in the network, an Admission Control (AC) is defined. AC aims to accept or reject a new connection according to the negotiated parameters and the availability of resources in the network. This mechanism is not standardized and let to the operators. We tackle this point, by proposing in this study a new Admission Control (AC) that improves the QoS of BE traffic by avoiding a strict bandwidth assignment of other traffics (rtPS and nrtPS) as is defined in major previous studies. The proposed mechanism is based on token bucket for rtPS, nrtPS and BE traffics in order to reduce lightly the number of accepted connections and to improve considerably the number of accepted BE connections. To evaluate the performance of the proposed scheme, we use PEPS (Performance Evaluation of Parallel Systems) which is a powerful tool based on models which can be described with Stochastic Automata Networks (SAN). PEPS can solve complex models with a large state space and with many synchronized events. Therefore, we show that this tool is suitable for wireless network, and specifically for the proposed scheme, toward numerical results we show as we expected that our proposed AC outperform the classical one by reducing lightly the performance of other service classes.     

Self-stabilizing minimum degree spanning tree within one from the optimal degree

We propose a self-stabilizing algorithm for constructing a Minimum Degree Spanning Tree (MDST) in undirected networks. Starting from an arbitrary state, our algorithm is guaranteed to converge to a legitimate state describing a spanning tree whose maximum node degree is at most Δ^∗+1, where Δ^∗ is the minimum possible maximum degree of a spanning tree of the network.To the best of our knowledge, our algorithm is the first self-stabilizing solution for the construction of a minimum degree spanning tree in undirected graphs. The algorithm uses only local communications (nodes interact only with the neighbors at one hop distance). Moreover, the algorithm is designed to work in any asynchronous message passing network with reliable FIFO channels. Additionally, we use a fine grained atomicity model (i.e., the send/receive atomicity). The time complexity of our solution is O(mn²logn) where m is the number of edges and n is the number of nodes. The memory complexity is O(δlogn) in the send-receive atomicity model (δ is the maximal degree of the network).