J4 ›› 2011, Vol. 38 ›› Issue (5): 101-107.doi: 10.3969/j.issn.1001-2400.2011.05.017

• Original Articles • Previous Articles     Next Articles

Research on the adaptive load balancing routing algorithm

ZHU Bin1;ZENG Xiaoping1;CHEN Li1;LIAO Hongyun2;YAN Fang1   

  1. (1. College of Commun. Eng., Chongqing Univ., Chongqing  400044, China;
    2. Chongqing Jin-mei Commun. Co., Ltd., Chongqing  400030, China)
  • Received:2010-07-06 Online:2011-10-20 Published:2012-01-14
  • Contact: ZHU Bin E-mail:zb@ccee.cqu.edu.cn

Abstract:

The traditional routing algorithms for Ad hoc networks use the minimum hop count as the routing metric, so some central nodes are overloaded and the performance of the networks is degraded. Therefore, an adaptive load balancing routing algorithm based on a gossip mechanism is proposed. This routing algorithm combines the gossip routing mechanism and the load balancing of the network. In the phase of routing discovery, it adjusts the transmission probability in gossip adaptively according to the distributing situation of the nodes and the relative degree of the load in the local area, and lets the nodes with a smaller load join the foundation of the routing preferentially. Simulation demonstrates that this algorithm reduces the routing control overhead remarkably, increases the average packet delivery ratio, and decreases the average end-to-end delay of the data packets, so it is of high practicability.

Key words: ad hoc networks, routing algorithms, load balancing, routing overhead, gossip mechanism


Baidu
map