Shinko, I.; Kolici, V.; Barolli, A.; Oda, T.; Barolli, L.; Xhafa, F. Journal of high speed networks Vol. 23, num. 2, p. 163-173 DOI: 10.3233/JHS-170563 Data de publicació: 2017-04-12 Article en revista
In this paper, we evaluate the performance of two Wireless Mesh Networks (WMNs) architectures considering throughput, delay, jitter and fairness index metrics. For simulations, we used ns-3, Distributed Coordination Function (DCF) and Optimized Link State Routing (OLSR). We compare the performance of WMN for different Transmission Control Protocol (TCP): Tahoe, Reno and NewReno considering normal and uniform distributions of mesh clients by sending multiple Constant Bit Rate (CBR) flows in the network. The simulation results show that for normal and uniform distributions and both WMN architectures, the PDR values are almost the same. For Hybrid WMN, the throughput of TCP NewReno is good, but for I/B WMN, the throughput of TCP Tahoe is higher than other algorithms. For normal distribution, the delay and jitter of I/B WMN are lower compared with Hybrid WMN, while for uniform distribution, the delay and jitter of TCP NewReno are a little bit lower compared with other algorithms. The fairness index of normal distribution is higher than uniform distribution.
In P2P systems, each peer has to obtain information of other peers and propagate the information to other peers through neighboring peers. Thus, it is important for each peer to have some number of neighbor peers. Moreover, it is more significant to discuss if each peer has reliable neighbor peers. In reality, each peer might be faulty or might send obsolete, even incorrect information to the other peers. We have implemented a P2P platform called JXTA-Overlay, which defines a set of protocols that standardize how different devices may communicate and collaborate among them. It abstracts a new layer on the top of JXTA through a set of primitive operations and services that are commonly used in JXTA-based applications and provides a set of primitives that can be used by other applications, which will be built on top of the overlay, with complete independence. JXTA-Overlay provides a set of basic functionalities, primitives, intended to be as complete as possible to satisfy the needs of most JXTA-based applications. In this paper, we present two fuzzy-based systems (called FRS1 and FRS2) to improve the reliability of JXTA-Overlay P2P platform. We make a comparison study between the fuzzy-based reliability systems. Comparing the complexity of FRS1 and FRS2, the FRS2 is more complex than FRS1. However, it considers also the security; therefore, it can be used in real application for secure systems.
The final publication is available at IOS Press through http://dx.doi.org/10.3233/JHS-150506
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