802.11s无线Mesh网络中协作多样性感知的路由度量和协作路由协议

提出了802.11s无线Mesh网络中协作多样性感知的路由度量,并提出了适应无线Mesh网络特点的协作式路由协议(CDARP)与协作媒体访问控制协议(CMAC).通过构建协作虚拟节点、计算协作链路度量,CDARP-CMAC能够选择最合理的路径进行协作数据传输.实验结果表明,与最优路径的协作机制相比,CDARP-CMAC协议提高了网络有效吞吐量5％～13％;同时降低了数据包丢包率5％～10％.     

IEEE 802.11无线网状网中的一种干扰感知的多径路由协议

基于IEEE 802.11 MAC层协议模型,提出一种新颖的能够描述多条路径之间干扰程度的多径路由判据IAMM,并以此为基础,提出一种新的干扰感知的多径路由IAMR协议.IAMR协议通过2次选路,在保证单条路径性能的同时兼顾考虑路径之间的干扰因素.仿真实验表明,IAMR协议在端到端延迟、数据包到达率和吞吐量等方面均有较明显的性能提升.     

OSPF在校园网中的实现

作为一种大型网络,路由设计与实现是校园网建设的主要内容.合理的协议选择与设计部署,将在很大程度上影响网络的功能,以及稳定性、适应性和扩展性.本文结合OSPF协议的特点,探讨OSPF在校园网部署中的区域划分、路由优化和安全等问题,对校园网的建设和升级工作具有一定的参考价值.     

无线中继网络的联合路由与调度的近似最优算法

在基于802.16j的无线中继网络中,考虑路由和调度的联合优化问题,最小化系统总调度时间. 首先采用线性规划的方法建立路由,进行链路业务速率分配,然后基于平移和交换思想提出一种链路调度算法. 理论分析证明所提算法的性能在最坏情况下,不会超过最优性能的1.5倍. 仿真结果表明,所提算法的平均性能非常接近最优性能.     

无线传感器网络LEACH协议的分析

在无线传感器网络中降低节点能耗,延迟网络生命周期是其研究的重点。现有分层路由协议中存在着簇首节点能耗分布不均,簇首与节点、基站间距离分布不均等问题;基于LEACH协议的思想提出一种改进的分层路由协议(M-LEACH),它考虑了簇首当前剩余能耗的因素,仿真结果表明能有效的延迟网络生命周期。     

Fractional lion optimization for cluster head-based routing protocol in wireless sensor network

Due to the hopeful application of gathering information from unreachable position, wireless sensor network creates an immense challenge for data routing to maximize the communication with more energy efficiency. In order to design the energy efficient routing, the optimization based clustering protocols are more preferred in wireless sensor network. In this paper, we have proposed competent optimization based algorithm called Fractional lion (FLION) clustering algorithm for creating the energy efficient routing path. Here, the proposed clustering algorithm is used to increase the energy and lifetime of the network nodes by selecting the rapid cluster head. In addition, we have proposed multi-objective FLION clustering algorithm to develop the new fitness function based on the five objectives like intra-cluster distance, inter-cluster distance, cluster head energy, normal nodes energy and delay. Here, the proposed fitness function is used to find the rapid cluster centroid for an efficient routing path. Finally, the performance of the proposed clustering algorithm is compared with the existing clustering algorithms such as low energy adaptive clustering hierarchy (LEACH), particle swarm optimization (PSO), artificial bee colony (ABC) and Fractional ABC clustering algorithm. The results proved that the lifetime of the wireless sensor nodes is maximized by the proposed FLION based multi-objective clustering algorithm as compared with existing protocols.     

A flow and routing control policy for communication networks with multiple competitive users

This paper is concerned with deriving an optimal flow and routing control policy for two-node parallel link communication networks with multiple competing users. The model assumes that each user has a flow demand which needs to be optimally selected and routed on the network links. The flow and routing control policy for each user seeks to maximize the user's total throughput and minimize its expected delay. To derive such a policy, we consider a utility function for each user that combines these two objectives in an additive fashion with preference constants that can be adjusted to reflect the user's own preferences between maximizing throughput and minimizing delay. Additionally, we provide each user with the ability to make these preferences link-dependent to reflect the user's preferences for certain links over others in the network. A condition that depends on the link capacities and preference constants is derived to guarantee the existence and uniqueness of a non-symmetric flow and routing control policy solution which satisfies the Nash equilibrium of non-cooperative game theory. The Nash equilibrium is a desirable solution for such networks because it insures that no user can improve its utility by unilaterally deviating from its Nash control policy. We discuss in detail several interesting properties of this equilibrium and in particular, its relationship to the users’ preference constants. Two illustrative examples are also presented.     

对科学园认识的演进和发展趋势

人们对世界正在兴起的科学园区的认识，经由设想到实践，示范到扩展，孵化到服务社会的演进过程，反映了不同时期科技、经济和社会发展的要求，是人们在特定的历史时段认识与实践的成果。科学园区的综合化、大型化建设的同时出现了特色化、小型化的发展趋势，在回归自然的同时出现回归城市中心的发展趋势。     

肝源性糖尿病发病机理及其治疗体会

本文阐述了肝源性糖尿病发病机理、临床表现、治疗要点及其治疗体会.     

Recursive state estimation for nonlinear coupling complex networks with time-varying topology and round-robin protocol

This paper is devoted to solving the recursive state estimation (RSE) issue for a class of complex networks (CNs) with Round-Robin (RR) protocol and switching nonlinearities (SNs). A random variable obeying the Bernoulli distribution with known statistical properties is introduced to describe the switching phenomenon between two nonlinear functions. A Gaussian noise and time-varying outer coupling strength are adopted to show the changeable network topology (CNT). The RR protocol is applied to regulate signal transmissions, which determines that the element in measurement output has access to the communication networks at each step. The purpose of this paper is to construct a recursive state estimator such that, for all SNs, time-varying topology and RR protocol, the expected state estimation performance is guaranteed. Specifically, based on two recursive matrix equations, the covariance upper bound (CUB) of state estimation error is obtained firstly and then minimized via designing estimator gain in a proper way. Moreover, a feasible criterion is given to guarantee that the trace of obtained CUB is bounded and a monotonicity relationship is established between state estimation error and time-varying outer coupling strength. Lastly, a simulation experiment is illustrated to verify the feasibility of the addressed estimation method.