Data dissemination in a VANETs network requires a meticulous process to ensure a high quality of service and eliminate hazardous conditions due to congestion or a broadcast storm. Considering multi-metric approaches and their implicit conflicting nature, it is necessary to handle this through effective multi-objective optimization algorithms. An effective optimization can be handled using a meta-heuristic approach with a high level of solution interactions. For this purpose, firefly was selected, which is a type of meta-heuristic search algorithm. Several developments of the firefly optimization were added to increase its capability to find more dominating solutions, namely, objective decomposition, archive management, and controlled mutation for exploration and exploitation balance. This developed multi-objective optimization was designated as adaptive jumping multi-objective firefly algorithm (AJ-MOFA). Afterwards, AJ-MOFA was integrated with a clustering and forwarding mechanism (CFM). This mechanism includes three main components. The first is clustering, which uses arbitration based on the cluster head score; the second is a forwarding mechanism that uses probabilistic forwarding and the third is AJ-MOFA. The solution space design in CFM combined two variables: the first is the probability of forwarding and the second is the maximum number of nodes within one cluster. The metrics to be incorporated in the multi-objective optimizations are the packet delivery ratio (PDR), the end-to-end delay (E2E-delay) and the number of dropped packets. Comparing both AJ-MOFA and CFM with benchmarks using multi-objective optimization and networking metrics reveals the superiority in most evaluation measures, which makes them promising algorithms for data dissemination in VANETs. The results showed an accomplished PDR of 60% and an E2E delay of 6.6 seconds, while the number of dropped packets was almost nine for the entire running time of the experiment, comparing a similar or lower performance of the benchmarks for these metrics.
Vehicular Ad Hoc Networks (VANETs) is an emerging technology that can be applied in intelligent transportation systems. Routing protocols are essential for obtaining reliable VANET networks. This article proposes a novel framework, designated as Reliability Aware Multi-Objective Optimization Based VANETs Routing (RAMO). The framework includes three levels: the first is the simulation of the VANET system; the second is the routing criteria, based on reliability and geometrics; the third level is the routing algorithm. The actual network is the next stage. Furthermore, the framework includes an optimization block that controls the parameters of each of the reliability, geometrical and routing blocks. The optimization is presented under the multi-objective perspective and based on the development of a novel variant of multi-objective harmony searching. This has been designated as Enhanced Gaussian Mutation Harmony Searching (EGMHS), which includes Gaussian mutation, objective decomposition and a harmony memory extraction algorithm. The evaluation was performed based on two levels. The first was the EGMHS evaluation using nine benchmarking mathematical functions, while the second was the RAMO evaluation based on the network simulator. The metrics obtained, including set coverage, delta metric, hyper-volume, packet delivery ratio (PDR) and end-to-end (E2E) delay, demonstrate the superiority over the baseline approaches of both EGMHS and RAMO with EGMHS.
The large network architecture of today consists of thousands of computers connected together through many interconnecting router and switches. As many of them communicate concurrently, congestion over the channels may increase. In order to maintain the fairness among the transmission control protocol (TCP) based packets being sent, during congestion each flow of communication must be treated fairly. The most popular scheduling scheme implemented today is the drop-tail, which it cannot guarantee fairness and as the queues get full; the latency increases. Therefore, packet drops cause reduction in throughput of those flows. Research is ongoing to find an Active Queue Management (AQM) scheme that can solve this fairness issue, though fairness is not the only important feature that is looked on. Latency is another feature, that is important as well as the packet loss ratio. In this paper, the performance of network metrics between the drop-tail and the behavior of different Active queue management schemes (PFIFO, RED, ARED, CoDel) in large networks is evaluated using the open source discrete network simulator (NS-3). The results show that the throughput of CoDel and RED is the highest with the minimum latency. Moreover, the simulation results show also that Adaptive Active Queue Management (AAQM) provides postponing congestion and high link utilization whilst maintaining packet loss. The proposed scenario could be extended to evaluate real large network. The results prove the RED and CoDel have the best throughput and less latency comparing to others. Moreover, the ARED presents better performance when it compared to RED.
Advancements in Wireless Sensor Network (WSN) technology has allowed lightweight, inexpensive sensor nodes to track diverse physical and environmental environments, data, and so forth. Wireless correspondence, and delivery. The clustering of WSNs has proved to be an efficient method for enhancing data processing and scalability for broad WSNs. Clustering often retains the sensors’ minimal energy supplies. The aim of the paper to present the concept of WSN and their Characteristics and discuss the concept of the cluster in a wireless sensor network.
1 February 2024 in Bulletin of Electrical Engineering and Informatics
Vehicular ad hoc networks (VANETs) provide a robust infrastructure for intelligent transportation system (ITS) applications. VANET communication involves vehicle-to-vehicle and vehicle-to-infrastructure connections, primarily with roadside units (RSUs). Analyzing cognitive radio (CR)-VANET studies revealed two key performance issues: high energy consumption and latency. To address these challenges, we propose a novel approach: link stability and mobility prediction-based clustered CR-VANETs, known as LMCCR-VANET. LMCCR-VANET consists of four main components: CR-VANET construction, clustering model, speed-based mobility prediction, and link-based multipath routing. Initially, we establish cluster-based CR-VANETs to analyze and mitigate spectrum scarcity and power utilization problems in VANETs. Mobility prediction evaluates vehicle speed variations and predictions. Finally, employing link stability-based multipath routing (LSMR) in conjunction with the fuzzy interference model and ad hoc on-demand multipath distance vector (AOMDV) routing protocol ensures stable and efficient routing. Experimental results showcase the superiority of LMCCR-VANET. It exhibits enhanced energy efficiency, delivery rates, reduced energy consumption, end-to-end latency, and routing overhead when compared to recent works such as SCCR-VANET, CFCR-VANET, and MMCR-VANET.