Related papers: Connection intervals in multi-scale dynamic networ…
Nowadays, mobile users wish to use their multi-interface mobile devices to access the Internet through network points of attachment (PoA) based on heterogeneous wireless technologies. They also wish to seamlessly change the PoAs during…
In this work, we are concerned with maximizing the lifetime of a cluster of sensors engaged in single-hop communication with a base-station. In a data-gathering network, the spatio-temporal correlation in sensor data induces…
Impact of mobility will be increasingly important in future generation wireless services and the related challenges will need to be addressed. Sojourn time, the time duration that a mobile user stays within a cell, is a mobility-aware…
Interference alignment is degree of freedom optimal in K -user MIMO interference channels and many previous works have studied the transceiver designs. However, these works predominantly focus on networks with perfect channel state…
Multiple time scales in dynamical systems lead to a bundling of trajectories onto slow invariant manifolds (SIMs). Although they are absent in two-dimensional holomorphic dynamical systems, a bundling of orbits is often observed as well.…
Connectivity is one of the most fundamental properties of wireless multi-hop networks. A network is said to be connected if there is a path between any pair of nodes. A convenient way to study the connectivity of a random network is by…
This paper studies periodic event-triggered networked control for nonlinear systems, where the plants and controllers are connected by multiple independent communication channels. Several network-induced imperfections are considered…
The aim of this paper is to rigorously study dynamics of Heterogeneously Coupled Maps (HCM). Such systems are determined by a network with heterogeneous degrees. Some nodes, called hubs, are very well connected while most nodes interact…
We describe a simple adaptive network of coupled chaotic maps. The network reaches a stationary state (frozen topology) for all values of the coupling parameter, although the dynamics of the maps at the nodes of the network can be…
n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a power loss of r^{-alpha}, as well as a random phase. We…
In this paper, the behavior of scalar multi-agent systems over networks subject to time-driven jumps. Assuming that all agents communicate through distinct communication digraphs at jump and flow times, the asymptotic multi-consensus…
We study the transition to synchronization in large, dense networks of chaotic circle maps, where an exact solution of the mean-field dynamics in the infinite network and all-to-all coupling limit is known. In dense networks of finite size…
We characterize trade-offs between the end-to-end communication delay and the energy in urban vehicular communications with infrastructure assistance. Our study exploits the self-similarity of the location of communication entities in…
It is well known that the addition of noise to a multistable dynamical system can induce random transitions from one stable state to another. For low noise, the times between transitions have an exponential tail and Kramers' formula gives…
Positioning systems in self-organizing networks generally rely on measurements such as delay and received signal strength, which may be difficult to obtain and often require dedicated equipment. An alternative to such approaches is to use…
We introduce a new model of spatial random multiple access systems with a non-standard departure policy: all arriving messages are distributed uniformly on a finite sphere in the space, and when a successful transmission of a single message…
This article studies the reliability of multi-hop routing in a multi-tier hybrid satellite-terrestrial relay network (HSTRN). We evaluate the reliability of multi-hop routing by introducing interruption probability, which is the probability…
Markovian evolving graphs are dynamic-graph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamic-network…
Moving Sink (MS) in Wireless Sensor Networks (WSNs) has appeared as a blessing because it collects data directly from the nodes where the concept of relay nodes is becomes obsolete. There are, however, a few challenges to be taken care of,…
Network remodeling, or adaptation, in the presence of periodically driven forcings has hereto remained largely unexplored, despite the fact that a broad class of biological transport networks, e.g. animal vasculature, depends on periodic…