Traffic resource allocation for complex networks

In this paper, an optimal resource allocation strategy is proposed to enhance traffic dynamics in complex networks. The network resources are the total node packet-delivering capacity and the total link bandwidth. An analytical method is developed to estimate the overall network capacity by using the concept of efficient betweenness (ratio of algorithmic betweenness and local processing capacity). Three network structures (scale-free, small-world, and random networks) and two typical routing protocols (shortest path protocol and efficient routing protocol) are adopted to demonstrate the performance of the proposed strategy. Our results show that the network capacity is reversely proportional to the average path length for a particular routing protocol and the shortest path protocol can achieve the largest network capacity when the proposed resource allocation strategy is adopted.     

多元时间序列复杂网络流型动力学分析

针对气液两相流流动特性,利用有限元分析方法设计变曲率对壁式电导传感器.采用设计加工的传感器在多相流装置上进行气液两相流动态实验,并测得多组对应于不同流型的电导波动信号. 基于测量数据,采用多元时间序列复杂网络构建算法构建对应于不同流型的复杂网络.在此基础上, 对网络的社团特性进行了分析, 研究发现,不同的社团结构对应于不同的流型,而社团内部网络特征可有效刻画不同流型内在动力学特性.多元时间序列复杂网络分析可为两相流流型演化动力学特性研究及流型识别提供新理论、开拓新途经.     

Optimal dynamic bandwidth allocation for complex networks

Traffic capacity of one network strongly depends on the link’s bandwidth allocation strategy. In previous bandwidth allocation mechanisms, once one link’s bandwidth is allocated, it will be fixed throughout the overall traffic transmission process. However, the traffic load of every link changes from time to time. In this paper, with finite total bandwidth resource of the network, we propose to dynamically allocate the total bandwidth resource in which each link’s bandwidth is proportional to the queue length of the output buffer of the link per time step. With plenty of data packets in the network, the traffic handling ability of all links of the network achieves full utilization. The theoretical analysis and the extensive simulation results on complex networks are consistent. This work is valuable for network service providers to improve network performance or to do reasonable network design efficiently.     

基于交通流量的病毒爆发动力行为研究

给出基于交通流量的病毒扩散易染-感染模型（SI）修正模型,进而利用平均场近似方法,研究基于交通流量的病毒扩散动力学行为.以最小搜索信息路由为例,重新研究了SI模型下扩散系数τ与平均发包率λ、感染率β以及实际介数之间的关系.理论分析与实验结果均表明,当网络拓扑和路由策略一定时,扩散参数τ反比于平均发包率λ和感染率β,是λ=1时的扩散参数τ_λ=1的1/λ.     

Emergence of a phase transition for the required amount of storage in highly renewable electricity systems

Due to global environmental concerns, our electricity supply will transform from mostly conventional power generation to mostly fluctuating renewable power generation. The transition will require combined backup from conventional sources and storage. A phase transition emerges during the ramp-up of the required amount of storage, with renewable penetration being the control parameter and average relative storage filling level being the order parameter. A singularity appears for the required storage energy capacity at a renewable penetration determined by the parameters of the storage. For an ideal storage with no roundtrip losses the transition occurs at 100% renewable penetration. Moreover, the required storage energy capacity is strongly enhanced by temporal correlations on the synoptic weather time scale. A Markov process is proposed, which reproduces these findings.     

Variable disparity estimation based intermediate view reconstruction in dynamic flow allocation over EPON-based access networks

In this paper, a variable disparity estimation (VDE)-based intermediate view reconstruction (IVR) in dynamic flow allocation (DFA) over an Ethernet passive optical network (EPON)-based access network is proposed. In the proposed system, the stereoscopic images are estimated by a variable block-matching algorithm (VBMA), and they are transmitted to the receiver through DFA over EPON. This scheme improves a priority-based access network by converting it to a flow-based access network with a new access mechanism and scheduling algorithm, and then 16-view images are synthesized by the IVR using VDE. Some experimental results indicate that the proposed system improves the peak-signal-to-noise ratio (PSNR) to as high as 4.86 dB and reduces the processing time to 3.52 s. Additionally, the network service provider can provide upper limits of transmission delays by the flow. The modeling and simulation results, including mathematical analyses, from this scheme are also provided.     

Optimal downlink power allocation in cellular networks

In this paper, we introduce a novel approach for power allocation in cellular networks. In our model, we use sigmoidal-like utility functions to represent different users’ modulation schemes. Each utility function is a representation of the probability of successfully transmitted packets per unit of power consumed by a user, when using a certain modulation scheme. We consider power allocation with utility proportional fairness policy, where the fairness among users is in utility percentage i.e. percentage of successfully transmitted packets of the corresponding modulation scheme. We formulate our power allocation optimization problem as a product of utilities of all users and prove that it is convex and therefore the optimal solution is tractable. We present a distributed algorithm to allocate base station powers optimally with priority given to users running lower modulation schemes while ensuring non-zero power allocation to users running higher modulation schemes. Our algorithm prevents fluctuation in the power allocation process and is capable of traffic and modulation dependent pricing policy. This can be used to flatten traffic and decrease the service price for users. We also compare our results with a benchmark algorithm and show that our algorithm performs better in allocating powers fairly to all users without dropping any user in order to maximize performance.     

