Least-mean-square routing with load-balancing for wireless ad hoc networks

• Published in: Journal of Shanghai University Vol. 12; no. 2; pp. 131 - 135
• Main Author: 陈西豪 陈惠民 周伟
• Format: Journal Article
• Language: English
• Published: Heidelberg Shanghai University Press 01.04.2008
• Subjects: Classical Mechanics; Engineering; Environment; hoc网络; Life Sciences; Materials Science; Mathematical and Computational Engineering; Mechatronics; 数学物理; 无线ad; 最小均方负载均衡路由算法; 计算方法; routing; route REQuest (RREQ); ad hoc network; least-mean-square routing (LMSR)
• ISSN: 1007-6417; 1863-236X
• DOI: 10.1007/s11741-008-0209-2

Routing algorithm is a challenge for a mobile ad hoc network （MANET）, but current routing protocols for MANETs consider the path with minimum number of hops as the optimal path to a given destination. This strategy does not balance the traffic load over a MANET, and may result in some disadvantages such as creating congested area, depleting power faster and enlarging time delay in the nodes with heavy duties. In this paper, we propose a routing scheme that balances the load over the network by selecting a path based on its mean load-square, the proposed routing metric can reflect not only the load of the path, but also the load distribution along the path. Simulation results show effectiveness of this routing scheme on balancing the load over all nodes in the network.