A SEMINAR ON Cluster Based Energy Efficient Lifetime Improvement Mechanism for WSN with Multiple Mobile Sink and

Single Static Sink

SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENT FOR THE AWARD OF DEGREE OF MASTER OF TECHNOLOGY IN ELECTRONICS AND COMMUNICATION (WIRELESS COMMUNICATION ENGINEERING) SUBMITTED BY ANSHUMAN PUSHP 13MTECEWCE009 Submitted to DR. RAJEEV PAULUS Department of Electronics and Communication Engineering Sam Higginbottom Institute of Agriculture, Technology and Sciences (Deemed-to-be-University) Allahabad

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING SHEPHERD SCHOOL OF ENGINEERING AND TECHNOLOGY SAM HIGGINBOTTOM INSTITUTE OF AGRICULTURE, TECHNOLOGY AND SCIENCES (DEEMED TO BE-UNIVERSITY) ALLAHABAD- 211007, (U.P) INDIA. Year 2014

CONTENTS Title Acknowledgement Abstract Contents List of abbreviations Publications vii-ix x Page No i ii

CHAPTER I 1.1 1.2 1.3 Background Motivation Objectives

INTRODUCTION

1-3 2 3

CHAPTER II CHAPTER III References

REVIEW OF LITERATURE CONCLUSION

4-11 12

List of Abbreviation
HWMP AODV CH DCA DSR EEDT IEEE MAC MANET NS QoS WSN LAN WLAN ETX WMN WCETT SHWMP CSMA/CA ETT Hybrid Wireless Mesh Protocol Adhoc on demand distance vector routing Cluster head. Distributive clustering algorithm. Dynamic source routing. Energy efficient data transmission Institute of Electrical & Electronics Engineers Medium access control. Mobile adhoc network. Network simulator. Quality of Service. Wireless sensor network. Local Area Network Wireless Local Area Network Expected Transmission Count Wireless Mesh Network Weighted Cumulative ETT Secure Hybrid Wireless Mesh Protocol Carrier sense multiple access with collision avoidance Expected Transmission Time ii

NIC PHY DSDV MR-LQSR

Network Interface Card Physical Destination Sequenced Distance Vector Multi-Radio Link-Quality Source Routing

iii

CHAPTER 1

Chapter One INTRODUCTION

1.1 Background
Wireless Mesh Networks (WMNs) started as a Study Group of IEEE 802.11 in September 2003 , and continues to be advanced with various amendments. It has recently got broad market in ubiquitous wireless access, due to its flexibility, reliability and robust services in supporting multimedia applications. WMNs can be categorized into three main groups, based on their architectures: infrastructure WMNs, client WMNs and hybrid WMNs, wherein hybrid WMNs are the most broadly used. A hybrid mesh architecture is the combination of infrastructure and client meshing. It typically comprises a number of powerful and static mesh routers, which form the mesh backbone automatically with high-speed and multi-hop communications. Motivated by these selfconfiguring routers, WMNs can expand their coverage with mesh clients arbitrarily added, such as laptops, PDAs and Wi-Fi IP phones. With the gateway functionalities in mesh routers, WMNs can be connected with other networks conveniently, such as the Ethernet, sensor networks, wireless-fidelity (Wi-Fi), worldwide inter-operability for microwave access (WiMAX) and WiMedia networks . WMN is a layer 2 network combined with Carrier sense multiple access with collision avoidance (CSMA/CA). Mesh routers select paths and forward data frames with MAC address routing mechanisms, which can reduce the power consumption and provide high speed and small latency deliveries . Recently, some routing protocols are proposed for WMNs, which can be categorized as hop-count based routing, QoS routing, reliability-aware routing and cross-layer multichannel routing, such as HEAT , LQSR and JMM. There are several existing routing metrics for mesh networks, such as hop count, ETX, ETT, WCETT, etc. Hop count is an extensively used routing metric, but the proposal dedicated to find a shortest path between source and destination is not suitable for the variable wireless links, which can be easily affected by the fading, noise, interference, and even the limited energy of the nodes. Expected Transmission Count (ETX) means the expected number of MAC layer transmissions, which is needed for successfully delivering a packet through a wireless link . It captures the effect of packet loss ratios and path length, but does not consider interference and the different transmission rates. Expected Transmission Time (ETT) improves ETX by considering the differences in link transmission rates. Weighted Cumulative ETT (WCETT) captures the intra-flow interference based on ETT . Both ETT and WCETT do not consider the efforts of traffic load. There are also other existing metrics which are focus on the interferences between the links, such as INX. The IEEE Standard 802.11s defines the default metric as airtime link metric in Hybrid Wireless Mesh Protocol (HWMP) . It takes into account the channel access overhead, protocol overhead, the transmitting rate and frame error rate, so it can obtain detailed channel

