Evaluation of node weight-based congestion adaptive routing algorithm in MANET packet routing

Research Paper (postgraduate) from the year 2017 in the subject Instructor Plans: Computing / Data Processing / IT / Telecommunication, language: English, abstract: Mobile ad-hoc networks are valuable in situations where communication support is required but there are no fixed infrastructures that are in existence and movement of communicating parties is permitted. This is a typical case in the military where the personnel move randomly in the battle field but need to maintain constant communication to the commanding stations. Unfortunately, mobile ad-hoc networks exhibit unexpected behavior when transmitting multiple data streams under heavy traffic load, more so when these data streams are destined to common terminal. Therefore, congestion is one of the most limiting factors for efficient packet transmissions over wireless ad-hoc networks. This is because it introduces problems such as long delay, high overhead and low throughput over the communication channels. To surmount these issues, researchers have proposed many congestion aware and congestion adaptive routing protocols. One of such a congestion control algorithm is the one based on node weight for the computation of usable network routes. To achieve this objective, number of dead links, um of energy for packet transmission over a mobile ad hoc network, and the number of packets delivered over the network were used as performance metrics. The results obtained indicated that the node weight-based path calculation approach yields better performance compared to the existing congestion control algorithms.