Energy Efficient Multipath Routing Protocol for Mobile Ad-Hoc Network Using the Fitness Function

Taha, Aqeel; Alsaqour, Raed; Uddin, Mueen; Abdelhaq, Maha; Saba, Tanzila

doi:10.1109/access.2017.2707537

Cited by 173 publications

(113 citation statements)

References 22 publications

Supporting

Mentioning

108

Contrasting

Order By: Relevance

“…When λ > 1, the forwarding node carries multiple message copies. The proportion of the delivery probability P i wt of each node and the number of copies λ i that each relay node obtains are calculated by (10) and (11), where P (U, D) denotes P (F, D) or P (R i ,D) :…”

Section: Fig 3 Encountering Duration Timementioning

confidence: 99%

An Efficient location‐aware routing approach in opportunistic networks

Wang

et al. 2020

IEEJ Transactions Elec Engng

View full text Add to dashboard Cite

An opportunistic network is a kind of self‐organizing network that makes use of the encountering opportunities to realize short‐distance wireless communication. Because of the intermittent connectivity between nodes and dynamic network topology, how to devise a reliable and efficient routing approach has become a challenging issue. However, the periodic update mechanism of the node's location information in the existing works costs too much. To address this issue, we propose a location‐aware opportunistic routing (LAOR) approach. In the the proposed LAOR, we first establish a location‐aware prediction model based on the Markov process to predict the node's next location. Then we devise a decision‐making scheme of message forwarding to select the desired relay nodes based on the node's delivery probability. In addition, we introduce a dynamic buffer management strategy to determine the message priority. Finally, we validate the effectiveness of our proposed model and the high efficiency of the LAOR approach. Simulation results demonstrate that the proposed LAOR outperforms the existing Epidemic, Prophet, history‐based prediction routing, and location prediction‐based forwarding for routing using Markov chain algorithms in terms of delivery ratio, overhead ratio, and the number of messages dropped. © 2020 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

show abstract

Section: Fig 3 Encountering Duration Timementioning

confidence: 99%

An Efficient location‐aware routing approach in opportunistic networks

Wang

et al. 2020

IEEJ Transactions Elec Engng

View full text Add to dashboard Cite

show abstract

“…The functionality of AODV protocol is explained in [12]. The authors here proposed an new protocol using AODV as the base protocol where a fitness function is used.…”

Section: Ad Hoc On Demand Distance Vector Protocolmentioning

confidence: 99%

Secured Approach towards Reactive Routing Protocols Using Triple Factor in Mobile Ad Hoc Networks

Belgaum¹,

Musa²,

Su’ud³

et al. 2019

AETiC

View full text Add to dashboard Cite

Routing protocols are used to transmit the packets from the source to the destination node in mobile ad hoc networks. The intruders seek chance to pierce into the network and becomes a cause of malfunctioning in the network. These protocols are always prone to attacks. During the phases of routing in different types of protocols, each of the attack finds a way to degrade the performance of the routing protocols. The reactive routing protocols DSR and AODV have lot of similar features and so are consideredin this study. In order to transmit the packets safely, a secured approach using triple factor has been proposed. This triple factor computes the trust by using the direct information then verifies the reputation by collecting the information from the neighbouring nodes called distributed factor and uses cryptographic algorithm to ensure security. And to ensure that there are routes available to perform the routing process, the reasons for such attacks are studied so as to re-integrate back the nodes in to the network, once it has repented for being malicious before. The availability of routes increases the throughput.

show abstract

“…Comparing with other BEB algorithms, our proposed algorithm effectively decrease the collision probability and thus improving the efficiency of nodes competing with limited channel resources. Figure 4 shows that the throughput of our RCSS-MAC method is better than Ad Hoc On Demand Multipath Distance Vector with the Fitness Function (FF-AOMDV), 20 ad hoc on-demand multipath routing with lifetime maximization (AOMR-LM), 21 and ACW techniques. The dynamic setting of CW management algorithm decreases the collision probability and maximizes the throughput performance in the network.…”

Section: Figurementioning

confidence: 99%

Capacity utilization based on contention window management in mobile ad hoc network

M¹,

Saleh

2019

Int J Numerical Modelling

View full text Add to dashboard Cite

A major challenge to the mobile ad hoc network (MANET) is the ability to efficiently utilize the available capacity. The exposed terminal problem (ETP) and the hidden terminal problem (HTP) are considered as major concerns in the media access control (MAC) layers of MANET. During transmission, there is an increase in energy consumption, unnecessary delay, overhead, and the number of retransmission due to the request to send (RTS) packet collision. To eliminate these problems, we have developed an algorithm called receiver collision sensing scheme in multiple access control (RCSS‐MAC) for collisions detection by the receiver. This method uses appeal for RTS (ARTS) packet to detect unsuccessful RTS packet. Here, we use only the minimal number of ARTS to reduce unnecessary retransmission, delay, and RTS collision. The performance of this method can be improved using the contention window (CW) management scheme to reset and renovate the failed system. In RCSS‐MAC, an additional field (victory rate) in MAC frame is utilized to control the CW management to reflect the network condition in and around the receiver. Simulation is carried out under the open‐source second version of the network simulator (NS2). As a result, RCSS‐MAC algorithm achieves better performance than conventional techniques in terms of delay, throughput, and energy consumption and network lifetime.

show abstract

Energy Efficient Multipath Routing Protocol for Mobile Ad-Hoc Network Using the Fitness Function

Cited by 173 publications

References 22 publications

An Efficient location‐aware routing approach in opportunistic networks

An Efficient location‐aware routing approach in opportunistic networks

Secured Approach towards Reactive Routing Protocols Using Triple Factor in Mobile Ad Hoc Networks

Capacity utilization based on contention window management in mobile ad hoc network

Contact Info

Product

Resources

About