Engineering » Electrical and Electronic Engineering » "Wireless Mesh Networks - Efficient Link Scheduling, Channel Assignment and Network Planning Strategies", book edited by Andrey V. Krendzel, ISBN 978-953-51-0672-2, Published: August 14, 2012 under CC BY 3.0 license. © The Author(s).

# Achieving Fault-Tolerant Network Topology in Wireless Mesh Networks

By Svilen Ivanov and Edgar Nett
DOI: 10.5772/50173

Article top

## Overview

Figure 1. Wireless mesh networks and radio coverage

Figure 2. Static deployment method for radio coverage

Figure 3. The states of our fault-tolerant system

Figure 4. The error detection and system recovery of our fault-tolerant system

Figure 5. Base station planning algorithm

Figure 6. Example operation of the base station planning algorithm

Figure 7. Example of the graph consolidation step

Figure 8. Example fault-tolerant (biconnected) topology produced by the algorithm

Figure 9. Algorithm termination: 80% of all algorithm executions terminated after 2 iterations. The algorithm needed a maximum of 4 iterations to complete.

Figure 10. Example network topology after the first algorithm iteration

# Achieving Fault-Tolerant Network Topology in Wireless Mesh Networks

Svilen Ivanov1 and Edgar Nett2

## 1. Introduction

Wireless Mesh Network (WMN) is an ad-hoc network with a fixed network infrastructure (see an example in figure ). The physical structure of a WMN includes base stations, a backbone and mobile stations. The base stations (also known as mesh routers or mesh points) are static wireless nodes, forming the network infrastructure and providing wireless network access to the mobile stations. The backbone is a wireless ad-hoc network among the base stations. The fixed network infrastructure provides wireless network access to the mobile stations in a service area. Service area is a finite three-dimensional space. The mobile stations are wireless nodes which move within the service area and communicate to other stations via the WMN. The stations in a WMN use a multi-hop routing protocol for communication. This protocol automatically discovers the network topology and delivers the messages to the destination; if needed over multiple hops. We can think of a WMN as an infrastructure wireless network in which the backbone is replaced by a wireless one and the communication is done in a (multi-hop) ad-hoc way.

#### Figure 1.

Wireless mesh networks and radio coverage

We consider a wireless mesh network which supports a business process and is under the administration of an organization. This is not a MANET (Mobile Ad-hoc Network) consisting of self-dependent mobile nodes, like it is often in the literature. The organization has control over the network infrastructure and aims at providing radio coverage and connectivity in a clearly defined service area. The management appliance is a central instance for basic configuration and diagnosis of the WMN, including topology monitoring, protocol settings, traffic management, etc.

Radio coverage and connectivity are basic services of a wireless mesh network which are required for communication. Radio coverage ensures that the mobile stations can access the network infrastructure (backbone) while they are located or moving in the service area. Connectivity ensures that the topology of the backbone is connected.

### 1.1. Radio coverage

The service radio coverage is correct, if the service area is covered by the base stations. The service area is covered, if the unification of radio cells of all base stations contains the whole service area. The radio cell of a base station is a part of the space around it, in which a mobile station observes the base station with a radio signal strength sufficient for communication. The sufficient radio signal strength in the service area is a basic requirement for the mobile stations to be able to access the WMN. The radio coverage service ensures this sufficient signal strength in the service area. Service location is a point of the service area, specified by its coordinates. A service location is covered, if the unification of radio cells of all base stations contains the service location.

### 1.2. Connectivity

The service connectivity is correct, if the backbone graph is connected. The backbone graph is a graph with the base stations as vertices and the routing layer links among them as edges. A link exists if two wireless devices can communicate through the wireless medium obeying some qualitative parameters (see section for more information). The backbone graph represents the network topology at the routing layer. This graph is connected, if a path (a sequence of edges) exists between every two vertices. A connected backbone graph means a connected routing layer topology which is a basic requirement for communication through the WMN. The connectivity service ensures that the backbone graph is connected.

At the example WMN in figure the radio coverage and the connectivity are correct. The unification of radio cells contains the service area and the backbone graph is connected.

### 1.3. Problem exposition and contributions

In this chapter, we address the problem of guaranteeing radio coverage of Wireless Mesh Networks, which are exposed to environmental dynamics.

The environmental dynamics are unpredictable changes of the radio propagation and radio attenuation properties of the environment (e.g. new obstacles, movement of obstacles, increased humidity). They occur due to reconfiguration of the plant layout. Environmental dynamics occur, for instance, in Reconfigurable Manufacturing Systems (RMS) [1], [2]. An RMS is a production system with an adjustable structure, that is able to meet the market requirements with respect to capacity, functionality and cost. This adjustable structure at the system level includes changes in the plant layout, for instance “adding, removing or modifying machine modules, machines, cells, material handling units and/or complete lines[1]. In RMS the environmental dynamics are unpredictable at design time, because the system layout adjustments are made on the fly to meet the actual production demand. The environmental dynamics negatively affect the radio coverage (radio signal strength between mobile stations and base stations) and the backbone network connectivity among base stations of an WMN.

The first contribution of this chapter is a fault-tolerance method for guaranteeing radio coverage of wireless mesh networks in dynamic propagation environments. The basic idea of this approach is to automatically detect an error state, which is lack of redundancy in radio coverage and connectivity, and correct this error by reconfiguring the base stations before the radio coverage fails. The error detection is based on a radio propagation model: if an error is detected in the model, this is an indicator that an error in the real radio coverage exists. In order to be able to make this conclusion, this model is automatically calibrated to the real enviromnent by using radio signal strength measurements.

The second contribution of this chapter is an automatic base station planning algorithm for the reconfiguration phase of the fault-tolerance approach. In this phase base stations are added to the network in order to correct errors in the radio coverage and connectivity. The question is: what is the minimum number of base stations to be added and at which positions in order to restore the original state of radio coverage and connectivity. Our approach is an optimization algorithm, which uses knowledge from the calibrated radio propagation model and answers this question in a sufficient time frame.

### 1.4. Structure of the chapter