information from both PHY and MAC layers. Although airtime metric can catch the link quality, it typically suffers from several shortcomings, such as ignoring the influence of traffic flow and inefficient usage of the shared wireless resources. These shortcomings can finally degrade the system performance.

In this research, a novel scheme has been proposed as HWMP+, which estimates the link quality in corporation with traffic flow information and allocates the network resources in an efficient way. The metric computation scheme is operated in a smoothed mode, which has both historical and real-time perspectives of the link quality and is sensitive to the link quality variations in a dynamic environment. Except considering the traffic flow information during the link metric computation, we continue to modify the metric selection strategy during the routing process. These improvements are prone to allocate the limited channel resources for the high load links and finally increase the network throughput.

1.3 Objective
To study and evaluate the performance of Cluster Based Energy Efficient Lifetime Improvement Mechanism for WSN with Multiple Mobile Sink and Single Static Sink

CHAPTER 2

CHAPTER TWO LITERATURE REVIEW

Romer et al. (2004), presents a detailed study on recent, wireless sensor networks have found their way into a wide variety of applications and systems with vastly varying requirements and characteristics. As a con- sequence, it is becoming increasingly difficult to discuss typical requirements regarding hardware issues and soft- ware support. This is particularly problematic in a multi- disciplinary research area such as wireless sensor networks, where close collaboration between users, application do- main experts, hardware designers, and software developers is needed to implement efficient systems. In this paper we discuss the consequences of this fact with regard to the de- sign space of wireless sensor networks by considering its various dimensions. We justify our view by demonstrating that specific existing applications occupy different points in the design space. In April 2004, the authors organized a workshop, funded by the European Science Foundation (ESF), with a view to carrying out coordinated research into wireless sensor networks in Europe [18]. 24 experts from 11 European countries including academic researchers and representatives from industry were invited to discuss application areas with particular relevance for Europe as well as various aspects of the hardware and software architectures required to support these applications. Some of the more concrete questions discussed at the workshop were: Which prospective application domains and concrete applications are of particular value to Europe? What are the requirements and challenges involved in implementing these applications? What hardware requirements are needed to support these applications? Are existing systems sufficient, or is there a gap that needs additional research and development? This work was partly supported by NCCR-MICS, a center supported by the Swiss National Science Foundation under grant no. 5005-67322. To appear in IEEE Wireless Communications, Dec. 2004. What type of software is needed (e.g., operating systems, programming abstractions, tools) to support these applications and what requirements have to be met? How can we better coordinate the mostly isolated and disconnected research activities on sensor networks across Europe?

