www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 2 Issue 2 Feb 2013 Page No.

288-292

Reduced Link Failures Through Autonomous Reconfiguration System For Wireless Mesh Networks
Jayanthi K, Venkatesh R.S, Subash C, Samynathan T Department of Electronics & Communication Engineering Pondicherry Engineering College Puducherry - 14

AbstractMulti-hop wireless mesh networks (WMNs) experience frequent link failures caused by channel interference, dynamic obstacles, and/or applications bandwidth demands. These failures cause severe performance degradation in WMNs or require expensive manual network management for their real-time recovery. This paper presents an autonomous network reconfiguration system (ARS) that enables a multi-radio WMN to autonomously recover from local link failures to preserve network performance using a simplified approach. By using channel and radio diversities in WMNs, ARS generates necessary changes in local radio and channel assignments in order to recover from failures. Next, based on the thus-generated configuration changes, the system co-operatively reconfigures network s e t t i n gs a mo n g local mesh routers. The performance of ARS has been tested in a simulation platform (NS2) and comparison analysis is also done with the existing AODV protocol. An Enhanced ARS mechanism which suffers lesser delay than ARS mechanism is proposed and tested in a simulation platform.

Index Terms Multi-radio wireless mesh networks(mrWMNs), self-reconfigurable networks, wireless link failures. I.INTRODUCTION Wireless networks provide unprecedented freedom and mobility for a growing number of laptop and PDA users who no longer need wires to stay connected with their workplace and the Internet. Ironically, the very devices that provide wireless service to these clients need lots of wiring themselves to connect to private networks and the Internet. This difficulty can be tackled using a viable alternative: WMN. A wireless mesh network (WMN) is a communications network made up of radio nodes organized in a mesh topology. Wireless mesh networks often consist of mesh clients like laptops, cell phones etc., mesh routers and gateways. The mesh routers forward traffic to and from the gateways which may but need not connect to the Internet. The coverage area of the radio nodes working as a single network is called a mesh cloud. Access to this mesh cloud is dependent on the radio nodes working in harmony with each other to create a radio network. A mesh network is reliable and offers redundancy. When one node can no longer operate, the rest of the nodes can still communicate with each other, directly or through one or more intermediate nodes.. Wireless mesh networks can be implemented with various wireless technology including 802.11, 802.15, 802.16, cellular technologies or combinations of more than one type. A wireless mesh network can be seen as a special type of wireless ad-hoc network. A wireless mesh network often has a more planned configuration, and may be deployed to provide dynamic and cost effective connectivity over a certain

