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.
Table of Contents
I. INTRODUCTION
II. RELATED WORK
III. SIMULATION FRAMEWORK
A. Energy Calculations
B. Packet Delivered Plots
C. Number of Dead Nodes Plots
IV. RESULTS
V. DISCUSSIONS AND COMPARISONS
VI. CONCLUSIONS
Research Objectives and Themes
This study aims to evaluate and optimize the performance of a node weight-based congestion adaptive routing algorithm for mobile ad-hoc networks (MANETs) to minimize congestion-related issues such as high delay, overhead, and bandwidth degradation.
- Analysis of congestion in mobile ad-hoc networks.
- Evaluation of node weight-based routing protocols.
- Performance metrics including energy consumption, packet delivery ratio, and dead link analysis.
- Comparison of the proposed algorithm against established MANET protocols.
Excerpt from the Book
I. INTRODUCTION
The primary issue in mobile wireless ad hoc networks is network congestion and traffic blocking. In these networks, congestion is prompted when there is limited availability of resources. Moreover, in mobile ad hoc networks, packet transmissions suffer from interference and fading. This can be attributed to the shared wireless channel among the communicating entities. According to Shrivastava and Tomar (2016), the dynamic topology experienced in mobile ad hoc networks can also lead to interference and fading. In their study, Valarmathi and Chandrasekaran (2010) point out those transmission errors are likely to lead to burdens on the network since the packets in question have to be retransmitted.
With the proliferation of multimedia communications, there is an increasing need for communication gadgets to support multimedia communication in mobile ad hoc networks. The challenge of this kind of communication, as Jain and Kokate (2011) point out, is that the bulky amount of real-time traffic is more often in form of bursts. Moreover, these transmissions are bandwidth intensive and hence susceptible to congestion. The flip side of congestion is that it can lead to packet losses and bandwidth degradation. On recovery from congestion, mobile ad hoc networks tend to and waste time and energy. In their study, Shrivastava et al., (2011) illustrated that it is not possible to get rid of congestion problem completely from the networks. However, it is feasible to bind the impact of congestion on network efficiency. This can be done by using suitable procedures and rules for traffic flow. To minimize congestion in mobile ad hoc networks, routing algorithms are used.
Summary of Chapters
I. INTRODUCTION: Provides an overview of congestion challenges in mobile ad-hoc networks and the necessity for efficient routing algorithms.
II. RELATED WORK: Reviews existing literature on congestion recovery and multi-path routing techniques in MANETs.
III. SIMULATION FRAMEWORK: Details the methodologies used for calculating energy consumption, tracking packet delivery, and identifying dead nodes.
IV. RESULTS: Presents the performance data of the developed algorithm, comparing initial and final conditions through gradients and metrics.
V. DISCUSSIONS AND COMPARISONS: Evaluates the proposed model against standard protocols like AODV, OLSR, TORA, and DSR regarding bandwidth and energy efficiency.
VI. CONCLUSIONS: Summarizes the study's findings, highlighting the algorithm's effectiveness in maintaining high throughput and energy efficiency.
Keywords
Mobile Ad-hoc Networks, MANET, Congestion Adaptive Routing, Network Throughput, Energy Calculation, Dead Links, Packet Delivery Ratio, Routing Algorithms, Network Optimization, Traffic Blocking, Node Weight, Performance Evaluation, Bandwidth Degradation, Multi-path Routing, Data Aggregation
Frequently Asked Questions
What is the core focus of this research?
The research focuses on evaluating a node weight-based congestion adaptive routing algorithm designed to improve throughput and manage traffic congestion within mobile ad-hoc networks (MANETs).
What are the primary topics covered in the study?
The study covers network congestion, routing protocol categorization (proactive vs. on-demand), energy consumption modeling, and comparative performance analysis of routing algorithms.
What is the main goal or research question?
The primary goal is to determine if a node weight-based path calculation approach outperforms existing congestion control algorithms in maintaining network efficiency under heavy traffic loads.
Which scientific methodology is employed?
The research employs a simulation-based approach, using performance metrics such as energy consumption calculation, packet delivery ratios, and tracking dead node rates over specific time intervals.
What topics are discussed in the main body?
The main body details the simulation framework, the logic behind the energy calculation code, the plot parameters for packets and dead nodes, and a performance comparison with protocols like AODV and OLSR.
How is the work characterized by its keywords?
The work is characterized by terms related to MANET performance optimization, specifically focusing on energy efficiency and congestion management through adaptive routing.
How do 'dead nodes' affect the network performance in this study?
A node is considered 'dead' if it is no longer participating in packet forwarding. The study found that the proposed algorithm maintains zero dead nodes, ensuring all network nodes remain active.
What does the energy-time graph reveal about the algorithm?
The energy-time graph demonstrates that while initial energy consumption is higher due to network learning, the algorithm successfully minimizes energy usage once ideal routes are established.
- Arbeit zitieren
- Rebecca Nyasuguta Arika (Autor:in), A. Mindila (Autor:in), W. Cheruiyot (Autor:in), 2017, Evaluation of node weight-based congestion adaptive routing algorithm in MANET packet routing, München, GRIN Verlag, https://www.grin.com/document/377489