During the discussions it was observed that wireless sensor networks have found their way into a wide variety of applications and systems with vastly varying requirements and characteristics, and hence it was very difficult to discuss specific application requirements, research directions, and challenges. In the past, a number of early, mostly US- based research projects established a de facto definition of a wireless sensor network as a large-scale ad hoc, multi- hop, unpartitioned network of largely homogeneous, tiny, resource-constrained, mostly immobile sensor nodes that would be randomly deployed in the area of interest. While this characterization is certainly valid for a large class of applications (in particular from the military domain), an in- creasing number of sensor-network applications cannot be adequately characterized in this way. As a result of this observation, it was suggested that the sensor network design space and its various dimensions should be characterized. Such an explicit design space might not only prove helpful as a framework for discussing and structuring coordinated research (e.g., analyzing mutual dependencies between applications, software, and hardware; avoiding duplicate work), but might also provide a conceptual basis for the development of flexible software frameworks that can be adapted to meet different application needs. This paper is a partial answer to the questions raised during the above-mentioned workshop. We make an attempt to specify important dimensions of the sensor network design space and we justify our findings by showing that existing sensor network applications occupy different points in the design space. We build on earlier work [16] that classified system models of sensor networks with respect to communication protocols but did not consider the diverse nature of concrete applications.

Akyildiz et al.(2002), Wireless sensor networks: a survey I.F. Akyildiz, W. Su*, Y. Sankarasubramaniam, E. Cayirci Broadband and Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA Received 12 December 2001; accepted 20 December 2001 Abstract This paper describes the concept of sensor networks which has been made viable by the convergence of micro- electromechanical systems technology, wireless communications and digital electronics. First, the sensing tasks and the potential sensor networks applications are explored, and a review of factors

influencing the design of sensor networks is provided. Then, the communication architecture for sensor networks is outlined, and the algorithms and protocols developed for each layer in the literature are explored. Open research issues for the realization of sensor networks are also discussed. ? 2002 Published by Elsevier Science B.V. Keywords: Wireless sensor networks; Ad hoc networks; Application layer; Transport layer; Networking layer; Routing; Data link layer; Medium access control; Error control; Physical layer; Power aware protocols 1. Introduction Recent advances in micro-electro-mechanical systems (MEMS) technology, wireless communications, and digital electronics have enabled the development of low-cost, low-power, multifunctional sensor nodes that are small in size and communicate untethered in short distances. These tiny sensor nodes, which consist of sensing, data processing, and communicating components, leverage the idea of sensor networks based on collaborative effort of a large number of nodes. Sensor networks represent a significant improvement over traditional sensors, which are deployed in the following two ways [39]: Sensors can be positioned far from the actual phenomenon, i.e., something known by sense perception. In this approach, large sensors that use some complex techniques to distinguish the targets from environmental noise are required. Several sensors that perform only sensing can be deployed. The positions of the sensors and communications topology are carefully engineered. They transmit time series of the sensed phenomenon to the central nodes where computations are performed and data are fused. A sensor network is composed of a large number of sensor nodes, which are densely deployed either inside the phenomenon or very close to it. Anastasi et al. (May,2009), In the last years, wireless sensor networks (WSNs) have gained
increasing attention from both the research community and actual users. As sensor nodes are generally battery-powered devices, the critical aspects to face concern how to reduce the energy consumption of nodes, so that the network lifetime can be extended to reasonable times. In this paper we rst break down the energy consumption for the components of a typical sensor node, and discuss the main directions to energy conservation in WSNs. Then, we present a systematic and comprehensive taxonomy of the energy conservation schemes, which are subsequently discussed in depth. Special attention has been devoted to promising solutions which have not yet obtained a wide attention in the literature, such as techniques for energy efcient data acquisition. Finally we conclude the paper with insights for research directions about energy conservation in WSNs. A wireless sensor network consists of sensor nodes deployed over a geographical area for monitoring physical phenomena like temperature, humidity, vibrations, seismic events, and so on [5]. Typically, a sensor node is a tiny device that includes three basic components: a sensing Subsystem for data acquisition from the physical surrounding environment, a processing subsystem for local data processing and storage, and a wireless communication subsystem for data transmission. In addition,

