相关论文: Improved Approximation Algorithms for Relay Placem…

Range-based localization is ubiquitous: global navigation satellite systems (GNSS) power mobile phone-based navigation, and autonomous mobile robots can use range measurements from a variety of modalities including sonar, radar, and even…

This paper considers N mobile nodes that move together in the vicinity of each other, whose initial poses as well as subsequent movements must be accurately tracked in real time with the assist of M(>=3) reference nodes. By engaging the…

In a radio network with single source-destination pair and some relays, a link between any two nodes is considered to have same or zero path loss. However in practice some links may have considerably high path loss than others but still…

The following paper proposes a new target localization system design using an architecture based on reconfigurable intelligent surfaces (RISs) and passive radars (PRs) for integrated sensing and communications systems. The preamble of the…

Molecular Communications via Diffusion (MCvD) is a promising paradigm which enables nano-machines to communicate with each other. However, the reliability of existing systems degrade rapidly as the distance between the transmitters and the…

In this paper, a cooperative localization algorithm is proposed that considers the existence of obstacles in mobilityassisted wireless sensor networks (WSNs). In this scheme, a mobile anchor (MA) node cooperates with static sensor nodes and…

Emerging reconfigurable optical communication technologies allow to enhance datacenter topologies with demand-aware links optimized towards traffic patterns. This paper studies the algorithmic problem of jointly optimizing topology and…

First, we study geometric variants of the standard set cover motivated by assignment of directional antenna and shipping with deadlines, providing the first known polynomial-time exact solutions. Next, we consider the following general…

Large infrastructure networks (e.g. for transportation and power distribution) require constant monitoring for failures, congestion, and other adversarial events. However, assigning a sensor to every link in the network is often infeasible…

The concept of bounded highway dimension was developed to capture observed properties of the metrics of road networks. We show that a graph with bounded highway dimension, for any vertex, can be embedded into a a graph of bounded treewidth…

Motivated by real-world applications such as the allocation of public housing, we examine the problem of assigning a group of agents to vertices (e.g., spatial locations) of a network so that the diversity level is maximized. Specifically,…

To enhance the reliability of LoRa sensor networks, we propose two opportunistic forwarding protocols in which relays overhear sensor-to-gateway messages and periodically forward them to a gateway. To reduce the number of transmissions, the…

Sensor arrays play a significant role in direction of arrival (DOA) estimation. Specifically, arrays with low redundancy and reduced mutual coupling are desirable. In this paper, we investigate a sensor array configuration that has a…

Countries with access to large bodies of water often aim to protect their maritime transport by employing maritime surveillance systems. However, the number of available sensors (e.g., cameras) is typically small compared to the…

Exploiting wavefront curvature enables localization with limited infrastructure and hardware complexity. With the introduction of reconfigurable intelligent surfaces (RISs), new opportunities arise, in particular when the RIS is functioning…

In the NP-hard continuous 1.5D Terrain Guarding Problem (TGP) we are given an $x$-monotone chain of line segments in $\mathbb{R}^2$ (the terrain $T$) and ask for the minimum number of guards (located anywhere on $T$) required to guard all…

In this paper a convergent, nearest-neighbor, control protocol is suggested for agents with nontrivial dynamics. The protocol guarantees convergence to a common point in space even if each agent is restricted to communicate with a single…

Reminiscent of the parity function in network coding for the butterfly network, it is shown that forwarding an even/odd indicator bit for a scalar quantization of a relay observation recovers 1 bit of information at the two destinations in…

In this paper, we investigate the optimal precoding scheme for relay networks with finite-alphabet constraints. We show that the previous work utilizing various design criteria to maximize either the diversity order or the transmission rate…

The multihop relay wireless networks have gained traction due to the emergence of Reconfigurable Intelligent Surfaces (RISs) which can be used as relays in high frequency range wireless network, including THz or mmWave. To select paths in…