In section we will discuss related work. In section we will present our fault-tolerance approach for ensuring the availability of radio coverage and connectivity of wireless mesh networks. In section we will present our approach for automatic base station planning in wireless mesh networks, which is used in the reconfiguration phase on the fault-tolerance approach. Section provides a conclusion and a summary of future work.

## 2. Related work

Firstly, we will present related work aiming at availability of the radio coverage and connectivity. Then we will discuss related work to the automatic base station planning algorithm.

### 2.1. Availability of the radio coverage

The availability of the service radio coverage is a necessary condition for reliable communication in wireless networks. The issue of reliable communication via wireless medium has been extensively investigated during the design of every wireless communication system. Since the wireless medium is unshielded, the effect of the environment on the wireless communication is specific to the environment. Different methods have been developed for increasing the reliability of the communication through the wireless medium. Most of them are at the physical layer. For instance the robust modulation methods (e.g. MIMO), frequency hopping, spread spectrum transmission, redundancy in the antennas and redundancy of the transmitters. At the data link layer, error correction codes and retransmissions are typical measures. These methods mostly address the time-variability of the wireless channel caused by multi-path propagation. However, all these methods require some minimum radio signal strength at the receiver which is a basic requirement for decoding the frames successfully. Providing this minimum radio signal strength is a matter of network deployment and configuration in the particular environment.

The state-of-the-art method for ensuring radio coverage has a static nature (e.g. [3], [4], [5]). Figure

### Figure 2.

Static deployment method for radio coverage

In the context of this chapter, we have high availability requirements. We have an environment which can change in unpredictable way during the network's life-cycle which is typically larger than 10-20 years. For this reason, it is hardly possible to plan sufficient static redundancy for all possible changes of the environment. They are not known at the deployment phase. Even if this would be possible, it would be extremely inefficient. Consequently, a new method is needed for guaranteeing radio coverage. When the factory-layout changes for adapting to a new market, the method should enable an easy adaption of the WMN and should guarantee high availability of the radio coverage and the connectivity.

### 2.2. Connectivity and base station planning

In this section we focus on the deployment and operation of the base stations which is an essential function for connectivity. For the routing protocol and the topology discovery we base on the research within our working group (e.g. [7], [8], [9]).

Industrial automation networks have usually been isolated, single-cell networks or classic infrastructure networks with multiple cells. This means that base station planning is required only for the 'last mile', i.e. the connection between a base station and a mobile station, e.g. [4]. In the case of multi-hop wireless mesh networks, the planning of the backbone network is a new research aspect that needs to be considered. Research on radio network planning consider network throughput as a main planning goal, e.g. [10]. However, the most common requirement of industrial networks is availability. With the introduction of technologies for multi-hop communication in industrial environments (e.g. Zigbee, Wireless HART), the base station planning problem gains importance. Paper [6], for instance, presents the challenges for developing a planning tool for industrial wireless sensor networks. However, to the best of our knowledge, no systematic approach exists for planning multi-hop wireless networks with respect to fault-tolerance requirements of industrial automation networks.

The existing algorithms for the base station planning in wireless mesh networks [11], [12] have a different goal. It is to design a mesh network with a minimum number of base stations such that the end-to-end throughput requirements of application flows are fulfilled. These requirements are typical for Internet access in areas with no alternative high-speed wired connection. The approach is to transform the planning problem into a linear optimization problem which is a combination of a set covering problem and a network flow problem. As a result, the backbone is a connected graph, but with no fault-tolerance. Another disadvantage is the intractability of the proposed approaches. For some inputs, the algorithm takes too much time for the result to be useful. This is because the underlying linear optimization problem is a binary integer problem which is well known for its NP-completeness. Paper [12] addresses this issue by a decomposition method, but the algorithm still runs about 22 hours for a network with 58 nodes. This is acceptable for the mentioned scenarios, but for network reconfiguration in automation scenarios a faster algorithm is required. Extending these algorithms to fault-tolerance would mean an additional increase in the complexity. Paper [13] considers the problem of coverage control in wireless sensor networks, including various aspects like activating/deactivating of the nodes, finding the coverage characteristics of a given network, and sensor node deployment. However, all considerations include only the aspect of last mile coverage, i.e. the sensing function of the nodes. They do not consider the problem of the backbone connectivity for communicating the sensed data to a central instance.

Our approach is to extend the existing methods from infrastructure network planning to planning multi-hop wireless mesh networks with fault-tolerance aspects. Other papers about fault-tolerance in wireless multi-hop networks can benefit from our approach for generating a fault-tolerant topology. Papers considering fault-tolerant routing, for instance [14], [15], [16], have a prerequisite of biconnected backbone network, but do not address the base station planning problem. The base station planning problem has been little addressed so far because in most mobile ad-hoc and sensor network scenarios the number and position of the nodes are considered uncontrolled or hardly controlled. However, in automation scenarios the networks are typically planned to provide service in some predefined geographical area (e.g. production hall). This requires careful base station planning for ensuring high availability of the radio coverage.

The topology control problem is to configure a given an instance of a multi-hop network such that it is connected and a quality of service property is fulfilled. Depending on the configured parameter, these methods adjust the transmission power [17] or the time of activity and sleeping periods of the nodes [18]. Paper [17] presents an algorithm for distributed adjustment of the transmission powers of the nodes with the purpose of minimizing the interference and keeping the network topology connected with a high probability. Paper [18] presents a distributed protocol for topology management which determines the active and sleeping periods for the nodes in such a way that the network is connected, the energy consumption is minimized, and the data is delivered with real-time guarantees. Paper [19] considers the issue of data forwarding in industrial wireless sensor networks and the integration in a wired backbone. It proposes a chain-based communication protocol for real-time communication over multiple hops. It is common for all topology control protocols that they operate on some existing instance of a multi-hop network. For achieving the required quality of service property, these protocols require some topological properties of the network (like connectivity or k-connectivity). The difference is that our base station planning algorithm plans a given network to be deployed with the desired topological properties. In this way, our algorithm can be used in the first phase of planning the topological properties of the network. In a second phase a topology control algorithm can be used to additionally adjust the transmission powers or active/sleep times of the nodes for achieving the required QoS property.