a power source supplies the energy needed by the device to perform the programmed task. This power source often consists of a battery with a limited energy budget. In addition, it could be impossible or inconvenient to recharge the battery, because nodes may be deployed in a hostile or unpractical environment. On the other hand, the sensor network should have a lifetime long enough to fulll the application requirements. In many cases a lifetime in the order of several months, or even years, may be required. Therefore, the crucial question is: how to prolong the network lifetime to such a long time? In some cases it is possible to scavenge energy from the external environment [59] (e.g., by using solar cells as power source). However, external power supply sources often exhibit a non-continuous behavior so that an energy buffer (a battery) is needed as well. In any case, energy is a very critical resource and must be used very sparingly. Therefore, energy conservation is a key issue in the design of systems based on wireless sensor networks. In this paper we will refer mainly to the sensor network model depicted in Fig. 1 and consisting of one sink node (or base station) and a (large) number of sensor nodes deployed over a large geographic area (sensing eld). Data are transferred from sensor nodes to the sink through a multihop communication paradigm [5]. We will consider rst the case in which both the sink and the sensor nodes are static (static sensor network). Then, we will also discuss energy conservation schemes for sensor networks with mobile elements in Section 6, in which a sparse sensor network architecture where continuous end-to-end paths between sensor nodes and the sink might not be available will be accounted as well. Experimental measurements have shown that generally data transmission is very expensive in terms of energy consumption, while data processing consumes signicantly less [108]. The energy cost of transmitting a single bit of information is approximately the same as that needed for processing a thousand operations in a typical sensor node [103]. The energy consumption of the sensing subsystem depends on the specic sensor type. In many cases it is negligible with respect to the energy consumed by the processing and, above all, the communication subsystems. In other cases, the energy expenditure for data sensing may be comparable to, or even greater than, the energy needed for data transmission. In general, energy-saving techniques focus on two subsystems: the networking subsystem (i.e., energy management is taken into account in the operations of each single node, as well as in the design of networking protocols), and the sensing subsystem (i.e., techniques are used to reduce the amount or frequency of energy-expensive samples). The lifetime of a sensor network can be extended by jointly applying different techniques [10]. For example, energy efcient protocols are aimed at minimizing the energy consumption during network activities. However, a large amount of energy is consumed by node components (CPU, radio, etc.) even if they are idle. Power management schemes are thus used for switching off node components that are not temporarily needed. In this paper we will survey the main enabling techniques used for energy conservation in wireless sensor networks. Specically, we focus primarily on the networking subsystem by considering duty cycling. Furthermore, we will also survey the main techniques suitable to reduce the energy consumption of sensors when the energy cost for data acquisition (i.e. sampling) cannot be neglected. Finally, we will introduce mobility as a new energy conservation paradigm with the

purpose of prolonging the network lifetime. These techniques are the basis for any networking protocol and solution optimized froman energy-saving point of view. Due to the fundamental role of these enabling techniques, we will stress the design principles behind them and their features instead of presenting a complete set of networking protocols for wireless sensor networks.

