A Trusted Waterfall Framework Based Peer to Peer Protocol for Reliable and Energy Efficient Data Transmission in MANETs

Mohanakrishnan, Usha; Bhagavathiperumal, Ramakrishnan; Jayaraman, Sathiamoorthy

doi:10.1007/s11277-018-5829-8

Cited by 15 publications

(4 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In a 1000 m × 1000 m space, the nodes are scattered using OPNET. Some authors propose Improved Ant Colony based Multi constraint QoS Energy Routing (IAMQER) [25] as a new, more efficient, and more efficient QoS energy-saving routing method for designing multi-constrained Quality of Service (QoS) routes [26,27], while simultaneously increasing throughput and reducing energy usage. It is a heuristic method used to calculate the most efficient path.…”

Section: Related Workmentioning

confidence: 99%

Efficient Optimal Routing Algorithm Based on Reward and Penalty for Mobile Adhoc Networks

Anubha¹,

Bedi²,

Khan³

et al. 2023

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

Mobile adhoc networks have grown in prominence in recent years, and they are now utilized in a broader range of applications. The main challenges are related to routing techniques that are generally employed in them. Mobile Adhoc system management, on the other hand, requires further testing and improvements in terms of security. Traditional routing protocols, such as Adhoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR), employ the hop count to calculate the distance between two nodes. The main aim of this research work is to determine the optimum method for sending packets while also extending life time of the network. It is achieved by changing the residual energy of each network node. Also, in this paper, various algorithms for optimal routing based on parameters like energy, distance, mobility, and the pheromone value are proposed. Moreover, an approach based on a reward and penalty system is given in this paper to evaluate the efficiency of the proposed algorithms under the impact of parameters. The simulation results unveil that the reward penalty-based approach is quite effective for the selection of an optimal path for routing when the algorithms are implemented under the parameters of interest, which helps in achieving less packet drop and energy consumption of the nodes along with enhancing the network efficiency.

show abstract

Section: Related Workmentioning

confidence: 99%

Efficient Optimal Routing Algorithm Based on Reward and Penalty for Mobile Adhoc Networks

Anubha¹,

Bedi²,

Khan³

et al. 2023

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

show abstract

“…Route maintenance and route discovery are essential for maintaining the route for longer periods. 43 For route discovery, a flooding scheme is usually implemented for sending and receiving the route request and route reply packets. Based on the route discovery scheme, the routing methods are categorized into proactive and reactive method.…”

Section: Related Workmentioning

confidence: 99%

SecRIP: Secure and reliable intercluster routing protocol for efficient data transmission in flying ad hoc networks

Bhardwaj

Kaur

Vashisht

et al. 2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Unmanned aerial vehicles (UAVs) come up with eminent opportunities for military and civilian applications. Such opportunities come with unique challenges. The high mobility of UAVs leads to the frequent change in the network topology that results in packet loss or routing path failure, and so on. Moreover, secure routing is one of the most important features while organizing wireless communication among UAVs. To counter these challenges, a secure and reliable routing protocol (SecRIP) for the flying ad hoc network is proposed for efficient and reliable data transfer. This SecRIP works toward the enhancement of the quality of service (QoS) and quality of experience (QoE) metrics. The SecRIP works on two algorithms: (i) a chaotic algae algorithm and (ii) dragonfly algorithm; these algorithm serves the functionality of cluster selection, management, and data transmission in intercluster. The proposed technique is compared with other existing techniques using a network simulator. The results show that the proposed technique is capable of maintaining the higher QoS and the QoE standards and also helps the nodes conserve their power without compromising on the performance. The simulated results show improvement as it decreases the delay incurred in SecRIP is 24%, and routing overhead is 19%, where the PDR of SecRIP is increased by 32% in comparison with existing protocols. In an extreme case, when node density increases, the SecRIP helps to limits the delay to 41%, and the PDR is 28% higher than the other existing protocols. Finally, the result demonstrates that the SecRIP protocol achieves secure and reliable data transmission.

show abstract

“…To handle the problem of energy efficiency in the network, many researches Int J Elec & Comp Eng ISSN: 2088-8708 ❒ 6441 have adopted clustering, which refers to group sensors into clusters mastered by a cluster head (CH). This later is gathers cluster members data, aggregate it and route it to the sink [17]- [19]. Meanwhile, when it comes to vast monitored fields, the risk of data loss increases, adopting direct transmissions to the sink.…”

Section: Introductionmentioning

confidence: 99%

Novel reliable and dynamic energy-aware routing protocol for large scale wireless sensor networks

Qabouche

Sahel

Badri

et al. 2022

IJECE

View full text Add to dashboard Cite

<p>Wireless sensor networks (WSN) are made up of an important number of sensors, called nodes, distributed in random way in a concerned monitoring area. All sensor nodes in the network are mounted with limited energy sources, which makes energy harvesting on top of the list of issues in WSN. A poor communication architecture can result in excessive consumption, reducing the network lifetime and throughput. Centralizing data collection and the introduction of gateways (GTs), to help cluster heads (CHs), improved WSN life time significantly. However, in vast regions, misplacement and poor distribution of GTs wastes a huge amount of energy and decreases network’s performances. In this work, we describe a reliable and dynamic with energy-awareness routing (RDEAR) protocol that provides a new GT’s election approach taking into consideration CHs density, transmission distance and energy. Applied on 20 different networks, RDEAR reduced the overall energy consumption, increased stability zone and network life time as well as other compared metrics. Our proposed approach increased network’s throughput up to 75.92% , 67.7% and 9.78% compared to the low energy adaptive clustering hierarchy (LEACH), distributed energy efficient clustering (DEEC) and static multihop routing (SMR), protocols, respectively.</p>

show abstract

A Trusted Waterfall Framework Based Peer to Peer Protocol for Reliable and Energy Efficient Data Transmission in MANETs

Cited by 15 publications

References 22 publications

Efficient Optimal Routing Algorithm Based on Reward and Penalty for Mobile Adhoc Networks

Efficient Optimal Routing Algorithm Based on Reward and Penalty for Mobile Adhoc Networks

SecRIP: Secure and reliable intercluster routing protocol for efficient data transmission in flying ad hoc networks

Novel reliable and dynamic energy-aware routing protocol for large scale wireless sensor networks

Contact Info

Product

Resources

About