TY - JOUR
T1 - Consistent sensor, relay, and link selection in wireless sensor networks
AU - Arroyo-Valles, Rocío
AU - Simonetto, Andrea
AU - Leus, Geert
N1 - Accepted Author Manuscript
PY - 2017/11
Y1 - 2017/11
N2 - 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.
AB - 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.
KW - Convex relaxations
KW - Link and relay selection
KW - Resources optimization
KW - Sensor selection
KW - Sparsity
KW - Wireless sensor networks
UR - http://www.scopus.com/inward/record.url?scp=85018905312&partnerID=8YFLogxK
UR - http://resolver.tudelft.nl/uuid:29f940f0-34d1-4131-8ce8-0bf898bde6cc
U2 - 10.1016/j.sigpro.2017.04.020
DO - 10.1016/j.sigpro.2017.04.020
M3 - Article
AN - SCOPUS:85018905312
SN - 0165-1684
VL - 140
SP - 32
EP - 44
JO - Signal Processing
JF - Signal Processing
ER -