Performance Analysis of Wireless Mesh Network for AODV, DSDV, DSR and AOMDV

Transcription

1 Performance Analysis of Wireless Mesh Network for AODV, DSDV, DSR and AOMDV 1 Anagha P. Mahajan, M.Tech,Electronics Engg(communication), Vidarbha Institute of Technology, Nagpur University, India, id- anaghamahajan05@yahoo.com. 2 Nilesh Bodne, Assistant Professor (M. Tech ECE), Vidarbha Institute of Technology, Nagpur University, India, id- nileshbodne@gmail.com ABSTRACT Wireless mesh networks (WMNs) have emerged as a key technology for next-generation wireless networking. Wireless mesh network is a self-organizing, self-managing and self-healing and thus it is easy and speedy in deployment. Apart from these characteristics, it is low cost and easy maintenance. In recent years, Wireless Mesh Networks have already become very popular and been receiving an increasing amount of attention by the research community. Due to the limited transmission range of the radio, many pairs of nodes in WMN may not be able to communicate directly, hence they need other intermediate nodes to forward packets for them. Routing in such networks is an important issue and it possesses great challenges. In their current form, however, these networks suffer from both limited throughput and low reliability. Routing is the main task to satisfy various parameters like packet delivery ratio, packet loss ratio, throughput, overhead, energy and delay. We generally use virtual clustering concept in the protocol. In this paper routing protocols used are AODV (Ad-Hoc On Demand Distance Vector Routing), DSDV (Destination Sequence Distance Vector Routing), DSR (Dynamic Source Routing) and AOMDV (Ad-Hoc On Demand Multipath Distance Vector Routing) and NS-2 simulator is used for simulation and results will be calculated. But in wireless networks packet loss ratio is a problem. It is caused by various reasons. To minimize the packet loss ratio and delay, and aggregation techniques are used. Key words: Wireless Mesh Network, Routing Protocol, AODV, DSDV, DSR, AOMDV,. with the external network (e.g. the Internet) by forwarding each other's traffic (including clients traffic) towards the gateway nodes, which are directly connected to the wired infrastructure. In a WMN, each router forwards packets on behalf of other nodes (that may not be within direct wireless transmission range of their destinations). Moreover, the gateway functionalities enable the integration of WMNs with various existing wireless networks such as Wi-Fi, Wi-max cellular networks. Compared to wired networks, routing in WMN is specially challenging because of two fundamental differences. The first one is the heterogeneous characteristics of the wireless links: due to the strong dependency of radio transmission impediments between the nodes with their distance and the environmental elements influencing the radio waves propagation. As a consequence, packet delivery probabilities may be significantly different for every link of a WMN. The second one is the broadcast nature of wire-less transmissions: unlike wired networks, where links are typically point to point, when a node transmits a packet in a wireless network, the packet can be received by several neighbouring nodes simultaneously. Mesh networks extend the coverage area without expensive wiring, offering cheap and moderately fast connectivity, sufficient for accessing the Internet assuming normal browsing habits. Next generation applications, however, are highly demanding. Consumers expect to be able to access video over the Internet, share large files, ship high definition multimedia to entertainment devices in their homes, among other things. 1. INTRODUCTION: Wireless Mesh Network (WMN) is formed by a set of gateways, mesh routers, and mesh clients. Gateways and mesh routers form the backbone of the network, where mobility is reduced. Mesh clients can be cell phones, laptops or other wireless devices. Routers communicate IJESAT Jul-Aug

