Tag Archive: 'Omnet Simulator'
We consider the problem of deriving an explicit approximate solution of the nonlinear power equations that describe a balanced power distribution network. We give sufficient conditions for the existence of a practical solution to the power flow equations, and we propose an approximation that is linear in the active and reactive power demands of the […]
This paper is concerned with the global robust synchronization of multiple memristive neural networks (MMNNs) with nonidentical uncertain parameters. A coupling scheme is introduced, in a general topological structure described by a direct or undirect graph, with a linear diffusive term and a discontinuous sign term. First, a set of sufficient conditions are derived based […]
Many signal processing problems in wireless sensor networks can be solved by graph filtering techniques. Finite impulse response (FIR) graph filters (GFs) have received more attention in the literature because they enable distributed computation by the sensors. However, FIR GFs are limited in their ability to represent the global information of the network. This letter […]
Transmission over doubly-selective fading (DSF) interference channel often relies on the use of robust precoder due to a lack of accurate channel state information, with performance often depending on the conservativeness of the mismatch model. Previously proposed mismatch models either have been deemed too conservative (deterministic models) or are prone to error due to inaccuracy […]
Modern control systems rely heavily on their sensors for reliable operation. Failure of a sensor could destabilize the system, which could have serious consequences to the system’s operations. Therefore, there is a need to detect and accommodate such failures, particularly if the system in question is of a safety critical application. In this paper, a […]
In this paper, a joint optimization of link scheduling, routing and replication for delay-tolerant networks (DTNs) has been studied. The optimization problems for resource allocation in DTNs are typically solved using dynamic programming which requires knowledge of future events such as meeting schedules and durations. This paper defines a new notion of approximation to the […]
We develop robust resource-allocation schemes for a cognitive radio network (CRN), where the secondary users (SUs) try to communicate with each other from different small cell primary user (PU) networks. User cooperation technique is considered for communication among the SUs since PUs are in close proximity and there are tight interference constraints on the PU […]
We propose and implement required GMPLS/PCE routing and signaling protocol extensions for the configuration/control of MF OTPs. A novel online RSMA algorithm allows experimentally evaluating the automatic provisioning of LSPs including MF OTPs.
This work extends NFV paradigm to transport networks, known as Transport NFV. This paper presents a detailed overview of the SDN/NFV services that are offered on top of the Cloud Computing platform and transport network of the ADRENALINE Testbed. On the one hand, we propose a generic architecture for SDN/NFV services deployed over multi-domain transport […]
Congestion phenomenon has been observed in communication networks for many years, and one important reason for this is the effect of network applications. In actual networks, different applications may be provided by the same server node. This results in coupling between the applications. This coupling relationship makes it difficult to evaluate actual network reliability, with […]