Optimal fault-tolerant placement of relay nodes in a mission critical wireless network

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 Mixed Integer Linear Programming (MILP) as well as a Pseudo-Boolean Satisfiability (PB-SAT) optimisation problem and present experimental results com- paring the two approaches on realistic scenarios

QoS Constrained Optimal Sink and Relay Placement in Planned Wireless Sensor Networks

We are given a set of sensors at given locations, a set of potential locations for placing base stations (BSs, or sinks), and another set of potential locations for placing wireless relay nodes. There is a cost for placing a BS and a cost for placing a relay. The problem we consider is to select a set of BS locations, a set of relay locations, and an association of sensor nodes with the selected BS locations, so that number of hops in the path from each sensor to its BS is bounded by hmax, and among all such feasible networks, the cost of the selected network is the minimum. The hop count bound suffices to ensure a certain probability of the data being delivered to the BS within a given maximum delay under a light traffic model. We observe that the problem is NP-Hard, and is hard to even approximate within a constant factor. For this problem, we propose a polynomial time approximation algorithm (SmartSelect) based on a relay placement algorithm proposed in our earlier work, along with a modification of the greedy algorithm for weighted set cover. We have analyzed the worst case approximation guarantee for this algorithm. We have also proposed a polynomial time heuristic to improve upon the solution provided by SmartSelect. Our numerical results demonstrate that the algorithms provide good quality solutions using very little computation time in various randomly generated network scenarios

Distribution System Outage Detection using Consumer Load and Line Flow Measurements

An outage detection framework for power distribution networks is proposed. Given the tree structure of the distribution system, a method is developed combining the use of real-time power flow measurements on edges of the tree with load forecasts at the nodes of the tree. A maximum a posteriori detector {\color{black} (MAP)} is formulated for arbitrary number and location of outages on trees which is shown to have an efficient detector. A framework relying on the maximum missed detection probability is used for optimal sensor placement and is solved for tree networks. Finally, a set of case studies is considered using feeder data from the Pacific Northwest National Laboratories. We show that a 10\% loss in mean detection reliability network wide reduces the required sensor density by 60 \% for a typical feeder if efficient use of measurements is performed.Comment: Complete rework of result

Car-Park Management using Wireless Sensor Networks

A complete wireless sensor network solution for car-park management is presented in this paper. The system architecture and design are first detailed, followed by a description of the current working implementation, which is based on our DSYS25z sensing nodes. Results of a series of real experimental tests regarding connectivity, sensing and network performance are then discussed. The analysis of link characteristics in the car park scenario shows unexpected reliability patterns which have a strong influence on MAC and routing protocol design. Two unexpected link reliability patterns are identified and documented. First, the presence of the objects (cars) being sensed can cause significant interference and degradation in communication performance. Second, link quality has a high temporal correlation but a low spatial correlation. From these observations we conclude that a) the construction and maintenance of a fixed topology is not useful and b) spatial rather than temporal message replicates can improve transport reliability