One of the key advantages of Wireless Mesh Networks (WMNs) is their importance for providing cost-efficient broadband connectivity. There are issues for achieving the network connectivity and user coverage, which are related with the node placement problem. In this work, we compare Hill Climbing (HC), Simulated Annealing (SA) and Genetic Algorithm (GA) by simulations for node placement problem. We want to find the optimal distribution of router nodes in order to provide the best network connectivity and provide the best coverage in a set of randomly distributed clients. From the simulation results, all algorithms converge to the maximum size of Giant Component (GC). However, according to the number of covered mesh clients, HC and SA converge faster.

In this paper, we present the implementation and analysis of our testbed considering the link quality window size (LQWS) parameter of optimized link state routing (OLSR) and better approach to mobile ad-hoc networking (B.A.T.M.A.N.) protocols. We investigate the effect of mobility in the throughput of a mobile ad-hoc network (MANET). The mobile nodes move toward the destination at a regular speed. When the mobile nodes arrive at the corner, they stop for about three seconds. In our experiments, we consider two cases: only one node is moving (mobile node)and two nodes (intermediate nodes) are moving at the same time. We assess the performance of our testbed in terms of throughput, round trip time, jitter and packet loss. From our experiments, we found that throughput of TCP was improved by reducing LQWS.