## 3. Fault-tolerant radio coverage and connectivity

This section presents our approach for fault-tolerant radio coverage and connectivity of wireless mesh networks in dynamic propagation environments. A premature version of this approach, considering only radio coverage, has been published in [20].

### 3.1. Fault-tolerance approach

We consider the goal of this chapter at a general abstraction level. It is to guarantee availability of the services (radio coverage and connectivity) of a system (wireless mesh network) which is exposed to dynamic external behavior (the dynamic propagation environment). The environmental dynamics is an external factor to the wireless network. It results from the changing surroundings of the wireless network.

For this general type of problem, a well-known method exists in the field of dependable computing. This is the fault-tolerance approach [21]. Fault-tolerance avoids service failures in the presence of faults. Service failure, or failure, is the inability of a system to perform a service according to the service specification. Error is a part of the system state which may lead to a subsequent service failure. A fault is the cause for an error. The fault-tolerant system design includes fault model definition, error detection and system recovery. The fault model definition identifies a set of faults, for which service failures do not occur. The error detection identifies errors in the system, caused by the faults. The system recovery transforms a system with errors to a system without errors. The idea is to detect errors and perform system recovery before the errors lead to failures. In this way, the fault-tolerance approach avoids failures if faults from the fault model occur. In this chapter we apply the fault-tolerance approach for guaranteeing availability of radio coverage and connectivity of wireless mesh networks in dynamic propagation environments.

A fault in our system is the environmental dynamics. Environmental dynamics are changes of the radio attenuation properties of the environment (e.g. new obstacles, movement of obstacles, increased humidity). The attenuation describes the ability of the radio propagation environment to absorb and weaken the radio waves. An increased attenuation has a negative effect on radio coverage and connectivity. Regarding radio coverage, it reduces the radio signal strength at the service locations. This can lead to the fact that some service locations are not covered. The effect on connectivity is that some backbone links can be lost. This can disconnect the backbone network. If no measures are taken, the fault environmental dynamics can lead to service failures. A fault is the event of environmental dynamics which decreases the $ARSS$ (Average Radio Signal Strength) up to a user-specified amount $\Delta ARSS$.

Our system design uses redundancy for tolerating the faults. Figure shows the state machine of our fault-tolerant system. The figure shows the system states, their attributes and their entry actions. The initial state is the normal state. In addition to the correct service, the normal system state contains redundancy for compensating the faults at run-time. In this normal state the system performs concurrent error detection, meaning that the error detection takes place during the normal service delivery. In the error state the redundancy is lost due to a fault, but the service is correct because the initial redundancy has compensated the negative effects of the fault. In this state, the system performs system recovery. The system recovery restores the initial redundancy. In the following sections we will specify how we applied this concept to the services radio coverage and to connectivity. For each service we will define the correct service specification, the redundancy and the error. A failure for both services occurs when the service consumer (a mobile station) tries to use the service and the service is not correct. Our fault-tolerant system design avoids the failures.

### Correct service

Radio coverage is correct if every service is covered by at least one base station with a radio signal strength of at least $ARS{S}_{Min}$.

### Redundancy

In order to ensure correct radio coverage in case of faults, the normal system state uses radio signal strength redundancy. This means that every service location is covered by at least one base station with a radio signal strength of at least $ARS{S}_{RED}$. $ARS{S}_{RED}$ is the value of the redundant radio signal strength needed for compensating the environmental dynamics during the error detection and system recovery ($ARS{S}_{RED}=ARS{S}_{Min}+\Delta ARSS$).

### Error

In the error state, the radio coverage is not as good as the radio coverage in the normal state, but the radio coverage is still correct. An error exists, if at some service location the $ARSS$ is less than the redundancy value, but it exceeds the minimum threshold for correct coverage: $ARS{S}_{RED}>ARSS\ge ARS{S}_{Min}$.

### Correct service

Connectivity is correct if the backbone graph is connected.

### Redundancy

In order to ensure correct connectivity in case of faults, the backbone graph is biconnected (2-connected). A graph is biconnected if any two vertices can be joined by two independent paths [22]. This backbone redundancy compensates for the loss of a backbone link as a result of a fault.

### Error

In the error state, the backbone graph is not biconnected, but it is connected. The loss of biconnectivity can be caused by environmental dynamics leading to link loss. The loss of a link is not necessarily a connectivity error. It is an error only if it leads to loss of the biconnectivity.

### Figure 3.

The states of our fault-tolerant system

### 3.2. Error detection

When faults occur and lead to errors, the errors have to be automatically detected by the system. Since we are considering two services, radio coverage and connectivity, we need methods for detecting radio coverage errors and connectivity errors. Figure shows our methods for error detection and their integration in our fault-tolerant system design.

### Figure 4.

The error detection and system recovery of our fault-tolerant system

#### 3.2.1. Connectivity error detection

For detecting connectivity errors we use a monitoring at the routing layer and a classic biconnectivity testing algorithm from graph theory [22]. This algorithm uses information about the backbone graph and determines whether it is biconnected or not. If the graph is not biconnected, then there is an error. The required information for biconnectivity testing are the edges (links) among the vertices (base stations) of the graph. In our scenario, this information is globally available at the management appliance. As a part of the routing protocol, the base stations monitor the backbone link states by exchanging control messages with other base stations [23]. The state of every link is determined by two communication endpoints (base stations). One of them sends control messages and the other one determines the link state based on a statistic on the received messages. The link state information is periodically updated and communicated, so the management appliance has an actual global view of the backbone network. Based on this global view, the management appliance performs biconnectivity testing. The fact that every link state is determined by two communication endpoints enables us to detect connectivity errors by monitoring at the routing layer. If the backbone link state information is not available globally, distributed biconnectivity testing algorithms can be used (e.g. [24]).

#### 3.2.2. Radio coverage error detection

