Related papers: Optimal forwarding ratio on dynamical networks wit…
Exploring the collective behavior of interacting entities is of great interest and importance. Rather than focusing on static and uniform connections, we examine the co-evolution of diverse mobile agents experiencing varying interactions…
A fundamental understanding of gain provided by motion prediction in wireless ad hoc routing is currently lacking. This paper examines benefits in routing obtainable via prediction. A theoretical best-case non-predictive routing model is…
We investigate simplified models of computer data networks and examine how the introduction of additional random links influences the performance of these net works. In general, the impact of additional random links on the performance of…
To achieve the requirement of high data rate, low latency, user fairness for next generation wireless networks, proper designing of cross-layer optimized dynamic resource allocation algorithm is prerequisite. In this paper, we propose a…
We initiate the study of the heterogeneous facility location problem with limited resources. We mainly focus on the fundamental case where a set of agents are positioned in the line segment [0,1] and have approval preferences over two…
We study the problem of caching optimization in heterogeneous networks with mutual interference and per-file rate constraints from an energy efficiency perspective. A setup is considered in which two cache-enabled transmitter nodes and a…
We consider a load balancing system consisting of $n$ single-server queues working in parallel, with heterogeneous service rates. Jobs arrive to a central dispatcher, which has to dispatch them to one of the queues immediately upon arrival.…
An important aspect in jointly analysing networked control systems and their communication is to model the networking in a sufficiently rich but at the same time mathematically tractable way. As such, this paper improves on a recently…
In this paper, we consider the dynamic multi-robot distribution problem where a heterogeneous group of networked robots is tasked to spread out and simultaneously move towards multiple moving task areas while maintaining connectivity. The…
Natural and artificial collectives exhibit heterogeneities across different dimensions, contributing to the complexity of their behavior. We investigate the effect of two such heterogeneities on collective opinion dynamics: heterogeneity of…
In random access protocols, the service rate depends on the number of stations with a packet buffered for transmission. We demonstrate via numerical analysis that this state-dependent rate along with the consideration of Poisson traffic and…
The topologies of predictable dynamic networks are continuously dynamic in terms of node position, network connectivity and link metric. However, their dynamics are almost predictable compared with the ad-hoc network. The existing routing…
Communication of signals among nodes in a complex network poses fundamental problems of efficiency and cost. Routing of messages along shortest paths requires global information about the topology, while spreading by diffusion, which…
With the increasing demands for new data and real-time services, wireless networks should support calls with different traffic characteristics and different Quality of Service (QoS)guarantees. In addition, various wireless technologies and…
This paper introduces a new theoretical framework for optimal handover procedures in heterogeneous networks by devising the novel fractional Gittins indices, which are dynamical priorities whose values can be statically associated to the…
We study kinetic transport through modular networks consisting of alternating domains using both analytical and numerical methods. We demonstrate that the mean velocity is insensitive to the local structure of the network, and it indicates…
Preferences, fundamental in all forms of strategic behavior and collective decision-making, in their raw form, are an abstract ordering on a set of alternatives. Agents, we assume, revise their preferences as they gain more information…
Nodes can be ranked according to their relative importance within the network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based…
The current paper deals with the subject of shortest path routing in transportation networks (in terms of travelling time), where the speed in several of the network's roads is a function of the time interval. The main contribution of the…
Routing strategies under the aegis of dynamic traffic assignment have been proposed in the literature to optimize system performance. However, challenges have persisted in their deployment ability and effectiveness due to inherent strong…