Draves et al.(2007), are the authors present a new metric for routing in multi-radio, multihop wireless networks. They focus on wireless networks with stationary nodes, such as community wireless networks. The goal of the metric is to choose a high-throughput path between a source and a destination. Their metric assigns weights to individual links based on the Expected Transmission Time (ETT) of a packet over the link. The ETT is a function of the loss rate and the bandwidth of the link. The individual link weights are combined into a path metric called Weighted Cumulative ETT (WCETT) that explicitly accounts for the interference among links that use the same channel. The WCETT metric is incorporated into a routing protocol that they call Multi-Radio Link-Quality Source Routing. They studied the performance of their metric by implementing it in a wireless testbed consisting of 23 nodes, each equipped with two 802.11 wireless cards. They find that in a multi-radio environment, their metric significantly outperforms previously-proposed routing metrics by making judicious use of the second radio. They have shown that when nodes are equipped with multiple heterogenous radios, it is important to select channel diverse paths in addition to accounting for the loss rate and bandwidth of individual links. They have implemented a routing protocol MR-LQSR (Multi-Radio Link-Quality Source Routing) with a new metric WCETT (Weighted Cumulative Expected Transmission Time) to accomplish this task, and compared its performance to other routing metrics in a multi-radio testbed. Their results show that WCETT outperforms previously-proposed metrics. WCETT allows us to trade off channel diversity and path length, by changing the value of the control parameter . They experimented with different values of this control parameter, and showed that on shorter paths, taking channel diversity into account brings significant benefits. They also showed that on longer paths, as well as in heavily-loaded networks, the benefits obtained by selecting channel-diverse paths are limited. Xiaofei Wang#, Wei Cai#, Ye Yany, Taekyoung Kwon#, Yanghee Choi#, Wenhua Zeng(2007), are the authors propose a framework for distributed reactive routing protocol in WMNs, which utilizes multi-radio multi-channel technique, as well as multi-path transmission strategy. Dynamic channel assignment is used to avoid the inter-flow and intra-flow channel competition and interference. Our protocol establishes and maintains two or more channeldimensional disjoint paths, and then every data flow is splitted into multiple paths, in order to increase the total end-to-end transmission throughput. Demo and NS2 simulations are carried out for the evaluation of the performance of our proposed protocol comparing with AODV and other related routing protocols. It is shown our proposal can increase end to- end throughput significantly. In this paper, they proposed a framework for a multi-radio and multi-path routing protocol based on origin AODV for Wireless Mesh Network systems. The protocol can dynamically establish

multiple paths with diverse channel assignment, which are topology-dimensional and channel dimensional disjoint for data transmission, and the routing initialization works in a distributed manner. JAVA demo and NS2 simulations are carried out to evaluate their proposed protocol compared with other routing strategies: SRSP, MRSP and SRMP. Their proposal can make significant enhancement on achievable throughput in WMNs if the network is initially idle, and it performs still better than AODV in scenarios where there is also other concurrent ongoing flow. Rami Langar, Nizar Bouabdallah, Raouf Boutaba, and Guy Pujolle (May 2010), presentet a new metric for routing in wireless mesh networks (WMNs). The proposed metric does not only consider the quality of wireless links to choose a high throughput path between a pair of nodes, but it also includes the resulting interference introduced by using such links. The philosophy behind this metric is to choose a good path for an arriving connection, not necessarily the best in terms of throughput, but that alleviates the resulting interference in order to preserve good paths for the subsequent arriving connections. In doing so, they find that our metric significantly outperforms previously proposed routing metrics when multiple concurrent flows are considered in the network. The total network throughput is indeed increased. . To achieve this, a simulation model has been developed using ns-2. This work has focused on studying the benefits to the WMN throughput that can be gained by anticipating the impact of routing decisions, in terms of interference, on the service of subsequent arriving connections. They have shown that attributing always the best available route for an arriving connection in terms of bandwidth and loss rate may deteriorate the quality of the remaining available resources in the network due to the resulting interference. Consequently, new arriving connections will experience poor services and thus the total network throughput is affected. To improve the network throughput, they have proposed in this paper our INX metric that captures, in addition to the quality of wireless links, the resulting interference introduced by using such links. It has been shown that this metric outperforms existing routing metrics when multiple concurrent flows are considered in the network; however, it does not perform well when a single connection is considered to be active at any time, which is unlikely to be the case in real networks. Douglas S. J. De Couto Daniel Aguayo John Bicket Robert Morris(July 2007), are the authors presents the expected transmission count metric (ETX), which finds high-throughput paths on multi-hop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The ETX metric incorporates the effects of link loss ratios, asymmetry in the loss ratios between the two directions of each link, and interference among the successive links of a path. In contrast, the minimum hop-count metric chooses arbitrarily among the different paths of the same minimum length, regardless of the often large differences in throughput among those paths, and ignoring the possibility that a longer path might offer higher throughput. This paper describes the design and implementation of ETX as a metric for the DSDV and DSR routing protocols, as well as modifications to DSDV and DSR which allow them to use ETX. Measurements taken from a 29- node 802.11b test-bed demonstrate the poor performance of minimum hopcount , illustrate the causes of that poor performance, and confirm that ETX improves performance. For long paths the throughput improvement is often a factor of two or

