Distributed algorithms for resource allocation in wireless mesh networks

A wireless network using a mesh topology is offered as an alternative to a star topology in a dynamic mobile network. A great challenge for a mobile mesh network is the ability to share resources between nodes to allow connectivity throughout the network. As the network is dynamic, it is proposed that the algorithm for resource sharing be distributed and be easily adaptable to changes. This research suggests two distributive algorithms for resource allocation and compares the results to the minimal distribution in one predetermined scenario, and to a in random scenarios. The research assumes the ability to perform frequency and time division, and also suggests a method for resource allocation when using orthogonal subbands.