Opportunistic spectrum access for TDMA-based cognitive radio networks

In this paper, opportunistic spectrum access is proposed for TDMA-based cognitive radio networks. In TDMA-based networks, the time is divided into slots with fixed length one by one. If a primary user (PU) needs to transmit data, one or several slots will be used. Otherwise, the slots are idle and can be utilized by secondary users (SUs). When SUs want to use the licensed channel, they should sense the channel at the beginning period of each slot. Then SUs exchange their sensing results and make the same decision about the channel state (idle or used by PUs), which could reduce the probability of false sensing. The aforementioned duration is called spectrum sensing phase. When SUs decide there is an idle channel, they contend to use the channel at the rest time of the slot. The duration is called access phase. In this period, SUs contend the channel with backoff counters. When the remaining time is less than one data transmission duration, SUs cannot transmit data packets. Therefore, the remaining time is wasted. To solve this problem, SUs transmit control packets with small length in the remaining time instead. The SU who exchange control packets successfully reserves the channel and sends a data packet prior to other SUs in access phase of the next idle slot. Obviously, this reserved transmission is without collision. The independent spectrum sensing, channel state decision and control packets reservation influence the performance of SUs. The proposed scheme is formulated with all above factors. Simulations which consist with the numerical results show the proposed access scheme achieve higher throughput than the existed scheme without channel reservation.     

无线传感器网络中继节点布居算法的研究

本文表述的是在该应用背景下引入多约束条件, 并采用枚举法与贪婪寻优算法相结合的方法, 解决了在可以作为中继节点设置位置的预设中继节点位置集合内, 合理选择中继节点设置位置以及既存网络因添加新传感器节点所引起的中继节点追加的问题. 仿真实验表明, 本文提出的中继节点布居与追加优化算法能够保证多约束条件下网络的容错性. 同时提出的基于最小网络距离因子评价标准, 有效提高了中继节点布居算法的能效性.     

增长速度对合作网络参与者节点度分布的影响

采用率方程对合作网络自组织演化模型进行解析,得到参与者节点度分布服从Yule-Simon分布,这种分布可以用漂移幂律分布近似.分析参与者节点增长速度与参与者节点度分布之间的关系,发现随节点增长速度加快,参与者节点度分布远离幂律,表明节点增长速度是除优先连接之外的另一个影响合作网络拓扑性质的重要因素.通过对城市公交网络和科研合作网络的实证研究,验证了度分布解析结果的正确性.结合实证研究,探讨了合作网络中参与者节点增长速度的形成机制及其实际意义.     

考虑最佳入口温度的多股流换热器网络循环优化

针对于多股流换热器网络的应用优势,本文在衍生网络优化方法基础上,提出了考虑最佳入口温度的多股流换热器循环优化方法,即利用多股流换热器网络小面积换热器合并而不产生固定投资费用这一特点,将优化结果中存在公用工程的流体返回到另一种流体的入口并与其入口流体进行循环优化。结果表明,这种优化方法能够进一步发挥多股流换热器网络的优点,得到年综合费用更小、运行费用更低的网络结构。     

Strain rate effects on compressive behavior of covalently bonded CNT networks

In this study, strain rate effects on the compressive mechanical properties of randomly structured carbon nanotube (CNT) networks were examined. For this purpose, three-dimensional atomistic models of CNT networks with covalently-bonded junctions were generated. After that, molecular dynamics (MD) simulations of compressive loading were performed at five different strain rates to investigate the basic deformation characteristic mechanisms of CNT networks and determine the effect of strain rate on stress–strain curves. The simulation results showed that the strain rate of compressive loading increases, so that a higher resistance of specimens to deformation is observed. Furthermore, the local deformation characteristics of CNT segments, which are mainly driven by bending and buckling modes, and their prevalence are strongly affected by the deformation rate. It was also observed that CNT networks have superior features to metal foams such as metal matrix syntactic foams (MMSFs) and porous sintered fiber metals (PSFMs) in terms of energy absorbing capabilities.     

Novel stability criteria for fuzzy Hopfield neural networks based on an improved homogeneous matrix polynomials technique