more, suggesting that ETX will become more useful as networks grow larger and paths become longer. The Dijkstra algorithm finds the route to the destination which has the minimum metric. This paper introduces a new metric for multi-hop wireless networks, called ETX. Route selection using ETX accounts for link loss ratios, the asymmetry of the loss ratios in the two directions of each link, and the reduction of throughput due to interference among the successive hops of a route. Measurements on a wireless test-bed show that ETX finds routes with significantly higher throughputs than a minimum hop-count metric, particularly for paths with two or more hops. Several aspects of ETX could be improved in the future: its predictions of loss ratios for different packet sizes, particularly for 802.11b ACKs; its handling of networks with links that run at a variety of bit-rates; and the robustness of ETX probes when competing with high levels of data traffic.

Ashish Raniwala, Kartik Gopalan, Tzi-cker Chiueh (2004), are the researchers focussed their attention on wireless mesh networks that serve as the backbone for relaying end-user traffic from wireless access points to the wired network. The idea of exploiting multiple channels is particularly appealing in wireless mesh networks because of their high capacity requirements to support backbone traffic. To reap the full performance potential of this architecture are the authors developed a set of centralized channel assignment, bandwidth allocation, and routing algorithms for multi-channel wireless mesh networks. In this paper performance evaluation shows that with intelligent channel and bandwidth assignment, equipping every wireless mesh network node with just 2 NICs operating on different channels can increase the total network goodput by a factor of up to 8 compared with the conventional single-channel ad hoc network architecture. In these networks, static nodes form a multihop backbone of a large wireless access network that provides connectivity to end-users mobile terminals. The network nodes cooperate with each other to relay data traffic to its destinations. Wireless mesh networks are gaining significant momentum as an inexpensive solution to provide last-mile connectivity to the Internet. Here, some of the nodes are provided with wired connectivity to the Internet, while the rest of the nodes access the Internet through these wire-connected nodes by forming a multi-hop wireless mesh network with them. As deployment and maintenance of wired infrastructure is a major cost component in providing ubiquitous high-speed wireless Internet access , use of mesh network on the last-hop brings down the overall ISP costs. For similar reasons, wireless mesh network can be an attractive alternative even to wired broadband technologies such as DSL/cable modem. In this paper, researchers propose and evaluate one of the first multi-channel multi-hop wireless ad-hoc network architectures that can be built using standard 802.11 hardware by equipping each node with multiple network interface cards (NICs) operating on different channels. We focus our attention on wireless mesh networks that serve as the backbone for relaying end-user traffic from wireless access points to the wired network. In this paper, they assume we can obtain such traffic profile information through measurements and/or provisioning, and use it to modify channel assignment and routing decisions on a periodic basis. In this paper researchers describes the channel assignment, bandwidth allocation, and routing algorithms. The results and analysis of a detailed study presents the proposed architecture and algorithms based on ns-2 simulations.

