A new algorithm for optimization of quality of service in peer to peer wireless mesh networks

摘要

Nowadays, wireless mesh networks are known as important parts of different commercial, scientific, and industrial processes. Their prevalence increases day-by-day and the future of the world is associated with such technologies for better communication. However, the issue of improving quality of service for dealing with more complex and intense flow of data has been always a remarkable research problem, as a result of improved wireless communication systems. In this sense, objective of this study is to provide a new algorithm for contributing to the associated literature. In the study, peer to peer wireless mesh networks and the concept of service quality were examined first and then an approach for improving service quality in such networks has been proposed accordingly. In detail, the proposed an approach allows profiting data transfer capability by data packet and using this information for routing and preventing overcrowd in network nodes and finally, distributing the load over it. When middle nodes overcrowd, they withhold to send control messages of route creating or do that by delay. The proposed approach has been evaluated and the findings revealed that at least 10% of undue delays through network can be prevented while permittivity does not reduce, thanks to the approach. Also energy consumption within network nodes partially increases due to adding table and the search which can be overlooked.