相关论文: Distributed backbone structure for deterministic a…

Graph spanners are fundamental graph structures with a wide range of applications in distributed networks. We consider a standard synchronous message passing model where in each round $O(\log n)$ bits can be transmitted over every edge (the…

In this work we address the question how important is the knowledge of geometric location and network density to the efficiency of (distributed) wireless communication in ad hoc networks. We study fundamental communication task of broadcast…

In this paper, we consider multiple channels and wireless nodes with multiple transceivers. Each node assigns one transmitter at each available channel. For each assigned transmitter the node decides the power level and data rate of…

We give efficient algorithms for the fundamental problems of Broadcast and Local Broadcast in dynamic wireless networks. We propose a general model of communication which captures and includes both fading models (like SINR) and graph-based…

In the light of energy conservation and the expansion of existing networks, wireless networks face the challenge of nodes with heterogeneous transmission power. However, for more realistic models of wireless communication only few…

Deep neural networks (DNNs) have been employed for designing wireless networks in many aspects, such as transceiver optimization, resource allocation, and information prediction. Existing works either use fully-connected DNN or the DNNs…

This paper proposes a new class of simple, distributed algorithms for scheduling in wireless networks. The algorithms generate new schedules in a distributed manner via simple local changes to existing schedules. The class is parameterized…

This paper studies a deep learning approach for binary assignment problems in wireless networks, which identifies binary variables for permutation matrices. This poses challenges in designing a structure of a neural network and its training…

We study the performance of wireless links for a class of Poisson networks, in which packets arrive at the transmitters following Bernoulli processes. By combining stochastic geometry with queueing theory, two fundamental measures are…

4D time-space reconstruction of dynamic events or deforming objects using X-ray computed tomography (CT) is an important inverse problem in non-destructive evaluation. Conventional back-projection based reconstruction methods assume that…

While routing in wireless networks has been studied extensively, existing protocols are typically designed for a specific set of network conditions and so cannot accommodate any drastic changes in those conditions. For instance, protocols…

We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity $\lambda$ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm takes $\tilde…

The Beeping Network (BN) model captures important properties of biological processes. Paradoxically, the extremely limited communication capabilities of such nodes has helped BN become one of the fundamental models for networks. Since in…

Interference-aware resource allocation of time slots and frequency channels in single-antenna, halfduplex radio wireless sensor networks (WSN) is challenging. Devising distributed algorithms for such task further complicates the problem.…

We study the multi-broadcast problem in multi-hop wireless networks under the SINR model deployed in the 2D Euclidean plane. In multi-broadcast, there are $k$ initial rumours, potentially belonging to different nodes, that must be forwarded…

Constructing a connected dominating set as the virtual backbone plays an important role in wireless networks. In this paper, we propose two novel approximate algorithms for dominating set and connected dominating set in wireless networks,…

In this paper we consider the problem of communication scheduling in wireless networks with respect to the SINR(Signal to Interference plus Noise Ratio) constraint in metric spaces. The nodes are assigned linear powers, i.e. for each sender…

In wireless ad hoc or sensor networks, distributed node coloring is a fundamental problem closely related to establishing efficient communication through TDMA schedules. For networks with maximum degree Delta, a Delta + 1 coloring is the…

The design of a set of beamformers for the multiuser multiple-input single-output (MISO) downlink that provides the receivers with prespecified levels of quality-of-service (QoS) can be quite challenging when the channel state information…

In this paper, we study systems of distributed entities that can actively modify their communication network. This gives rise to distributed algorithms that apart from communication can also exploit network reconfiguration in order to carry…