Consistent sensor, relay, and link selection in wireless sensor networks

Abstract

In wireless sensor networks, where energy is scarce, it is inefficient to have all nodes active because they consume a non-negligible amount of battery. In this paper we consider the problem of jointly selecting sensors, relays and links in a wireless sensor network where the active sensors need to communicate their measurements to one or multiple access points. Information messages are routed stochastically in order to capture the inherent reliability of the broadcast links via multiple hops, where the nodes may be acting as sensors or as relays. We aim at finding optimal sparse solutions where both, the consistency between the selected subset of sensors, relays and links, and the graph connectivity in the selected subnetwork are guaranteed. Furthermore, active nodes should ensure a network performance in a parameter estimation scenario. Two problems are studied: sensor and link selection; and sensor, relay and link selection. To solve such problems, we present tractable optimization formulations and propose two algorithms that satisfy the previous network requirements. We also explore an extension scenario: only link selection. Simulation results show the performance of the algorithms and illustrate how they provide a sparse solution, which not only saves energy but also guarantees the network requirements.

Request Scheduling in Quantum Networks

“…However, energy is very often a scarce resource, therefore the nodes alternate between activity and inactivity periods: when they do so in an uncontrolled manner, the routing process cannot rely on all potential links being active at the same time, which is similar to what happens in a quantum network due to a failed local entanglement. The problem has been studied in the literature, e.g., in [33] the authors propose a distributed algorithm that finds the optimal routing probabilities based on the physicallayer characteristics of the links, which is then generalized in [1], which also considers the sensing process in addition to multi-hop data transfer. Key difference: There is a fundamental difference between stochastic routing in WSNs and the quantum routing problem investigated in this work: as we will explain in more details in Sec.…”

“…A roadmap for its realization is neatly summarized in [43] while a break-down of the technologies involved and their recent status is reported in [2]. The most important building block of quantum networks is the quantum repeater (or repeater for short) 1 , which allows the transfer of quantum states through entanglement swap [5]. The case of end-toend entanglement between two physically separated quantum systems (let us call them nodes) via a repeater using quantum sources is illustrated in Fig.…”

“…1 [35]. The quantum sources emit 1 Alternative techniques to achieve entanglement distribution in a quantum network have been also proposed and are worthy of further investigation, e.g., entanglement percolation [30], but in the research community repeaterbased approaches are currently predominant. locally entangled Einstein-Podolsky-Rosen (EPR) pairs towards both the end-point quantum systems, called Alice and Carol in the example, and the repeater, i.e., Bob.…”

Design of Routing Algorithm for Wireless Sensor Networks based on Clustering Structure

“…Data transmission relies on efficient routing algorithms. In recent years, research on routing algorithms has never been interrupted, and LEACH algorithm (Low Energy Adaptive Clustering Hierarchy) has been widely used as a low-power adaptive algorithm (6)(7)(8)(9)(10) .…”

A Review of Relay Assignment Problem in the Cooperative Wireless Sensor Networks

“…Similarly, the work done in [16] propose a joint relay assignment and power allocation (JRPA) algorithm for cooperative communication. The energy efficiency is one the main performance criteria to select the relay node in wireless sensor networks [17,18]. • Opportunist relay selection: Opportunistic relay selection depends on instantaneous measurement of channel condition and does not require any topological information.…”