Research on the adaptive load balancing routing algorithm

被引:0
|
作者
Zhu B. [1 ]
Zeng X. [1 ]
Chen L. [1 ]
Liao H. [2 ]
Yan F. [1 ]
机构
[1] College of Commun. Eng., Chongqing Univ.
[2] Chongqing Jin-Mei Commun. Co., Ltd.
关键词
Ad hoc networks; Gossip mechanism; Load balancing; Routing algorithms; Routing overhead;
D O I
10.3969/j.issn.1001-2400.2011.05.017
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:101 / 107
页数:6
相关论文
共 14 条
  • [1] Perkins C.E., Mroyer E., Das S., Ad-hoc on-demand distance vector (AODV) routing, (2003)
  • [2] Johnson D., The dynamic source routing for mobile ad hoc networks
  • [3] Toh C.K., Associativity-based routing for ad-hoc mobile networks, Wireless Personal Communications Journal, 4, 2, pp. 103-139, (1997)
  • [4] Zhou A., Hassanein H., Load-balanced wireless ad hoc routing, Canadian Conference on Electrical and Computer Engineering, pp. 1157-1161, (2001)
  • [5] Lee S.J., Gerla M., Dynamic load-aware routing in ad hoc networks, IEEE International Conference on Communications, pp. 3206-3210, (2001)
  • [6] Wu K., Harms J., Load-sensitive routing for mobile ad hoc network, Tenth Intl Conf on Computer Communications And Networks Proc, pp. 540-546, (2001)
  • [7] Meester R., Roy R., Continuum Percolation, (1996)
  • [8] Haas Z.J., Halpern J.Y., Li E.L., Gossip-based ad hoc routing, IEEE/ACM Trans on Networking, 14, 3, pp. 479-791, (2006)
  • [9] Chen D., Li J., Li C., Novel MAC protocol for MIMO link ad hoc networks, Journal of Xidian University, 37, 3, pp. 385-390, (2010)
  • [10] Jiang D., Pan S., Xu J., Et al., Congestion adaptive protocol in mobile ad hoc networks, Journal of Nanjing University of Aeronautics & Astronautics, 42, 1, pp. 77-83, (2010)