MDPI - Publisher of Open Access Journals

16 pages, 1002 KiB

Open AccessArticle

Optimizing Energy Efficiency in Opportunistic Networks: A Heuristic Approach to Adaptive Cluster-Based Routing Protocol

by Meisam Sharifi Sani, Saeid Iranmanesh, Hamidreza Salarian, Faisel Tubbal and Raad Raad

Information 2024, 15(5), 283; https://doi.org/10.3390/info15050283 - 16 May 2024

Cited by 4 | Viewed by 1711

Opportunistic Networks (OppNets) are characterized by intermittently connected nodes with fluctuating performance. Their dynamic topology, caused by node movement, activation, and deactivation, often relies on controlled flooding for routing, leading to significant resource consumption and network congestion. To address this challenge, we propose the Adaptive Clustering-based Routing Protocol (ACRP). This ACRP protocol uses the common member-based adaptive dynamic clustering approach to produce optimal clusters, and the OppNet is converted into a TCP/IP network. This protocol adaptively creates dynamic clusters in order to facilitate the routing by converting the network from a disjointed to a connected network. This strategy creates a persistent connection between nodes, resulting in more effective routing and enhanced network performance. It should be noted that ACRP is scalable and applicable to a variety of applications and scenarios, including smart cities, disaster management, military networks, and distant places with inadequate infrastructure. Simulation findings demonstrate that the ACRP protocol outperforms alternative clustering approaches such as kRop, QoS-OLSR, LBC, and CBVRP. The analysis of the ACRP approach reveals that it can boost packet delivery by 28% and improve average end-to-end, throughput, hop count, and reachability metrics by 42%, 45%, 44%, and 80%, respectively. Full article

(This article belongs to the Special Issue Advances in Communication Systems and Networks)

► Show Figures

Figure 1

18 pages, 1653 KiB

Open AccessArticle

Efficient Processing of k-Hop Reachability Queries on Directed Graphs

by Xian Tang, Junfeng Zhou, Yunyu Shi, Xiang Liu and Keng Lin

Appl. Sci. 2023, 13(6), 3470; https://doi.org/10.3390/app13063470 - 8 Mar 2023

Cited by 2 | Viewed by 2015

Abstract

Given a directed graph, a k-hop reachability query,

u \overset{? k}{\to} v

, is used to check for the existence of a directed path from

u

v

that has a length of at most

k

. Addressing k-hop reachability [...] Read more.

Given a directed graph, a k-hop reachability query,

u \overset{? k}{\to} v

, is used to check for the existence of a directed path from

u

v

that has a length of at most

k

. Addressing k-hop reachability queries is a fundamental task in graph theory and has been extensively investigated. However, existing algorithms can be inefficient when answering queries because they require costly graph traversal operations. To improve query performance, we propose an approach based on a vertex cover. We construct an index that covers all reachability information using a small set of vertices from the input graph. This allows us to answer k-hop reachability queries without performing graph traversal. We propose a linear-time algorithm to quickly compute a vertex cover, S, which we use to develop a novel labeling scheme and two algorithms for efficient query answering. The experimental results demonstrate that our approach significantly outperforms the existing approaches in terms of query response time. Full article

(This article belongs to the Section Computing and Artificial Intelligence)

► Show Figures

Figure 1

Search Results (2)

Further Information

Guidelines

MDPI Initiatives

Follow MDPI

Saved Queries

Search Filter Reset All

Years

Feature Papers

Subjects

Journals

Article Types

Countries / Regions

Search Results (2)

Further Information

Guidelines

MDPI Initiatives

Follow MDPI