Research on Algorithms of Spatial-Temporal Multi-Channel Allocation Based on the Greedy Algorithm for Wireless Mesh Network

ABSTRACT

With the development of mobile Internet and wireless network as well as the rapid increasing number of users, people’s demand for broadband is increasing sharply, making further capacity expansion of the network the major problem for researchers. Wireless Mesh network has the advantages of high network coverage and flexible networking, especially multi-hop wireless network, its important networking format takes full use of the feature of orthogonal channel to raise the throughput of wireless network and utilization efficiency of broadband dramatically and make the channel resources allocation more flexible. This paper points out the advantages and disadvantages of Mesh network by analyzing some relatively classic algorithms based on the research of Mesh network technology in order to increase utilization efficiency of orthogonal channel further. At the same time, it proposes Spatial-Temporal Multi-Channel Allocation Based on the Greedy Algorithm for Wireless Mesh Network which takes the channel allocated in previous slot time into consideration and allocates channels to different ports to reduce the switching time and other costs. Giving the direction of nodes is up stream, it requires well-functioning nodes near the gateway. Any network fault will influence other nodes near these gateways. This allocation realizes the communication between nodes on original channel nodes, increasing utilization efficiency significantly and reducing the burden of parent node. In the end, this paper makes a conclusion of the main work.

Keywords: