A Cooperative Broadcast Algorithm Based on the Successful Broadcasting Ratio and Residual Energy of Neighbor Nodes in Mobile Ad Hoc Networks

Routing Optimization in mobile ad hoc networks is an ever-demanding task. Mobile ad hoc networks are highly dynamic topology natured and hence several routing protocols meet the challenge of link quality, delay and energy conscious routing. This paper proposes a link quality, delay and energy conscious routing approach based on ant colony optimization. Based on the estimated link quality, delay and residual energy of the nearby nodes, Adaptive node stability (ANS) mechanism is mathematically modeled to make the routing strategy. LQDEARP selects the efficient node based on the ANS mechanism and sends the data packets through that node. Simulation results proved that LQDEARP reduces delay and energy consumption and increases packet delivery ratio than that of the AODV and DECRP protocol.

Download Full-text

Energy-aware ant colony optimization based routing for mobile ad hoc networks

10.32920/ryerson.14664300.v1 ◽

2021 ◽

Author(s):

Ssowjanya Harishankar

Keyword(s):

Ad Hoc Networks ◽

Mobile Ad Hoc Networks ◽

Routing Protocol ◽

Ad Hoc ◽

Energy Resource ◽

Residual Energy ◽

Energy Aware ◽

Manet Routing ◽

Mobile Ad Hoc ◽

Hoc Networks

In mobile ad hoc networks, nodes are mobile and have limited energy resource that can quickly deplete due to the multi-hop routing activities, which may gradually lead to an un-operational network. In the past decades, the hunt for a reliable and energy-efficient MANET routing protocol has been extensively researched. In this thesis, a novel routing scheme for MANETs (so-called MAntNet) has been proposed, which is based on the AntNet approach. Precisely, the AntNet algorithm is modified in such a way that the routing decisions are facilitated based on the available nodes energy. Additionally, some energy-aware conditions are introduced in MAntNet and replicated in the conventional AODV routing protocol for MANETs. The resulting energy-aware M-AntNet (E-MAntNet) and energy-aware AODV(E-AODV) are analyzed using NS2 simulations. The results show that E-MAntNet performs significantly better than MAntNet and E-AODV both in terms of network residual energy and number of established connections in the network.

Download Full-text

Residual energy-based OLSR in mobile ad hoc networks

2011 International Conference on Multimedia Technology ◽

10.1109/icmt.2011.6002054 ◽

2011 ◽

Cited By ~ 3

Author(s):

Kouji Hirata Wardi ◽

Yoshinobu Higami ◽

Shin-ya Kobayashi

Keyword(s):

Ad Hoc Networks ◽

Mobile Ad Hoc Networks ◽

Ad Hoc ◽

Residual Energy ◽

Mobile Ad Hoc ◽

Hoc Networks

Download Full-text

Energy-aware ant colony optimization based routing for mobile ad hoc networks

10.32920/ryerson.14664300 ◽

2021 ◽

Author(s):

Ssowjanya Harishankar

Keyword(s):

Ad Hoc Networks ◽

Mobile Ad Hoc Networks ◽

Routing Protocol ◽

Ad Hoc ◽

Energy Resource ◽

Residual Energy ◽

Energy Aware ◽

Manet Routing ◽

Mobile Ad Hoc ◽

Hoc Networks

In mobile ad hoc networks, nodes are mobile and have limited energy resource that can quickly deplete due to the multi-hop routing activities, which may gradually lead to an un-operational network. In the past decades, the hunt for a reliable and energy-efficient MANET routing protocol has been extensively researched. In this thesis, a novel routing scheme for MANETs (so-called MAntNet) has been proposed, which is based on the AntNet approach. Precisely, the AntNet algorithm is modified in such a way that the routing decisions are facilitated based on the available nodes energy. Additionally, some energy-aware conditions are introduced in MAntNet and replicated in the conventional AODV routing protocol for MANETs. The resulting energy-aware M-AntNet (E-MAntNet) and energy-aware AODV(E-AODV) are analyzed using NS2 simulations. The results show that E-MAntNet performs significantly better than MAntNet and E-AODV both in terms of network residual energy and number of established connections in the network.

Download Full-text