Md. Shariful Islam, Young Jig Yoon, Md. Abdul Hamid, and Choong Seon Hong, are the researchers proposed a secure version of HWMP (SHWMP) that operates similarly to that of HWMP but uses cryptographic extensions to provide authenticity and integrity of routing messages and prevents unauthorized manipulation of mutable fields in the routing information elements. They have shown through analyses and simulation that SHWMP is robust against identified attacks and provides higher packet delivery ratio and incurs little computational and storage overhead to ensure security. They propose a secure routing protocol for 802.11s which takes into consideration the existing key hierarchy of 802.11s, identifies the mutable and non-mutable fields in the routing message, protects the non-mutable part using symmetric encryption and authenticates mutable information using Merkle tree. HWMP routing information elements have a mutable and a non-mutable part. We exploit these existing mutable and non mutable fields to design a secure layer-2 routing. More specifically, we (i) use the existing key distribution, (ii) identify the mutable and non-mutable fields, (iii) show that mutable fields can be authenticated in hop-by-hop fashion using the concept of Merkle tree, and (iv) use symmetric encryption to protect non-mutable fields. ns-2 simulate proposed secure routing (SHWMP) approach and compare that with existing HWMP. The goal of this paper is to develop a secure routing mechanism for wireless mesh networks. We have proposed SHWMP, a secure extension of L2 routing specified in 802.11s. Our proposed mechanism takes into consideration the existing key hierarchy of 802.11s (so, there is no extra keying burden), identifies the mutable and non mutable fields in the routing message, protects the non-mutable part using symmetric encryption and uses Merkle-tree approach to authenticate mutable information .They have shown that our protocol is robust against identified attacks and computationally efficient as it uses only symmetric key operations. Elizabeth M. Belding-Royer a,*, Charles E. Perkins, are the researchers designed the ad hoc on demand distance-vector (AODV) routing protocol for use in ad hoc networks, which are presently receiving wide interest within many diverse research communities. These networks represent a significant departure from traditional wired networks due to the distinguishing characteristics of both the wireless channel and mobile devices. Consequently, AODV incorporates many novel features for handling mobility, reduced capacity links, and the variable, indeterminate nature of the signaling range of wireless media. Since its initial design, AODV has evolved in a number of ways for improved performance, robustness, and better scalability. Nevertheless, we see many opportunities for continued improvement. This paper describes the current state of AODV, including its base functionality as well as optional features that improve performance and add capabilities. They also offer some direction for the continued evolution of AODV by presenting areas that can be targeted for future enhancements. The ad hoc on-demand distance-vector (AODV) routing protocol is an ondemand routing protocol; all routes are discovered only when needed, and are maintained only as long as they are being used. Routes are discovered through a route discovery cycle, whereby the network nodes are queried in search of a route to the destination node. When a node with a route to the destination is discovered, that route is reported back to the source node that requested the route. AODV was designed to meet the following goals: Minimal control overhead.

 Minimal processing overhead. Multi-hop path routing capability. Dynamic topology maintenance. Loop prevention. This paper provides a wide-ranging overview of AODV, which is among the leading contenders for routing protocol deployment within ad hoc networks. The protocol messages and procedures for route discovery and maintenance are described in this paper. The wide variety of approaches for improved scalability and performance are also given. The process of protocol modularization and reconstruction will enable many other features to be more easily included in systems according to the needs of the applications and users for a specific deployment. For instance, the needs of a company of firefighters and public safety workers will be different from the needs of passengers playing games on the freeways, and both will be different than the needs of snowboarders at a ski resort. Nevertheless all of these scenarios are likely candidates to benefit from using AODV as a base routing protocol to support wireless connectivity for the participants. These are just three examples of the dozens or hundreds of new scenarios for Internet applications that will be enabled by AODV and ad hoc networking technology. Simulation results comparing AODV and AOMDV show that in many situations, particularly with high traffic load, AOMDV is able to improve performance by decreasing the average endto-end delay of data packets as well as decreasing the routing load. Packets suffer less delay because fewer route discoveries are needed to maintain routes. Further, because there are fewer route discoveries, the overall overhead of AOMDV decreases. Alan Damers, Scott Shanker, Lixia Xheng, are the researchers studied media access control for a single channel wireless LAN being developed at Xerox Corporations Palo Alto Research Center. They start with the MACA media access protocol first proposed by Karan and later refined by Biba which uses an RTS-CTS DATA packet exchange and binary exponential backoff .Using packet level simulations .They examine various performance and design issues in such protocols. Their analysis lead to a new protocol MACAW which uses an RTS-CTS DATA ACK message exchange and includes significantly different backoff algorithm. MACAW is able to cope with highly non-homogenous congestion and can shield uncongested neighbours from losing too much throughput due to the presence of congested neighbour. MACAW achieves an improvement in total throughput of about 13% over MACA. More important is that MACAW achieves a fairer distribution of throughput. Kae Won Choi, Wha Sook Jeon and Dong Geun Jeong (Sept 2010), are the researchers proposed a load-aware routing scheme for wireless mesh networks (WMNs). In a WMN, the traffic load tends to be unevenly distributed over the network. In this situation, the load-aware routing scheme can balance the load, and consequently, enhance the overall network capacity. We design a routing scheme which maximizes the utility, i.e., the degree of user satisfaction, by using the dual decomposition method. The structure of this method makes it possible to implement the proposed routing scheme in a fully distributed way. With the proposed scheme, a WMN is divided into multiple clusters for load control. A cluster head estimates traffic load in its cluster. As the estimated load gets higher, the cluster head increases the routing metrics of the routes passing through the cluster. Based on the routing metrics, user traffic takes a detour to avoid overloaded areas, and as a result, the WMN achieves global load balancing. We present the numerical results showing that the proposed scheme effectively balances the traffic load and