Chance-constrained resource allocation for cognitive wireless-powered backscatter communication networks

With the rapid development of the Internet of Things (IoT) and the increasing number of wireless nodes, the problems of scare spectrum and energy supply of nodes have become main issues. To achieve green IoT techniques and resolve the challenge of wireless power supply, wireless-powered backscatter communication as a promising transmission paradigm has been concerned by many scholars. In wireless-powered backscatter communication networks, the passive backscatter nodes can harvest the ambient radio frequency signals for the devices’ wireless charging and also reflect some information signals to the information receiver in a low-power-consumption way. To balance the relationship between the amount of energy harvesting and the amount of information rate, resource allocation is a key technique in wireless-powered backscatter communication networks. However, most of the current resource allocation algorithms assume available perfect channel state information and limited spectrum resource, it is impractical for actual backscatter systems due to the impact of channel delays, the nonlinearity of hardware circuits and quantization errors that may increase the possibility of outage probability. To this end, we investigate a robust resource allocation problem to improve system robustness and spectrum efficiency in a cognitive wireless-powered backscatter communication network, where secondary transmitters can work at the backscattering transmission mode and the harvest-then-transmit mode by a time division multiple access manner. The total throughput of the secondary users is maximized by jointly optimizing the transmission time, the transmit power, and the reflection coefficients of secondary transmitters under the constraints on the throughput outage probability of the users. To tackle the non-convex problem, we design a robust resource allocation algorithm to obtain the optimal solution by using the proper variable substitution method and Lagrange dual theory. Simulation results verify the effectiveness of the proposed algorithm in terms of lower outage probabilities.     

无标度网络上队列资源分配研究

研究了节点队列资源有限的条件下,无标度网络上的信息流动力学过程,发现了网络由自由流通到拥塞的相变现象,提出了一种基于节点度的队列资源分配模型.模型的核心是使节点i的队列长度与kβi成正比(ki为节点i的度,β为分配参数).仿真结果表明,在网络使用最短路径算法进行信息包传送的条件下,β近似等于1.25时队列资源分配最合理,网络容量最大,且该最佳值与队列总资源多少以及网络的规模无关.     

Power allocation for cognitive underlay networks with spectrum band selection

In this paper, we study the cooperative communication of a cognitive underlay network by utilizing the diversity of multiple spectrum bands. In particular, we assume that the transmission power of the secondary user (SU) is subject to different joint constraints, such as peak interference power of the multiple primary users (PUs), peak transmission power of the SU, outage tolerate interference, and outage probability threshold. Accordingly, two power allocation schemes are considered on the basis of the minimum interference channel from the SU to the PU and the channel state information of the primary user link. Furthermore, the SU can select one of the three transmission modes following the channel state conditions, namely as cellular, device-to-device, or switching mode, to transmit the signal to the secondary user receiver. Given this setting, two power allocation schemes over a spectrum band selection strategy are derived. In addition, closed-form expressions for the outage probability of three modes are also obtained to evaluate the performance of the secondary network. Most importantly, a closed-form expression for the peak interference power level of the PU, which is considered as one of the most important parameters to control the SU’s transmission power, is derived by investigating the relation of two considered power allocation schemes in the practise. Finally, numerical examples show that the outage performance of secondary network in the switching mode outperforms the one of the cellular and device-to-device (D2D) mode for all considered power allocation schemes.     

Potential games for energy-efficient resource allocation in multipoint-to-multipoint CDMA wireless data networks

The problem of noncooperative resource allocation in a multipoint-to-multipoint CDMA cellular network is considered in this paper. The considered scenario is general enough to represent several key instances of modern wireless networks such as a multicellular network, a peer-to-peer network (interference channel), and a wireless network equipped with femtocells. In particular, the problem of joint transmit waveforms adaptation, linear receiver design, and transmit power control is examined. Several utility functions to be maximized are considered, and, among them, we cite the received SINR, and the transmitter energy efficiency, which is measured in bit/J, and represents the number of successfully delivered bits for each energy unit used for transmission. Resorting to the theory of potential games, noncooperative games admitting Nash equilibria in multipoint-to-multipoint cellular networks regardless of the channel coefficient realizations are designed. Computer simulations confirm that the considered games are convergent, and show the huge benefits that resource allocation schemes can bring to the performance of wireless data networks.     

Joint offloading design and bandwidth allocation for RIS-aided multiuser MEC networks

