Research on multi-path routing based on load-balance algorithm for ad hoc networks

Authors:
Haifeng Zhang;Zhefu Wu;Yali Qin
Affiliations:
College of Information Engineering, ZheJiang University of Technology, Hangzhou, China;College of Information Engineering, ZheJiang University of Technology, Hangzhou, China;College of Information Engineering, ZheJiang University of Technology, Hangzhou, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 4
Cited 0

Routing with load balancing in wireless Ad hoc networks

MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing
Efficient Semantic-Based Content Search in P2P Network

IEEE Transactions on Knowledge and Data Engineering
A survey on position-based routing in mobile ad hoc networks

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the increase in size and application of the communication networks, more attention has been paid to the mobile ad hoc networks. The study of multi-path routing protocol is always an important component in the research of ad hoc network. Based on studying deeply in the characteristic of mobile ad hoc networks, analyzing the shortages in multi-path routing protocol, this paper proposes a new kind of routing algorithm based on load-balance. Firstly, algorithm analyzes the queuing model and put forward two formulas to evaluating the partial function and whole function for ad hoc networks. Using the connective matrix and traffic matrix, the usage condition of every link and function index can be calculated. At last, we set the threshold value to limit the excessive usage of links, reduced the possibility of congestion. Simulations and comparisons with some typical route algorithms show our algorithm is robust and effective.