The global stability problem of Takagi-Sugeno(T-S) fuzzy Hopfield neural networks(FHNNs) with time delays is investigated.Novel LMI-based stability criteria are obtained by using Lyapunov functional theory to guarantee the asymptotic stability of the FHNNs with less conservatism.Firstly,using both Finsler’s lemma and an improved homogeneous matrix polynomial technique,and applying an affine parameter-dependent Lyapunov-Krasovskii functional,we obtain the convergent LMI-based stability criteria.Algebraic properties of the fuzzy membership functions in the unit simplex are considered in the process of stability analysis via the homogeneous matrix polynomials technique.Secondly,to further reduce the conservatism,a new right-hand-side slack variables introducing technique is also proposed in terms of LMIs,which is suitable to the homogeneous matrix polynomials setting.Finally,two illustrative examples are given to show the efficiency of the proposed approaches.     

Ecological interaction and phylogeny, studying functionality on composed networks

We study a class of composed networks that are formed by two tree networks, T_P and T_A, whose end points touch each other through a bipartite network B_PA. We explore this network using a functional approach. We are interested in how much the topology, or the structure, of T_X (X=A or P) determines the links of B_PA. This composed structure is a useful model in evolutionary biology, where T_P and T_A are the phylogenetic trees of plants and animals that interact in an ecological community. We make use of ecological networks of dispersion of fruits, which are formed by frugivorous animals and plants with fruits; the animals, usually birds, eat fruits and disperse their seeds. We analyse how the phylogeny of T_X determines or is correlated with B_PA using a Monte Carlo approach. We use the phylogenetic distance among elements that interact with a given species to construct an index κ that quantifies the influence of T_X over B_PA. The algorithm is based on the assumption that interaction matrices that follows a phylogeny of T_X have a total phylogenetic distance smaller than the average distance of an ensemble of Monte Carlo realisations. We find that the effect of phylogeny of animal species is more pronounced in the ecological matrix than plant phylogeny.     

Time-varying networks based on activation and deactivation mechanisms

A class of models for activity-driven networks is proposed in which nodes vary in two states: active and inactive.Only active nodes can receive links from others which represent instantaneous dynamical interactions. The evolution of the network couples the addition of new nodes and state transitions of old ones. The active group changes with activated nodes entering and deactivated ones leaving. A general differential equation framework is developed to study the degree distribution of nodes of integrated networks where four different schemes are formulated.     

Attractive target wave patterns in complex networks consisting of excitable nodes

This review describes the investigations of oscillatory complex networks consisting of excitable nodes,focusing on the target wave patterns or say the target wave attractors.A method of dominant phase advanced driving(DPAD) is introduced to reveal the dynamic structures in the networks supporting oscillations,such as the oscillation sources and the main excitation propagation paths from the sources to the whole networks.The target center nodes and their drivers are regarded as the key nodes which can completely determine the corresponding target wave patterns.Therefore,the center(say node A) and its driver(say node B) of a target wave can be used as a label,(A,B),of the given target pattern.The label can give a clue to conveniently retrieve,suppress,and control the target waves.Statistical investigations,both theoretically from the label analysis and numerically from direct simulations of network dynamics,show that there exist huge numbers of target wave attractors in excitable complex networks if the system size is large,and all these attractors can be labeled and easily controlled based on the information given by the labels.The possible applications of the physical ideas and the mathematical methods about multiplicity and labelability of attractors to memory problems of neural networks are briefly discussed.     

Network dynamics and its relationships to topology and coupling structure in excitable complex networks

All dynamic complex networks have two important aspects, pattern dynamics and network topology. Discovering different types of pattern dynamics and exploring how these dynamics depend or/network topologies are tasks of both great theoretical importance and broad practical significance. In this paper we study the oscillatory behaviors of excitable complex networks （ECNs） and find some interesting dynamic behaviors of ECNs in oscillatory probability, the multiplicity of oscillatory attractors, period distribution, and different types of oscillatory patterns （e.g., periodic, quasiperiodic, and chaotic）. In these aspects, we further explore strikingly sharp differences among network dynamics induced by different topologies （random or scale-free topologies） and different interaction structures （symmetric or asymmetric couplings）. The mechanisms behind these differences are explained physically.