Given a wireless sensor network, we consider the problem to minimize its total energy consumption over consecutive time slots with respect to communication activities. Non-empty and disjoint subsets of nodes are required to be active and connected under a tree topology configuration in the different time slots, and each network node must be active in a unique time slot. Moreover, the power required by the same pair of network nodes to communicate on the associated direct channel may vary in the different time slots. The problem has been recently introduced in the literature under the name Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage. We focus on the exact solution of the problem. We present a branch-and-cut (BC) algorithm based on a novel Integer Linear Programming formulation which allows avoiding the introduction of symmetries in the solution space. In particular, the algorithm relies on an efficient and non-typical separation algorithm for known valid inequalities, and on an easy-to-implement primal bound heuristic. The effectiveness of the BC algorithm is empirically shown through an extensive experimental analysis involving 300 newly generated benchmark instances with up to 200 network nodes and 8 time slots. Moreover, the experimental results show that the BC algorithm represents a valid computational tool to benchmark the performance of heuristics addressing the problem, and can be used in practice, as an heuristic solver, to tackle problem instances that are not too large.
On optimally solving sub-tree scheduling for wireless sensor networks with partial coverage: a branch-and-cut algorithm / N. Bianchessi. - In: NETWORKS. - ISSN 0028-3045. - 81:4(2023 Jun), pp. 499-513. [10.1002/net.22145]
On optimally solving sub-tree scheduling for wireless sensor networks with partial coverage: a branch-and-cut algorithm
N. Bianchessi
Primo
2023
Abstract
Given a wireless sensor network, we consider the problem to minimize its total energy consumption over consecutive time slots with respect to communication activities. Non-empty and disjoint subsets of nodes are required to be active and connected under a tree topology configuration in the different time slots, and each network node must be active in a unique time slot. Moreover, the power required by the same pair of network nodes to communicate on the associated direct channel may vary in the different time slots. The problem has been recently introduced in the literature under the name Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage. We focus on the exact solution of the problem. We present a branch-and-cut (BC) algorithm based on a novel Integer Linear Programming formulation which allows avoiding the introduction of symmetries in the solution space. In particular, the algorithm relies on an efficient and non-typical separation algorithm for known valid inequalities, and on an easy-to-implement primal bound heuristic. The effectiveness of the BC algorithm is empirically shown through an extensive experimental analysis involving 300 newly generated benchmark instances with up to 200 network nodes and 8 time slots. Moreover, the experimental results show that the BC algorithm represents a valid computational tool to benchmark the performance of heuristics addressing the problem, and can be used in practice, as an heuristic solver, to tackle problem instances that are not too large.File | Dimensione | Formato | |
---|---|---|---|
main-clean-ALL.pdf
accesso aperto
Tipologia:
Pre-print (manoscritto inviato all'editore)
Dimensione
358.76 kB
Formato
Adobe PDF
|
358.76 kB | Adobe PDF | Visualizza/Apri |
Networks - 2023 - Bianchessi - On optimally solving sub‐tree scheduling for wireless sensor networks with partial coverage .pdf
accesso aperto
Tipologia:
Publisher's version/PDF
Dimensione
1.57 MB
Formato
Adobe PDF
|
1.57 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.