2 forwarding is done fast because routes are defined before transferring packets. Proactive routing protocols have the significance of providing lower latency in packet delivery and possibility of supporting applications which have quality-of-service constraints. Example- DSDV (Destination Sequence Distance vector Routing) Reactive protocol: Fig. 1. Wireless Mesh Network Wireless Mesh Network is a network in which there is collection of nodes which are interconnected by wireless links. Wireless mesh network nodes are differentiated as stationary nodes and mobile nodes. It is the subclass of ad-hoc networking. Wireless mesh network are developed for military applications. There exist a family of ad-hoc routing protocol. Routing Protocols : Wireless mesh networks are multi-hop networks. Therefore a mechanism for finding a path between source and destination is needed. Static routing means that the path is set up manually, while dynamic routing requires a routing protocol which sets up routing tables. A router forwards packets to a next hop neighbour, which is chosen upon a routing metric. This process is called routing. Routing protocols are used to find and maintain routes between source and destination nodes, in order to forward traffic. These protocols find the route and deliver the packet to the correct destination. Routing is used to select the best suitable path for the transmission of packets from one place to another. Routing Protocols are divided into: 1. Proactive protocol 2. Reactive protocol 3. Hybrid Protocol Proactive protocol: These are also known as table driven protocol in which route to all nodes is predefined in routing table. These protocols require each and every node to maintain one or more tables to store routing information. These protocols give response to change in network topology by providing route update throughout the network. Packet Generally, reactive protocols perform route discovery mechanism between the source and the destination, so that these protocols could find the route only when it is necessary. Routes are not predefined for routing. It is created when required. A source node finds a new route whenever transmission is needed. It invokes the route discovery mechanism to determine the path to the destination. It depends on flooding algorithm. A node send packets to all its neighbours and intermediate nodes forward that packet to all their neighbours. This is repeated until it reaches the correct destination. Example- AODV, DSR, AOMDV 2. LITERATURE REVIEW: In this paper, the characteristics of wireless mesh networks have been discussed and compared with the properties of other wireless networks. Existing routing protocols have been categorized according to these properties.[1] In this paper, a routing protocol is proposed for wireless mesh network. The proposed scheme, improves performance compared to other protocols are AODV and DSDV. It uses both proactive and reactive routing mechanism. Proactive concept we use to collect the topology information and reactive concept uses to route the packets. Proactive scenario improves the end-to-end delay and provides efficient routing in the network. Reactive scenario improves packet delivery ratio and packet loss ratio in the network.[2] This paper aims to study the performance of routing protocols in a wireless mesh network, where static mesh routers and mobile clients participate together to implement networks functionality such as routing and packet forwarding in different mobility scenarios.[3] This paper presented a novel encoding scheme to efficiently represent a n-bit bitmask using n-1 bits, thus reducing the compressed data size. Experimental results demonstrated an improvement of 3 to 10% in efficiency without introducing any area or performance penalty. [4] In this paper, an effort is made to have the comparison of reactive and proactive protocols (AODV, IJESAT Jul-Aug

3 AOMDV, DSDV and DSR) by transmitting the H.264/SVC format video over 3 mobile nodes and the QoS metrics like average end to end delay and packet loss rate is measured at varying fragment sizes.[5] 3. PROBLEM STATEMENT: In designing wireless mesh network using different routing protocols various parameters are to be calculated such as throughput, packet delivery ratio, delay, energy and jitter and the performance of protocols are analyzed. As the packet loss is caused due to various reasons. One cause of packet loss is loss due to bit errors in the transmitted frame. Bit errors occur when the received signal cannot be decoded properly. If the network load and the number of contending nodes rises, the probability of collisions on the MAC layer rises. Larger packets have a better payload/overhead ratio. Therefore they reduce the channel utilization and consequently the probability of collisions. If a node tries to send more data than the MAC layer and channel speed can handle, the packets will queue up in the internal packet queue. If the packet rate is greater than the maximum possible MAC service rate this will eventually lead to a queue overflow. New packets cannot be stored in the queue anymore and are dropped. So the technique with aggregation algorithm is used to minimize the packet loss and delay shown the improvement in the results. 4. IMPLEMENTED WORK: The NS-2 software is used for the project. Ns-2 is especially useful for the comparison of protocols. It is quite challenging to model a real-life setting in ns-2. The focus of NS-2 is on packet handling, which means that a simulation is the exchange of packets between objects and the processing of the packets by the objects. The routing protocols used are AODV, AOMDV, DSDV and DSR. The packet size is of 1000 bytes and the MAC layer is The wireless mesh network is designed using all the above protocols and calculated the result that are throughput, jitter, energy and delay. But as the problem is of packet loss ratio, so the of data is implemented using aggregation algorithm. Fig.2. Wireless Mesh Network with mesh router, clients and gateway Data minimizes the number of bits required to encode information. Data often reduces the bandwidth needed to transmit information or increases storage capacity. Removal of redundancy from encoded data is essential to successful data. Many algorithms are designed for special purposes. For instance, in a broadcast environment, one may have huge resources with which to compress information that is to be transmitted from a single point to many destinations. The equipment at the destination may be limited because duplication of expensive equipment at each remote site is not economical. Data methods are designed to reduce the number of bits required to store or transmit information in the original data and to allow information in the decompressed copy of the data to be re-created. By reducing the size of a message, the effective bandwidth of the communications channel can be increased. Packet Aggregation : Packet aggregation means to assemble one large aggregation packet from multiple small packets. It is called packet aggregation. The concept of packet aggregation is: 1) Collect packets which pass a common hop (aggregation target) 2) Aggregate packets together in an aggregation packet. Send this packet to the aggregation target. IJESAT Jul-Aug

4 5. SIMULATION PARAMETERS: Channel Channel/wireless channel Propagation Propagation/ two ray ground Network Interface Phy/Wireless phy MAC MAC/ Packet Size 1000 bytes Interface Queue 50 Length No. of Nodes 30 Area Size 300x300 Routing Protocols AODV, DSDV,DSR, AOMDV Performance Metrics, delay, energy, jitter Fig 3. Network results for AODV protocol with and without : 6. SIMULATED RESULT: : The throughput is defined as the total amount of data a receiver R receives from the sender divided by the times it takes for R to get the last packet Average Jitter: Jitter is the variation in the time between packets arriving, caused by network congestion, timing drift or route changes. Average End-to-end delay: End-to-end delay indicates how long it took for a packet to travel from the source to the application layer of the destination. Energy : Energy indicates how much the energy is consumed or left. In this section the simulation results of wireless mesh are shown. Fig 4. Delay graph Delay Without Delay With IJESAT Jul-Aug