This article examines a multiuser intelligent reflecting surface (RIS) aided mobile edge computing (MEC) system, where multiple edge nodes (ENs) with powerful calculating resources at the network can help compute the calculating tasks from the users through wireless channels. We evaluate the system performance by using the performance metric of communication and computing delay. To enhance the system performance by reducing the network delay, we jointly optimize the unpacking design and wireless bandwidth allocation, whereas the task unpacking optimization is solved by using the deep deterministic policy gradient (DDPG) algorithm. As to the bandwidth allocation, we propose three analytical solutions, where criterion I performs an equal bandwidth allocation, criterion II performs the allocation based on the transmission data rate, while criterion III performs the allocation based on the transmission delay. We finally provide simulation results to show that the proposed optimization on the task unpacking and bandwidth allocation is effective in decreasing the network delay.     

Optimal flux patterns in cellular metabolic networks

The availability of whole-cell-level metabolic networks of high quality has made it possible to develop a predictive understanding of bacterial metabolism. Using the optimization framework of flux balance analysis, I investigate the metabolic response and activity patterns to variations in the availability of nutrient and chemical factors such as oxygen and ammonia by simulating 30,000 random cellular environments. The distribution of reaction fluxes is heavy tailed for the bacteria H. pylori and E. coli, and the eukaryote S. cerevisiae. While the majority of flux balance investigations has relied on implementations of the simplex method, it is necessary to use interior-point optimization algorithms to adequately characterize the full range of activity patterns on metabolic networks. The interior-point activity pattern is bimodal for E. coli and S. cerevisiae, suggesting that most metabolic reactions are either in frequent use or are rarely active. The trimodal activity pattern of H. pylori indicates that a group of its metabolic reactions (20%) are active in approximately half of the simulated environments. Constructing the high-flux backbone of the network for every environment, there is a clear trend that the more frequently a reaction is active, the more likely it is a part of the backbone. Finally, I briefly discuss the predicted activity patterns of the central carbon metabolic pathways for the sample of random environments.     

Numerical study of the heat transfer and electro-thermo-convective flow patterns in dielectric liquid layer subjected to unipolar injection

In this article we study the electro-thermal convection in a dielectric liquid layer placed between two electrodes and subjected to the simultaneous action of an electric field and a thermal gradient. The full set of equations describing the electro-thermo-convective phenomena is directly solved using a finite volume method. We first heat the liquid from below at time t = 0, wait for the thermal steady state and then inject the electric charges by applying the electric potential. The development of the electro-convective motion is analysed in detail in two cases: 1) strong injection from the lower electrode, 2) strong injection from the upper one. We also study the heat transfer enhancement due to electro-convection. The evolution in time of the Nusselt number Nu for different combinations of the two usual non-dimensional parameters associated to the electro-thermo-convection phenomena (Rayleigh number Ra and the electrical parameter T) is also given and analysed.     

Pair-correlated patterns in Hopfield model of neural networks

We study the retrieval properties of the Hopfield model of neural networks when the memorized patterns are statistically correlated in pairs. There is a finite correlationk between the memories of each pair, but memories of different pairs are uncorrelated. The analysis is restricted to the case of an arbitrary but finite number of memories in the thermodynamic limit. We find that there are two retrieval regimes: for 0<T<(1–k) the system recognizes the stored patterns and for (1–k)<T<(1+k) the system is able to recognize pairs, but it is not able to distinguish between its two patterns.     

Full-duplex communication for future wireless networks: Dynamic resource block allocation approach

In this paper, we discuss a full-duplex (FD) communication scenario, where multiple FD user equipments (UEs) share same spectrum resources (or resource blocks) simultaneously. The FD eNodeB deploys digital precoding and successive interference cancellation with optimal ordering algorithm, to allow coexistence of multiple UEs in downlink and uplink, respectively. The sharing of same resource blocks, results in co-channel interference (CCI), in downlink of a UE, from uplink signals of other UEs. To mitigate the interference, a smart antenna approach is adopted. The approach includes using multiple antennas at UEs to form directed beams towards eNodeB and nulls towards other UEs. However, the approach fails when the UEs due to their mobility align themselves in the same direction with respect to the eNodeB (eNB). In this paper, we propose a dynamic resource block allocation (DRBA) algorithm for avoiding CCI due to mobility of UEs, sharing the spectrum resource, in a FD communication scenario. The proposed algorithm shows significant improvement of the quality of service (QoS) of the communication links.     

Delay-induced cluster patterns in coupled Cayley tree networks

We study effects of delay in diffusively coupled logistic maps on the Cayley tree networks. We find that smaller coupling values exhibit sensitiveness to value of delay, and lead to different cluster patterns of self-organized and driven types. Whereas larger coupling strengths exhibit robustness against change in delay values, and lead to stable driven clusters comprising nodes from last generation of the Cayley tree. Furthermore, introduction of delay exhibits suppression as well as enhancement of synchronization depending upon coupling strength values. To the end we discuss the importance of results to understand conflicts and cooperations observed in family business.