Optimization of WMN Performance for Different Propagation Environment

Abstract

Wireless mesh networks are multihop systems in which contrivances avail each other in transmitting packets through the network, especially in arduous conditions. We can drop these ad hoc networks into place with minimal preparation, and they provide a reliable, flexible system that can be elongated to thousands of contrivances. The wireless mesh network topology developed is a point-to-point-to-point, or peer-to-peer, system called an ad hoc, multi-hop network. A node can send and receive messages, and in a mesh network, a node withal functions as a router and can relay messages to its neighbours. A mesh network offers multiple redundant communications paths throughout the network. If one link fails for any reason, the network automatically routes messages through alternate paths. In a mesh network, we can abbreviate the distance between nodes, which dramatically increases the link quality. If we reduce the distance by a factor of two, the resulting signal is at least four times more puissant at the receiver. This makes links more reliable without incrementing transmitter power in individual nodes. In a mesh network, we can elongate the reach, integrate redundancy, and amend the general reliability of the network simply by integrating more nodes. One of the most astronomically immense issues in routing is to providing copacetic performance while scaling the wireless mesh network. It is fascinating, however, to investigate what transpires when routing nodes are expanded in different propagation environment and how that affects routing metrics. In this thesis, we examine the utilization of different proactive, reactive and hybrid protocols in such a way so that we may be able to build a cost function which avails in culling the finest grouping of routing protocols for a particular urban wireless mesh network. The key parameters are network throughput and average end to culminate delay. The performance of Bellman ford, DYMO, STAR and ZRP protocols have been examined with different node densities. A non-linear cost function equation has been proposed corresponding to each routing parameter taken. Bitrate is taken as constant (CBR).