geographic area. An ad-hoc network, on the other hand, is formed ad hoc when wireless devices come within communication range of each other. The mesh routers may be mobile, and be moved according to specific demands arising in the network. Often the mesh routers are not limited in terms of resources compared to other nodes in the network and thus can be exploited to perform more resource intensive functions. In this way, the wireless mesh network differs from an ad-hoc network, since these nodes are often constrained by resources.A WMN is dynamically self-organized and self-configured, with the nodes in the network automatically establishing and maintaining mesh connectivity among themselves. Mesh networks consist of multiple wireless devices equipped with COTS802.11 a/b/g cards that work in ad-hoc fashion 802.11 capable antennas placed on rooftops allow a large coverage area. II.EXISTING SYSTEM WIRELESS mesh networks (WMNs) are being developed actively and deployed widely for a variety of applications, such as public safety, environment monitoring, and citywide wireless Internet services. They have also been evolving in various forms (e.g., using multiradio/channel systems to meet the increasing capacity demands by the above-mentioned and other emerging applications. However, due to heterogeneous and fluctuating wireless link conditions, preserving the required performance of such WMNs is still a challenging problem. For example, some links of a WMN may experience significant channel interference from other coexisting wireless networks. Some parts of networks might not be able to meet increasing bandwidth demands from new

Jayanthi K International Journal Of Engineering And Computer Science 2:2 Feb 2013(287-292)

mobile users and applications. Links in a certain area (e.g., a hospital or police station) might not be able to use some frequency channels because of spectrum etiquette or regulation. Limitations of Existing Approaches Localized Reconfiguration: Network reconfiguration needs a planning algorithm that keeps necessary network changes (to recover from link failures) as local as possible, as opposed to changing the entire network settings. Existing channel assignment and scheduling algorithms provide holistic guidelines such as throughput bounds and proper scheduling for channel assignment during a network deployment stage. However, the algorithms do not consider the degree of configuration changes from previous network settings, and hence they often require global network changes to meet all the constraints. Even though these algorithms are suitable for static or periodic network planning, they may cause network service disruption, and thus are unsuitable for dynamic network reconfiguration that has to deal with frequent local link failures. Next, the greedy channel-assignment algorithm, which considers only local areas in channel assignments, might do better in reducing the scope of network changes than the above-mentioned assignment algorithms. However, this approach still suffers from the ripple effect, in which one local change triggers the change of additional network settings at neighbouring nodes (e.g., nodes using channel 3 in Fig. 2) due to association dependency among neighbouring radios. This undesired effect might be avoided by transforming a mesh topology into a tree topology, but this transformation reduces network connectivity as well as path diversity among mesh nodes. Finally, interference-aware channel-assignment algorithms can minimize interference by assigning orthogonal channels as closely as possible geographically. While this approach can improve overall network capacity by using additional channels, the algorithm could further improve its flexibility by considering both radio diversity (i.e., link association) and local traffic information. III. PROPOSED SYSTEM This paper attempts to suggest for an autonomous network reconfiguration system (ARS) that enables a multiradio WMN to autonomously recover from wireless link failures. ARS generates an effective reconfiguration plan that requires only local network configuration changes by exploiting channel, radio, and path diversity. Furthermore, ARS effectively identifies reconfiguration plans that satisfy applications QoS constraints, admitting up to two times more flows than static assignment, through QoS aware planning. Next, ARSs online reconfigurability allows for real-time failure detection and network reconfiguration, thus improving channel efficiency by 92%. Experimental evaluation on a Linux-based implementation and ns2-based simulation demonstrates the effectiveness of

ARS in recovering from local link-failures and in satisfying applications diverse QoS demands. The functionality of the proposed system can be explained under various sections: 1.Route discovery 2.Link Failure Detection 3.Route Recovery 4.Reconfiguration System 1.ROUTE DISCOVERY Route Discovery is used whenever a source node desires a route to a destination node. First, the source node looks up its route cache to determine if it already contains a route to the destination. If the source finds a valid route to the destination, it uses this route to send its data packets. If the node does not have a valid route to the destination, it initiates the route discovery process by broadcasting a route request message. The route request message contains the address of the source and the destination, and a unique identification number. An intermediate node that receives a route request message searches its route cache for a route to the destination. If no route is found, it appends its address to the route record of the message and forwards the message to its neighbors. The message propagates through the network until it reaches either the destination or an intermediate node with a route to the destination. Then a route reply message, containing the proper hop sequence for reaching the destination, is generated and unicast back to the source node. 2.LINK FAILURE DETECTION: Three types of failures: Self failure Path failure Sink failure In self failure, the node itself has failed due to a crash, re-boot, bug in software code, or connectivity issue. In path failure, a node along the path fails, causing other nodes to fail or there are collisions along the path. In sink (i.e., base station) failure, the whole network appears to be failing when it is the sink that has failed. Failure at the sink may be due to bad sink placement, changes in the environment after deployment, and connectivity issues. Automated link failure and Interference Detection Avoidance (AIDA) module determines when it is advantageous to change channels for any AP or backhaul radio that experiences high levels of RF interference. The AIDA module monitors all channels, including unused channels, in order to perform this service. 3.Route recovery Route recovery scheme in ad hoc networks is to reduce the time delay and control overhead in the route recovery process.Maintaining connectivity with the sink node is a crucial issue to collect data from sensors without any interruption. While sensors are typically deployed in abundance to tolerate possible node failures, a large

Page

288

Jayanthi K International Journal Of Engineering And Computer Science 2:2 Feb 2013(287-292)

number of such failures within the same region simultaneously may result in losing the connectivity with the sink node which eventually reduces the quality and efficiency of the network operation.The idea of this distributed heuristic is based on maintaining the route information at each node to the sink and then utilizing such information for the relocation of the sensors.Route recovery scheme to solve the link failure problem caused by node movement, packet collision or bad channel condition. Since it considers a backup node mobility and conduct route recovery implicitly, it can support fast route recovery and then provide reliable and stable route for routing protocol.Routes need not be included in packet headers Nodes maintain routing tables containing entries only for routes that are in active use At most one next-hop per destination maintained at each node. DSR may maintain several routes for a single destination. Sequence numbers are used to avoid old/broken routes. Sequence numbers prevent formation of routing loops. 4.AUTONOMOUS RECONFIGURATION SYSTEM: A reconfiguration plan is defined as a set of links configuration changes necessary for a network to recover from a link failure on a channel, and there are usually multiple reconfiguration plans for each link failure. ARS systematically generates reconfiguration plans that localize network changes by dividing the reconfiguration planning into three processesfeasibility, QoS satisfiability, and optimalityand applying different levels of constraints. ARS first applies connectivity constraints to generate a set of feasible reconfiguration plans that enumerate feasible channel, link, and route changes around the faulty areas, given connectivity and link-failure constraints. Then, within the set, ARS applies strict constraints (i.e., QoS and network utilization) to identify a reconfiguration plan that satisfies the QoS demands and that improves network utilization most. IV.ARS ARCHITECTURE

QoS of link MN but cause to exceed 1.0, resulting in cascaded QoS failures of links beyond node O. The following are the various steps involved in ARS. A. Localized reconfiguration: Based on multiple channels and radio associations available, ARS generates reconfiguration plans that allow for changes of network configurations only in the vicinity where link failures occurred while retaining configurations in areas remote from failure locations. B. QoS-aware planning: ARS effectively identifies QoS-satisfiable reconfiguration plans by estimating the QoS satisfaction of generated reconfiguration plans and deriving their expected benefits in channel utilization. C.Autonomous reconfiguration via link-quality monitoring: ARS accurately monitors the quality4 of links of each node in a distributed manner. Furthermore, based on the measurements and given links QoS constraints, ARS detects local link failures and autonomously initiates network reconfiguration. D. Cross-layer interaction: ARS actively interacts across the network and link layers for planning. This interaction enables ARS to include a rerouting for reconfiguration planning in addition to link-layer reconfiguration. ARS can also maintain connectivity during recovery period with the help of a routing protocol. Algorithm describes the operation of ARS. First, ARS in every mesh node monitors the quality of its outgoing wireless links at every (e.g., 10 s) and reports the results to a gateway via a management message. Second, once it detects a link failure(s), ARS in the detector node(s) triggers the formation of a group among local mesh routers that use a faulty channel, and one of the group members is elected as a leader using the well-known bully algorithm [29] for coordinating the reconfiguration. Third, the leader node sends a planning-request message to a gateway. Then, the gateway synchronizes the planning requestsif there are multiple requestsand generates a reconfiguration plan for the request. Fourth, the gateway sends a reconfiguration plan to the leader node and the group members. Finally, all nodes in the group execute the corresponding configuration changes, if any, and resolve the group. We assume that during the formation and reconfiguration, all messages are reliably delivered via a routing protocol and per-hop retransmission timer. E. Planning for Localized Network Reconfiguration: The core function of ARS is to systematically generate localized reconfiguration plans. A reconfiguration plan is defined as a set of links configuration changes (e.g., channel switch, link association) necessary for a network to recover from a link(s) failure on a channel, and

Fig. 1 Mesh Nodes

Page

Let us consider an example in Fig. 1. Assuming BAR of each directed link is 0.2 in a tuned channel, of each radio tuned to channel 1 does not exceed 1.0, satisfying each links QoS requirement. In addition, assuming that increases from 0.2 to 0.4 in Fig. 1. To accommodate this increase, reconfiguration plans that have a detour path through node Q do not affect the QoS-satisfication of the neighbouring nodes. On the other hand, plans with radio switches satisfy the

289

Jayanthi K International Journal Of Engineering And Computer Science 2:2 Feb 2013(287-292)

there are usually multiple reconfiguration plans for each link failure. Existing channel-assignment and scheduling algorithms seek optimal solutions by considering tight QoS constraints on all links, thus requiring a large configuration space to be searched and hence making the planning often an NP-complete problem . In addition, change in a links requirement may lead to completely different network configurations. By contrast, ARS systematically generates reconfiguration plans that localize network changes by dividing the reconfiguration planning into three processesfeasibility, QoS satisfaction, and optimalityand applying different levels of constraints. ARS first applies connectivity constraints to generate a set of feasible reconfiguration plans that enumerate feasible channel, link, and route changes around the faulty areas, given connectivity and link-failure constraints. Then, within the set, ARS applies strict constraints (i.e., QoS and network utilization) to identify a reconfiguration plan that satisfies the QoS demands and that improves network utilization most. F.Feasible Plan Generation: Generating feasible plans is essentially to search all legitimate changes in links configurations and their combinations around the faulty area. Given multiple radios, channels, and routes, ARS identifies feasible changes that help avoid a local link failure but maintain existing network connectivity as much as possible. G. Maintaining network connectivity and utilization: While avoiding the use of the faulty channel, ARS needs to maintain connectivity with the full utilization of radio resources. Because each radio can associate itself with multiple neighbouring nodes, a change in one link triggers other neighbouring links to change their settings. To coordinate such propagation, ARS takes a two-step approach. ARS first generates feasible changes of each link using the primitives, and then combines a set of feasible changes that enable a network to maintain its own connectivity. Furthermore, for the combination, ARS maximizes the usage of network resources by making each radio of a mesh node associate itself with at least one link and by avoiding the use of same (redundant) channel among radios in one node. H.Controlling the scope of reconfiguration changes: ARS has to limit network changes as local as possible, but at the same time it needs to find a locally optimal solution by considering more network changes or scope. To make this tradeoff, ARS uses a -hop reconfiguration parameter. Starting from a faulty link(s), ARS considers link changes within the first hops and generates feasible plans. If ARS cannot find a local solution, it increases the number of hops so that ARS may explore a broad range of link changes. Thus, the total number of reconfiguration changes is determined on the basis of existing configurations around the faulty area as well as the value.

I. Per-link bandwidth estimation: For each feasible plan, ARS has to check whether each links configuration change satisfies its bandwidth requirement, so it must estimate link bandwidth. To estimate link bandwidth, ARS accurately measures each links capacity and its available channel airtime. In multihop wireless networks equipped with a CSMA-like MAC, each links achievable bandwidth (or throughput) can be affected by both link capacity and activities of other links that share the channel airtime. Even though numerous bandwidth-estimation techniques have been proposed, they focus on the average bandwidth of each node in a network or the end-to-end throughput of flows , which cannot be used to calculate the impact of per-link configuration changes. By contrast, ARS estimates an individual links capacity based on measured (or cached) link-quality informationpacket-delivery ratio and data-transmission rate measured by passively monitoring the transmissions of data or probing packets and the formula derived in the Appendix. Here, we assume that ARS is assumed to cache link-quality information for other channels and use the cached information to generate reconfiguration plans. If the information becomes obsolete, ARS detects link failures and triggers another reconfiguration to find QoS-satisfiable planslazy monitoring. J.Examining per-link bandwidth satisfiability: Given measured bandwidth and bandwidth requirements, ARS has to check if the new link change(s) satisfies QoS requirements. ARS defines and uses the expected busy airtime ratio of each link to check the links QoS satisfiability. Assuming that a links bandwidth requirement is given, the links busy airtime ratio (BAR) can be defined as and must not exceed 1.0 (i.e., ) for a link to satisfy its bandwidth requirement. If multiple links share the airtime of one channel, ARS calculates aggregate BAR of end-radios of a link, which is defined as , where is a radio ID, a link associated with radio , and the set of directed links within and across radio s transmission range. K.Breaking a tie among multiple plans: Multiple reconfiguration plans can have the same benefit, and ARS needs to break a tie among them. ARS uses the number of link changes that each plan requires to break a tie. Although link configuration changes incur a small amount of flow disruption (e.g., in the order of 10 ms), the less changes in link configuration, the less network disruption.

L.Complexity of ARS Thanks to its distributed and localized design, ARS incurs reasonable bandwidth and computation overheads. First, the network monitoring part in the reconfiguration protocols is made highly efficient by exploiting existing data traffic and consumes less than 12 kb/s probing bandwidth (i.e., one packet per second) for each radio. In addition, the group formation

Page

290

Jayanthi K International Journal Of Engineering And Computer Science 2:2 Feb 2013(287-292)

requires only message overhead (in forming a spanning tree), where n is the number of nodes in the group. Next, the computational overhead in ARS mainly stems from the planning algorithms. Specifically, generating its possible link plans incurs complexity, where n is the number of available channels and m the number of radios. Next, a gateway node needs to generate and evaluate feasible plans, which incurs search overhead in a constraint graph that consists of nodes, where is the number of links that use a faulty channel in the group. V. ALGORITHM

Fig. 2 ARS Packets Transmitted

Monitoring period 1: For every link j do 2:Measure link quality using passive monitoring 3: End for 4: Send monitoring results to gateway g Failure detection and group formation period 5:if link violates link requirements then 6: request a group formation on channel of link ; 7: end if 8: participate in a leader election if a request is received Planning period 9: if node is elected as a leader then 10: send a planning request message to a gateway; 11: else if node is a gateway then 12:synchronize requests from reconfiguration groups 13:generate a reconfiguration plan for ; 14: send a reconfiguration plan to a leader of ; 15: End if Reconfiguration period 16: if includes changes of node then 17: apply the changes to links 18: end if 19: relay it to neighboring members, if any
VI.SIMULATION RESULTS

Fig. 3 ARS Packets Received

Fig. 4 ARS Efficiency Fig. 5 AODV Efficiency

VII. SIMULATION PARAMETERS AND DISCUSSION The simulation is run deploying 25 WMN nodes. The data rate assumed is 2 Mbps. Size of each packet is 1024 bytes. Frequency of operation is 2.4 Ghz to 5 Ghz as prescribed for 802.11s wireless mesh military standard. Fig. 2 shows the number of packets transmitted in ARS. Fig. 3 shows the number of packets received in ARS. Fig. 4 is the efficiency graph of ARS. Fig.5 is the efficiency graph of existing AODV. On comparing fig. 4 and fig. 5 we see that maximum efficiency of AODV is around 70% whereas ARS reaches a maximum efficiency of about 95%. ARS achieves such high efficiency by making use of a modified version of AODV, namely AODV-HM. As AODV is strictly for ad-hoc networks and

Page

291

Jayanthi K International Journal Of Engineering And Computer Science 2:2 Feb 2013(287-292)

since WMNs are hybrid networks, we use AODV-HM. This new algorithm makes efficient use of the infrastructure based part of the network to improve on the efficiency. Hence ARS is a good link recovery mechanism for WMNs. VIII.ENHANCED ARS Though ARS is efficient in terms of throughput, it suffers a high delay due to an in-efficient leader election mechanism. In other words the Bully Leader Election algorithm consumes a lot of time due to the more number of signalling involved as shown in the below figure. Fig. 7 Comparison between ARS and EARS The simulation results clearly show that the enhanced ARS which uses an efficient leader election algorithm suffers lesser delay than the original ARS which used bully algorithm, due to the reduced number of signalling involved in it. IX.CONCLUSION An autonomous network reconfiguration system (ARS) that enables a multi-radio WMN to autonomously recover from wireless link failures has been proposed. Furthermore, ARS effectively identifies reconfiguration plans that satisfy applications QoS constraints, admitting up to two times more flows than static assignment, through QoS aware planning. Next, ARSs online reconfiguration facility allows for real-time failure detection and network reconfiguration. ARS also improves channel efficiency by more than 90% over the other recovery methods. ARS is compared with already existing popular AODV algorithm and is found to surpass it significantly. Finally an enhanced ARS with reduced delay is proposed and tested. X.REFERENCES [1] Kyu-Han Kim and Kang G. Shin,Self-Reconfigurable Wireless Mesh Networks, IEEE/ACM Transactions on Networking, vol. 19, no. 2, April 2011. [2] I. Akyildiz, X. Wang, and W. Wang, Wireless mesh networks: A survey, Computer Networking., vol. 47, no. 4, pp. 445487, Mar. 2005. [3] Anand Prabhu Subramanian,Himanshu Gupta, Samir R. Das and Jing Cao, Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks, IEEE Transactions on mobile computing, vol. 7,no. 12, December 2008. [4] J. Tang, G. Xue, and W. Zhang, Interference-Aware Topology Control and QoS Routing in Multi-Channel Wireless Mesh Networks, Proc. ACM MobiHoc, 2005. [5] Che-Cheng Chang and Jichiang Tsai, An Efficient Leader Election Algorithm of Performance-Related Characteristics for Dynamic Networks, 2012 International Conference on Smart Grid Systems, IPCSIT vol.45, IACSIT Press, Singapore, 2012.

Fig. 6 Bully Leader Election Algorithm When a coordinator node fails, the node which is associated with the ongoing process will find leader failure. Then it will send election signal to all nodes in vicinity. All the alive nodes will reply with ok signal. Then election is done based on priority and the new leader is elected. The new leader beacons the coordinator signal to all the other nodes. As you can see more number of signalling increases the delay. Instead of following the above procedure , the node involved can directly send the election signal to the top priority node in the local network based on the QOS results already available in the ARS module of the gateway. Hence the unnecessary signalling can be reduced and the delay is substantially reduced. This new procedure of leader election [5] is implemented and the simulation is repeated under the same network conditions.

Page

292