scholarly journals COMPARISON OF HOP COUNT ON WIRELESS MESH NETWORK

2021 ◽  
Vol 2 (2) ◽  
pp. 11
Author(s):  
Eliza Staviana ◽  
Hizbul Wathan

Wireless Mesh Network (MWN) is a self-configured and self-organized network that can typically be implemented on 802.11 hardware. It consists of several nodes that make up the network backbone in a multi-story and sealed room, in contrast to building a hall or a place without bulkheads. This experiment uses an odd and even number scheme with a maximum number of routers of 8 pieces. In a sealed room, the performance of the method of installation of the number of strange Hops is better than the number of even Hops, with throughput calculation of 2665.19 KB, delay 0.25 s, data lost 0.60 %, and jitter 0.01 s and the best scheme that is with the number of Hops as much as five pieces, with the calculation of the number of throughput 7001.88 KB, delay 0.51s, data lost 0.47%, and jitter 0.002 s. In the free spaces, it can produce the better performance of the even hop count calculation scheme than the odd hop count by building throughput 16709.8 KB, delay 0.2 s, data lost 0.08 %, and jitter 0.03 s. and the best scheme that is with the number of throughput 68975,2 KB, wait for 0.0148 s, data lost 0 %, and jitter 0.0014 s. WMN performance in unshared space is more maximized than the version in a sealed area, with throughput values of 11786.82 kbps, delay of 2.08 ms, and data lost by 0.08 %, and jitter 0.03 s.it can produce the better performance of the even hop count calculation scheme than the odd hop count by producing throughput 16709.8 KB, delay 0.2 s, data lost 0.08 %, and jitter 0.03 s. and the best scheme that is with the number of throughput 68975,2 KB, wait for 0.0148 s, data lost 0 %, and jitter 0.0014 s. WMN performance in unshared space is more maximized than the version in sealed space, with throughput values of 11786.82 kbps, delay of 2.08 ms, and data lost by 0.08 %, and jitter 0.03 s. and data lost by 0.08%, and jitter 0.03s.

Wireless Mesh Network (WMN) is a convincing theme to many net researchist because of its minimal effort in sending, straightforwardness in the establishment and heartiness in activity. Notwithstanding, current routing protocols intended for MANET, can't work productively in WMN on the grounds that spine in WMN shaped by Mesh Router has low portability and are not put under power and memory duress. In this paper, we are coming with a new idea of routing using geographic multipath, which will be beneficial for an Infrastructural WMNetwork and also don't depend on node's location. The proposed protocols has awareness, about the node's congestion and the node's location of all next neighbors, and utilize Hop-Count array technique. Furthermore, with help of a procedure of congestion-cognizant, nodes can select the perfect connection with adequate bandwidth for the requirement of comer traffic. In the proposed protocol for routing we accomplish various remarkable characteristics of Hop-count array (metric) depend on routing algorithm: straightforwardness, durability and feasibility of affectation. Results demonstrate that throughput increments extraordinarily with our proposed protocol when contrasted with unadulterated AODV and AOMDVin heavily loaded traffic situation.


2020 ◽  
Vol 7 (1) ◽  
pp. 50-53
Author(s):  
Kumaravel K ◽  
Sengaliappan M

In wireless mesh network the nodes are dynamically self-organized and self- configured networks create a changing topology and keep a mesh connectivity to offer Internet access to the users. The shortest path problem is one of the most fundamental problems in networking. This problem can be solved by manytechniques and algorithm. In this paper we find the shortest path by using the fittest nodes in the network. By using the fittest node we can send the packets to the destination without packet loss, delay in packets.Average end to end delay is decreased by increasing bandwidth and the results are shown.


Sign in / Sign up

Export Citation Format

Share Document