Tags:air traffic control, antenna node, Case study, communication network, convex polygon, directional antenna, fault tolerance, milp problem, mission critical communication network, mixed integer linear programming, Optimisation, placement cost, pseudo boolean satisfiability, Pseudo-Boolean Optimisation, relay antenna, relay node placement, terrain orography, wireless network, Wireless Networks and wireless sensor network
Abstract:
The operations of many critical infrastructures (e.g., airports) heavily depend on proper functioning of the radio communication network supporting operations. As a result, such a communication network is indeed a mission-critical communication network that needs adequate protection from external electromagnetic interferences. This is usually done through radiogoniometers. Basically, by using at least three suitably deployed radiogoniometers and a gateway gathering information from them, sources of electromagnetic emissions that are not supposed to be present in the monitored area can be localised. Typically, relay nodes are used to connect radiogoniometers to the gateway. As a result, some degree of fault-tolerance for the network of relay nodes is essential in order to offer a reliable monitoring. On the other hand, deployment of relay nodes is typically quite expensive. As a result, we have two conflicting requirements: minimise costs while guaranteeing a given fault-tolerance.
In this paper address the problem of computing a deployment for relay nodes that minimises the relay node network cost while at the same time guaranteeing proper working of the network even when some of the relay nodes (up to a given maximum number) become faulty (fault-tolerance).
We show that the above problem can be formulated as a MILP as well as a PB optimisation problem and present experimental results comparing the two approaches on realistic scenarios.
Optimal Fault-Tolerant Placement of Relay Nodes in a Mission Critical Wireless Network