Research On Node Deployment And Resource Allocation In Wireless Mesh Network

Wireless Mesh network is a new technology network,which is different from other networks,it has multi-hop interconnection,self-organization and self-configuration and so on.With the continuous development of communication technology,wireless Mesh network in people’s lives from the role is also growing.The deployment of wireless Mesh network and channel allocation of wireless Mesh network research is also important.Traditionally,the deployment of routers in wireless Mesh networks requires the planner to calculate by hand,and also need to configure the relevant parameters.With the increasing network expansion,the need to deploy more Mesh routers to meet the requirements,through manual planning to consume a lot of time and efficiency is not high,so we propose a multi-objective programming based on the node deployment algorithm Meet the needs of the business.This method satisfies as much as possible in a given area with the least Mesh device to cover and can achieve a better throughput.According to the multi-objective programming model,Mesh nodes in the network are deployed.In the case of ensuring better network throughput,the number of Mesh devices deployed in the network is small.The interference model adopts the protocol model to establish the multi-objective programming model.The Mesh nodes are deployed and the Mesh nodes are added and removed to meet the traffic requirements of each node.Finally,the algorithm and other algorithms are used to compare the number of Mesh routers and Mesh gateways with the same throughput.The performance of the algorithm is verified.Aiming at the shortcomings of the fairness of channel resource allocation in wireless Mesh networks,a channel resource allocation algorithm based on dynamic factor repetitive game is proposed.The algorithm combines game theory with channel resource allocation problem,and regards Mesh nodes in the network as During the game,each node competes with the resources in the channel through its own selection strategy,allowing only one node’s strategy to change each time the game is played,If the change of the node can change the revenue function of the network,then the system will enter the next round of the game until the algorithm converges to a Nash equilibrium.For the interference loss of the distribution process,the loss factor is introduced to dynamically update the game weight,so that the channel resources of the node can be allocated on demand to achieve the purpose of fairness of channel allocation.Finally,through the simulation experiment,we propose the repeated game algorithm and other Algorithm to verify the network performance of the algorithm in terms of network throughput,transmission delay and fairness of node resource allocation.