5 Fig 5. graph Without With Fig 7. Jitter graph Jitter Without Jitter With results for DSDV protocol with and without : Fig 6. Energy graph Energy Without (mj) Energy With (mj) IJESAT Jul-Aug

6 Fig 8. Delay graph Fig 9. graph Delay Without Delay With Without With Fig 10. Energy graph IJESAT Jul-Aug

7 Energy Without (mj) Energy With (m J) Fig 12. Delay graph Delay Without Delay With Fig 11. Jitter graph Jitter Without Jitter With results for DSR protocol with and without : Fig 13. graph IJESAT Jul-Aug

8 Without With Fig 15. Jitter graph Jitter Without Jitter With Fig 14. Energy graph Energy Without (mj) Energy With (mj) results for AOMDV protocol with and without : IJESAT Jul-Aug

9 Without With Fig 16. Delay graph Delay Without Delay With Fig 18. Energy graph Energy Without (mj) Energy With (mj) Fig 17. graph IJESAT Jul-Aug

10 [1] Sonia Waharte, Raouf Boutaba, Youssef Iraqi, Brent Ishibashi, Routing Protocol in Wireless Mesh Networks: Challenges and Design Considerations,IEEE, July [2] K. Sri Devi, K. Rama Krishnaiah, B. Ramesh Babu, A Comparative Study on Performance of AODV, DSDV and Hybrid Routing Protocol for Wireless Mesh Networks, IJCST Vol. 4, Jan- Mar [3] Shashi Bhushan1, Anil Saroliya2, Vijander Singh, Implementation and Evaluation of Wireless Mesh Networks on MANET Routing Protocols, International Journal of Advanced Research in Computer and Communication Engineering Vol. 2, Issue 6, June [4] Chetan Murthy and Prabhat Mishra, Lossless Compression using Efficient Encoding of Bitmasks, 2009 IEEE Computer Society Annual Symposium on VLSI. Fig 19. Jitter graph Jitter Without Jitter With CONCLUSION: In this paper we have concluded that none of the protocol have 100% efficiency. The network is designed for 30 nodes and as the number of nodes are more congestion in the network increases so delay and packet loss increases. The network is designed using AODV, DSDV, DSR and AOMDV protocol and the performance of all the above protocols is analyzed with NS2 simulator and calculated the result that are throughput, jitter, energy and delay.then with the help of aggregation based the improvement in the results are shown. And it is observed that packet delivery ratio is good, delay is minimized as compared to the delay which is without. Jitter should be close to zero for consistency and thus it is achieved. REFERENCES: [5] Dr. Swati Sharma, Nandita Negi, Nipun Sharma, Packet End To End Delay Evaluation of AODV, AOMDV, DSR and DSDV in H.264 Streaming Video Transmission over MANETs, International Journal of Innovative Research in Computer Science, Engineering and Technology August [6] Hashem Kalbkhani, Behrouz Zali*, Video Streaming over Wireless Mesh Networks, [7] Saleh Yousefi, Morteza Maleki, Multicast Scheduling Algorithm Supporting Spatial Mini-slot Reuse for IEEE Mesh Networks, IEEE, January 2013 [8] Meenakshi, Vinod Kumar Mishra, Kuber Singh, & Performance Analysis of Proactive, Reactive & Hybrid Routing Protocols in MANET, International Journal of Advanced Research in Computer science and Software Engineering, July2012. [9] B.Soujanya, T.Sitamahalakshmi, Study Of Routing Protocols In Mobile Ad-Hoc Networks, International Journal of Engineering Science and Technology (IJEST), Vol. 3 No. 4,pp , April [10] Esmailpour A, Nasser N, Packet Scheduling Scheme with quality of Service support for Mobile WiMax Networks, Proceedings of 9 th International Workshop on Wireless Local Network: October 20-23, 2009, Zurich Switzerland: IEEE, 2009: IJESAT Jul-Aug

11 [11] Ali N, Taha M, Hassanein H, IEEE Mesh Schedulers: Issues and Design Challenges, IEEE Network, [12] Chai Keong Toh, Anh-Ngoc Le and You-Ze Cho Load Balanced Routing Protocols for Ad Hoc Mobile Wireless Networks in IEEE Communications Magazine, pp 2-9, August [13] R. Bruno, M. Conti, and E. Gregori, Mesh networks: Commodity multihop ad hoc networks, IEEE Communications Magazine, vol. 43, pp , Mar [14] Chiang C-C, Gerla M (1997, October) IEEE 6th international conference on universal personal communications record. In: Routing and Multicast in Multihop, Mobile Wireless Networks, vol 2, pp [15] De Couto DSJ, Aguayo D, Bicket J, Morris R (2003) A high-throughput path metric for multihop wireless routing. In: Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, pp [16] Vijay Kumar, Bharat Bhushan, Analytical Evaluation of Protocols AODV and DSR, JM Academy of IT & Management, Vol.1, No.1, pp , [17] Priti Garg, Asma Tuteja, Comparative Performance Analysis of Two Ad-Hoc Routing Protocols, International Conference on Network And Electronics Engineering, IPCSIT, Vol. 11, IJESAT Jul-Aug