This paper proposes an improved handover algorithm method for vehicle location prediction (VLP-HA) using mobility prediction database. The main advantage of this method is the mobility prediction database is based on real traffic data traces. Furthermore, the proposed method has the ability to reduce handover decision time and solve resource allocation problem. The algorithm is simple and can be computed very rapidly; thus, its implementation for a high-speed vehicle is possible. To evaluate the effectiveness of the proposed method, QualNet simulation is carried out under different velocity scenarios. Its performance is compared with conventional handover method. The superiority of the proposed method over conventional handover method in deciding the best handover location and choosing candidate access points is highlighted by simulation. It was found that VLP-HA has clearly reduced handover delay by 45% compared to handover without VLP, give high accuracy, hence low complexity algorithm.
Traffic Congestion Prediction using Deep Reinforcement Learning in Vehicular ...IJCNCJournal
In recent years, a new wireless network called vehicular ad-hoc network (VANET), has become a popular research topic. VANET allows communication among vehicles and with roadside units by providing information to each other, such as vehicle velocity, location and direction. In general, when many vehicles likely to use the common route to proceed to the same destination, it can lead to a congested route that should be avoided. It may be better if vehicles are able to predict accurately the traffic congestion and then avoid it. Therefore, in this work, the deep reinforcement learning in VANET to enhance the ability to predict traffic congestion on the roads is proposed. Furthermore, different types of neural networks namely Convolutional Neural Network (CNN), Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM) are investigated and compared in this deep reinforcement learning model to discover the most effective one. Our proposed method is tested by simulation. The traffic scenarios are created using traffic simulator called Simulation of Urban Mobility (SUMO) before integrating with deep reinforcement learning model. The simulation procedures, as well as the programming used, are described in detail. The performance of our proposed method is evaluated using two metrics; the average travelling time delay and average waiting time delay of vehicles. According to the simulation results, the average travelling time delay and average waiting time delay are gradually improved over the multiple runs, since our proposed method receives feedback from the environment. In addition, the results without and with three different deep learning algorithms, i.e., CNN, MLP and LSTM are compared. It is obvious that the deep reinforcement learning model works effectively when traffic density is neither too high nor too low. In addition, it can be concluded that the effective algorithms for traffic congestion prediction models in descending order are MLP, CNN, and LSTM, respectively.
This document summarizes a study on analyzing link weight performance in intra-domain networks. It discusses measuring network topology and traffic, modeling path selection based on IGP configuration, and controlling the network by reconfiguring IGP link weights. The goal is to optimize routing within existing protocols like OSPF to improve traffic flow based on measured conditions. Link weights are adjusted to balance loads and steer traffic onto preferable paths between routers within an autonomous system or domain.
Performance Evaluation of Routing Protocols in University Networkijtsrd
In an enterprise network, multiple dynamic routing protocols are used for forwarding packets with the best routes. Therefore, performance of the network is based on routing protocols and the route redistribution is an important issue in an enterprise network that has been configured by multiple different routing protocols in its routers. So, aim of the system is to analyze the performance and comparison of different Interior Gateway routing protocols. Routing is depended on many parameters critical such as network convergence time, Ethernet delay, throughput, end to end delay, jitter, packet delivery, security and bandwidth, etc. In this paper, the analysis of characteristics and the performance of the different routing protocols as Routing Information Protocol RIP , Open Shortest Path First OSPF and Enhanced Interior Gateway Routing Protocol EIGRP are evaluated in a university network. The performance evaluation are based on end to end packet delay, network convergence time, packet delay variation and administrative distance, etc. The analysis focuses on the performance of the routing protocols with its routing table in a simulator. The Simulation software can be used to evaluate and compare the performance of the routing protocols. The simulator return the routing table for each node or router in the university network which would contain the best path to reach the remote destination on the metric chosen based on the routing protocol implemented. The simulation software give results used to evaluate the performance of routing protocols, the performance of different routing protocols will be compared, and to analyze the convergence time and administrative distance of routing protocols. Kyaw Zay Oo "Performance Evaluation of Routing Protocols in University Network" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd26582.pdfPaper URL: https://www.ijtsrd.com/engineering/information-technology/26582/performance-evaluation-of-routing-protocols-in-university-network/kyaw-zay-oo
Analytical average throughput and delay estimations for LTESpiros Louvros
This document summarizes an article that appeared in a journal published by Elsevier. The article proposes an analytical model to estimate average throughput and packet transmission delay for uplink cell edge users in LTE networks. The model uses probability analysis and mathematical modeling to estimate transmission delay and throughput, providing cell planners with an analytical tool for evaluating uplink performance under different conditions. The model accounts for factors like scheduling decisions, resource allocation, channel conditions and buffering that impact transmission delay and throughput for cell edge users.
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEU...IJCNCJournal
In this article, a retrial queueing model will be considered with persevering customers for wireless cellular
networks which can be frequently applied in the Fractional Guard Channel (FGC) policies, including
Limited FGC (LFGC), Uniform FGC (UFGC), Limited Average FGC (LAFGC) and Quasi Uniform FGC
(QUFGC). In this model, the examination on the retrial phenomena permits the analyses of important
effectiveness measures pertained to the standard of services undergone by users with the probability that a
fresh call first arrives the system and find all busy channels at the time, the probability that a fresh call
arrives the system from the orbit and find all busy channels at the time and the probability that a handover
call arrives the system and find all busy channels at the time. Comparison between four types of the FGC
policy can befound to evaluate the performance of the system.
Location and Mobility Optimized On-demand Geographical Multipath Routing Prot...Eswar Publications
The advancement of science and technology had made mobile ad hoc network an important tool to access network of next generation. Recently, numerous multipath routing protocols for mobile ad hoc network are reported in literature. Each routing methods works based on their salient feature, but failed to control congestion, energy efficiency, overhead packets, signal stability during data transmission which leads to edge effect, signal decay and bottleneck situation of the bandwidth consumption. In this paper a novel approach havely Geographical Distance based Ad Hoc On-demand Distance Vector Routing (GD-AOMDV), which selects the path based on transmission distance value to limit and control the congestion and control overheads has been proposed. The salient feature of the proposed model is that it establishes a relationship between path distance and MANET design parameters
including transmission range, consumption of energy and bandwidth. The accuracy of the proposed scheme is
analyzed and validated with the experimental results in respect to various flow using NS2 simulations.
Performance improvement of vehicular delay tolerant networks using public tra...ijmnct
In some networks, communications are sometimes interrupted and packet sending encounters many delays
due to lack of permanent connection between the nodes. Inter-vehicular and inter-satellite networks, which
are the so-called delay-tolerant networks, are an example to this type. This paper proposed a new routing
algorithm, which could increase efficiency of this kind of networks using predictability feature of bus
movement in a vehicular network. In this paper, bus routes were considered the backbone for vehicular
network and, knowing route of bus and destination of packets, the proposed algorithm, which was able to
use this information, was introduced. In addition, the proposed algorithm was simulated to prove its
efficiency and then it was compared with other algorithms in different conditions. The obtained results
indicated acceptable efficiency of the proposed algorithm.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
Traffic Congestion Prediction using Deep Reinforcement Learning in Vehicular ...IJCNCJournal
In recent years, a new wireless network called vehicular ad-hoc network (VANET), has become a popular research topic. VANET allows communication among vehicles and with roadside units by providing information to each other, such as vehicle velocity, location and direction. In general, when many vehicles likely to use the common route to proceed to the same destination, it can lead to a congested route that should be avoided. It may be better if vehicles are able to predict accurately the traffic congestion and then avoid it. Therefore, in this work, the deep reinforcement learning in VANET to enhance the ability to predict traffic congestion on the roads is proposed. Furthermore, different types of neural networks namely Convolutional Neural Network (CNN), Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM) are investigated and compared in this deep reinforcement learning model to discover the most effective one. Our proposed method is tested by simulation. The traffic scenarios are created using traffic simulator called Simulation of Urban Mobility (SUMO) before integrating with deep reinforcement learning model. The simulation procedures, as well as the programming used, are described in detail. The performance of our proposed method is evaluated using two metrics; the average travelling time delay and average waiting time delay of vehicles. According to the simulation results, the average travelling time delay and average waiting time delay are gradually improved over the multiple runs, since our proposed method receives feedback from the environment. In addition, the results without and with three different deep learning algorithms, i.e., CNN, MLP and LSTM are compared. It is obvious that the deep reinforcement learning model works effectively when traffic density is neither too high nor too low. In addition, it can be concluded that the effective algorithms for traffic congestion prediction models in descending order are MLP, CNN, and LSTM, respectively.
This document summarizes a study on analyzing link weight performance in intra-domain networks. It discusses measuring network topology and traffic, modeling path selection based on IGP configuration, and controlling the network by reconfiguring IGP link weights. The goal is to optimize routing within existing protocols like OSPF to improve traffic flow based on measured conditions. Link weights are adjusted to balance loads and steer traffic onto preferable paths between routers within an autonomous system or domain.
Performance Evaluation of Routing Protocols in University Networkijtsrd
In an enterprise network, multiple dynamic routing protocols are used for forwarding packets with the best routes. Therefore, performance of the network is based on routing protocols and the route redistribution is an important issue in an enterprise network that has been configured by multiple different routing protocols in its routers. So, aim of the system is to analyze the performance and comparison of different Interior Gateway routing protocols. Routing is depended on many parameters critical such as network convergence time, Ethernet delay, throughput, end to end delay, jitter, packet delivery, security and bandwidth, etc. In this paper, the analysis of characteristics and the performance of the different routing protocols as Routing Information Protocol RIP , Open Shortest Path First OSPF and Enhanced Interior Gateway Routing Protocol EIGRP are evaluated in a university network. The performance evaluation are based on end to end packet delay, network convergence time, packet delay variation and administrative distance, etc. The analysis focuses on the performance of the routing protocols with its routing table in a simulator. The Simulation software can be used to evaluate and compare the performance of the routing protocols. The simulator return the routing table for each node or router in the university network which would contain the best path to reach the remote destination on the metric chosen based on the routing protocol implemented. The simulation software give results used to evaluate the performance of routing protocols, the performance of different routing protocols will be compared, and to analyze the convergence time and administrative distance of routing protocols. Kyaw Zay Oo "Performance Evaluation of Routing Protocols in University Network" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd26582.pdfPaper URL: https://www.ijtsrd.com/engineering/information-technology/26582/performance-evaluation-of-routing-protocols-in-university-network/kyaw-zay-oo
Analytical average throughput and delay estimations for LTESpiros Louvros
This document summarizes an article that appeared in a journal published by Elsevier. The article proposes an analytical model to estimate average throughput and packet transmission delay for uplink cell edge users in LTE networks. The model uses probability analysis and mathematical modeling to estimate transmission delay and throughput, providing cell planners with an analytical tool for evaluating uplink performance under different conditions. The model accounts for factors like scheduling decisions, resource allocation, channel conditions and buffering that impact transmission delay and throughput for cell edge users.
PERFORMANCE ANALYSIS IN CELLULAR NETWORKS CONSIDERING THE QOS BY RETRIAL QUEU...IJCNCJournal
In this article, a retrial queueing model will be considered with persevering customers for wireless cellular
networks which can be frequently applied in the Fractional Guard Channel (FGC) policies, including
Limited FGC (LFGC), Uniform FGC (UFGC), Limited Average FGC (LAFGC) and Quasi Uniform FGC
(QUFGC). In this model, the examination on the retrial phenomena permits the analyses of important
effectiveness measures pertained to the standard of services undergone by users with the probability that a
fresh call first arrives the system and find all busy channels at the time, the probability that a fresh call
arrives the system from the orbit and find all busy channels at the time and the probability that a handover
call arrives the system and find all busy channels at the time. Comparison between four types of the FGC
policy can befound to evaluate the performance of the system.
Location and Mobility Optimized On-demand Geographical Multipath Routing Prot...Eswar Publications
The advancement of science and technology had made mobile ad hoc network an important tool to access network of next generation. Recently, numerous multipath routing protocols for mobile ad hoc network are reported in literature. Each routing methods works based on their salient feature, but failed to control congestion, energy efficiency, overhead packets, signal stability during data transmission which leads to edge effect, signal decay and bottleneck situation of the bandwidth consumption. In this paper a novel approach havely Geographical Distance based Ad Hoc On-demand Distance Vector Routing (GD-AOMDV), which selects the path based on transmission distance value to limit and control the congestion and control overheads has been proposed. The salient feature of the proposed model is that it establishes a relationship between path distance and MANET design parameters
including transmission range, consumption of energy and bandwidth. The accuracy of the proposed scheme is
analyzed and validated with the experimental results in respect to various flow using NS2 simulations.
Performance improvement of vehicular delay tolerant networks using public tra...ijmnct
In some networks, communications are sometimes interrupted and packet sending encounters many delays
due to lack of permanent connection between the nodes. Inter-vehicular and inter-satellite networks, which
are the so-called delay-tolerant networks, are an example to this type. This paper proposed a new routing
algorithm, which could increase efficiency of this kind of networks using predictability feature of bus
movement in a vehicular network. In this paper, bus routes were considered the backbone for vehicular
network and, knowing route of bus and destination of packets, the proposed algorithm, which was able to
use this information, was introduced. In addition, the proposed algorithm was simulated to prove its
efficiency and then it was compared with other algorithms in different conditions. The obtained results
indicated acceptable efficiency of the proposed algorithm.
21 9149 simulation analysis for consistent path identification edit septianIAESIJEECS
As the demand for Mobile Ad hoc Network (MANET) applications grows, so does their use of many essential services where node consistent and stability of the communication paths are of great importance. In this scheme, we propose Simulation Analysis for Consistent Path Identification to Refine the Network Lifetime (CPIR). This technique offers more stable path and transmits the data through the consistent nodes. This article is focused on protecting the route from the inconsistent node in mobile communications to improve the network performance and reduce the energy consumption in the network. The simulation results demonstrate that CPIR provided reduce the energy utilization and improved both the longer lifetimes and increased number of packets delivered.
Address-light and energy aware routing protocol for wireless sensor networkTELKOMNIKA JOURNAL
In recent years, sensor networks applications were used in many criteria. Because of its vast applications, so many researchers studied these networks. Wireless sensor networks contain significant number of sensor nodes; they are suitable medium for collecting and sending data or informing the sink about an event. This study presents a new integrated method for routing in sensor networks which is based on remaining energy of the nodes and existing space between each node and the sink. This method is more suitable for large and medium volume of data. Lifetime enhancement of the network is the main purpose of this method which is obtained by fair division of nodes roles in transmission of data to the sink. In ALERP algorithm (Address Light, Label-Based and Energy-Aware Routing Protocol), in order to reduce network overload and energy consuming as well as enhancement of network lifetime, we used predetermined routes as well as routing based on packet labels. Energy consumption in the entire network is another advantage of this method. The existence of various parameters on this algorithm will lead to more flexibility of it. Generally, conducted simulations indicate higher uniformity in energy consumption of nodes.
A new approach in position-based routing Protocol using learning automata for...ijasa
This document summarizes a research paper that proposes a new position-based routing protocol called PBLA (Position-Based routing protocol using Learning Automata) for vehicular ad hoc networks (VANETs) in urban scenarios. PBLA uses learning automata and traffic information to initially find the best and shortest path to a mobile destination. It has two phases: a learning phase where vehicles learn traffic patterns on streets to assign costs; and a routing phase where the shortest path is found using Dijkstra's algorithm and packets are forwarded between intersections greedily. The performance of PBLA is evaluated against GPSR and GPCR protocols in a simulated urban road network, showing it can efficiently route packets in high mobility V
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This document proposes a new fuzzy logic-based routing protocol for mobile ad-hoc networks (MANETs) that considers path stability, residual energy of nodes, and bandwidth for optimal path selection at the source node. It also proposes adjusting the transmission rate at the source node based on end-to-end delay and packet loss ratio measured at the destination node. This cross-layer approach uses two fuzzy logic systems - one for path selection based on stability and bandwidth, and another for transmission rate adjustment based on delay and packet loss. The goal is to select stable paths and prevent congestion for more efficient data transmission in MANETs.
An efficient vertical handoff mechanism for future mobile networkBasil John
This document proposes a novel fuzzy logic based vertical handoff decision algorithm for heterogeneous wireless networks. It introduces a speed-adaptive system discovery scheme to improve the update rate of candidate networks based on the mobile terminal's speed. It also includes a pre-handoff decision method to quickly filter candidate networks and reduce unnecessary handoffs. The key aspects of the proposed algorithm are: 1) It uses a speed-adaptive scheme to dynamically adjust the discovery of candidate networks. 2) It employs a pre-handoff decision method to filter networks and reduce ping-pong effects. 3) It applies fuzzy logic to evaluate multiple parameters like bandwidth, RSS, and cost to select the best network. Simulations show it outperforms traditional RSS-based
Simulation of Route Optimization with load balancing Using AntNet SystemIOSR Journals
This document summarizes a research paper that simulates route optimization and load balancing in computer networks using the AntNet routing algorithm. The AntNet algorithm is based on the behavior of ants and uses forward and backward ants to collect information and update routing tables. The simulation tested the AntNet algorithm against a generic algorithm without AntNet. The results showed that AntNet performed better in terms of throughput, average packet delivery, distance, delay, and failed packets. Specifically, when the simulation speed was 1000 and total packets were 100, AntNet delivered all packets with less delay and distance compared to the generic algorithm which failed 2 packets. This demonstrates that the AntNet algorithm can effectively optimize routes and balance network load.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
This document presents a comparative study of flat-based/data-centric wireless sensor network (WSN) specific routing protocols. It first provides background on data-centric approaches in WSNs and discusses some popular flat-based/data-centric routing protocols, including Directed Diffusion, Minimum Cost Forwarding Algorithm (MCFA), Threshold sensitive Energy Efficient sensor Network protocol (TEEN), Adaptive Periodic Threshold sensitive Energy Efficient sensor Network protocol (APTEEN), Energy Aware Data (EAD) Centric Routing Protocol, RUMOR Routing, Sensor Protocols for Information via Negotiation (SPIN), Constrained Anisotropic Diffusion Routing (CADR), COUGAR,
6RLR-ABC: 6LOWPAN ROUTING PROTOCOL WITH LOCAL REPAIR USING BIO INSPIRED ARTIF...IJCNCJournal
The document presents a new routing protocol called 6RLR-ABC for 6LoWPAN networks that uses an artificial bee colony algorithm for local route repair. It compares the performance of 6RLR-ABC to the existing 6LoWPAN Ad-hoc On-Demand Distance Vector (LOAD) protocol through simulations. The results show that 6RLR-ABC achieves lower packet delay, higher packet delivery ratio, and higher throughput while using less energy than LOAD, especially with increasing network traffic loads.
Traffic Dynamics in Virtual Routing Multi Topology SystemIOSR Journals
The document proposes an Adaptive Multipath Routing system to handle unpredicted traffic dynamics in a network. The system consists of two components: 1) A Weight Computation component that sets link weights to produce maximum path diversity across multiple virtual routing topologies. 2) A Traffic Splitting component that adaptively splits traffic across the topologies based on traffic conditions to balance loads. The system also uses Multiple Routing Configurations to allow packet forwarding on pre-configured alternative paths upon node or link failures, improving quality of service and network performance.
The document describes a proposed multi-hop clustering (MHC) approach for vehicular ad-hoc networks (VANETs). The MHC approach selects cluster heads based on the node's speed being closest to the average speed and having a high network life. It calculates distrust values to isolate malicious nodes and determines a QoS value considering bandwidth, number of neighbors, distance and velocity ratios. The approach aims to improve stability, reliability and security compared to previous work. It was simulated in NS2 and showed better results than existing techniques for parameters like overhead, throughput, delay, loss and delivery ratio. The key contribution is adding calculations for percentage of stability and path length.
Robust Resource Allocation in Relay Node Networks for Optimization ProcessIJCERT
Overlay steering has risen as a promising way to deal with enhances unwavering quality and effectiveness of the Internet. For one-jump overlay source steering, when a given essential way experiences the connection disappointment or execution debasement, the source can reroute the movement to the destination by means of a deliberately set transfer hub. Be that as it may, the over-substantial activity going through the same transfer hub may bring about incessant bundle misfortune and postponement jitter, which can corrupt the throughput and usage of the system. To defeat this issue, we propose a Load-Balanced One-jump Overlay Multipath Routing calculation (LB-OOMR), in which the activity is first part at the source edge hubs and afterward transmitted along numerous one-bounce overlay ways. So as to decide an ideal split proportion for the activity, we plan the issue as a direct programming (LP) definition, whose objective is to minimize the more regrettable case system blockage proportion. Since it is hard to take care of this LP issue in commonsense time, a heuristic calculation is acquainted with select the transfer hubs for building the disjoint one-jump overlay ways, which enormously lessens the computational multifaceted nature of the LP calculation. Reproductions in light of a genuine ISP system and an engineered Internet topology demonstrate that our proposed calculation can diminish the system clog proportion significantly, and accomplish top notch overlay directing administration.
Generalized optimal placement of PMUs considering power system observability,...IJECEIAES
This paper presents a generalized optimal placement of Phasor Measurement Units (PMUs) considering power system observability, reliability, Communication Infrastructure (CI), and latency time associated with this CI. Moreover, the economic study for additional new data transmission paths is considered as well as the availability of predefined locations of some PMUs and the preexisting communication devices (CDs) in some buses. Two cases for the location of the Control Center Base Station (CCBS) are considered; predefined case and free selected case. The PMUs placement and their required communication network topology and channel capacity are co-optimized simultaneously. In this study, two different approaches are applied to optimize the objective function; the first approach is combined from Binary Particle Swarm Optimization-Gravitational Search Algorithm (BPSOGSA) and the Minimum Spanning Tree (MST) algorithm, while the second approach is based only on BPSOGSA. The feasibility of the proposed approaches are examined by applying it to IEEE 14-bus and IEEE 118-bus systems.
Energy- Aware QoS Based Routing Protocols for Heterogeneous WSNs: A Survey ...............................1
Sridevi S., Rumeniya G. and Usha M.
Optimization of Outsourcing ICT Projects in Public Organizations; Case Study: Public Center of Iranian
ICT Studies ................................................................................................................................................. 20
Majid Nili Ahmadabadi, Abbas Bagheri and Fariba Abolghasemi
An Optimized CBIR Using Particle Swarm Optimization Algorithm ......................................................... 40
Subhakala S., Bhuvana S. and Radhakrishnan R.
Study of Satisfaction Assessment Techniques for Textual Requirements .............................................. 56
K. S. Divya, R. Subha and Dr. S. Palaniswami
Survey of MAC Protocols for Heterogeneous Traffic in Wireless Sensor Networks ............................... 67
Sridevi S., Priyadharshini R. and Usha M.
Harnessing Social Media for Business Success. Case Study of Zimbabwe ............................................... 80
Musungwini Samuel, Zhou Tinashe Gwendolyn, Zhou Munyaradzi and Ruvinga Caroline
Quality Platforms for Innovation and Breakthrough................................................................................ 90
Dr. Hima Gupta
Development of Virtual Experiment on Waveform Conversion Using Virtual Intelligent SoftLab ...... 107
Bhaskar Y. Kathane
Improved Routing Protocol in Mobile Ad Hoc Networks Using Fuzzy LogicTELKOMNIKA JOURNAL
In mobile ad hoc networks, route selection is one of the most important issues that is studied in
these networks as a field of research. Many articles trying to provide solutions to choose the best path in
which the important parameters such as power consumption, bandwidth and mobility are used. In this
article, in order to improve the solutions presented in recent papers parameters such as power remaining,
mobility, degree node and available bandwidth are used by taking the factors for each parameter in
proportion to its influence in choosing the best path. Finally, we compare the proposed solution with the
three protocols IAOMDV-F, AODVFART and FLM-AODV with the help of OPNET simulation program
based on network throughput, routing discovery time, the average number of hops per route, network
delay.
Dynamic K-Means Algorithm for Optimized Routing in Mobile Ad Hoc Networks IJCSES Journal
The document proposes a dynamic K-means clustering algorithm to improve routing in mobile ad hoc networks (MANETs). It aims to address limitations of the basic K-means algorithm like fixed cluster heads and members. The dynamic algorithm elects cluster heads periodically based on distance to cluster center and node energy. It allows any node to serve as cluster head for a time slot to address head mobility. Experimental results show the dynamic approach enhances MANET routing performance metrics like route discovery time, delay, and packet delivery rate compared to basic K-means routing.
SECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETSIJCNCJournal
The Border Gateway Protocol (BGP) provides crucial routing information for the Internet infrastructure. A problem with abnormal routing behavior affects the stability and connectivity of the global Internet. The biggest hurdles in detecting BGP attacks are extremely unbalanced data set category distribution and the dynamic nature of the network. This unbalanced class distribution and dynamic nature of the network results in the classifier's inferior performance. In this paper we proposed an efficient approach to properly managing these problems, the proposed approach tackles the unbalanced classification of datasets by turning the problem of binary classification into a problem of multiclass classification. This is achieved by splitting the majority-class samples evenly into multiple segments using Affinity Propagation, where the number of segments is chosen so that the number of samples in any segment closely matches the minority-class samples. Such sections of the dataset together with the minor class are then viewed as different classes and used to train the Extreme Learning Machine (ELM). The RIPE and BCNET datasets are used to evaluate the performance of the proposed technique. When no feature selection is used, the proposed technique improves the F1 score by 1.9% compared to state-of-the-art techniques. With the Fischer feature selection algorithm, the proposed algorithm achieved the highest F1 score of 76.3%, which was a 1.7% improvement over the compared ones. Additionally, the MIQ feature selection technique improves the accuracy by 3.5%. For the BCNET dataset, the proposed technique improves the F1 score by 1.8% for the Fisher feature selection technique. The experimental findings support the substantial improvement in performance from previous approaches by the new technique.
Review on Clustering and Data Aggregation in Wireless Sensor NetworkEditor IJCATR
This document provides a review of clustering and data aggregation techniques in wireless sensor networks. It begins with an introduction to wireless sensor networks and their characteristics. It then discusses clustering, which involves grouping sensor nodes into clusters headed by cluster heads. Different clustering models are described, including hierarchical clustering. The document also reviews data aggregation techniques, which aim to reduce data redundancy and save energy. It outlines common data aggregation protocols for flat and hierarchical network architectures, such as cluster-based, chain-based, tree-based and grid-based approaches. Finally, it summarizes key clustering routing protocols and data aggregation algorithms.
Survey on confidentiality of the user and query processing on spatial networkeSAT Journals
Abstract
The administration of transhipment systems has become increasingly important in many applications such as position-based services, supply cycle management, travel control, and so on. These applications usually involve queries over spatial networks with vigorously changing and problematical travel conditions. There may be possibilities of user's privacy violated when they are querying about the location information on the third party servers where the location information about the users will be tracked. The malicious attackers may steal the location information about the users. The k nearest neighbour query verification with location points on Voronoi diagram increases the verification cost on mobile clients. The reverse nearest neighbour queries by assigning each object and query with a safe region is applied such that the expensive recomputation is not required as long as the query and objects remain in their respective safe regions. The proposed system reduces the communication cost in client-server architectures because an object does not report its location to the server unless it leaves its safe region or the server sends a location update request. Hilbert curve is used here for the capability of partially retaining the neighbouring adjacency of the original data. The user data is protected by applying Hilbert transform over the original values and storing the transformed values in the Hilbert curve.
Keywords— Hilbert Curve, Voronoi diagram, Hilbert Transform
FANET optimization: a destination path flow model IJECEIAES
This document proposes a destination path flow model to optimize communication links in flying ad hoc networks (FANETs). It utilizes smell agent optimization and particle swarm optimization algorithms to manage link establishment between communicating nodes. Three scenarios depicting media coverage by FANET nodes are presented. Results show the smell agent optimization reduces bandwidth costs by 10.46-3.66% compared to particle swarm optimization, while particle swarm optimization reduces communication delays by 40.89-68.85% compared to smell agent optimization. The model aims to improve routing efficiency in FANETs by optimizing destination paths.
Approximation of regression-based fault minimization for network trafficTELKOMNIKA JOURNAL
This research associates three distinct approaches for computer network traffic prediction. They are the traditional stochastic gradient descent (SGD) using a few random samplings instead of the complete dataset for each iterative calculation, the gradient descent algorithm (GDA) which is a well-known optimization approach in deep learning, and the proposed method. The network traffic is computed from the traffic load (data and multimedia) of the computer network nodes via the Internet. It is apparent that the SGD is a modest iteration but can conclude suboptimal solutions. The GDA is a complicated one, can function more accurate than the SGD but difficult to manipulate parameters, such as the learning rate, the dataset granularity, and the loss function. Network traffic estimation helps improve performance and lower costs for various applications, such as an adaptive rate control, load balancing, the quality of service (QoS), fair bandwidth allocation, and anomaly detection. The proposed method confirms optimal values out of parameters using simulation to compute the minimum figure of specified loss function in each iteration.
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
Address-light and energy aware routing protocol for wireless sensor networkTELKOMNIKA JOURNAL
In recent years, sensor networks applications were used in many criteria. Because of its vast applications, so many researchers studied these networks. Wireless sensor networks contain significant number of sensor nodes; they are suitable medium for collecting and sending data or informing the sink about an event. This study presents a new integrated method for routing in sensor networks which is based on remaining energy of the nodes and existing space between each node and the sink. This method is more suitable for large and medium volume of data. Lifetime enhancement of the network is the main purpose of this method which is obtained by fair division of nodes roles in transmission of data to the sink. In ALERP algorithm (Address Light, Label-Based and Energy-Aware Routing Protocol), in order to reduce network overload and energy consuming as well as enhancement of network lifetime, we used predetermined routes as well as routing based on packet labels. Energy consumption in the entire network is another advantage of this method. The existence of various parameters on this algorithm will lead to more flexibility of it. Generally, conducted simulations indicate higher uniformity in energy consumption of nodes.
A new approach in position-based routing Protocol using learning automata for...ijasa
This document summarizes a research paper that proposes a new position-based routing protocol called PBLA (Position-Based routing protocol using Learning Automata) for vehicular ad hoc networks (VANETs) in urban scenarios. PBLA uses learning automata and traffic information to initially find the best and shortest path to a mobile destination. It has two phases: a learning phase where vehicles learn traffic patterns on streets to assign costs; and a routing phase where the shortest path is found using Dijkstra's algorithm and packets are forwarded between intersections greedily. The performance of PBLA is evaluated against GPSR and GPCR protocols in a simulated urban road network, showing it can efficiently route packets in high mobility V
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This document proposes a new fuzzy logic-based routing protocol for mobile ad-hoc networks (MANETs) that considers path stability, residual energy of nodes, and bandwidth for optimal path selection at the source node. It also proposes adjusting the transmission rate at the source node based on end-to-end delay and packet loss ratio measured at the destination node. This cross-layer approach uses two fuzzy logic systems - one for path selection based on stability and bandwidth, and another for transmission rate adjustment based on delay and packet loss. The goal is to select stable paths and prevent congestion for more efficient data transmission in MANETs.
An efficient vertical handoff mechanism for future mobile networkBasil John
This document proposes a novel fuzzy logic based vertical handoff decision algorithm for heterogeneous wireless networks. It introduces a speed-adaptive system discovery scheme to improve the update rate of candidate networks based on the mobile terminal's speed. It also includes a pre-handoff decision method to quickly filter candidate networks and reduce unnecessary handoffs. The key aspects of the proposed algorithm are: 1) It uses a speed-adaptive scheme to dynamically adjust the discovery of candidate networks. 2) It employs a pre-handoff decision method to filter networks and reduce ping-pong effects. 3) It applies fuzzy logic to evaluate multiple parameters like bandwidth, RSS, and cost to select the best network. Simulations show it outperforms traditional RSS-based
Simulation of Route Optimization with load balancing Using AntNet SystemIOSR Journals
This document summarizes a research paper that simulates route optimization and load balancing in computer networks using the AntNet routing algorithm. The AntNet algorithm is based on the behavior of ants and uses forward and backward ants to collect information and update routing tables. The simulation tested the AntNet algorithm against a generic algorithm without AntNet. The results showed that AntNet performed better in terms of throughput, average packet delivery, distance, delay, and failed packets. Specifically, when the simulation speed was 1000 and total packets were 100, AntNet delivered all packets with less delay and distance compared to the generic algorithm which failed 2 packets. This demonstrates that the AntNet algorithm can effectively optimize routes and balance network load.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
This document presents a comparative study of flat-based/data-centric wireless sensor network (WSN) specific routing protocols. It first provides background on data-centric approaches in WSNs and discusses some popular flat-based/data-centric routing protocols, including Directed Diffusion, Minimum Cost Forwarding Algorithm (MCFA), Threshold sensitive Energy Efficient sensor Network protocol (TEEN), Adaptive Periodic Threshold sensitive Energy Efficient sensor Network protocol (APTEEN), Energy Aware Data (EAD) Centric Routing Protocol, RUMOR Routing, Sensor Protocols for Information via Negotiation (SPIN), Constrained Anisotropic Diffusion Routing (CADR), COUGAR,
6RLR-ABC: 6LOWPAN ROUTING PROTOCOL WITH LOCAL REPAIR USING BIO INSPIRED ARTIF...IJCNCJournal
The document presents a new routing protocol called 6RLR-ABC for 6LoWPAN networks that uses an artificial bee colony algorithm for local route repair. It compares the performance of 6RLR-ABC to the existing 6LoWPAN Ad-hoc On-Demand Distance Vector (LOAD) protocol through simulations. The results show that 6RLR-ABC achieves lower packet delay, higher packet delivery ratio, and higher throughput while using less energy than LOAD, especially with increasing network traffic loads.
Traffic Dynamics in Virtual Routing Multi Topology SystemIOSR Journals
The document proposes an Adaptive Multipath Routing system to handle unpredicted traffic dynamics in a network. The system consists of two components: 1) A Weight Computation component that sets link weights to produce maximum path diversity across multiple virtual routing topologies. 2) A Traffic Splitting component that adaptively splits traffic across the topologies based on traffic conditions to balance loads. The system also uses Multiple Routing Configurations to allow packet forwarding on pre-configured alternative paths upon node or link failures, improving quality of service and network performance.
The document describes a proposed multi-hop clustering (MHC) approach for vehicular ad-hoc networks (VANETs). The MHC approach selects cluster heads based on the node's speed being closest to the average speed and having a high network life. It calculates distrust values to isolate malicious nodes and determines a QoS value considering bandwidth, number of neighbors, distance and velocity ratios. The approach aims to improve stability, reliability and security compared to previous work. It was simulated in NS2 and showed better results than existing techniques for parameters like overhead, throughput, delay, loss and delivery ratio. The key contribution is adding calculations for percentage of stability and path length.
Robust Resource Allocation in Relay Node Networks for Optimization ProcessIJCERT
Overlay steering has risen as a promising way to deal with enhances unwavering quality and effectiveness of the Internet. For one-jump overlay source steering, when a given essential way experiences the connection disappointment or execution debasement, the source can reroute the movement to the destination by means of a deliberately set transfer hub. Be that as it may, the over-substantial activity going through the same transfer hub may bring about incessant bundle misfortune and postponement jitter, which can corrupt the throughput and usage of the system. To defeat this issue, we propose a Load-Balanced One-jump Overlay Multipath Routing calculation (LB-OOMR), in which the activity is first part at the source edge hubs and afterward transmitted along numerous one-bounce overlay ways. So as to decide an ideal split proportion for the activity, we plan the issue as a direct programming (LP) definition, whose objective is to minimize the more regrettable case system blockage proportion. Since it is hard to take care of this LP issue in commonsense time, a heuristic calculation is acquainted with select the transfer hubs for building the disjoint one-jump overlay ways, which enormously lessens the computational multifaceted nature of the LP calculation. Reproductions in light of a genuine ISP system and an engineered Internet topology demonstrate that our proposed calculation can diminish the system clog proportion significantly, and accomplish top notch overlay directing administration.
Generalized optimal placement of PMUs considering power system observability,...IJECEIAES
This paper presents a generalized optimal placement of Phasor Measurement Units (PMUs) considering power system observability, reliability, Communication Infrastructure (CI), and latency time associated with this CI. Moreover, the economic study for additional new data transmission paths is considered as well as the availability of predefined locations of some PMUs and the preexisting communication devices (CDs) in some buses. Two cases for the location of the Control Center Base Station (CCBS) are considered; predefined case and free selected case. The PMUs placement and their required communication network topology and channel capacity are co-optimized simultaneously. In this study, two different approaches are applied to optimize the objective function; the first approach is combined from Binary Particle Swarm Optimization-Gravitational Search Algorithm (BPSOGSA) and the Minimum Spanning Tree (MST) algorithm, while the second approach is based only on BPSOGSA. The feasibility of the proposed approaches are examined by applying it to IEEE 14-bus and IEEE 118-bus systems.
Energy- Aware QoS Based Routing Protocols for Heterogeneous WSNs: A Survey ...............................1
Sridevi S., Rumeniya G. and Usha M.
Optimization of Outsourcing ICT Projects in Public Organizations; Case Study: Public Center of Iranian
ICT Studies ................................................................................................................................................. 20
Majid Nili Ahmadabadi, Abbas Bagheri and Fariba Abolghasemi
An Optimized CBIR Using Particle Swarm Optimization Algorithm ......................................................... 40
Subhakala S., Bhuvana S. and Radhakrishnan R.
Study of Satisfaction Assessment Techniques for Textual Requirements .............................................. 56
K. S. Divya, R. Subha and Dr. S. Palaniswami
Survey of MAC Protocols for Heterogeneous Traffic in Wireless Sensor Networks ............................... 67
Sridevi S., Priyadharshini R. and Usha M.
Harnessing Social Media for Business Success. Case Study of Zimbabwe ............................................... 80
Musungwini Samuel, Zhou Tinashe Gwendolyn, Zhou Munyaradzi and Ruvinga Caroline
Quality Platforms for Innovation and Breakthrough................................................................................ 90
Dr. Hima Gupta
Development of Virtual Experiment on Waveform Conversion Using Virtual Intelligent SoftLab ...... 107
Bhaskar Y. Kathane
Improved Routing Protocol in Mobile Ad Hoc Networks Using Fuzzy LogicTELKOMNIKA JOURNAL
In mobile ad hoc networks, route selection is one of the most important issues that is studied in
these networks as a field of research. Many articles trying to provide solutions to choose the best path in
which the important parameters such as power consumption, bandwidth and mobility are used. In this
article, in order to improve the solutions presented in recent papers parameters such as power remaining,
mobility, degree node and available bandwidth are used by taking the factors for each parameter in
proportion to its influence in choosing the best path. Finally, we compare the proposed solution with the
three protocols IAOMDV-F, AODVFART and FLM-AODV with the help of OPNET simulation program
based on network throughput, routing discovery time, the average number of hops per route, network
delay.
Dynamic K-Means Algorithm for Optimized Routing in Mobile Ad Hoc Networks IJCSES Journal
The document proposes a dynamic K-means clustering algorithm to improve routing in mobile ad hoc networks (MANETs). It aims to address limitations of the basic K-means algorithm like fixed cluster heads and members. The dynamic algorithm elects cluster heads periodically based on distance to cluster center and node energy. It allows any node to serve as cluster head for a time slot to address head mobility. Experimental results show the dynamic approach enhances MANET routing performance metrics like route discovery time, delay, and packet delivery rate compared to basic K-means routing.
SECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETSIJCNCJournal
The Border Gateway Protocol (BGP) provides crucial routing information for the Internet infrastructure. A problem with abnormal routing behavior affects the stability and connectivity of the global Internet. The biggest hurdles in detecting BGP attacks are extremely unbalanced data set category distribution and the dynamic nature of the network. This unbalanced class distribution and dynamic nature of the network results in the classifier's inferior performance. In this paper we proposed an efficient approach to properly managing these problems, the proposed approach tackles the unbalanced classification of datasets by turning the problem of binary classification into a problem of multiclass classification. This is achieved by splitting the majority-class samples evenly into multiple segments using Affinity Propagation, where the number of segments is chosen so that the number of samples in any segment closely matches the minority-class samples. Such sections of the dataset together with the minor class are then viewed as different classes and used to train the Extreme Learning Machine (ELM). The RIPE and BCNET datasets are used to evaluate the performance of the proposed technique. When no feature selection is used, the proposed technique improves the F1 score by 1.9% compared to state-of-the-art techniques. With the Fischer feature selection algorithm, the proposed algorithm achieved the highest F1 score of 76.3%, which was a 1.7% improvement over the compared ones. Additionally, the MIQ feature selection technique improves the accuracy by 3.5%. For the BCNET dataset, the proposed technique improves the F1 score by 1.8% for the Fisher feature selection technique. The experimental findings support the substantial improvement in performance from previous approaches by the new technique.
Review on Clustering and Data Aggregation in Wireless Sensor NetworkEditor IJCATR
This document provides a review of clustering and data aggregation techniques in wireless sensor networks. It begins with an introduction to wireless sensor networks and their characteristics. It then discusses clustering, which involves grouping sensor nodes into clusters headed by cluster heads. Different clustering models are described, including hierarchical clustering. The document also reviews data aggregation techniques, which aim to reduce data redundancy and save energy. It outlines common data aggregation protocols for flat and hierarchical network architectures, such as cluster-based, chain-based, tree-based and grid-based approaches. Finally, it summarizes key clustering routing protocols and data aggregation algorithms.
Survey on confidentiality of the user and query processing on spatial networkeSAT Journals
Abstract
The administration of transhipment systems has become increasingly important in many applications such as position-based services, supply cycle management, travel control, and so on. These applications usually involve queries over spatial networks with vigorously changing and problematical travel conditions. There may be possibilities of user's privacy violated when they are querying about the location information on the third party servers where the location information about the users will be tracked. The malicious attackers may steal the location information about the users. The k nearest neighbour query verification with location points on Voronoi diagram increases the verification cost on mobile clients. The reverse nearest neighbour queries by assigning each object and query with a safe region is applied such that the expensive recomputation is not required as long as the query and objects remain in their respective safe regions. The proposed system reduces the communication cost in client-server architectures because an object does not report its location to the server unless it leaves its safe region or the server sends a location update request. Hilbert curve is used here for the capability of partially retaining the neighbouring adjacency of the original data. The user data is protected by applying Hilbert transform over the original values and storing the transformed values in the Hilbert curve.
Keywords— Hilbert Curve, Voronoi diagram, Hilbert Transform
FANET optimization: a destination path flow model IJECEIAES
This document proposes a destination path flow model to optimize communication links in flying ad hoc networks (FANETs). It utilizes smell agent optimization and particle swarm optimization algorithms to manage link establishment between communicating nodes. Three scenarios depicting media coverage by FANET nodes are presented. Results show the smell agent optimization reduces bandwidth costs by 10.46-3.66% compared to particle swarm optimization, while particle swarm optimization reduces communication delays by 40.89-68.85% compared to smell agent optimization. The model aims to improve routing efficiency in FANETs by optimizing destination paths.
Approximation of regression-based fault minimization for network trafficTELKOMNIKA JOURNAL
This research associates three distinct approaches for computer network traffic prediction. They are the traditional stochastic gradient descent (SGD) using a few random samplings instead of the complete dataset for each iterative calculation, the gradient descent algorithm (GDA) which is a well-known optimization approach in deep learning, and the proposed method. The network traffic is computed from the traffic load (data and multimedia) of the computer network nodes via the Internet. It is apparent that the SGD is a modest iteration but can conclude suboptimal solutions. The GDA is a complicated one, can function more accurate than the SGD but difficult to manipulate parameters, such as the learning rate, the dataset granularity, and the loss function. Network traffic estimation helps improve performance and lower costs for various applications, such as an adaptive rate control, load balancing, the quality of service (QoS), fair bandwidth allocation, and anomaly detection. The proposed method confirms optimal values out of parameters using simulation to compute the minimum figure of specified loss function in each iteration.
Mobile environment pretense a number of novel
theoretical and optimization issues such as position, operation
and following in that a lot of requests rely on them for
desirable information. The precedent works are sprinkled
across the entire network layer: from the medium of physical
to link layer to routing and then application layer. In this
invention, we present outline solutions in Medium Access
Control (MAC), data distribution, coverage resolve issues
under mobile ad-hoc network environment based on
congestion control technique using Transmission Control
Protocol (TCP). In mobile ad-hoc network issues can arise
such as link disconnections, channel contention and recurrent
path loss. To resolve this issue, we propose a Cross Layer
based Hybrid fuzzy ad-hoc rate based Congestion Control
(CLHCC) approach to maximize network performance. Based
on the destination report it regulates the speed of data flow to
control data loss by monitoring the present network status
and transmits this report to the source as advice. The source
adjusts the sending flow rate as per the advice. This is
monitored by channel usage, ultimate delay, short term
throughput.
Multimedia Streaming in Wireless Ad Hoc Networks According to Fuzzy Cross-lay...Editor IJCATR
1) The document describes a fuzzy logic-based routing protocol for multimedia streaming in wireless ad hoc networks. It aims to select optimal routes taking into account factors like node mobility, available bandwidth, and battery energy levels.
2) The protocol uses fuzzy logic rules and membership functions to calculate a "stability rate" for network links based on their characteristics. This is used to select routes with minimum mobility and maximum bandwidth and energy.
3) Simulation results using the OPNET simulator show that the proposed fuzzy logic approach has fewer lost data packets compared to the standard AODV routing protocol, especially over time, indicating it selects more reliable routes for multimedia streaming in mobile ad hoc networks.
Vehicular ad hoc networks (VANETs) have seen tremendous growth in the last decade, providing a vast
range of applications in both military and civilian activities. The temporary connectivity in the vehicles can also
increase the driver’s capability on the road. However, such applications require heavy data packets to be shared on
the same spectrum without the requirement of excessive radios. Thus, e-client approaches are required which can
provide improved data dissemination along with the better quality of services to allow heavy traffic to be easily
shared between the vehicles. In this paper, an e-client data dissemination approach is proposed which not only
improves the vehicle to vehicle connectivity but also improves the QoS between the source and the destination. The
proposed approach is analyzed and compared with the existing state-of-the-art approaches. The effectiveness of the
proposed approach is demonstrated in terms of the significant gains attained in the parameters namely, end to end
delay, packet delivery ratio, route acquisition time, throughput, and message dissemination rate in comparison with
the existing approaches.
IRJET - A Review on Congestion Control Methods in Mobile Adhoc NetworksIRJET Journal
This document reviews different techniques for congestion control in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and discusses how congestion can occur and degrade network performance. The literature survey section then summarizes several recent studies that have proposed various congestion control methods. These include adaptive data rate and control of hello packets, cross-layer approaches, hop-by-hop congestion control algorithms, avoiding congestion by monitoring bandwidth capacity, and fuzzy logic based congestion control. The document concludes that congestion is a major issue in MANETs and different control mechanisms aim to improve throughput, delivery ratio and reduce packet loss and delay.
This document discusses dynamic adaptation techniques for optimizing data transfer performance over networks. It describes how the number of concurrent data transfer streams can be adjusted dynamically according to changing network conditions, without relying on historical measurements or external profiling. The proposed approach gradually increases the level of parallelism during a transfer to find a near-optimal number of streams based on instant throughput measurements, allowing it to adapt to varying environments and network utilization over time.
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Journals
Abstract One of the most complicated issues is to measuring the delay performance of end to end nodes in Multi-hop Wireless Networks. The two nodes are communicating via hopping over the multiple wireless links. The fact that is each node has to concentrate not only its own generated traffic, but also relayed one. Observing unfairness particularly for transmissions among nodes that are more than one hop Most of the existing works deals with the joint congestion control and scheduling algorithm, which does not focusing the delay performance. In turn, considering the throughput metric alone although for congestion control flows, throughput is the repeated difficult performance metric Packet delay is also important because practical congestion control protocols need to establish the timeouts for the retransmissions based on the packet delay, such parameters could significantly impact the speed of recovery when loss of packets occurred. The related issues on the delay-performance First, for long flows, the end to end delay may grow in terms of square with based on the number of hops. Second, it is difficult to control the end-to-end delay of each flows. TDMA schedules the transmissions in a fair way, in terms of throughput per connection, considering the communication requirements of the active flows of the network. It does not work properly in the multi-hop scenario, because it is generated only for single hop networks, We propose The Leaky Bucket Algorithm, in addition to joint congestion control and scheduling algorithm in multi-hop wireless networks. The proposed algorithm not only achieves the provable throughput and also considering the upper bounds of the delay of each flow. It reduces the transmission time by delivering packets at a constant bit rate even it receives the packet at a busty way. Keywords- Multi-hop wireless networks, congestion control, Performance, Delay, Flow, Throughput.
Enhancement of qos in multihop wireless networks by delivering cbr using lb a...eSAT Publishing House
This document summarizes a research paper that proposes using the Leaky Bucket Algorithm to enhance quality of service (QoS) in multi-hop wireless networks delivering constant bit rate (CBR) traffic. The Leaky Bucket Algorithm aims to reduce transmission delay by delivering packets at a constant rate even when packets arrive in bursts. It combines joint congestion control and a scheduling algorithm to not only achieve provable throughput guarantees, but also place explicit upper bounds on the end-to-end delay of each flow. Simulation results show the proposed approach reduces transmission time and improves throughput compared to existing scheduling algorithms that do not consider delay performance.
IRJET- Efficient and Secure Communication In Vehicular AD HOC NetworkIRJET Journal
The document discusses efficient and secure communication in vehicular ad hoc networks (VANETs). It proposes a Cluster based reliable routing (CRR) protocol. Vehicles are clustered based on their velocity, and a Cluster Controller (CC) is elected based on transmitter heights and position to manage communication among cluster members. The CRR protocol aims to address the challenging routing issues posed by the highly dynamic topology of VANETs.
IoT Resource Allocation and Optimization Using Improved Reptile Search AlgorithmIJCNCJournal
The Internet of Things (IoT) is a dispersed network system that connects the world through the Internet. The architecture of IoT consists of more gateways and resources which cannot be allocated in a manual process. The allocation of resources in IoT is a challenging process due to the higher consumption of energy and high latency rate. To overcome the challenges in existing works, this research introduced an Improved Reptile Search Algorithm (IRSA) to solve the optimization problem which occurs during the time of allocation resources among IoT networks. IRSA employs the methodology of levy flight and cross-over to update the candidate position and enhance the search speed in a single iteration. The proposed method consumes less energy and has low latency during data transmission from User equipment (UE) to the base station.IRSA has been compared with the existing Scalable Resource Allocation Framework (SRAF) and Improved Chaotic Firefly Algorithm (ICFA). The obtained experimental results show that the proposed IRSA attained better performance with an allocation rate of 96.40% which is comparatively higher than SRAF and ICFA with 92.40% and 91.67% respectively.
IoT Resource Allocation and Optimization Using Improved Reptile Search AlgorithmIJCNCJournal
The Internet of Things (IoT) is a dispersed network system that connects the world through the Internet. The architecture of IoT consists of more gateways and resources which cannot be allocated in a manual process. The allocation of resources in IoT is a challenging process due to the higher consumption of energy and high latency rate. To overcome the challenges in existing works, this research introduced an Improved Reptile Search Algorithm (IRSA) to solve the optimization problem which occurs during the time of allocation resources among IoT networks. IRSA employs the methodology of levy flight and cross-over to update the candidate position and enhance the search speed in a single iteration. The proposed method consumes less energy and has low latency during data transmission from User equipment (UE) to the base station.IRSA has been compared with the existing Scalable Resource Allocation Framework (SRAF) and Improved Chaotic Firefly Algorithm (ICFA). The obtained experimental results show that the proposed IRSA attained better performance with an allocation rate of 96.40% which is comparatively higher than SRAF and ICFA with 92.40% and 91.67% respectively.
Resource Allocation Optimization for Heterogeneous NetworkIOSRjournaljce
The improvement of communication throughput using a cross layer mode of communication is proposed. Due to critical mode of applications of sensor networks, it is required to achieve data at faster rate for high refreshment. As the communicating data’s are sensed or measured data, it is required to have higherthroughput and less interference, to achieve accuracy and optimal resource utilization. In this paper we propose aintegrated cross layer mechanism to achieve higher performance in sensor networks. A new approach of cross layer controlling, based on integrated factor of power allocationand memory blockage is proposed.This mode of communication results at faster data transfer, with lower energy resource consumption over a wirelesssensor network architecture.
A Cooperative Cache Management Scheme for IEEE802.15.4 based Wireless Sensor ...IJECEIAES
Wireless Sensor Networks (WSNs) based on the IEEE 802.15.4 MAC and PHY layer standards is a recent trend in the market. It has gained tremendous attention due to its low energy consumption characteristics and low data rates. However, for larger networks minimizing energy consumption is still an issue because of the dissemination of large overheads throughout the network. This consumption of energy can be reduced by incorporating a novel cooperative caching scheme to minimize overheads and to serve data with minimal latency and thereby reduce the energy consumption. This paper explores the possibilities to enhance the energy efficiency by incorporating a cooperative caching strategy.
A Systematic Review on Routing Protocols for VANETsIRJET Journal
This document provides a systematic review and comparative analysis of 10 routing protocols for vehicular ad hoc networks (VANETs). It summarizes the key methods, benefits, and conclusions of each protocol. The protocols use various techniques like clustering, machine learning, Q-learning, firefly algorithm, and particle swarm optimization to address the challenges of frequent topology changes in VANETs. Simulation results show the protocols improve metrics like packet delivery ratio, end-to-end delay, and network throughput compared to other existing protocols. In conclusion, an efficient routing protocol is needed to meet the unique requirements of VANETs and achieve good performance.
Call Admission Control (CAC) with Load Balancing Approach for the WLAN NetworksIJARIIT
The cell migrations take place between the different network operators, and require the significant information exchange between the operators to handle the migratory users. The new user registration requires the pre-shared information from the user’s equipment, which signifies the user recognition before registering the new user over the network. In this thesis, the proposed model has been aimed at the development of the new call admission control mechanism with the sub-channel assignment. The very basic utilization of the proposed model is to increase the number of the users over the given cell units, which is realized by using the sub-channel assignment to the users of the network. The proposed model is aimed at solving the issue by assigning the dual sub channels over the single communication channel. Also the proposed model is aimed at handling the minimum resource users by incorporating the load balancing approach over the given network segment. The load balancing approach shares the load of the overloaded cell with the cell with lowest resource utilization. The proposed model performance has been evaluated in the various scenarios and over all of the BTS nodes. The proposed model results have been obtained in the form of the resource utilization, network load, transmission delay, consumed bandwidth and data loss. The proposed model has shown the efficiency obtained by using the proposed call admission control (CAC) along with the new load balancing mechanism. The proposed model has shown the robustness of the proposed model in handling the cell overloading factors.
Recent many works have concentrated on
dynamically turning on/off some base stations (BSs) in order to
improve energy efficiency in radio access networks (RANs). In
this survey, we broaden the research over BS switching
operations, which should competition up with traffic load
variations. The proposed method formulate the traffic variations
as a Markov decision process which should differ from dynamic
traffic loads which are still quite challenging to precisely forecast.
A reinforcement learning framework based BS switching
operation scheme was designed in order to minimize the energy
consumption of RANs. Furthermore a transfer actor-critic
algorithm (TACT) is used to speed up the ongoing learning
process, which utilizes the transferred learning expertise in
historical periods or neighboring regions. The proposed TACT
algorithm performs jumpstart and validates the feasibility of
significant energy efficiency increment.
THE DEVELOPMENT AND STUDY OF THE METHODS AND ALGORITHMS FOR THE CLASSIFICATIO...IJCNCJournal
This document summarizes a study on developing methods and algorithms for classifying data flows of cloud applications in the network of a virtual data center. The researchers developed a hybrid approach using data mining and machine learning methods to classify traffic flows in real-time. They created an algorithm for classifying and adaptively routing cloud application traffic flows, which was implemented as a module in the software-defined network controller. This solution aims to improve the efficiency of handling user requests to cloud applications and reduce response times.
AN INTEGRATED SECURED ROUTING APPROACH FOR MANETSIRJET Journal
This document proposes an integrated routing approach for MANETs using machine learning algorithms. It uses a fuzzy clustering algorithm to select cluster heads based on trust values, providing multiple paths. An optimized route is then selected using Bacteria Foraging Optimization Algorithm (BFOA) to find the best path avoiding misbehaving nodes. The approach aims to provide secure, fast, and energy-efficient routing for MANETs challenged by frequent topology changes, limited power, and security threats.
Similar to Handover Algorithm based VLP using Mobility Prediction Database for Vehicular Network (20)
Redefining brain tumor segmentation: a cutting-edge convolutional neural netw...IJECEIAES
Medical image analysis has witnessed significant advancements with deep learning techniques. In the domain of brain tumor segmentation, the ability to
precisely delineate tumor boundaries from magnetic resonance imaging (MRI)
scans holds profound implications for diagnosis. This study presents an ensemble convolutional neural network (CNN) with transfer learning, integrating
the state-of-the-art Deeplabv3+ architecture with the ResNet18 backbone. The
model is rigorously trained and evaluated, exhibiting remarkable performance
metrics, including an impressive global accuracy of 99.286%, a high-class accuracy of 82.191%, a mean intersection over union (IoU) of 79.900%, a weighted
IoU of 98.620%, and a Boundary F1 (BF) score of 83.303%. Notably, a detailed comparative analysis with existing methods showcases the superiority of
our proposed model. These findings underscore the model’s competence in precise brain tumor localization, underscoring its potential to revolutionize medical
image analysis and enhance healthcare outcomes. This research paves the way
for future exploration and optimization of advanced CNN models in medical
imaging, emphasizing addressing false positives and resource efficiency.
Embedded machine learning-based road conditions and driving behavior monitoringIJECEIAES
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
Advanced control scheme of doubly fed induction generator for wind turbine us...IJECEIAES
This paper describes a speed control device for generating electrical energy on an electricity network based on the doubly fed induction generator (DFIG) used for wind power conversion systems. At first, a double-fed induction generator model was constructed. A control law is formulated to govern the flow of energy between the stator of a DFIG and the energy network using three types of controllers: proportional integral (PI), sliding mode controller (SMC) and second order sliding mode controller (SOSMC). Their different results in terms of power reference tracking, reaction to unexpected speed fluctuations, sensitivity to perturbations, and resilience against machine parameter alterations are compared. MATLAB/Simulink was used to conduct the simulations for the preceding study. Multiple simulations have shown very satisfying results, and the investigations demonstrate the efficacy and power-enhancing capabilities of the suggested control system.
Neural network optimizer of proportional-integral-differential controller par...IJECEIAES
Wide application of proportional-integral-differential (PID)-regulator in industry requires constant improvement of methods of its parameters adjustment. The paper deals with the issues of optimization of PID-regulator parameters with the use of neural network technology methods. A methodology for choosing the architecture (structure) of neural network optimizer is proposed, which consists in determining the number of layers, the number of neurons in each layer, as well as the form and type of activation function. Algorithms of neural network training based on the application of the method of minimizing the mismatch between the regulated value and the target value are developed. The method of back propagation of gradients is proposed to select the optimal training rate of neurons of the neural network. The neural network optimizer, which is a superstructure of the linear PID controller, allows increasing the regulation accuracy from 0.23 to 0.09, thus reducing the power consumption from 65% to 53%. The results of the conducted experiments allow us to conclude that the created neural superstructure may well become a prototype of an automatic voltage regulator (AVR)-type industrial controller for tuning the parameters of the PID controller.
An improved modulation technique suitable for a three level flying capacitor ...IJECEIAES
This research paper introduces an innovative modulation technique for controlling a 3-level flying capacitor multilevel inverter (FCMLI), aiming to streamline the modulation process in contrast to conventional methods. The proposed
simplified modulation technique paves the way for more straightforward and
efficient control of multilevel inverters, enabling their widespread adoption and
integration into modern power electronic systems. Through the amalgamation of
sinusoidal pulse width modulation (SPWM) with a high-frequency square wave
pulse, this controlling technique attains energy equilibrium across the coupling
capacitor. The modulation scheme incorporates a simplified switching pattern
and a decreased count of voltage references, thereby simplifying the control
algorithm.
A review on features and methods of potential fishing zoneIJECEIAES
This review focuses on the importance of identifying potential fishing zones in seawater for sustainable fishing practices. It explores features like sea surface temperature (SST) and sea surface height (SSH), along with classification methods such as classifiers. The features like SST, SSH, and different classifiers used to classify the data, have been figured out in this review study. This study underscores the importance of examining potential fishing zones using advanced analytical techniques. It thoroughly explores the methodologies employed by researchers, covering both past and current approaches. The examination centers on data characteristics and the application of classification algorithms for classification of potential fishing zones. Furthermore, the prediction of potential fishing zones relies significantly on the effectiveness of classification algorithms. Previous research has assessed the performance of models like support vector machines, naïve Bayes, and artificial neural networks (ANN). In the previous result, the results of support vector machine (SVM) were 97.6% more accurate than naive Bayes's 94.2% to classify test data for fisheries classification. By considering the recent works in this area, several recommendations for future works are presented to further improve the performance of the potential fishing zone models, which is important to the fisheries community.
Electrical signal interference minimization using appropriate core material f...IJECEIAES
As demand for smaller, quicker, and more powerful devices rises, Moore's law is strictly followed. The industry has worked hard to make little devices that boost productivity. The goal is to optimize device density. Scientists are reducing connection delays to improve circuit performance. This helped them understand three-dimensional integrated circuit (3D IC) concepts, which stack active devices and create vertical connections to diminish latency and lower interconnects. Electrical involvement is a big worry with 3D integrates circuits. Researchers have developed and tested through silicon via (TSV) and substrates to decrease electrical wave involvement. This study illustrates a novel noise coupling reduction method using several electrical involvement models. A 22% drop in electrical involvement from wave-carrying to victim TSVs introduces this new paradigm and improves system performance even at higher THz frequencies.
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...IJECEIAES
Climate change's impact on the planet forced the United Nations and governments to promote green energies and electric transportation. The deployments of photovoltaic (PV) and electric vehicle (EV) systems gained stronger momentum due to their numerous advantages over fossil fuel types. The advantages go beyond sustainability to reach financial support and stability. The work in this paper introduces the hybrid system between PV and EV to support industrial and commercial plants. This paper covers the theoretical framework of the proposed hybrid system including the required equation to complete the cost analysis when PV and EV are present. In addition, the proposed design diagram which sets the priorities and requirements of the system is presented. The proposed approach allows setup to advance their power stability, especially during power outages. The presented information supports researchers and plant owners to complete the necessary analysis while promoting the deployment of clean energy. The result of a case study that represents a dairy milk farmer supports the theoretical works and highlights its advanced benefits to existing plants. The short return on investment of the proposed approach supports the paper's novelty approach for the sustainable electrical system. In addition, the proposed system allows for an isolated power setup without the need for a transmission line which enhances the safety of the electrical network
Bibliometric analysis highlighting the role of women in addressing climate ch...IJECEIAES
Fossil fuel consumption increased quickly, contributing to climate change
that is evident in unusual flooding and draughts, and global warming. Over
the past ten years, women's involvement in society has grown dramatically,
and they succeeded in playing a noticeable role in reducing climate change.
A bibliometric analysis of data from the last ten years has been carried out to
examine the role of women in addressing the climate change. The analysis's
findings discussed the relevant to the sustainable development goals (SDGs),
particularly SDG 7 and SDG 13. The results considered contributions made
by women in the various sectors while taking geographic dispersion into
account. The bibliometric analysis delves into topics including women's
leadership in environmental groups, their involvement in policymaking, their
contributions to sustainable development projects, and the influence of
gender diversity on attempts to mitigate climate change. This study's results
highlight how women have influenced policies and actions related to climate
change, point out areas of research deficiency and recommendations on how
to increase role of the women in addressing the climate change and
achieving sustainability. To achieve more successful results, this initiative
aims to highlight the significance of gender equality and encourage
inclusivity in climate change decision-making processes.
Voltage and frequency control of microgrid in presence of micro-turbine inter...IJECEIAES
The active and reactive load changes have a significant impact on voltage
and frequency. In this paper, in order to stabilize the microgrid (MG) against
load variations in islanding mode, the active and reactive power of all
distributed generators (DGs), including energy storage (battery), diesel
generator, and micro-turbine, are controlled. The micro-turbine generator is
connected to MG through a three-phase to three-phase matrix converter, and
the droop control method is applied for controlling the voltage and
frequency of MG. In addition, a method is introduced for voltage and
frequency control of micro-turbines in the transition state from gridconnected mode to islanding mode. A novel switching strategy of the matrix
converter is used for converting the high-frequency output voltage of the
micro-turbine to the grid-side frequency of the utility system. Moreover,
using the switching strategy, the low-order harmonics in the output current
and voltage are not produced, and consequently, the size of the output filter
would be reduced. In fact, the suggested control strategy is load-independent
and has no frequency conversion restrictions. The proposed approach for
voltage and frequency regulation demonstrates exceptional performance and
favorable response across various load alteration scenarios. The suggested
strategy is examined in several scenarios in the MG test systems, and the
simulation results are addressed.
Enhancing battery system identification: nonlinear autoregressive modeling fo...IJECEIAES
Precisely characterizing Li-ion batteries is essential for optimizing their
performance, enhancing safety, and prolonging their lifespan across various
applications, such as electric vehicles and renewable energy systems. This
article introduces an innovative nonlinear methodology for system
identification of a Li-ion battery, employing a nonlinear autoregressive with
exogenous inputs (NARX) model. The proposed approach integrates the
benefits of nonlinear modeling with the adaptability of the NARX structure,
facilitating a more comprehensive representation of the intricate
electrochemical processes within the battery. Experimental data collected
from a Li-ion battery operating under diverse scenarios are employed to
validate the effectiveness of the proposed methodology. The identified
NARX model exhibits superior accuracy in predicting the battery's behavior
compared to traditional linear models. This study underscores the
importance of accounting for nonlinearities in battery modeling, providing
insights into the intricate relationships between state-of-charge, voltage, and
current under dynamic conditions.
Smart grid deployment: from a bibliometric analysis to a surveyIJECEIAES
Smart grids are one of the last decades' innovations in electrical energy.
They bring relevant advantages compared to the traditional grid and
significant interest from the research community. Assessing the field's
evolution is essential to propose guidelines for facing new and future smart
grid challenges. In addition, knowing the main technologies involved in the
deployment of smart grids (SGs) is important to highlight possible
shortcomings that can be mitigated by developing new tools. This paper
contributes to the research trends mentioned above by focusing on two
objectives. First, a bibliometric analysis is presented to give an overview of
the current research level about smart grid deployment. Second, a survey of
the main technological approaches used for smart grid implementation and
their contributions are highlighted. To that effect, we searched the Web of
Science (WoS), and the Scopus databases. We obtained 5,663 documents
from WoS and 7,215 from Scopus on smart grid implementation or
deployment. With the extraction limitation in the Scopus database, 5,872 of
the 7,215 documents were extracted using a multi-step process. These two
datasets have been analyzed using a bibliometric tool called bibliometrix.
The main outputs are presented with some recommendations for future
research.
Use of analytical hierarchy process for selecting and prioritizing islanding ...IJECEIAES
One of the problems that are associated to power systems is islanding
condition, which must be rapidly and properly detected to prevent any
negative consequences on the system's protection, stability, and security.
This paper offers a thorough overview of several islanding detection
strategies, which are divided into two categories: classic approaches,
including local and remote approaches, and modern techniques, including
techniques based on signal processing and computational intelligence.
Additionally, each approach is compared and assessed based on several
factors, including implementation costs, non-detected zones, declining
power quality, and response times using the analytical hierarchy process
(AHP). The multi-criteria decision-making analysis shows that the overall
weight of passive methods (24.7%), active methods (7.8%), hybrid methods
(5.6%), remote methods (14.5%), signal processing-based methods (26.6%),
and computational intelligent-based methods (20.8%) based on the
comparison of all criteria together. Thus, it can be seen from the total weight
that hybrid approaches are the least suitable to be chosen, while signal
processing-based methods are the most appropriate islanding detection
method to be selected and implemented in power system with respect to the
aforementioned factors. Using Expert Choice software, the proposed
hierarchy model is studied and examined.
Enhancing of single-stage grid-connected photovoltaic system using fuzzy logi...IJECEIAES
The power generated by photovoltaic (PV) systems is influenced by
environmental factors. This variability hampers the control and utilization of
solar cells' peak output. In this study, a single-stage grid-connected PV
system is designed to enhance power quality. Our approach employs fuzzy
logic in the direct power control (DPC) of a three-phase voltage source
inverter (VSI), enabling seamless integration of the PV connected to the
grid. Additionally, a fuzzy logic-based maximum power point tracking
(MPPT) controller is adopted, which outperforms traditional methods like
incremental conductance (INC) in enhancing solar cell efficiency and
minimizing the response time. Moreover, the inverter's real-time active and
reactive power is directly managed to achieve a unity power factor (UPF).
The system's performance is assessed through MATLAB/Simulink
implementation, showing marked improvement over conventional methods,
particularly in steady-state and varying weather conditions. For solar
irradiances of 500 and 1,000 W/m2
, the results show that the proposed
method reduces the total harmonic distortion (THD) of the injected current
to the grid by approximately 46% and 38% compared to conventional
methods, respectively. Furthermore, we compare the simulation results with
IEEE standards to evaluate the system's grid compatibility.
Enhancing photovoltaic system maximum power point tracking with fuzzy logic-b...IJECEIAES
Photovoltaic systems have emerged as a promising energy resource that
caters to the future needs of society, owing to their renewable, inexhaustible,
and cost-free nature. The power output of these systems relies on solar cell
radiation and temperature. In order to mitigate the dependence on
atmospheric conditions and enhance power tracking, a conventional
approach has been improved by integrating various methods. To optimize
the generation of electricity from solar systems, the maximum power point
tracking (MPPT) technique is employed. To overcome limitations such as
steady-state voltage oscillations and improve transient response, two
traditional MPPT methods, namely fuzzy logic controller (FLC) and perturb
and observe (P&O), have been modified. This research paper aims to
simulate and validate the step size of the proposed modified P&O and FLC
techniques within the MPPT algorithm using MATLAB/Simulink for
efficient power tracking in photovoltaic systems.
Adaptive synchronous sliding control for a robot manipulator based on neural ...IJECEIAES
Robot manipulators have become important equipment in production lines, medical fields, and transportation. Improving the quality of trajectory tracking for
robot hands is always an attractive topic in the research community. This is a
challenging problem because robot manipulators are complex nonlinear systems
and are often subject to fluctuations in loads and external disturbances. This
article proposes an adaptive synchronous sliding control scheme to improve trajectory tracking performance for a robot manipulator. The proposed controller
ensures that the positions of the joints track the desired trajectory, synchronize
the errors, and significantly reduces chattering. First, the synchronous tracking
errors and synchronous sliding surfaces are presented. Second, the synchronous
tracking error dynamics are determined. Third, a robust adaptive control law is
designed,the unknown components of the model are estimated online by the neural network, and the parameters of the switching elements are selected by fuzzy
logic. The built algorithm ensures that the tracking and approximation errors
are ultimately uniformly bounded (UUB). Finally, the effectiveness of the constructed algorithm is demonstrated through simulation and experimental results.
Simulation and experimental results show that the proposed controller is effective with small synchronous tracking errors, and the chattering phenomenon is
significantly reduced.
Remote field-programmable gate array laboratory for signal acquisition and de...IJECEIAES
A remote laboratory utilizing field-programmable gate array (FPGA) technologies enhances students’ learning experience anywhere and anytime in embedded system design. Existing remote laboratories prioritize hardware access and visual feedback for observing board behavior after programming, neglecting comprehensive debugging tools to resolve errors that require internal signal acquisition. This paper proposes a novel remote embeddedsystem design approach targeting FPGA technologies that are fully interactive via a web-based platform. Our solution provides FPGA board access and debugging capabilities beyond the visual feedback provided by existing remote laboratories. We implemented a lab module that allows users to seamlessly incorporate into their FPGA design. The module minimizes hardware resource utilization while enabling the acquisition of a large number of data samples from the signal during the experiments by adaptively compressing the signal prior to data transmission. The results demonstrate an average compression ratio of 2.90 across three benchmark signals, indicating efficient signal acquisition and effective debugging and analysis. This method allows users to acquire more data samples than conventional methods. The proposed lab allows students to remotely test and debug their designs, bridging the gap between theory and practice in embedded system design.
Detecting and resolving feature envy through automated machine learning and m...IJECEIAES
Efficiently identifying and resolving code smells enhances software project quality. This paper presents a novel solution, utilizing automated machine learning (AutoML) techniques, to detect code smells and apply move method refactoring. By evaluating code metrics before and after refactoring, we assessed its impact on coupling, complexity, and cohesion. Key contributions of this research include a unique dataset for code smell classification and the development of models using AutoGluon for optimal performance. Furthermore, the study identifies the top 20 influential features in classifying feature envy, a well-known code smell, stemming from excessive reliance on external classes. We also explored how move method refactoring addresses feature envy, revealing reduced coupling and complexity, and improved cohesion, ultimately enhancing code quality. In summary, this research offers an empirical, data-driven approach, integrating AutoML and move method refactoring to optimize software project quality. Insights gained shed light on the benefits of refactoring on code quality and the significance of specific features in detecting feature envy. Future research can expand to explore additional refactoring techniques and a broader range of code metrics, advancing software engineering practices and standards.
Smart monitoring technique for solar cell systems using internet of things ba...IJECEIAES
Rapidly and remotely monitoring and receiving the solar cell systems status parameters, solar irradiance, temperature, and humidity, are critical issues in enhancement their efficiency. Hence, in the present article an improved smart prototype of internet of things (IoT) technique based on embedded system through NodeMCU ESP8266 (ESP-12E) was carried out experimentally. Three different regions at Egypt; Luxor, Cairo, and El-Beheira cities were chosen to study their solar irradiance profile, temperature, and humidity by the proposed IoT system. The monitoring data of solar irradiance, temperature, and humidity were live visualized directly by Ubidots through hypertext transfer protocol (HTTP) protocol. The measured solar power radiation in Luxor, Cairo, and El-Beheira ranged between 216-1000, 245-958, and 187-692 W/m 2 respectively during the solar day. The accuracy and rapidity of obtaining monitoring results using the proposed IoT system made it a strong candidate for application in monitoring solar cell systems. On the other hand, the obtained solar power radiation results of the three considered regions strongly candidate Luxor and Cairo as suitable places to build up a solar cells system station rather than El-Beheira.
An efficient security framework for intrusion detection and prevention in int...IJECEIAES
Over the past few years, the internet of things (IoT) has advanced to connect billions of smart devices to improve quality of life. However, anomalies or malicious intrusions pose several security loopholes, leading to performance degradation and threat to data security in IoT operations. Thereby, IoT security systems must keep an eye on and restrict unwanted events from occurring in the IoT network. Recently, various technical solutions based on machine learning (ML) models have been derived towards identifying and restricting unwanted events in IoT. However, most ML-based approaches are prone to miss-classification due to inappropriate feature selection. Additionally, most ML approaches applied to intrusion detection and prevention consider supervised learning, which requires a large amount of labeled data to be trained. Consequently, such complex datasets are impossible to source in a large network like IoT. To address this problem, this proposed study introduces an efficient learning mechanism to strengthen the IoT security aspects. The proposed algorithm incorporates supervised and unsupervised approaches to improve the learning models for intrusion detection and mitigation. Compared with the related works, the experimental outcome shows that the model performs well in a benchmark dataset. It accomplishes an improved detection accuracy of approximately 99.21%.
Software Engineering and Project Management - Introduction, Modeling Concepts...Prakhyath Rai
Introduction, Modeling Concepts and Class Modeling: What is Object orientation? What is OO development? OO Themes; Evidence for usefulness of OO development; OO modeling history. Modeling
as Design technique: Modeling, abstraction, The Three models. Class Modeling: Object and Class Concept, Link and associations concepts, Generalization and Inheritance, A sample class model, Navigation of class models, and UML diagrams
Building the Analysis Models: Requirement Analysis, Analysis Model Approaches, Data modeling Concepts, Object Oriented Analysis, Scenario-Based Modeling, Flow-Oriented Modeling, class Based Modeling, Creating a Behavioral Model.
Introduction- e - waste – definition - sources of e-waste– hazardous substances in e-waste - effects of e-waste on environment and human health- need for e-waste management– e-waste handling rules - waste minimization techniques for managing e-waste – recycling of e-waste - disposal treatment methods of e- waste – mechanism of extraction of precious metal from leaching solution-global Scenario of E-waste – E-waste in India- case studies.
Discover the latest insights on Data Driven Maintenance with our comprehensive webinar presentation. Learn about traditional maintenance challenges, the right approach to utilizing data, and the benefits of adopting a Data Driven Maintenance strategy. Explore real-world examples, industry best practices, and innovative solutions like FMECA and the D3M model. This presentation, led by expert Jules Oudmans, is essential for asset owners looking to optimize their maintenance processes and leverage digital technologies for improved efficiency and performance. Download now to stay ahead in the evolving maintenance landscape.
VARIABLE FREQUENCY DRIVE. VFDs are widely used in industrial applications for...PIMR BHOPAL
Variable frequency drive .A Variable Frequency Drive (VFD) is an electronic device used to control the speed and torque of an electric motor by varying the frequency and voltage of its power supply. VFDs are widely used in industrial applications for motor control, providing significant energy savings and precise motor operation.
Design and optimization of ion propulsion dronebjmsejournal
Electric propulsion technology is widely used in many kinds of vehicles in recent years, and aircrafts are no exception. Technically, UAVs are electrically propelled but tend to produce a significant amount of noise and vibrations. Ion propulsion technology for drones is a potential solution to this problem. Ion propulsion technology is proven to be feasible in the earth’s atmosphere. The study presented in this article shows the design of EHD thrusters and power supply for ion propulsion drones along with performance optimization of high-voltage power supply for endurance in earth’s atmosphere.
Applications of artificial Intelligence in Mechanical Engineering.pdfAtif Razi
Historically, mechanical engineering has relied heavily on human expertise and empirical methods to solve complex problems. With the introduction of computer-aided design (CAD) and finite element analysis (FEA), the field took its first steps towards digitization. These tools allowed engineers to simulate and analyze mechanical systems with greater accuracy and efficiency. However, the sheer volume of data generated by modern engineering systems and the increasing complexity of these systems have necessitated more advanced analytical tools, paving the way for AI.
AI offers the capability to process vast amounts of data, identify patterns, and make predictions with a level of speed and accuracy unattainable by traditional methods. This has profound implications for mechanical engineering, enabling more efficient design processes, predictive maintenance strategies, and optimized manufacturing operations. AI-driven tools can learn from historical data, adapt to new information, and continuously improve their performance, making them invaluable in tackling the multifaceted challenges of modern mechanical engineering.
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...shadow0702a
This document serves as a comprehensive step-by-step guide on how to effectively use PyCharm for remote debugging of the Windows Subsystem for Linux (WSL) on a local Windows machine. It meticulously outlines several critical steps in the process, starting with the crucial task of enabling permissions, followed by the installation and configuration of WSL.
The guide then proceeds to explain how to set up the SSH service within the WSL environment, an integral part of the process. Alongside this, it also provides detailed instructions on how to modify the inbound rules of the Windows firewall to facilitate the process, ensuring that there are no connectivity issues that could potentially hinder the debugging process.
The document further emphasizes on the importance of checking the connection between the Windows and WSL environments, providing instructions on how to ensure that the connection is optimal and ready for remote debugging.
It also offers an in-depth guide on how to configure the WSL interpreter and files within the PyCharm environment. This is essential for ensuring that the debugging process is set up correctly and that the program can be run effectively within the WSL terminal.
Additionally, the document provides guidance on how to set up breakpoints for debugging, a fundamental aspect of the debugging process which allows the developer to stop the execution of their code at certain points and inspect their program at those stages.
Finally, the document concludes by providing a link to a reference blog. This blog offers additional information and guidance on configuring the remote Python interpreter in PyCharm, providing the reader with a well-rounded understanding of the process.
Gas agency management system project report.pdfKamal Acharya
The project entitled "Gas Agency" is done to make the manual process easier by making it a computerized system for billing and maintaining stock. The Gas Agencies get the order request through phone calls or by personal from their customers and deliver the gas cylinders to their address based on their demand and previous delivery date. This process is made computerized and the customer's name, address and stock details are stored in a database. Based on this the billing for a customer is made simple and easier, since a customer order for gas can be accepted only after completing a certain period from the previous delivery. This can be calculated and billed easily through this. There are two types of delivery like domestic purpose use delivery and commercial purpose use delivery. The bill rate and capacity differs for both. This can be easily maintained and charged accordingly.
2. ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 8, No. 4, August 2018 : 2477 – 2485
2478
It is noted that the technical details and system procedures of handover in heterogeneous networks
fifth generation (5G) attribute system have fundamental differences with other systems, however, there is no
specification that has been designed or released. As the main contributions of this paper, based on the frame
structures, protocol, measurement procedure; the system information and handover procedure are analyzed
and designed on the basis of the LTE-Advanced network. Thus, to allow the predictability and generality of
this network architecture to be maintained. The key of research of this paper, the details of the handover
procedure which includes the new handover decision-making scheme and signaling flow during intra-macro
cell and inter-macro cell handover are presented and thoroughly designed.
The paper presents a set of the prediction method for selecting the best AP. On the basis of this
method, it then describes the preparation of handover algorithm. The combination of these two methods will
provide an effective technique to improve handover performance on vehicular networks. The remainder of
this paper is structured as follows. Section 2 presents related work. Section 3 presents the mobility prediction
proposed scheme. Section 4 portrays the handover algorithm combined with mobility prediction, simulation
setting and contributed scenarios. Section 5 presents and discusses the simulation results and finally, the
paper concludes in Section 6.
2. RESEARCH METHOD
The mobility prediction can enhance the handover performance by reducing handover latency,
packet jitter, and end-to-end delay. One key approach for mobility prediction is using Markov Chain
predictor. In this section, a mobility prediction via Markov Chain as a technique to assist the handover
procedure in the vehicular network is proposed. The overview of envisions about the vehicles network data
available and the system network architecture is explained first before describing the prediction algorithm.
Wireless network for the user in vehicles that traveling from one cell to another is assumed to have open
access mode. Every node or AP records its coordinates as well as its ID number. Besides, there is a
centralized approach to collect the history of every node and execute the prediction algorithm. Therefore, the
trajectory of the vehicles is denoted by sequences of AP ID numbers, which form a model for prediction
scheming.
Markov Chain predictor is based on probability matrix that utilizes trajectory of the users that are
stored in a database. The database consists of multiple available sources of information and is organized in
the proposed data structure. In this work, the database is collected from user’s data traces using logging
report, which are then processed into transaction database. The Markov chain equation can be derived as:
n
n tp p P (1)
Where,
initial distribution matrix,
current transition probability matrix,
number of state transition.
2.1. User mobility pattern
Equation (1) is used to predict vehicle’s next location. The main parameter for this equation is TPM.
Many studies have shown that value in TPM is trained from user’s mobility history [13], [14]. The collection
of user’s mobile history provides useful information such as frequently visited locations, common routes and
received the radio signal. However, it is not easy to deal with such data. The user’s mobility history may
consume much memory, energy, and bandwidth, especially at the base stations that are frequently visited.
Therefore, the data should be checked and pre-processed before carrying the analysis. A method called data
mining is needed to extract and analyze data. In this section, the formal definitions to model mobility pattern
and rules are given.
Definition 1. Let C and as a set of access point ID and time respectively. The ordered pairs
, where and , is called a point. Denote to be the set of all points
{ }.
Two points and are considered. Point is equivalent to , if and only if
and . If , point is defined as an earlier location than point which means the user
connected to point before connected to point .
Definition 2. A trajectory of the user is defined as a finite sequence of the points
in space where point for .
3. Int J Elec & Comp Eng ISSN: 2088-8708
Handover Algorithm based VLP using Mobility Prediction Database … (Arfah A. Hasbollah)
2479
The value of point p must be unique in the trajectory for each user (e.g. ), where the user
cannot be connected to the same AP at the same time. The value of time shall be unique in the trajectory.
However, the value of AP ID can be the same with different time, . Means, the user can be connected to
the same AP, but at a different time. If there is a case where point is the same as other point , the data
obtained is set as an information error. The earlier information is stored while other duplicate information
shall be removed from the log file.
Definition 3. Time interval is an interval time between two sequence points .
Time gap tg is a maximum interval time that the user connected to a point p. If the time interval
, the user is assumed to stop moving or reach its destination.
The time gap is introduced to create a partition between trajectories and identify the last
destination of the user. The accuracy of the transactional database is expected to be increased when the time
gap is used. The value of the time gap should be chosen properly because it may affect the prediction
accuracy of the user’s next location.
From the log file, the source-destination table is computed then the transactional database is
developed. The transactional database shows a relationship between the source AP and the destination AP.
This is the final step of the user’s mobility history scheme before the value of the transactional database is
utilized in the Markov Chain equation to predict the user’s next location.
2.2. Transactional database
The first step in data mining process is to create a log file as in Figure 1. The format of the log file is
inspired by [15]. Data contained in the log file are a date, time, location, and type of transport. The date
represents a date the user connect to the AP. Location represents AP ID number the user is connected at a
particular time. Time represents the time the user is connected to the particular AP. And lastly, transport
represents what kind of transport they use at the particular time because different vehicles have different
speed. This log file will be updated each time user moves from one location to another. Data collection is
done by considering some assumption: 1) Wireless network in campus is open access mode. 2) All APs are
located in every building.
Figure 1. Log file
Data collection must be done when the mobile client is in ’idle’ mode and not communicating with
any AP. The idle mode is chosen because to avoid the effect on actual data performance. In this research, a
group of real vehicles user mobility traces in Universiti Teknologi Malaysia (UTM) are used which consists
of undergraduate students, post-graduate students, and staff. With our pre-process on the original data, the
mobility trace denotes associated history of each vehicle by the cell number in the network under a simple
mobility model assumption. After logging report is acquired, the transactional database is created to relate
between the source and destination base station. The most frequent visited base station will be detected via
the database. Figure 2 shows the step of transactional database development.
Figure 2. Source-destination table
4. ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 8, No. 4, August 2018 : 2477 – 2485
2480
First, logging report is converted into the source-destination table to identify user’s trajectory. From
the source-destination table, a transactional database is developed based on the relationship between source
and destination AP. Day and time should be considered when converting logging report into the source-
destination table. The starting location for each day is set as the source, and then next location will become
the destination. If there is third movement after that, the current location will become the source and next
location will become the destination. These steps will be carried out continuously throughout the day
according to logging report. The last location for that day will become the destination. Then for the next day
location, it will become the new source.
From the source-destination table, the transactional database is developed base on the relationship
between source and destination AP. The first column in the transactional database represents source AP and
the first row represents destination AP. The value of each relationship determines the frequency of user
attached to each AP. The grand total is the total amount of user’s transition from each base station to another.
Once the transactional database is created, the TPM is generated.
TPM can be defined by dividing each value by the total value for each row in the transactional
database. The value of transition probability is verified using summation for each row in the transactional
database that should equal to 1. TPM value can be derived following Equation (2). This will be applied to all
value in the transactional database. This process will occur continuously along with the acquired data. Then,
this TPM used in Markov equation to predict vehicle’s next location. After mobility prediction is calculated,
prediction accuracy is computed for proper estimation of user’s next location. The predicted result will be
verified to lessen any error in prediction. Figure 3 shows the step of generating TPM from the transactional
database.
1
1
i
i
p
TPM
p
(2)
Where number of destination.
Figure 3. Step for generating TPM
The mobility prediction can be calculated after determining the initial probability or initial state of
the mobile user. As mention before, initial state can be calculated by some parameter such as the number of
the user, velocity of mobile user or distance target, or location, etc. This parameter is presented as initial state
matrix. Furthermore, by using user’s initial state or GPS location and velocity as the value of initial state
matrix and TPM as Equation (1), the next location of the mobile user can be calculated.
The predicted result then checked to mitigate an error in prediction. Ideal case in handover is mobile
user should handoff to the adjacent AP. However, if predicted AP is not adjacent to the previous AP, the
predicted AP is considered an error. In order to verify the efficiency of mobility prediction technique,
prediction accuracy is calculated based on the ratio between the number of correct prediction and the total
number of predictions as in Equation (3). Flowchart of proposed mobility prediction process is shown in
Figure 5.
Pr cp
p
N
ediction accuracy
N
(3)
Where number of correct predictions and number of predictions. Figure 4 illustrate the
performance comparisons of VLP method and heuristic method [13]. Simulation result demonstrates that the
5. Int J Elec & Comp Eng ISSN: 2088-8708
Handover Algorithm based VLP using Mobility Prediction Database … (Arfah A. Hasbollah)
2481
proposed predictive mobility scheme outperformed a heuristic predictive scheme because VLP method
achieves higher prediction accuracy which peaks at about 0.96 compared to the heuristic method which is
peaks at about 0.71.
Figure 4. Prediction accuracy comparison between VLP method and heuristic method
Figure 5. VLP technique
6. ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 8, No. 4, August 2018 : 2477 – 2485
2482
3. HANDOVER ALGORITHM FOR VEHICULAR NETWORK
According to [16], a conventional handover procedure consists initiation step, network selection
step, and execution step. In initiation step, UE measures the channel qualities such as Received Signal
Strength (RSS), Signal to Interference Ratio (SIR), distance and others from a different cell. Then UE sends
the measurement report back to the serving cell. The serving cell then forwards the measurement report to
control unit. Control unit decides which cell is the best to maintain the connection in network selection step.
At this rate, the handover decision-making process will be performed based on handover threshold. If the
handover is required, then control unit informs the target cell and lets serving cell send the handover
command to UE. Finally, in execution step, the UE starts to set up a connection with the target cell by
sending authentication, synchronization, network reconfiguration, etc. After the handover process is
completed, UE sends an indication signal to the target cell. From these procedures, it involves many wireless
and backbone exchanging signal. It may take some time to complete the handover. In this section, a handover
algorithm that overcomes this problem is delivered.
The proposed vehicular location prediction handover algorithm (VLP_HA) was designed by
adopting Markov chain mobility prediction feature, was a promising technique to improve the overall
wireless network performance. This improvement was important to minimize handover delay and to improve
data throughput. As explained in the previous section, handover decision phase is the important part to ensure
the mobile user has good communication quality. VLP_HA requires the prediction results from the proposed
vehicle location prediction (VLP) to assist the handover decision.
VLP_HA is started by the serving cell receives the measurement report from UE. Control unit then
received the measurement report and decided the target cell by examining the neighbor cell with highest RSS
value. At the same time, the best neighbor cell was verified with the prediction results. If the best neighbor
cell was same as the predicted cell, it suggested that the target cell is the location that UE should go. Thus,
the handover was needed. However, if the best neighbor cell was not same as predicted cell, it assumed that
the target cell was not the location that UE should go. Therefore, the handover was unnecessary and it will be
delayed for a while. The handover can be performed when the target cell RSS is higher than source cell RSS
at least by handover trigger offset. This procedure was conducted to minimize the number of unnecessary
handovers that lead to ping-pong effect. Moreover, VLP_HA was a simple algorithm and could achieve fast
handover. Since the coverage area of AP is small, UE may pass through the coverage area within the short
time, which is why fast handover was needed.
The network simulation scenarios are set as shown in Table 1. The simulation time was set for 100
seconds to observe the overall network performance as well as the arrival time for UE. All APs have the
same characteristic which transmits 30 dBm powers. The scenario considers the open access mode for all
APs. Hence, the UE can connect to the APs without any restriction.
The handover simulations were performed using QualNet to observe the handover performance
when the UE speed is varied. Each simulation result was recorded, tabulated and the handover performance
was analyzed. The network simulation scenario is based on real topology in UTM within the area of 1.5km
1.5km as shown in Figure 6. This network scenario consists a group of wireless APs organized for 1 mobile
user. It also consists 4 mobility management entity (MME) and serving gateway (SGW) nodes supporting to
the AP region and a core network. SGW shall forward the data that come from the base station and packet
data network gateway. MME is used to control the high-level operation such as choosing the right SGW for
the UE and authenticating them. MME also responsible for controlling the mobility between the LTE
networks with other access networks.
As simulation starts, UE moves toward the destination. As it approaches next eNB, UE starts to lose
network coverage. UE will start sending the measurement report to next eNB to start handover process.
However, the challenge here is eNBs is closed with each other and mobile UE is not allowed UE to do
normal handover process. Ping pong effect also happened at this stage. But with predict handover scheme,
the next eNB is predicted and handover process time will be shortened because handover decision is taken
based on predicted next eNB.
Table 1. Simulation parameter
Variable Value
Simulation Time 100s
Transmission Power 30 dBm
Number of UE 1
UE velocity 1 – 10 m/s
Receiver Sensitivity -80 dBm
Handover RSS Trigger -72 dB
7. Int J Elec & Comp Eng ISSN: 2088-8708
Handover Algorithm based VLP using Mobility Prediction Database … (Arfah A. Hasbollah)
2483
Figure 6. Network simulation scenario
4. RESULT AND DISCUSSION
This section analyzed the simulation result of the handover performance and discussed in detail.
The network performances were measured in term of delivery delay, network throughput, and packet delivery
ratio. Delivery delay performance is to look at the delivery delay rate when data was being sent to AP during
the communication. If the delivery delay rate is high, it means that the network is in the congested state. A
jitter arriving, caused by network congestion, timing drifts, or route changes. So, delivery delay plays an
important role to determine the network jitter as the lower delivery rate, the less network jitter occurs.
Meanwhile, the network throughput is the sum of the data rates that are delivered to all eNBs nodes or APs in
a network. Packet delivery ratio is the ratio between the number of data packets sent by source nodes and the
number of packets received by the destination.
Figure 7 depicts the delivery delay for user speed between 1 m/s to 10 m/s. Compared to
conventional handover, network delay rate for predicted handover scheme is improved by 45% which is
indicates APs trigger handover process is faster than conventional handover scheme. Additionally, knowing
where destination nodes are heading with high accuracy, packets forwarders can make better decisions to
choose the next hop. It could be concluded that VLP-HA can perform faster handover compared to
conventional handover.
Figure 8 shows the handover throughput versus user’s speed (1-10 m/s). In the simulation scenario,
UE is moving across the network on a predefined path, and the throughput would fluctuate when the UE is
moving into the cell center or moving out to the cell edge. According to Figure 8, the network throughput
seems to be increased by 4% for predicted handover scheme greater than conventional handover scheme.
This concludes that mobility prediction can significantly and stably improve the capacity of users in the
vehicle, thus providing the possibility to support high data rate services.
Figure 9 plots the packet delivery ratio. It turns out that the packet delivery ratio (PDR) is almost
same for conventional handover and predicted handover. It means that the ratio between two schemes is
almost identical and not much difference. PDR for VLP-HA have difference about 1% with conventional
handover. Apparently, it also depends on the UE speed. The PDR starts with high value. However, when the
UE speed increases, the PDR drops to below 85% due to the packet dropping over frequent handover.
Although network throughput for predicted handover is higher than conventional handover, the higher UE
predictive state information in PDR offers better performance.
Figure 7. Handover delay with and without mobility predictions under different velocities
8. ISSN: 2088-8708
Int J Elec & Comp Eng, Vol. 8, No. 4, August 2018 : 2477 – 2485
2484
Figure 8. Handover throughput with and without mobility predictions
Figure 9. Packet delivery ratio when under different velocities
5. CONCLUSION
In this paper, the handover with mobility prediction algorithm is used in the vehicular network. It is
shown that the conventional handover techniques take a lot of time from initiation step to network selection
and execution step. Hence, it will be the disadvantage for the mobile user which leads to frequent cell
selection, higher end-to-end delay, call drop and inaccessibility data service. To improve the handover
method, a simple and efficient method is proposed to allocate the network resource for the shortest time
which is using mobility prediction. The results indicate that the proposed handover method outperforms the
conventional handover method and gives several advantages: 1) It has lower end-to-end delay; 2) it exhibits
more data throughput within the network; 3) the mobility prediction algorithm can be easily developed using
user’s history database; 4) The mobility prediction have high accuracy, hence give low complexity algorithm.
ACKNOWLEDGEMENTS
The authors would like to thank all those had contributed towards making this research successful,
especially the support from research team Advanced Telecommunication Technology (ATT) and Shibaura
Institute of Technology (SIT). The authors wish to express their gratitude to the Ministry of Higher
Education Malaysia (MOHE), Research Management Center UTM (RMC) for the sponsorship and financial
support (Vot Number Q.J13000.2523.13H24 ).
REFERENCES
[1] H. Mahajan, Payal; Singh, Kuldeep; Kaur, “Handover decision mechanism in interworking technologies using
radial basis functions,” IAES Int. J. Artif. Intell., vol. 3, no. 2, pp. 79-83, 2014.
[2] M. Mouton, G. Castignani, R. Frank, and T. Engel, “Enabling Vehicular Mobility in City-wide IEEE 802.11
Networks Through Predictive Handovers,” Veh. Commun., vol. 2, no. 2, pp. 59-69, 2015.
[3] A. S. Sadiq, K. A. Bakar, K. Z. Ghafoor, and A. J. Gonzalez, “Mobility and Signal Strength-Aware Handover
Decision in Mobile IPv6 based Wireless LAN,” in International MultiConference of Engineers and Computer
Scientists, 2011.
[4] W. Xiaonan and Q. Huanyan, “Mobility Management Solution for IPv6-based Vehicular Networks,” Comput.
Stand. Interfaces, vol. 36, no. 1, pp. 66-75, 2013.
[5] J. Moon and D. Cho, “Efficient Group Handoff Decision Algorithm for Wireless Networks with Mobile Access
Points,” in 2011 - MILCOM 2011 Military Communications Conference, 2011, pp. 1096-1101.
[6] X. Xu, “Access Control and Handover Strategy for Multiple Access Points Cooperative Communication in Vehicle
Environments,” in Vehicular Technologies - Deployment and Applications, InTech, 2013, pp. 97-115.
[7] S. Chae, T. Nguyen, and Y. M. Jang, “Seamless QoS-Enabled Handover Scheme Using CoMP in Fast Moving
Vehicular Networks,” Int. J. Distrib. Sens. Networks, pp. 1-8, 2013.
9. Int J Elec & Comp Eng ISSN: 2088-8708
Handover Algorithm based VLP using Mobility Prediction Database … (Arfah A. Hasbollah)
2485
[8] D. Barth, S. Bellahsene, and L. Kloul, “Mobility Prediction Using Mobile User Profiles,” in 2011 IEEE 19th
Annual International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunication
Systems, 2011, pp. 286-294.
[9] G. Zhang and F. Liu, “An Auction Approach to Group Handover with Mobility Prediction in Heterogeneous
Vehicular Networks,” in 2011 11th International Conference on ITS Telecommunications, 2011, pp. 584-589.
[10] L. Zhanjun, M. Qichao, R. Cong, and C. Qianbin, “Load Balancing Based on the Specific Offset of Handover,”
TELKOMNIKA (Telecommunication Computing, Electronics and Control), vol. 12, no. 8, pp. 6281-6290, 2014.
[11] R. Zhang, M. Wu, Y. Zhang, and L. Luan, “Alternative Reference Point Based Handover Algorithm for LTE High-
speed Rail,” Indones. J. Electr. Eng. Comput. Sci., vol. 12, no. 3, pp. 2278-2284, 2014.
[12] G. Xue, Y. Luo, J. Yu, and M. Li, “A Novel Vehicular Location Prediction Based On Mobility Patterns for Routing
In Urban VANET,” EURASIP J. Wirel. Commun. Netw., no. 1, p. 222, 2012.
[13] N. A. Amirrudin, S. H. S. Ariffin, N. N. N. A. Malik, and N. E. Ghazali, “User’s Mobility History-based Mobility
Prediction in LTE Femtocells Network,” in IEEE International RF and Microwave Conference (RFM2013), 2013,
pp. 105-110.
[14] S. Chen, Y. Li, W. Ren, D. Jin, and P. Hui, “Location Prediction for Large Scale Urban Vehicular Mobility,”
in Wireless Communications and Mobile Computing Conference (IWCMC), 2013, pp. 1733-1737.
[15] N. A. Amirrudin, “Mobility Prediction via Markov Model in LTE Femtocell,” Int. J. Comput. Appl., vol. 65,
no. 18, pp. 40-44, 2013.
[16] Q.-A. Zeng and D. P. Agrawal, “Handoff in Wireless Mobile Networks,” in Handbook of Wireless Networks and
Mobile Computing, I. Stojmenovic, Ed. John Wiley & Sons, 2002, p. 662.
BIOGRAPHIES OF AUTHORS
Arfah A. Hasbollah received the B.E degree in Electrical (Electronics) in 2007 and M.E. degree in
Electrical-Electronics and Telecommunication in 2009 from Universiti Teknologi Malaysia (UTM).
Now she is pursuing Ph.D in Universiti Teknologi Malaysia. She is currently an Officer of Higher
Education in Politeknik Ibrahim Sultan. Her current research interests include vehicular network,
mobility management in LTE, LTE-A and 5G, and Mobile Computing System.
Sharifah Hafizah Sed Ariffin received her B.Eng (Hons) from London Metropolitan University
(formerly known as University of North London) in 1997, and obtained her MEE and Ph.D in 2001
and 2006 from Universiti Teknologi Malaysia, and Queen Mary, University of London, London
respectively. She is currently Associate Professor with Faculty of Electrical Engineering, Universiti
Teknologi Malaysia. Her current research interests are in Internet of Things, Ubiquitous computing
and smart devices Wireless sensor networks, IPV6, Handoff Management, 6loWPAN and Network
and Mobile Computing System.
N. Effiyana Ghazali received the B.E. (2007) degree from Universiti Teknologi Malaysia. She
received two M. E. degree, which is from Shibaura Institute of Technology (2010) and Universiti
Teknologi Malaysia (2011). She received Ph.D (2016) from Universiti Teknologi Malaysia. Now she
is working in Faculty of Electrical Engineering at Universiti Teknologi Malaysia who is currently
active in research of Mobility Management, Sport Monitoring System, Ubiquitous Network, 5G and
Handover Management.
Kamaludin Mohamad Yusof received his B.Eng in 2000, MEE in 2012 from Universiti Teknologi
Malaysia. He received Ph.D in 2014 from University of Essex, Essex. He is currently working with
Faculty of Electrical Engineering, Universiti Teknologi Malaysia. His current research interests are in
Signal Propagation, Ranging Estimation, Localisation, Wireless Sensor Network (WSN), Cognitive
Radio (CR), Frequency Scanning, Software-Defined Radio (SDR), Networking, Software-Defined
Network (SDN), Internet-of-Things (IoT), Crowd Sourcing and Data Mining.
Hiroaki Morino received B.E, M.E. and Ph.D. degrees from the University of Tokyo in 1994, 1996
and 1999, respectively. He is currently an associate professor of Shibaura Institute of Technology,
Japan. His research interests include the MAC protocols and routing protocols of wireless multihop
networks, urgent information gathering and notification systems using wireless sensor networks, and
reliable peer-to-peer video multicast networks.