The information required for radio coverage error detection is the radio signal strength at every service location. However, a communication endpoint at every service location does not exist. Therefore, radio coverage errors can not be detected by monitoring, as with the connectivity errors. Nevertheless, a method for detecting these errors is needed because the environmental dynamics affect the radio coverage. The radio coverage should be guaranteed for every service location before a mobile station moves to those locations.

Our approach is to use a model-based assessment for detecting radio coverage errors at the physical layer. We use a radio propagation model for assessing the radio signal strength at every service location. This model has a tight relation to the propagation environment. We use measurements from the wireless network for calibrating the model to the reality.

In the state-of-the art assessment approaches the radio propagation models are static; meaning that they do not reflect the dynamics of the environment. The innovation of our approach is that the radio propagation model automatically calibrates to the real environment. Radio model calibration is the process of adjusting the model-parameters in such a way that the model reflects better a set of measurements from the actual propagation environment. Radio coverage assessment is the model-based estimation of the radio signal strength for the purpose of error detection. The radio model calibration method is out of scope of this chapter, but the reader can find a detailed description in [25], [26], [27].

### 3.3. System recovery

The system recovery transforms a system with errors to a system without errors. In our approach we use the same mechanism for recovery from radio coverage errors and for recovery from connectivity errors. This mechanism adds new base stations to the network. The new base stations improve the radio coverage by increasing the radio signal strength at the service locations. The new base stations also improve the connectivity by adding new links to the backbone network. Given a wireless mesh network with radio coverage and/or connectivity errors we have to decide how many base stations there is to install and and where to install them in order to correct the errors. For this purpose, we have developed an automatic base station planning algorithm (see section .

The error recovery includes automatic base station planning and manual reconfiguration (see figure ). The management appliance runs the base station planning algorithm and gives instructions to the operating staff for the reconfiguration. The operating staff performs the reconfiguration which restores the redundancy of the services.

## 4. Automatic base station planning

This section describes our algorithm for automatic base station planning. It starts with a problem definition for the base station planning, followed by an overview of our approach in section . The following sections define the details of the algorithm, namely the used link state model, the optimization approach and the graph consolidation approach. This algorithm is published in [28]; in addition this section describes the integration with the presented fault-tolerance framework.

### 4.1. Problem definition

The problem of the base station planning algorithm is to find a minimum number of base stations to be installed which transform a wireless mesh network with radio coverage errors and/or connectivity errors to a system without errors. The existing algorithms for this type of problem in wireless mesh networks are computationally intractable, or do not provide the required fault-tolerance (see section for a discussion). The following input information is given to the base station planning algorithm:

• Service location information. This is information about the service locations which have to be covered.

• Candidate sites information. This is information about possible locations of the base stations. The candidate sites and the service locations are specified by the deployment staff.

• Radio coverage information. This information is obtained from the radio propagation model. This is for every service location, the candidate sites which cover this service location, if base stations were installed at all candidate sites.

• Connectivity information: for every candidate site, the candidate sites which have a link in the backbone network, if base stations were installed at all candidate sites. For this purpose, we use our calibrated radio propagation model and a link state model (section ).

• The currently installed base stations and their positions

The base station planning algorithm has to determine the number and positions of base stations to be installed such that:

• The radio coverage and the connectivity enter the normal state. The normal state includes redundancy in the services which has been defined in section .

• The algorithm should provide an acceptable relation between base stations minimality and running time. The running time of the algorithm should be appropriate for error detection and system recovery in a dynamic propagation environment.

The challenge of the defined problem is the connectivity requirement. The coverage requirement can be formally defined as a local property which depends only on the considered entities (e.g. a base station covers a service location). For the connectivity, the requirement is global. It includes all network paths among all pair of base stations. The existence of a path between two base stations depends not only on the considered base stations, but on the number and positions of all other base stations in the network. The fault-tolerance (biconnectivity) requirement increases the complexity of the problem. It has been shown that finding a minimum number of base stations for this type of problematic is an NP-complete problem. For this reason, we are looking for an approach, having a good balance between minimality and running time.

### 4.2. Overview of the algorithm

Our idea is to perform an optimization, satisfying a simple local network property which significantly affects the fulfillment of the global property (biconnectivity). This local property is the minimum degree. For the backbone (multi-hop) network, the degree of a base station is the number of links to other base stations. The minimum degree of the network is the least degree among all base stations. In graph theory, the minimum degree is a necessary but not sufficient condition for k-connectivity [22]. This means that a k-connected graph has a minimum degree of $k$, but a graph with minimum degree of $k$ is not necessary k-connected. Formally, this rule applies to the backbone of wireless mesh networks. We consider both radio coverage and connectivity. The service locations are spread in some area (e.g. production hall). Hence, the probability that the necessary condition is also sufficient in mesh networks is significantly higher than the probability in graph theory. Therefore, our algorithm fulfills the local necessary condition and checks whether the global sufficient condition is also fulfilled. If not, the algorithm performs an incremental correction. The advantage of this approach is that it fulfills the connectivity requirement without increasing the complexity of the underlying optimization problem.

The algorithm operates in three steps: optimization, connectivity testing, and graph consolidation (figure ). The optimization step finds an optimal solution for the optimization criteria. The optimization criteria are the radio coverage requirement and the necessary condition for the connectivity (the local property min. degree). The optimization uses the radio propagation model and the link state model. The connectivity testing step tests the resulted graph for biconnectivity (the sufficient condition). If the sufficient condition is true, the algorithm finishes. Otherwise the algorithm performs a graph consolidation step. The consolidation step maps biconnected parts of the to a single vertex. After the consolidation, the algorithm continues with the optimization step which is done based on the consolidated graph. After a few (expected 1-3) iterations, the algorithm produces a solution that satisfies the coverage requirements.

### Figure 5.

Base station planning algorithm

#### Example

The optimization step has produced a graph with minimum degree 2 (figure A) according to the necessary condition. This graph does not satisfy the biconnectivity requirements (one edge and two vertices exist whose removal disconnect the graph). The consolidation step identifies two sub-graphs which are biconnected, and maps them to vertices (figure B). Note that after the consolidation, the minimum degree of the graph is 1. Then the optimization step places a new base station, such that the consolidated graph plus the new vertex result in a graph with minimum degree of 2 (figure C). Finally, the deconsolidated graph satisfies the biconnectivity requirements.

### Figure 6.

Example operation of the base station planning algorithm

### 4.3. Link state model

This section defines the used link model which models the link state based on the radio signal strength. The used link model in this chapter considers the operation of an ad-hoc routing protocol. We have shown in [23] that the communication in a mesh network is possible only if the links have some quality level.

The routing protocols determine the state of a link by analyzing the periodically received Hello packets from the neighbors. Depending on the mobility and the required stability of a link, different approaches for determining the link state at the routing layer exist [29], [30], [31]. What is common for all of them is the analysis of received Hello packets at the routing layer. The AWDS (Ad-hoc Wireless Distribution System) [32][23] routing software, for instance, identifies a link as existing if 10 consequent Hello packets in both directions are received correctly. A link is identified as non existing if 3 consequent Hello packets in either direction are not received.

The radio signal strength is one of the main factors which determine the reception of the packets at the receiver [3], [33]. This means that if the RSS is too low, then the wireless adapter can not decode the frame correctly. Therefore, to model the existence of a link, we use a threshold model based on ARSS. If the average radio signal strength exceeds the threshold ($ARSS\ge ARS{S}_{Min}$), then a link exists, otherwise a link does not exist. Remember that our fault-tolerance approach ensures that $ARSS\ge ARS{S}_{Min}+\Delta ARSS$.

There are other factors, influencing the packet loss and the link state (e.g. collision, radio interference). But the factor RSS is a necessary condition for successful frame decoding. In wireless mesh networks, it is one of the most influencing factors for the link state. This has been shown in our research in wireless mesh network routing [34], [35], [23], wireless network simulation and emulation [36]. Other researchers in our group are working on improving the link state model. They apply a data mining based approach for predicting the link state from various network monitoring information [30].

### 4.4. Optimization

#### 4.4.1. Minimization approach

Our algorithm uses a minimization approach based on binary search for finding the minimum number of base stations ($B{S}_{min}$) which satisfies the optimization criteria. It searches iteratively the interval between a lower bound $B{S}_{low}$ and an upper bound $B{S}_{up}$. At each iteration, the algorithm chooses the middle of the interval as a current value for $BS$ and determines whether a solution is possible by solving an optimization problem. If the solution satisfies the optimization criteria, then the algorithm decreases $BS$ by searching the lower half of the interval, otherwise it increases $BS$ by searching the upper half of the interval. Finally, the algorithm finds a minimum value for $BS$ which satisfies the optimization criteria.

#### 4.4.2. Optimization problem formulation

The optimization performed at each iteration can be defined by the following:

• Variables

The optimization variables are the positions of the base stations ${\left(X,Y,Z\right)}_{BS}$. We consider a typical multi-hop network, operating in a single frequency. Therefore, the frequency assignment is a constant for all base stations.

• Bounds

The variables have lower and upper bounds according to the candidate sites information, provided by the user. For instance, if the base stations are to be installed on the ceiling of a production hall with dimensions 200x300x6m, then the bounds are: $0\le X\le 200$, $0\le Y\le 300$, $Z=6$. For the currently installed base stations, the lower and upper bounds are equal to the base stations coordinates. In this way, they are considered in the solution, but are not relocated by the algorithm.

• Service locations

The service locations, defined by their coordinates, are stored in the set $SL$.

• Radio coverage model

From the values of the variables ${\left(X,Y,Z\right)}_{BS}$ the radio coverage model provides the radio coverage by the function $Model.RadioCoverage\left({\left(X,Y,Z\right)}_{BS}\right)$. The result is a vector. For every service location in the set $SL$, it contains the number of base stations that cover this service location. The calculation is based on the calibrated radio propagation model.

• Connectivity model: $Model.BSDegree\left({\left(X,Y,Z\right)}_{BS}\right)$. The result is a vector. For every base station, it contains the number of links to other base stations. The calculation is based on the calibrated radio propagation model and the link state model.

• Objective function

The objective function (Matlab pseudo code in algorithm ) influences the solution in a direction which satisfies the optimization criteria (the coverage requirements and the necessary condition for connectivity). In addition, the objective function maximizes the mean radio coverage degree and the mean backbone degree. The radio coverage degree is the number of base stations covering a service location. From the input coordinates, the radio coverage model and the link state model, the function calculates the radio coverage degree and the backbone degree. For base stations which have less than ${N}_{bb}=2$ links to other base stations, the function calculates the backbone shortfall. This is the sum of the differences between the required and the current degree over all base stations. The shortfall is weighted by a backbone penalty factor and subtracted by the objective function. The penalty factor is a relatively large number, compared to the mean values which influences the solution to a direction of a zero shortfall. The processing for the radio coverage links is similar. The objective function should be maximized.

Algorithm 1 Objective function of the optimization step

function Objective (X, Y, Z)

{

PenaltyCoverage = 50;

PenaltyConnectivity = 100;

Coverage = Model.RadioCoverage(X, Y, Z);

Connectivity = Model.BSDegree(X, Y, Z);

ShortfallCoverage = sum(Nlm -

Coverage(find(Coverage < Nlm)));

ShortfallConnectivity = sum(Nbb -

Connectivity(find(Connectivity < Nbb)));

Objective = mean(Coverage)

+ mean(Connectivity)

- PenaltyCoverage*ShortfallCoverage

- PenaltyConnectivity*ShortfallConnectivity;

}

#### 4.4.3. Optimization problem solving

In order to solve this optimization problem, we apply an optimization method. Specially for this problem is that the objective function can not be differentiated. This is because the objective function, can not be represented as an algebraic function of only the optimization parameters ${\left(X,Y,Z\right)}_{BS}$. This is because the objective function contains the radio coverage model which includes the geometry of the model. Several algorithms exist for solving this type of problem (pattern search, genetic algorithm, simulated annealing). We have selected pattern search, because it has a proven convergence and supports any type of constraints [37].

### 4.5. Connectivity testing

For k-connectivity testing in a graph with $n$ vertices, we use existing algorithms from the graph theory [22]. The complexity of this algorithm is $O\left(k*{n}^{3}\right)$, under the condition that $k<\sqrt{n}$ which is true in our case.

### 4.6. Graph consolidation

In this step, the algorithm finds sub-graphs satisfying the connectivity requirements and transforms each subgraph into a single vertex. The formal specification of the graph consolidation step is described by pseudo code in algorithm which is explained in the following list. Figure shows an example of the operation of the graph consolidation step.

• Given a graph $G$, identify all biconnected components ${G}_{c}$ containing at least 3 vertices and store them in a set $BC$. For finding biconnected components, existing graph theory algorithms are used.

• Identify the special articulation points which are articulation points shared between the biconnected components in the set $BC$. An articulation point is a vertex whose removal disconnects a graph. On figure B) vertices 1, 2 and 3 are articulation points. Vertex 1 is a special articulation point, since it is shared between two biconnected components of size of at least 3. For identifying biconnected components and articulation points existing graph algorithms are used [22].

