Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks
The shortest path routing does not balance the routing load on the links according to their capacity thus some links experience more traffic than they can accommodate, which congests the network. Hence there is a need to balance the traffic load on all links according to their capacities. By combini...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
Institute of Electrical and Electronics Engineers Inc.
2015
|
| Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84944412115&doi=10.1109%2fI4CT.2015.7219617&partnerID=40&md5=e5a1294a315bf778e4aa2db59e2d5639 http://eprints.utp.edu.my/31520/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The shortest path routing does not balance the routing load on the links according to their capacity thus some links experience more traffic than they can accommodate, which congests the network. Hence there is a need to balance the traffic load on all links according to their capacities. By combining physical layer capacity with MAC layer estimated congestion value, a new delay-based load-balancing routing (DLBR) algorithm is proposed in this paper. A new routing metric i.e. The end-to-end delay (EED) is introduced, which estimates the congestion level at the MAC and physical layers. The DLBR then uses this metric to select high capacity links for data forwarding, thus providing paths with less congested nodes and high capacity links. Simulations have been conducted on MATLAB to study the performance of DLBR. Results show that for the same network load, DLBR outperforms the shortest path in terms of the average delay and packet loss. © 2015 IEEE. |
|---|