A New Load-balancing Algorithm in Wireless Networks

Since traditional soft load balancing algorithm in the heterogeneous wireless networks exists the problem of high load deviation and low system throughput, this paper proposes grid-based load-balancing algorithm to improve the integration of heterogeneous wireless throughput and reduce business delay and load deviation, while ensuring network quality of service basis. The algorithm proposed in this paper maps the wireless resource into different three-dimensional resource unit under the condition of full consideration of customers' business needs and difference matching of heterogeneous resources unit, and then divides the business into different sub-business traffic which is distributed to different network grid to achieve business distributed shunt. This gives specific process of load balancing algorithm. Finally, we perform the simulation experiments with MLB and DLBD algorithm on the aspects of shunt times, business blocking probability and network load balancing degree. Experiments show that: the algorithm proposed in this paper improves the utilization of the heterogeneous wireless resource, and improves performance of system.

[1]  Karl Aberer,et al.  The essence of P2P: a reference architecture for overlay networks , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[2]  Moni Naor,et al.  Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.

[3]  Juan Wang,et al.  Adaptive Clustering for Maximizing Network Lifetime and Maintaining Coverage , 2013, J. Networks.

[4]  Marcel Waldvogel,et al.  Efficient topology-aware overlay network , 2003, CCRV.

[5]  Nadeem Anjum,et al.  Association of Moving Objects Across Visual Sensor Networks , 2012, J. Multim..

[6]  Hao Liao,et al.  Building Small-World Peer-to-Peer Networks Based on Hierarchical Structures , 2009, IEEE Transactions on Parallel and Distributed Systems.

[7]  Wolfgang Nejdl,et al.  Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs , 2004, ISPA.

[8]  Jun Xu On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks , 2004, IEEE Journal on Selected Areas in Communications.

[9]  Markus H. Gross,et al.  Feature Preserving Point Set Surfaces based on Non‐Linear Kernel Regression , 2009, Comput. Graph. Forum.

[10]  D. Watts,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .

[11]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[12]  Abhishek Kumar,et al.  Ulysses: a robust, low-diameter, low-latency peer-to-peer network , 2004, Eur. Trans. Telecommun..

[13]  Yutaka Ohtake,et al.  Smoothing of Partition of Unity Implicit Surfaces for Noise Robust Surface Reconstruction , 2009, Comput. Graph. Forum.

[14]  Zhaoliang Duan,et al.  3D Tracking and Positioning of Surgical Instruments in Virtual Surgery Simulation , 2011, J. Multim..

[15]  Wenjun Xiao,et al.  Cayley graphs as models of deterministic small-world networks , 2006, Inf. Process. Lett..

[16]  Angela Carrillo Ramos,et al.  Personalized Services for Commercial Establishments using PlaSerEs , 2011, J. Mobile Multimedia.