outperforms the routing algorithm using the expected transmission time (ETT) as a routing metric.

CHAPTER 3

CONCLUSION
In this paper, we proposed an improved traffic load scheme for HWMP in WMNs. It presents an accurate metric with both historical and real-time perspectives, and an efficient routing process improved by traffic flow information. Simulation results show that our scheme can get less packet loss ratio and average end-to-end delay, and also achieves significant throughput gain than the original HWMP, especially in a dynamic environment. A good routing metric which is designed from the exploitation of traffic load, can make efficient routings on the limited bandwidth in wireless, and eventually upgrade the network capacity gain. But it is still hard to estimate the real traffic load in WMNs.

REFERENCES
F. Akyildiz, X. Wang, and W. Wang, Wireless Mesh Networks: A Survey, Computer Networks and ISDN Systems, vol. 47, no. 4, Mar. 2005. Raniwala and T. Chiueh, Architecture and algorithms for an IEEE 802.11-based multichannel wireless mesh network, Proceedings of IEEE Infocom, 2005. R. Baumann, S. Heimlicher, V. Lenders, and M. May, HEAT: Scalable Routing in Wireless Mesh Networks Using Temperature Fields, IEEE WoWMoM, Helsinki, Finland, June 2007. R. Draves, J. Padhye, and B. Zill, Routing in multi-radio, multi-hop wireless mesh networks, ACM International Conference on Mobile Computing and Networking (MobiCom), Sept. 2004, . W. H. Tarn and Y. C. Tseng, Joint multi-channel link layer and multipath routing design for wireless mesh networks, in INFOCOM, , 2007. Douglas S. J. De Couto, Daniel Aguayo, John Bicket, and Robert Morris, A High Throughput Path Metric for Multi-Hop Wireless Routing, ACM Mobicom, 2003. Richard Draves, Jitendra Padhye, and Brian Zill, Routing in Multi -Radio, Multi-Hop Wireless Mesh Networks, ACM Mobicom, 2004. R. Langar, N. Bouabdallah, R. Boutaba and G. Pujolle, Interferer Link -Aware Routing in Wireless Mesh Networks, International Conference on Communications, May 2010. IEEE 802.11s Mesh Networking, D1.06. Jul. 2007. C. E. Perkins and E. M. Belding-Royer, Ad-hoc On-Demand Distance Vector Routing, Internet Engineering Task Force, RFC 3561, Jul. 2003. V. Bharghavan, A. Demers, S. Shenker, and L. Zhang, MACAW: A Media Access Protocol for Wireless LAN's, Proceedings of ACM SIGCOMM Conference, Aug. 1993. A. Raniwala, K.Gopalan and T. Chiueh, Centralized Channel Assignment and Routing Algorithms for Multi-Channel Wireless Mesh Networks, ACM SIGMOBILE MC2R, 2004. Kae Won Choi, Wha Sook Jeon and Dong Geun Jeong, "Efficient Load-Aware Routing Scheme for Wireless Mesh Networks," IEEE Transactions on Mobile Computing, Sept. 2010.