A dynamic hierarchization method for traffic variation in wireless mesh networks

Nowadays, broadband services using smart phones and tablet terminals become popular and their users increase. Accordingly, the traffic volume through networks becomes tremendously large and heavily unbalanced. In large networks, a network is usually divided into small subnetworks for its efficient management. However, traffic elevation often occurs to specific divided subnetworks, the throughput suddenly decreases and in the worst case communication is not assured. In order to cope with the congestion problem, this paper proposes a dynamic hierarchization method for traffic variation in wireless mesh networks. In the proposed method, the subnetworks are divided and integrated adaptively to rapid traffic variation in wireless mesh networks. Simulation experimental results show that timely division of the proposed method reduces packets loss due to buffer overflow and a high throughput is maintained.