Related papers: Joint Optimization of Scheduling and Routing in Mu…

In this paper we tackle the problem of routing multiple agents in a coordinated manner. This is a complex problem that has a wide range of applications in fleet management to achieve a common goal, such as mapping from a swarm of robots and…

A scalable framework is developed to allocate radio resources across a large number of densely deployed small cells with given traffic statistics on a slow timescale. Joint user association and spectrum allocation is first formulated as a…

In this paper, we introduce a game theoretic framework for studying the problem of minimizing the delay of instantly decodable network coding (IDNC) for cooperative data exchange (CDE) in decentralized wireless network. In this…

We consider a general class of low complexity distributed scheduling algorithms in wireless networks, maximal scheduling with priorities, where a maximal set of transmitting links in each time slot are selected according to certain…

Due to their inherent complexity, engineered wireless multihop ad hoc communication networks represent a technological challenge. Having no mastering infrastructure the nodes have to selforganize themselves in such a way that for example…

We propose a decentralized stochastic control solution for the broadcast message dissemination problem in wireless ad hoc networks with slow fading channels. We formulate the control problem as a dynamic robust game which is well justified…

Routing in wireless communication networks is shaped by mobility, interference, congestion, and competing service requirements, making route selection a high-dimensional constrained optimization problem rather than a simple shortest-path…

We explore the interplay between architectures and algorithm design in the context of shared-memory platforms and a specific graph problem of central importance in scientific and high-performance computing, distance-1 graph coloring. We…

Schematic maps are in daily use to show the connectivity of subway systems and to facilitate travellers to plan their journeys effectively. This study surveys up-to-date algorithmic approaches in order to give an overview of the state of…

We study the problem of multi-robot active mapping, which aims for complete scene map construction in minimum time steps. The key to this problem lies in the goal position estimation to enable more efficient robot movements. Previous…

In this paper we consider graph-coloring problems, an important subset of general constraint satisfaction problems that arise in wireless resource allocation. We constructively establish the existence of fully decentralized learning-based…

Multicast is a central challenge for emerging multi-hop wireless architectures such as wireless mesh networks, because of its substantial cost in terms of bandwidth. In this report, we study one specific case of multicast: broadcasting,…

In this paper, we propose a solution to the distributed topology formation problem for large-scale sensor networks with multi-source multicast flows. The proposed solution is based on game-theoretic approaches in conjunction with network…

Combinatorial optimization problems near algorithmic phase transitions represent a fundamental challenge for both classical algorithms and machine learning approaches. Among them, graph coloring stands as a prototypical constraint…

This paper presents a potential game-based method for non-myopic planning of mobile sensor networks in the context of target tracking. The planning objective is to select the sequence of sensing points over more than one future time steps…

We present a novel algorithm for game-theoretic trajectory planning, tailored for settings in which agents can only observe one another in specific regions of the state space. Such problems arise naturally in the context of multi-robot…

This paper focuses on the link scheduling problem in networks where signal delays between nodes are multiples of a time interval. To model such networks, a directed hypergraph is employed, along with an integer matrix that specifies the…

We propose a novel framework for real-time communication-aware coverage control in networked robot swarms. Our framework unifies the robot dynamics with network-level message-routing to reach consensus on swarm formations in the presence of…

The energy efficiency of future networks is becoming a significant and urgent issue, calling for greener network designs. At the same time, rapid development of wireless networks shows a trend of increasing complexity in network structure…

Several authors modelled networks ad hoc by oriented or disoriented graphs, whereby the problem of allowance (allocation) of the frequencies at the level of the network was transformed into coloring problem of nodes in the graph. Graph…