A hop count based heuristic routing protocol for mobile delay tolerant networks.

ScientificWorldJournal

Information Engineering College, Qingdao University, Qingdao, Shandong 266071, China.

Published: April 2015

Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4090473PMC
http://dx.doi.org/10.1155/2014/603547DOI Listing

Publication Analysis

Top Keywords

routing protocol
12
hop count
8
count based
8
based heuristic
8
heuristic routing
8
delay tolerant
8
tolerant networks
8
routing
6
heuristic
4
protocol mobile
4

Similar Publications

Wireless sensor networks (WSNs) are imperative to a huge range of packages, along with environmental monitoring, healthcare structures, army surveillance, and smart infrastructure, however they're faced with numerous demanding situations that impede their functionality, including confined strength sources, routing inefficiencies, security vulnerabilities, excessive latency, and the important requirement to keep Quality of Service (QoS). Conventional strategies generally goal particular troubles, like strength optimization or improving QoS, frequently failing to provide a holistic answer that effectively balances more than one crucial elements concurrently. To deal with those challenges, we advocate a novel routing framework that is both steady and power-efficient, leveraging an Improved Type-2 Fuzzy Logic System (IT2FLS) optimized by means of the Reptile Search Algorithm (RSA).

View Article and Find Full Text PDF

Congestion avoidance in 6G networks with V Gradient Geocast Routing Protocol.

Sci Rep

January 2025

School of Computer Science Engineering and Information Systems, Vellore Institute of Technology, Vellore, India.

This is a moment of heavy necessity for a dependable internet connection in the modern world, which is used to engage in business dealings, communicate with other people, entertain oneself, and lead a daily life. Therefore, a Wi-Fi 6 router must have an internal wire-free connection within a house or business. However, as they depend on the weather and are installed in ways that expose them to infiltration, they are vulnerable.

View Article and Find Full Text PDF

In clustered cognitive radio sensor networks (CRSNs), availability of free channels, spectrum sensing and energy utilization during clustering and cluster head (CH) selection is essential for fairness of time and event-driven data traffic. The existing multi-hop routing protocols in CRSNs generally adopt a perfect spectrum sensing which is not same in the practical spectrum sensing of nodes in real networks. High imbalance in residual energy between the selected CHs negatively impacts the delivery of data packets.

View Article and Find Full Text PDF

This paper examines the impact of hetterogeneous wireless sensor networks (WSNs) on wireless communication systems, with a focus in Internet of Things (IoT) enabled smart grids. It introduces a novel approach for the fair distribution of energy and computational resources among sensor nodes (SNs), which is crucial for extending network lifespan, enhancing performance, and ensuring SG stability. The research highlights the role of initial energy and processing capacities of SNs.

View Article and Find Full Text PDF

In opportunistic IoT (OppIoT) networks, non-cooperative nodes present a significant challenge to the data forwarding process, leading to increased packet loss and communication delays. This paper proposes a novel Context-Aware Trust and Reputation Routing (CATR) protocol for opportunistic IoT networks, which leverages the probability density function of the beta distribution and some contextual factors, to dynamically compute the trust and reputation values of nodes, leading to efficient data dissemination, where malicious nodes are effectively identified and bypassed during that process. Simulation experiments using the ONE simulator show that CATR is superior to the Epidemic protocol, the so-called beta-based trust and reputation evaluation system (denoted BTRES), and the secure and privacy-preserving structure in opportunistic networks (denoted PPHB+), achieving an improvement of 22%, 15%, and 9% in terms of average latency, number of messages dropped, and average hop count, respectively, under varying number of nodes, buffer size, time to live, and message generation interval.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!