A routing algorithm for wireless mesh network based on information entropy theory

Le résumé fourni par la source

Abstract Nowadays, wireless mesh networks (WMNs) are rapidly spreading around the world due to their competitive advantages. Beyond this, their adaptability is evident in supporting a wide range of applications: from powering broadband home networks and educational programs to driving healthcare advancements, simplifying building automation systems, assisting in expedited rescue operations, and even serving military needs. The routing within WMNs plays a pivotal role in enhancing reliability and optimizing performance. Notably, WMNs can consist of several cascading channels, however, the literature lacks routing algorithms based on the concept of information entropy for these channels. This work introduces an information‐entropy‐based algorithm specifically designed for wireless cascaded channels within WMNs. The proposed algorithm aims to enhance bandwidth in WMNs by constructing routes based on the maximum value of entropy of the cascading binary channel. This algorithm builds a route with the maximum value of the path entropy and bandwidth in WMNs. Furthermore, this study validates the applicability and competitiveness of the proposed method through a comparative analysis against established algorithms like Dijkstra, ACO, OLSR, AODV, and a previous method by the authors.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.