• Every vertex which is either a special articulation point or other vertex, not belonging to a biconnected component in BC, is directly transformed into a vertex in the consolidated graph. The consolidated vertex inherits all edges of the original vertex.

• For every biconnected component in the set $BC$:

• If it contains special articulation points, then they are removed from the component.

• All vertices from the component are transformed into a single vertex in the consolidated graph.

• The consolidated vertex inherits all edges of the original vertices to other vertices in the graph. Other vertices are vertices not belonging to the same biconnected component.

• Duplicated edges in the consolidated graph are removed.

• $BC=find.biconnected.components\left(G,|{G}_{c}|\ge 3\right)$

• ${V}_{sap}=find.articulation.points\left(G,shared.among\left({G}_{c}\in BC\right)\right)$

• $foreach\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}v\in {V}_{sap}\cup \left(V\left(G\right)-V\left(BC\right)\right):$

• $v\to {v}^{{}^{\text{'}}}$

• $E\left({v}^{{}^{\text{'}}}\right)=E\left(v\right)$

• $foreach\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}\phantom{\rule{0.166667em}{0ex}}{G}_{c}\in BC:$

• ${G}_{c}={G}_{c}-{V}_{sap}$

• ${G}_{c}\to {v}^{{}^{\text{'}}}$

• $E\left({v}^{{}^{\text{'}}}\right)=ExternalEdges\left({G}_{c}\right)$

• $remove.duplicate.edges\left({v}^{{}^{\text{'}}}\right)$

### Figure 7.

Example of the graph consolidation step

## 5. Evaluation approach and implementation

We will present an evaluation of the base station planning algorithm according to the following evaluation criteria:

• Fault-tolerance: this shows the algorithm's ability to generate a network configuration that satisfies the fault-tolerance coverage requirements.

• Termination: this shows the number of iterations the algorithm needs to complete and the running time.

• Minimality: this shows the ability of the algorithm to use minimum number of base stations.

We performed a model-based evaluation of the algorithm. We generated different inputs to the algorithm, then executed the algorithm and observed the evaluation criteria. As an input of the algorithm, we used a service area with various sizes; typical for a production environment (see table for the parameter values). The service locations comprise of the entire floor. The candidate sites comprise of the entire ceiling. We also varied the attenuation of the propagation environment. For the radio connectivity model, we used the log-normal shadowing propagation model [38] which is used for radio coverage assessment. The path loss exponent has been fixed in these experiments. The shadowing factor ${X}_{\sigma }$ models the inhomogeneity of the propagation environment and it has been varied in these experiments. The other parameters of the propagation model are fixed. To determine the connectivity, we used our threshold-based link state model. The base station planning algorithm has been implemented in Matlab (about 600 lines of code). The algorithm has been tested on all the combinations of input parameters (area size and shadowing deviation) which make a total of 36 executions. At the end of each algorithm execution, we performed a requirements test. We tested whether the radio coverage and the connectivity were in normal (redundant) state.

 Parameter Values Transmit power ${P}_{tx}$ [dBm] 20 Required receive power ${P}_{min}$ [dBm] -78 Path loss exponent 3 Area size (X/Y) [meters] (50/50),(100/100),...,(300/300) Shadowing deviation $\sigma$ [dB] 5,6,7,8,9,10

#### Table 1.

Evaluation parameters

### 5.1. Results for fault-tolerance

With all the inputs, the algorithm has generated a network topology in which the radio coverage and the connectivity were in the normal (redundant) state, as defined in section . An example graph of the network topology, generated by the algorithm for area size 200/200m and shadowing deviation 8 is shown on figure . The related work algorithms [11], [12] generated topologies which are not fault-tolerant. Their topologies optimized the network throughput, but the backbone network war not biconnected (see figure 3 in [11], and figure 4 in [12]). Figure clearly shows the effect of the shadowing (inhomogeneous environment) on the base station planning. Because of the shadowing, some links are shorter than others and in some areas, more base stations are needed to provide coverage.

### Figure 8.

Example fault-tolerant (biconnected) topology produced by the algorithm

### 5.2. Results for termination, minimality and running time

Figure shows the measured termination property of the algorithm within the performed evaluation. The figure shows the cumulative termination, i.e. the percentage of the algorithm executions that have terminated up to some number of iterations. 30% of the algorithm executions generated a correct fault-tolerant solution directly after the first iteration. This means that in these cases, the graph consolidation step was not performed at all. These were the cases when the area sizes were smaller (50/50m and 100/100m). 80% of the algorithm executions generated a correct fault-tolerant topology after the second iteration. This means that only two optimizations and one graph consolidation were needed. The algorithm needed a maximum four iterations to complete all the inputs.

### Figure 9.

Algorithm termination: 80% of all algorithm executions terminated after 2 iterations. The algorithm needed a maximum of 4 iterations to complete.

### Figure 10.

Example network topology after the first algorithm iteration

90% of the base stations were selected at the first algorithm iteration. This means that 90% were selected according to the global optimization function and were optimally placed. The remaining 10% of the base stations were selected during the subsequent algorithm iterations in order to ensure the biconnectivity of the backbone. Figure shows the result after the first iteration for area size 150/150m and shadowing deviation 7. In the middle of the graph (around coordinates 65/44), a base station exists, whose removal would disconnect the network. In the next iteration the algorithm corrected this by inserting one base station in proximity of the first one (see figure ).

For the total 36 executions, the algorithm needed about 25 minutes to complete on a laptop with a dual core 2.5GHz processor and 3GB operating memory. This means that the average running time was 42 seconds. As a comparison, a related work algorithm in [12] needed 22 hours for a 58-node scenario because of the intractability of the approach. This means that for the purpose of the system recovery, our algorithm has an acceptable running time.

## 6. Conclusion

In this chapter, we developed a new approach for guaranteeing the availability of the services radio coverage and connectivity of Wireless Mesh Networks in dynamic propagation environments. Our approach is to apply fault-tolerance for avoiding service failures in the presence of environmental dynamics. Differing from the existing methods, we use reconfigurable redundancy of the services. As the radio propagation environment changes, our method changes the redundancy of services.

When the environmental dynamics is detected, the system recovery adds base stations to the network for restoring the redundancy of the services. But firstly, it has to be decided what the minimum number of base stations would be (and respectively their positions) which will restore the redundancy. For this purpose, we developed a new base station planning algorithm which takes the required decision and proposes reconfiguration instructions. Since the underlying optimization problem is NP complete, our algorithm is a trade-off between minimum base stations and minimum running time. The operating staff performs the network reconfiguration which restores the redundancy of the services.

In future work the presented concept will be integrated in a system for dependable end-to-end communication in wireless mesh networks. This system will incorporate other ongoing research works within our working group [29], [39] developing concepts for end-to-end quality of service guarantees (throughput, packet loss, latency) in Wireless Mesh Networks. Another aspect of our future work is to integrate the developed concepts in components for industrial wireless communication in cooperation with german product manufacturers.

## Acknowledgement

This work has been partially funded by the European Commission within the EU-project flexWARE, grant number 224359.

The project flexWARE (Flexible Wireless Automation in Real-Time Environments) develops a communication system for factory-wide wireless real-time control [40], [41], [42]. The methods, presented in this chapter, are used in flexWARE to achieve availability of the wireless medium by radio coverage monitoring and prediction and network engineering.

## References

1 - Ad-Hoc Wireless Distribution Systemn.d.cite:awds-web Ad-Hoc Wireless Distribution System (n.d.). http://awds.berlios.de/.
2 - Amaldi, E., Capone, A., Cesana, M., Filippini, I. & Malucelli, F. (2008). Optimization models and methods for planning wireless mesh networks, Elsevier Journal on Computer Networks 52(11): 2159–2171.
3 - Avizienis, A., Laprie, J.-C., Randell, B. & Landwehr, C. (2004). Basic Concepts and Taxonomy of Dependable and Secure Computing, IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 1: 11–33.
4 - Avresky, D. & Natchev, N. (2005). Dynamic reconfiguration in computer clusters with irregular topologies in the presence of multiple node and link failures, IEEE Transactions on Computers 54(5): 603–615.
5 - Bello, L. L. & Toscano, E. (2009). An Adaptive Approach to Topology Management in Large and Dense Real-Time Wireless Sensor Networks, IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 5(3): 314–324.
6 - Blough, D. M., Leoncini, M., Resta, G. & Santi, P. (2006). The k-neighbors approach to interference bounded and symmetric topology control in ad hoc networks, IEEE Transactions on Mobile Computing 5(9): 1267–1282.
7 - Bosio, S., Capone, A. & Cesana, M. (2007). Radio Planning of Wireless Local Area Networks, IEEE/ACM Transactions on Networking 15(6): 1414–1427.
8 - Chan, T. M., Man, K. F., Tang, K. S. & Kwong, S. (2007). A Jumping-Genes Paradigm for Optimizing Factory WLAN Network, IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 3: 33–43.
9 - Diestel, R. (2005). Graph Theory, Springer-Verlag, Heidelberg.
10 - Ekahau Site Survey – Wi-Fi Planning and Site Survey Tooln.d.EkahauSiteSurvey Ekahau Site Survey – Wi-Fi Planning and Site Survey Tool (n.d.). http://www. ekahau.com/products/ekahau-site-survey/overview.html, accessed 02.05.2012.
11 - ElMaraghy, H. A. (2009). Changeable and Reconfigurable Manufacturing Systems, Springer Series in Advanced Manufacturing.
12 - http://www.springer.com/engineering/production+eng/book/978-1-84882-066-1
13 - flexWARE - Flexible Wireless Automation in Real-Time Environments. Research project funded under the EU-FP7 programme.n.d.Flexware flexWARE - Flexible Wireless Automation in Real-Time Environments. Research project funded under the EU-FP7 programme. (n.d.). http://www.flexware.at/.
14 - Gaderer, G. & Trsek, H. (2010). flexWARE - Drahtlose Echtzeitkommunikation für die Fertigungsautomatisierung, Kommunikation in der Automation, KommA.
15 - Gungor, V., Lu, B. & Hancke, G. (2010). Opportunities and challenges of wireless sensor networks in smart grid, Industrial Electronics, IEEE Transactions on 57(10): 3557 –3564.
16 - Herms, A. (2009). Dienstg"ute in Wireless Mesh Networks, PhD thesis, Otto-von- Guericke-Universit"at.
17 - Herms, A., Ivanov, S. & Lukas, G. (2007). Precise admission control for bandwidth reservation in wireless mesh networks, Proceedings of 4th Intl. Conference on Mobile Ad-Hoc and Sensor Networks MASS'07, Pisa, Italy.
18 - Herms, A., Lukas, G. & Ivanov, S. (2006). Realism in design and evaluation of wireless routing protocols, in O. Spaniol (ed.), Proceedings of First international Workshop on Mobile Services and Personalized Environments (MSPE'06), Vol. P-102, Lecture Notes in Informatics (LNI), Aachen, Germany, pp. 57–70.
19 - http://ivs.cs.uni-magdeburg.de/EuK/forschung/publikationen/pdf/2006/awds-mspe.pdf
20 - Herms, A., Lukas, G. & Ivanov, S. (2007). Measurement-based detection of interfering neighbors for QoS in wireless mesh networks, 16th IST Mobile and Wireless Communications Summit 2007, Proceedings of. http://ivs.cs.uni-magdeburg.de/EuK/ forschung/publikationen/pdf/2007/interf-mobilesummit2007.pdf
21 - Hsu, C.-Y., Wu, J.-L. C., Wang, S.-T. & Hong, C.-Y. (2008). Survivable and delay-guaranteed backbone wireless mesh network design, Journal of Parallel and Distributed Computing 68(3): 306 – 320. Wireless Mesh Networks: Behavior, Artifacts and Solutions.
22 - http://www.sciencedirect.com/science/article/B6WKJ-4NRT39Y-2/2/65080a92e72ed991ef 6964c8430ddab1
23 - Ivanov, S. (2011). Fault-tolerant Radio Coverage and Connectivity in Wireless Mesh Networks, PhD thesis, University of Magdeburg.
24 - http://edoc2.bibliothek.uni-halle.de/hs/content/titleinfo/2030
25 - Ivanov, S., Herms, A. & Lukas, G. (2007). Experimental Validation of the NS-2 Wireless Model using Simulation, Emulation, and Real Network, Proceedings of the 4th Workshop on Mobile Ad-Hoc Networks (WMAN'07), in conjunction with the 15th ITG/GI - Fachtagung Kommunikation in Verteilten Systemen (KiVS'07), VDE Verlag, pp. 433 – 444. http:// ivs.cs.uni-magdeburg.de/EuK/forschung/publikationen/pdf/2007/wman07magdeburg.pdf
26 - Ivanov, S. & Nett, E. (2008). Fault-tolerant Coverage Planning in Wireless Networks, 27th IEEE International Symposium on Reliable Distributed Systems (SRDS 2008), 6-8 October, Napoli, Italy.
27 - Ivanov, S. & Nett, E. (to appear 2012). Localization-Based Radio Model Calibration for Fault-tolerant Wireless Mesh Networks, IEEE Transactions on Industrial Informatics .
28 - Ivanov, S., Nett, E. & Schemmer, S. (2007). Planning Available WLAN in Dynamic Production Environments, 7th IFAC International Conference on Fieldbuses and Networks in Industrial and Embedded Systems.
29 - Ivanov, S., Nett, E. & Schumann, R. (2010). Fault-tolerant Base Station Planning of Wireless Mesh Networks in Dynamic Industrial Environments, 15th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), Bilbao, Spain.
30 - Koren, Y. (2006). Reconfigurable Manufacturing Systems and Transformable Factories, Springer, chapter General RMS Characteristics. Comparison with Dedicated and Flexible Systems, pp. 27–45.
31 - Lin, B. & Ho, P.-H. (2009). Dimensioning and location planning of broadband wireless networks under multi-level cooperative relaying, IEEE Transactions on Wireless Communications 8(11): 5682–5691.
32 - Lindhorst, T. (2009). Schicht"ubergreifende fr"uherkennung von verbindungsausf"allen in drahtlosen mesh-netzwerken, in P. H. Wolfgang A. Halang (ed.), Software-intensive verteilte Echtzeitsysteme - Echtzeit 2009, Informatik aktuell, Fachtagung des GI/GMA - Fachausschusses Echtzeitsysteme, Springer, p. 67 ff.
33 - Lindhorst, T., Lukas, G. & Nett, E. (2010). Modeling fast link failure detection for dependable wireless mesh networks, IEEE International Symposium on Network Computing and Applications, IEEE.
34 - Lindhorst, T., Lukas, G., Nett, E. & Mock, M. (2010). Data-mining-based link failure detection for wireless mesh networks, IEEE International Symposium on Reliable Distributed Systems, IEEE.
35 - Lukas, G., Lindhorst, T. & Nett, E. (2011). Modeling medium utilization for admission control in industrial wireless mesh networks, IEEE International Symposium on Reliable Distributed Systems, IEEE.
36 - Mahrenholz, D. (2006). Providing QoS for Publish/Subscribe Communication in Dynamic Ad-hoc Networks, Doctoral dissertation, University of Magdeburg. online http://diglib.uni-magdeburg.de/Dissertationen/2006/danmahrenholz.pdf.
37 - MMathWorks (2010). Matlab Global Optimization Toolbox – User's Guide.
38 - Milic, B. (2009). Distributed Biconnectivity Testing in Wireless Multi-hop Networks, PhD thesis, Humboldt University – Berlin.
39 - Pathak, P. & Dutta, R. (2011). A survey of network design problems and joint design approaches in wireless mesh networks, Communications Surveys Tutorials, IEEE 13(3): 396 –428.
40 - Rappaport, T. S. (2002). Wireless Communications - Principles and Practice, Prentice Hall PTR.
41 - Ray, A. (2009). Planning and analysis tool for large scale deployment of wireless sensor network, International Journal of Next-Generation Networks (IJNGN) 1(1): 29–36.
42 - Sauter, T., Jasperneite, J. & Bello, L. L. (2009). Towards New Hybrid Networks for Industrial Automation, ETFA'09: Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation, IEEE Press, Piscataway, NJ, USA, pp. 1141–1148.
43 - So, A. & Liang, B. (2009). Optimal placement and channel assignment of relay stations in heterogeneous wireless mesh networks by modified bender's decomposition, Elsevier Journal on Ad Hoc Networks 7(1): 118–135.
44 - Toscano, E. & Bello, L. L. (2010). A novel approach for data forwarding in industrial wireless sensor networks, 15th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), Bilbao, Spain.
45 - Wang, B. (2010). Coverage Control in Sensor Networks, Springer London.
46 - Yackoski, J. & Shen, C.-C. (2006). Cross-layer inference-based fast link error recovery for manets, Wireless Communications and Networking Conference, Vol. 2, IEEE, pp. 715 – 722.