A DVR-Based Routing Protocol with Special Neighbours for Mobile Ad-Hoc Networks

Debbarma, Mrinal Kanti; Debbarma, Jhunu; Sen, Santanu; Roy, Sudipta

doi:10.1109/iscbi.2013.54

Cited by 2 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition to the aforementioned configurations, each node is equipped with both the proposed RDEC routing scheme and an existing DVR routing method module [32]. The inclusion of the RDEC scheme enables enhanced decision-making by considering multiple metrics that directly impact battery consumption, total energy consumption, and network throughput.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…Traditional routing schemes and their modified improvements, such as the distance-vector routing (DVR) protocol [32] and the ad hoc on-demand distance vector (AODV) routing protocol, calculate local maxima, i.e., the shortest path. However, it is crucial to consider a composite metric that takes into account not only the best path but also the longevity of the device in terms of energy consumption [33].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

RDEC: Routing Decisions Through Energy-Cost Estimation for IIoT and IWSNs in SDN-Managed Industry 4.0

Almuntasheri,

Alenazi

2023

IEEE Access

View full text Add to dashboard Cite

The fourth industrial revolution has brought about automation and a shift from wireless sensor networks (WSN) to the industrial Internet of Things (IIoT), resulting in data-oriented decision-making. However, processing large amounts of data and relying on batteries can lead to communication failure, process disruptions, and even catastrophic disasters. To address this, energy-aware smart communication protocols are critical that prolong the lifespan of devices. This paper proposes a novel energy-cost-based routing protocol called RDEC: routing decisions through energy-cost estimation, which utilizes softwaredefined networks (SDNs) to centralize routing path decision-making. The RDEC algorithm considers the energy required to transmit data and the average battery consumption of intermediate nodes, resulting in a significant reduction in battery consumption by up to six times compared to existing solutions. Furthermore, the proposed approach reduces transmission time by over 50% and doubles the throughput over previous routing methods. Overall, the proposed RDEC algorithm increases the communication lifespan of batteryconstrained devices while ensuring connectivity. In summary, the proposed RDEC algorithm provides an effective solution to address the challenges of energy consumption and communication failures in small battery-dependent devices, making it a significant contribution to the field of Industry 4.0.

show abstract

Section: Performance Evaluationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

RDEC: Routing Decisions Through Energy-Cost Estimation for IIoT and IWSNs in SDN-Managed Industry 4.0

Almuntasheri,

Alenazi

2023

IEEE Access

View full text Add to dashboard Cite

show abstract

“…The most important among them is the key concept of categorization, by each router, of its neighbouring routers as belonging to one or more categories of special neighbours [16]. With the help of the special neighbours, a router dynamically monitors its neighbours and maintains its current knowledge about neighbourhood.…”

Section: Scn_mcn_mcnbcn_detection Algorithmmentioning

confidence: 99%

A New Approach to Overcome the Weakness in DVR Protocol Based on Component Neigbhour in MANET

Barma

Debbarma

Sen³

et al. 2014

2014 International Conference on Soft Computing and Machine Intelligence

Self Cite

View full text Add to dashboard Cite

By using the distance vector routing (DVR) protocols, each router over internetwork send the neighbouring routers, the information about destination that it knows how to reach and maintains a list of all destinations that only contains the cost of getting to that destination, and the next node to send the messages to. Thus, the source node only knows to which node to hand the packet, which in turn knows the next node (Next hop). This approach has an advantage of massively reduced storage costs compared to link-state algorithms. DVR algorithms are easier to implement and required less amount of required storage space and the actual determination of the route is based on the Bellman-Ford algorithm. Our objective was primarily intended to remove the weaknesses inherent in the widely used DVR algorithm, based on the well-known Bellman-Ford shortest path algorithm. In this paper, we introduce a new technique to solve the weakness in DVR named as component based neighbour routing that uses to create the distance vector routing table that would be truly dynamic, robust and free from the various limitations that have been discussed.

show abstract

A DVR-Based Routing Protocol with Special Neighbours for Mobile Ad-Hoc Networks

Cited by 2 publications

References 9 publications

RDEC: Routing Decisions Through Energy-Cost Estimation for IIoT and IWSNs in SDN-Managed Industry 4.0

RDEC: Routing Decisions Through Energy-Cost Estimation for IIoT and IWSNs in SDN-Managed Industry 4.0

A New Approach to Overcome the Weakness in DVR Protocol Based on Component Neigbhour in MANET

Contact Info

Product

Resources

About