On the perspective transformation for efficient relay placement in wireless multicast networks

This letter investigates the relay placement problem in wireless multicast networks consisting of multiple sources, relays, and destinations. The data transmission from the sources to the destinations is carried out via the relays employing physical-layer network coding technique. Hybrid automatic repeat request protocol with incremental redundancy is applied for reliable communication. In particular, considering a general setting of nodes in irregularly shaped network, an efficient relay placement algorithm is proposed based on perspective transformation technique to find optimal relay positions for minimizing either the total energy consumption or the total delay in the whole network. The proposed algorithm not only helps reduce the relay searching complexity but also facilitates the relay placement for optimizing networks of any shape

Neural network and genetic algorithm techniques for energy efficient relay node placement in smart grid

Smart grid (SG) is an intelligent combination of computer science and electricity system whose main characteristics are measurement and real-time monitoring for utility and consumer behavior. SG is made of three main parts: Home Area Network (HAN), Field Area Network (FAN) and Wide Area Network (WAN). There are several techniques used for monitoring SG such as fiber optic but very costly and difficult to maintain. One of the ways to solve the monitoring problem is use of Wireless Sensor Network (WSN). WSN is widely researched because of its easy deployment, low maintenance requirements, small hardware and low costs. However, SG is a harsh environment with high level of magnetic field and background noise and deploying WSN in this area is challenging since it has a direct effect on WSN link quality. An optimal relay node placement which has not yet worked in a smart grid can improve the link quality significantly. To solve the link quality problem and achieve optimum relay node placement, network life-time must be calculated because a longer life-time indicates better relay placement. To calculate this life-time, it is necessary to estimate packet reception rate (PRR). In this research, to achieve optimal relay node placement, firstly, a mathematical formula to measure link quality of the network in smart grid environment is proposed. Secondly, an algorithm based on neural network to estimate the network life-time has been developed. Thirdly, an algorithm based on genetic algorithm for efcient positioning of relay nodes under different conditions to increase the life-time of neural network has also been developed. Results from simulation showed that life-time prediction of neural network has a 91% accuracy. In addition, there was an 85% improvement of life-time compared to binary integer linear programming and weight binary integer linear programming. The research has shown that relay node placement based on the developed genetic algorithms have increased the network life-time, addressed the link quality problem and achieved optimum relay node placement

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

ON RELAY NODE PLACEMENT PROBLEM FOR SURVIVABLE WIRELESS SENSOR NETWORKS

Wireless sensor networks are widely applied to many fields such as animal habitat monitoring, air traffic control, and health monitoring. One of the current problems with wireless sensor networks is the ability to overcome communication failures due to hardware failure, distributing sensors in an uneven geographic area, or unexpected obstacles between sensors. One common solution to overcome this problem is to place a minimum number of relay nodes among sensors so that the communication among sensors is guaranteed. This is called Relay Node Placement Problem (RNP). This problem has been proved as NP-hard for a simple connected graph. Therefore, many algorithms have been developed based on Steiner graphs. Since RNP for a connected graph is NP-hard, the RNP for a survivable network has been conjectured as NP-hard and the algorithms for a survivable network have also been developed based on Steiner graphs. In this study, we show the new approximation bound for the survivable wireless sensor networks using the Steiner graphs based algorithm. We prove that the approximation bound is guaranteed in an environment where some obstacles are laid, and also propose the newly developed algorithm which places fewer relay nodes than the existing algorithms. Consequently, the main purpose of this study is to find the minimum number of relay nodes in order to meet the survivability requirements of wireless sensor networks

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