Open Access Open Access  Restricted Access Subscription Access

A DCM Algorithm for AODV to Implement Energy Efficient Routing in MANET with Capacity Maximization


Affiliations
1 Department of Electronics and Communication Engineering, RajaRajeswari College of Engineering, Bengaluru, Karnataka, India
2 Department of Computer Science and Engineering, RajaRajeswari College of Engineering, Bengaluru, Karnataka, India
 

Ad-hoc networks are architecture-less networks because the sender and receiver nodes are mobile, and a node can act both as sender and receiver. Mobile Ad-hoc networks (MANET's) work on the principle of routing protocols that transmit the data packets from the sender to receiver using a routing path and various nodes that act as hops. Utilizing the multi-path routing will improve the throughput and route resilience than single-path and it has not been used widely thoroughly in MANET. Due to the broadcast nature of the node, there is increased power consumption which reduces the network's lifetime. Hence an efficient algorithm is needed for power control thereby reducing the interference and enhancing the performance of the network. Because of the dynamic network topology structure where nodes may join or leave the network leads to link and path failure. Other limitations are it requires some other node to act as a forwarding agent if the radio range is not in this transmission range. To avoid the link failure and to improve Throughput with reliable data delivery by considering route resilience the Novel routing algorithm is proposed here. Ad-hoc On-Demand Vector (AODV) protocol is a standard protocol used in MANETs. AODV has the issue of scalability, load balancing, link failure, security, Packet Delivery Ratio & Throughput decreases and more power consumption when the number of nodes increases and for high data rates. This standard protocol required various enhancements to compare different parameters of the network data transmission, and this work considers data rates, throughput, and power consumption and proposes a new algorithm called DCM Algorithm (Data rate, Communication range, Message size) for enhancing the performance of the AODV protocol. The Enhanced Version is called Intelligent Energy Efficient Enhanced AODV (IEEE-AODV) it identifies the malicious Black-hole node and provides security from black-hole attacks. This research design was simulated on an OMNet++ software tool, the simulation results and graphs of various enhancements are discussed. The results and comparison between the default AODV and IEEE-AODV are explained with different parameters, and it was found that the IEEE-AODV has higher throughput values and lower power consumption with good scalability.

Keywords

Algorithm, AODV, MANET, Mobile Ad-Hoc Networks, Power Consumption, Throughput.
User
Notifications
Font Size


  • A DCM Algorithm for AODV to Implement Energy Efficient Routing in MANET with Capacity Maximization

Abstract Views: 498  |  PDF Views: 1

Authors

Deepika J.
Department of Electronics and Communication Engineering, RajaRajeswari College of Engineering, Bengaluru, Karnataka, India
Rangaiah L.
Department of Electronics and Communication Engineering, RajaRajeswari College of Engineering, Bengaluru, Karnataka, India
Rangaiah L.
Department of Electronics and Communication Engineering, RajaRajeswari College of Engineering, Bengaluru, Karnataka, India
Jeyabalan S.
Department of Computer Science and Engineering, RajaRajeswari College of Engineering, Bengaluru, Karnataka, India
Jeyabalan S.
Department of Computer Science and Engineering, RajaRajeswari College of Engineering, Bengaluru, Karnataka, India

Abstract


Ad-hoc networks are architecture-less networks because the sender and receiver nodes are mobile, and a node can act both as sender and receiver. Mobile Ad-hoc networks (MANET's) work on the principle of routing protocols that transmit the data packets from the sender to receiver using a routing path and various nodes that act as hops. Utilizing the multi-path routing will improve the throughput and route resilience than single-path and it has not been used widely thoroughly in MANET. Due to the broadcast nature of the node, there is increased power consumption which reduces the network's lifetime. Hence an efficient algorithm is needed for power control thereby reducing the interference and enhancing the performance of the network. Because of the dynamic network topology structure where nodes may join or leave the network leads to link and path failure. Other limitations are it requires some other node to act as a forwarding agent if the radio range is not in this transmission range. To avoid the link failure and to improve Throughput with reliable data delivery by considering route resilience the Novel routing algorithm is proposed here. Ad-hoc On-Demand Vector (AODV) protocol is a standard protocol used in MANETs. AODV has the issue of scalability, load balancing, link failure, security, Packet Delivery Ratio & Throughput decreases and more power consumption when the number of nodes increases and for high data rates. This standard protocol required various enhancements to compare different parameters of the network data transmission, and this work considers data rates, throughput, and power consumption and proposes a new algorithm called DCM Algorithm (Data rate, Communication range, Message size) for enhancing the performance of the AODV protocol. The Enhanced Version is called Intelligent Energy Efficient Enhanced AODV (IEEE-AODV) it identifies the malicious Black-hole node and provides security from black-hole attacks. This research design was simulated on an OMNet++ software tool, the simulation results and graphs of various enhancements are discussed. The results and comparison between the default AODV and IEEE-AODV are explained with different parameters, and it was found that the IEEE-AODV has higher throughput values and lower power consumption with good scalability.

Keywords


Algorithm, AODV, MANET, Mobile Ad-Hoc Networks, Power Consumption, Throughput.

References





DOI: https://doi.org/10.22247/ijcna%2F2021%2F209991