An analytic network process and trapezoidal interval-valued fuzzy technique f...University of Piraeus
Next generation wireless networks consist of many heterogeneous access technologies that should support various service types with different quality of service (QoS) constraints, as well as user, requirements and provider policies. Therefore, the need for network selection mechanisms that consider multiple factors must be addressed. In this paper, a network selection method is proposed by applying the analytic network process to estimate the weights of the selection criteria, as well as a fuzzy version of technique for order preference by similarity to ideal solution to perform the ranking of network alternatives. The method is applied to a heterogeneous network environment providing different QoS classes and policy characteristics. Each user applies the method to select the most appropriate network, which satisfies his or her requirements in respect of his or her service-level agreement (SLA). Performance evaluation shows that when the user requests only one service, the proposed method performs better compared to the original technique for order preference by similarity to ideal solution, as well as the Fuzzy AHP-ELECTRE method. Moreover, the proposed method can be applied in cases where a user requires multiple services simultaneously on a device. The sensitivity analysis of the proposed method shows that it can be properly adjusted to conform to network environment changes.
Throughput in cooperative wireless networksjournalBEEI
Cognitive radio networks emerge as a solution to fixed allocation issues and spectrum scarcity through the dynamic access to spectrum. In cognitive networks, users must make intelligent decisions based on spectrum variation and actions taken by other users. Under this dynamic, cooperative systems can significantly improve quality of service parameters. This article presents the comparative study of the multi-criteria decision-making algorithms SAW and FFAHP through four levels of cooperation (10%, 20%, 50%, 80% y 100%) established between secondary users. The results show the performance evaluation obtained through of simulations and experimental measurements. The analysis is carried out based on throughput, depending on the class of service and the type of traffic.
WMNs: The Design and Analysis of Fair Schedulingiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Routing in Wireless Mesh Networks: Two Soft Computing Based Approachesijmnct
Due to dynamic network conditions, routing is the most critical part in WMNs and needs to be optimised.
The routing strategies developed for WMNs must be efficient to make it an operationally self configurable
network. Thus we need to resort to near shortest path evaluation. This lays down the requirement of some
soft computing approaches such that a near shortest path is available in an affordable computing time. This
paper proposes a Fuzzy Logic based integrated cost measure in terms of delay, throughput and jitter.
Based upon this distance (cost) between two adjacent nodes we evaluate minimal shortest path that updates
routing tables. We apply two recent soft computing approaches namely Big Bang Big Crunch (BB-BC) and
Biogeography Based Optimization (BBO) approaches to enumerate shortest or near short paths. BB-BC
theory is related with the evolution of the universe whereas BBO is inspired by dynamical equilibrium in
the number of species on an island. Both the algorithms have low computational time and high convergence
speed. Simulation results show that the proposed routing algorithms find the optimal shortest path taking
into account three most important parameters of network dynamics. It has been further observed that for
the shortest path problem BB-BC outperforms BBO in terms of speed and percent error between the
evaluated minimal path and the actual shortest path.
Hybrid multi objectives genetic algorithms and immigrants scheme for dynamic ...khalil IBRAHIM
the main concept of intelligent optimization techniques, artificial neural networks, and new genetic algorithms to solve the multi-objective multicast routing problems with shortest path (SP) problem that used in the addresses networks and improve all processes addressing in the wireless communications based on multi-objective optimization. The most important characteristics in mobile wireless networks is the topology dynamics and the network topology changes over time, the routing problem (SPRP) in mobile ad hoc networks (MANETs) turns out to be a dynamic optimization problem[13], the hybrid immigrants multiple-objective genetic algorithm (HIMOGAs) in the real- world are dynamic in nature, that has objective functions, constraints, and parameters, the dynamic optimization problems (DOPs) are a big challenges to evolutionary multi-objective, since any environmental change may affect the objective vector, constraints, and parameters, HIMOGA for the optimization goal is to track the moving of parameters and get a sequence of approximations solutions over time. The quantity of services (QoS) is supporting guarantee for all data traffic and getting the maximizing utilization for network, the QoS based on multicast routing offers significant challenges, and increases to use an efficient multicast routing protocol that will be able to check multicast routing and satisfying QoS constraints, The author propose to use HIMOGAs and SP algorithm to solve multicast problem that produces new generation wireless networks with immigrants schema to get high-quality solutions after each change and satisfying all objectives.
An analytic network process and trapezoidal interval-valued fuzzy technique f...University of Piraeus
Next generation wireless networks consist of many heterogeneous access technologies that should support various service types with different quality of service (QoS) constraints, as well as user, requirements and provider policies. Therefore, the need for network selection mechanisms that consider multiple factors must be addressed. In this paper, a network selection method is proposed by applying the analytic network process to estimate the weights of the selection criteria, as well as a fuzzy version of technique for order preference by similarity to ideal solution to perform the ranking of network alternatives. The method is applied to a heterogeneous network environment providing different QoS classes and policy characteristics. Each user applies the method to select the most appropriate network, which satisfies his or her requirements in respect of his or her service-level agreement (SLA). Performance evaluation shows that when the user requests only one service, the proposed method performs better compared to the original technique for order preference by similarity to ideal solution, as well as the Fuzzy AHP-ELECTRE method. Moreover, the proposed method can be applied in cases where a user requires multiple services simultaneously on a device. The sensitivity analysis of the proposed method shows that it can be properly adjusted to conform to network environment changes.
Throughput in cooperative wireless networksjournalBEEI
Cognitive radio networks emerge as a solution to fixed allocation issues and spectrum scarcity through the dynamic access to spectrum. In cognitive networks, users must make intelligent decisions based on spectrum variation and actions taken by other users. Under this dynamic, cooperative systems can significantly improve quality of service parameters. This article presents the comparative study of the multi-criteria decision-making algorithms SAW and FFAHP through four levels of cooperation (10%, 20%, 50%, 80% y 100%) established between secondary users. The results show the performance evaluation obtained through of simulations and experimental measurements. The analysis is carried out based on throughput, depending on the class of service and the type of traffic.
WMNs: The Design and Analysis of Fair Schedulingiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Routing in Wireless Mesh Networks: Two Soft Computing Based Approachesijmnct
Due to dynamic network conditions, routing is the most critical part in WMNs and needs to be optimised.
The routing strategies developed for WMNs must be efficient to make it an operationally self configurable
network. Thus we need to resort to near shortest path evaluation. This lays down the requirement of some
soft computing approaches such that a near shortest path is available in an affordable computing time. This
paper proposes a Fuzzy Logic based integrated cost measure in terms of delay, throughput and jitter.
Based upon this distance (cost) between two adjacent nodes we evaluate minimal shortest path that updates
routing tables. We apply two recent soft computing approaches namely Big Bang Big Crunch (BB-BC) and
Biogeography Based Optimization (BBO) approaches to enumerate shortest or near short paths. BB-BC
theory is related with the evolution of the universe whereas BBO is inspired by dynamical equilibrium in
the number of species on an island. Both the algorithms have low computational time and high convergence
speed. Simulation results show that the proposed routing algorithms find the optimal shortest path taking
into account three most important parameters of network dynamics. It has been further observed that for
the shortest path problem BB-BC outperforms BBO in terms of speed and percent error between the
evaluated minimal path and the actual shortest path.
Hybrid multi objectives genetic algorithms and immigrants scheme for dynamic ...khalil IBRAHIM
the main concept of intelligent optimization techniques, artificial neural networks, and new genetic algorithms to solve the multi-objective multicast routing problems with shortest path (SP) problem that used in the addresses networks and improve all processes addressing in the wireless communications based on multi-objective optimization. The most important characteristics in mobile wireless networks is the topology dynamics and the network topology changes over time, the routing problem (SPRP) in mobile ad hoc networks (MANETs) turns out to be a dynamic optimization problem[13], the hybrid immigrants multiple-objective genetic algorithm (HIMOGAs) in the real- world are dynamic in nature, that has objective functions, constraints, and parameters, the dynamic optimization problems (DOPs) are a big challenges to evolutionary multi-objective, since any environmental change may affect the objective vector, constraints, and parameters, HIMOGA for the optimization goal is to track the moving of parameters and get a sequence of approximations solutions over time. The quantity of services (QoS) is supporting guarantee for all data traffic and getting the maximizing utilization for network, the QoS based on multicast routing offers significant challenges, and increases to use an efficient multicast routing protocol that will be able to check multicast routing and satisfying QoS constraints, The author propose to use HIMOGAs and SP algorithm to solve multicast problem that produces new generation wireless networks with immigrants schema to get high-quality solutions after each change and satisfying all objectives.
Improved fuzzy c-means algorithm based on a novel mechanism for the formation...TELKOMNIKA JOURNAL
The clustering approach is considered as a vital method for many fields suchas machine learning, pattern recognition, image processing, information retrieval, data compression, computer graphics, and others.Similarly, it hasgreat significance in wireless sensor networks (WSNs) by organizing thesensor nodes into specific clusters. Consequently, saving energy and prolonging network lifetime, which is totally dependent on the sensor’s battery, that is considered asa major challenge in the WSNs. Fuzzyc-means (FCM) is one of classification algorithm, which is widely used in literature for this purpose in WSNs. However, according to the nature of random nodes deployment manner, on certain occasions, this situation forces this algorithm to produce unbalanced clusters, which adversely affects the lifetime of the network.To overcome this problem, a new clustering method called FCM-CMhas been proposed by improving the FCM algorithm to form balanced clustersfor random nodes deployment. The improvement is conductedby integrating the FCM with a centralized mechanism(CM).The proposed method will be evaluated based on four new parameters. Simulation result shows that our proposed algorithm is more superior to FCM by producing balanced clustersin addition to increasing the balancing of the intra-distances of the clusters, which leads to energy conservation and prolonging network lifespan.
Evaluate the performance of K-Means and the fuzzy C-Means algorithms to forma...IJECEIAES
The clustering approach is considered as a vital method for wireless sensor networks (WSNs) by organizing the sensor nodes into specific clusters. Consequently, saving the energy and prolonging network lifetime which is totally dependent on the sensors battery, that is considered as a major challenge in the WSNs. Classification algorithms such as K-means (KM) and Fuzzy C-means (FCM), which are two of the most used algorithms in literature for this purpose in WSNs. However, according to the nature of random nodes deployment manner, on certain occasions, this situation forces these algorithms to produce unbalanced clusters, which adversely affects the lifetime of the network. Based for our knowledge, there is no study has analyzed the performance of these algorithms in terms clusters construction in WSNs. In this study, we investigate in KM and FCM performance and which of them has better ability to construct balanced clusters, in order to enable the researchers to choose the appropriate algorithm for the purpose of improving network lifespan. In this study, we utilize new parameters to evaluate the performance of clusters formation in multi-scenarios. Simulation result shows that our FCM is more superior than KM by producing balanced clusters with the random distribution manner for sensor nodes.
QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MANETScseij
Mobile Ad Hoc Networking Does Not Own Any Fixed Infrastructure And Hence, Stable Routing Is The
Major Problem. The Mobility Nature Of Manet’s Node Facilitates Rediscovery Of A New Path To
Organizing A Routing. In Order To Intensify The Quality Of Service And Routing Stability In Manet, We
Propose A Dynamic Quality Of Service Stability Based Multicast Routing Protocol By Modifying The
Cuckoo Search Algorithm Through A Modernizing Mechanism Which Is Derived From The Differential
Evolution Algorithm. Tuned Csa Is A Combined Feature Of Csa And De Algorithms. Periodically, Each
Node In The Network Creates Neighbour Stability And Qos Database At Every Node By Calculating The
Parameters Like Node And Link Stability Factor, Bandwidth Availability, And Delays. Finally, Multicast
Path Constructs Route Request And Route Reply Packets, Stability Information And Performing Route
Maintenance.
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.
Social-sine cosine algorithm-based cross layer resource allocation in wireles...IJECEIAES
Cross layer resource allocation in the wireless networks is approached traditionally either by communications networks or information theory. The major issue in networking is the allocation of limited resources from the users of network. In traditional layered network, the resource are allocated at medium access control (MAC) and the network layers uses the communication links in bit pipes for delivering the data at fixed rate with the occasional random errors. Hence, this paper presents the cross-layer resource allocation in wireless network based on the proposed social-sine cosine algorithm (SSCA). The proposed SSCA is designed by integrating social ski driver (SSD) and sine cosine algorithm (SCA). Also, for further refining the resource allocation scheme, the proposed SSCA uses the fitness based on energy and fairness in which max-min, hard-fairness, proportional fairness, mixed-bias and the maximum throughput is considered. Based on energy and fairness, the cross-layer optimization entity makes the decision on resource allocation to mitigate the sum rate of network. The performance of resource allocation based on proposed model is evaluated based on energy, throughput, and the fairness. The developed model achieves the maximal energy of 258213, maximal throughput of 3.703, and the maximal fairness of 0.868, respectively.
Dynamic K-Means Algorithm for Optimized Routing in Mobile Ad Hoc Networks IJCSES Journal
In this paper, a dynamic K-means algorithm to improve the routing process in Mobile Ad-Hoc networks
(MANETs) is presented. Mobile ad-hoc networks are a collocation of mobile wireless nodes that can
operate without using focal access points, pre-existing infrastructures, or a centralized management point.
In MANETs, the quick motion of nodes modifies the topology of network. This feature of MANETS is lead
to various problems in the routing process such as increase of the overhead massages and inefficient
routing between nodes of network. A large variety of clustering methods have been developed for
establishing an efficient routing process in MANETs. Routing is one of the crucial topics which are having
significant impact on MANETs performance. The K-means algorithm is one of the effective clustering
methods aimed to reduce routing difficulties related to bandwidth, throughput and power consumption.
This paper proposed a new K-means clustering algorithm to find out optimal path from source node to
destinations node in MANETs. The main goal of proposed approach which is called the dynamic K-means
clustering methods is to solve the limitation of basic K-means method like permanent cluster head and fixed
cluster members. The experimental results demonstrate that using dynamic K-means scheme enhance the
performance of routing process in Mobile ad-hoc networks.
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.
IMPROVEMENTS IN ROUTING ALGORITHMS TO ENHANCE LIFETIME OF WIRELESS SENSOR NET...IJCNCJournal
Wireless sensor network (WSN) brings a new paradigm of real-time embedded systems with limited
computation, communication, memory, and energy resources that are being used fora huge range of
applications. Clustering in WSNs is an effective way to minimize the energy consumption of sensor nodes.
In this paper improvements in various parameters are compared for three different routing algorithms.
First, it is started with Low Energy Adaptive Cluster Hierarchy (LEACH)which is a famed clustering
mechanism that elects a CH based on the probability model. Then, work describes a Fuzzy logic system
initiated CH selection algorithm for LEACH. Then Artificial Bee Colony (ABC)which is an optimisation
protocol owes its inspiration to the exploration behaviour of honey bees. In this study ABC optimization
algorithm is proposed for fuzzy rule selection. Then, the results of the three routing algorithms are
compared with respect to various parameters
Genetic Algorithm for Vertical Handover (GAfVH)in a Heterogeneous networksIJECEIAES
The fifth generation (5G) wireless system will deal with the growing demand of new multimedia and broadband application. The 5G network architecture is based on heterogeneous Radio Access Technologies (RATs). In such implementation the Vertical handover is a key issue. Up till now, systems are using simple mechanisms to make handover decision, based on the evaluation of the Received Signal Strength (RSS). In some cases these mechanisms are not Efficient.This paper presents a new vertical handover algorithm based on Genetic Algorithm (GAfVH). It aims to reduce the number of unnecessary handovers, and optimizes the system performance. We compare our simulation results to the Received Signal Strength (RSS) based method. The results show that the number of handovers decreases. Moreover, we demonstrate that the network selection result can differ from an application to another.
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.
Path constrained data gathering scheme for wireless sensor networks with mobi...ijwmn
Wireless Sensor Networks (WSNs) have emerged as a promising solution for variety of applications.
Recently, in order to increase the lifetime of the network, many proposals have introduced the use of
Mobile Elements (MEs) as a mechanical carrier to collect data. In this paper, we investigate the problem of
designing the mobile element tour to visit subset of the nodes, termed as caching points, where the length of
the mobile element tour is bounded by pre-determined length. Caching can be implemented at various
points on the network such that any node in the network is at most k-hops away from one of these caching
points. To address this problem, we present heuristic-based solution. Our solution works by partitioning
the network such that the depth of each partition is bounded by k. Then, in each partition, the minimum
number of required caching points is identified. We compare the resulting performance of our algorithm
with the best known comparable schemes in the literature.
Improved fuzzy c-means algorithm based on a novel mechanism for the formation...TELKOMNIKA JOURNAL
The clustering approach is considered as a vital method for many fields suchas machine learning, pattern recognition, image processing, information retrieval, data compression, computer graphics, and others.Similarly, it hasgreat significance in wireless sensor networks (WSNs) by organizing thesensor nodes into specific clusters. Consequently, saving energy and prolonging network lifetime, which is totally dependent on the sensor’s battery, that is considered asa major challenge in the WSNs. Fuzzyc-means (FCM) is one of classification algorithm, which is widely used in literature for this purpose in WSNs. However, according to the nature of random nodes deployment manner, on certain occasions, this situation forces this algorithm to produce unbalanced clusters, which adversely affects the lifetime of the network.To overcome this problem, a new clustering method called FCM-CMhas been proposed by improving the FCM algorithm to form balanced clustersfor random nodes deployment. The improvement is conductedby integrating the FCM with a centralized mechanism(CM).The proposed method will be evaluated based on four new parameters. Simulation result shows that our proposed algorithm is more superior to FCM by producing balanced clustersin addition to increasing the balancing of the intra-distances of the clusters, which leads to energy conservation and prolonging network lifespan.
Evaluate the performance of K-Means and the fuzzy C-Means algorithms to forma...IJECEIAES
The clustering approach is considered as a vital method for wireless sensor networks (WSNs) by organizing the sensor nodes into specific clusters. Consequently, saving the energy and prolonging network lifetime which is totally dependent on the sensors battery, that is considered as a major challenge in the WSNs. Classification algorithms such as K-means (KM) and Fuzzy C-means (FCM), which are two of the most used algorithms in literature for this purpose in WSNs. However, according to the nature of random nodes deployment manner, on certain occasions, this situation forces these algorithms to produce unbalanced clusters, which adversely affects the lifetime of the network. Based for our knowledge, there is no study has analyzed the performance of these algorithms in terms clusters construction in WSNs. In this study, we investigate in KM and FCM performance and which of them has better ability to construct balanced clusters, in order to enable the researchers to choose the appropriate algorithm for the purpose of improving network lifespan. In this study, we utilize new parameters to evaluate the performance of clusters formation in multi-scenarios. Simulation result shows that our FCM is more superior than KM by producing balanced clusters with the random distribution manner for sensor nodes.
QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MANETScseij
Mobile Ad Hoc Networking Does Not Own Any Fixed Infrastructure And Hence, Stable Routing Is The
Major Problem. The Mobility Nature Of Manet’s Node Facilitates Rediscovery Of A New Path To
Organizing A Routing. In Order To Intensify The Quality Of Service And Routing Stability In Manet, We
Propose A Dynamic Quality Of Service Stability Based Multicast Routing Protocol By Modifying The
Cuckoo Search Algorithm Through A Modernizing Mechanism Which Is Derived From The Differential
Evolution Algorithm. Tuned Csa Is A Combined Feature Of Csa And De Algorithms. Periodically, Each
Node In The Network Creates Neighbour Stability And Qos Database At Every Node By Calculating The
Parameters Like Node And Link Stability Factor, Bandwidth Availability, And Delays. Finally, Multicast
Path Constructs Route Request And Route Reply Packets, Stability Information And Performing Route
Maintenance.
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.
Social-sine cosine algorithm-based cross layer resource allocation in wireles...IJECEIAES
Cross layer resource allocation in the wireless networks is approached traditionally either by communications networks or information theory. The major issue in networking is the allocation of limited resources from the users of network. In traditional layered network, the resource are allocated at medium access control (MAC) and the network layers uses the communication links in bit pipes for delivering the data at fixed rate with the occasional random errors. Hence, this paper presents the cross-layer resource allocation in wireless network based on the proposed social-sine cosine algorithm (SSCA). The proposed SSCA is designed by integrating social ski driver (SSD) and sine cosine algorithm (SCA). Also, for further refining the resource allocation scheme, the proposed SSCA uses the fitness based on energy and fairness in which max-min, hard-fairness, proportional fairness, mixed-bias and the maximum throughput is considered. Based on energy and fairness, the cross-layer optimization entity makes the decision on resource allocation to mitigate the sum rate of network. The performance of resource allocation based on proposed model is evaluated based on energy, throughput, and the fairness. The developed model achieves the maximal energy of 258213, maximal throughput of 3.703, and the maximal fairness of 0.868, respectively.
Dynamic K-Means Algorithm for Optimized Routing in Mobile Ad Hoc Networks IJCSES Journal
In this paper, a dynamic K-means algorithm to improve the routing process in Mobile Ad-Hoc networks
(MANETs) is presented. Mobile ad-hoc networks are a collocation of mobile wireless nodes that can
operate without using focal access points, pre-existing infrastructures, or a centralized management point.
In MANETs, the quick motion of nodes modifies the topology of network. This feature of MANETS is lead
to various problems in the routing process such as increase of the overhead massages and inefficient
routing between nodes of network. A large variety of clustering methods have been developed for
establishing an efficient routing process in MANETs. Routing is one of the crucial topics which are having
significant impact on MANETs performance. The K-means algorithm is one of the effective clustering
methods aimed to reduce routing difficulties related to bandwidth, throughput and power consumption.
This paper proposed a new K-means clustering algorithm to find out optimal path from source node to
destinations node in MANETs. The main goal of proposed approach which is called the dynamic K-means
clustering methods is to solve the limitation of basic K-means method like permanent cluster head and fixed
cluster members. The experimental results demonstrate that using dynamic K-means scheme enhance the
performance of routing process in Mobile ad-hoc networks.
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.
IMPROVEMENTS IN ROUTING ALGORITHMS TO ENHANCE LIFETIME OF WIRELESS SENSOR NET...IJCNCJournal
Wireless sensor network (WSN) brings a new paradigm of real-time embedded systems with limited
computation, communication, memory, and energy resources that are being used fora huge range of
applications. Clustering in WSNs is an effective way to minimize the energy consumption of sensor nodes.
In this paper improvements in various parameters are compared for three different routing algorithms.
First, it is started with Low Energy Adaptive Cluster Hierarchy (LEACH)which is a famed clustering
mechanism that elects a CH based on the probability model. Then, work describes a Fuzzy logic system
initiated CH selection algorithm for LEACH. Then Artificial Bee Colony (ABC)which is an optimisation
protocol owes its inspiration to the exploration behaviour of honey bees. In this study ABC optimization
algorithm is proposed for fuzzy rule selection. Then, the results of the three routing algorithms are
compared with respect to various parameters
Genetic Algorithm for Vertical Handover (GAfVH)in a Heterogeneous networksIJECEIAES
The fifth generation (5G) wireless system will deal with the growing demand of new multimedia and broadband application. The 5G network architecture is based on heterogeneous Radio Access Technologies (RATs). In such implementation the Vertical handover is a key issue. Up till now, systems are using simple mechanisms to make handover decision, based on the evaluation of the Received Signal Strength (RSS). In some cases these mechanisms are not Efficient.This paper presents a new vertical handover algorithm based on Genetic Algorithm (GAfVH). It aims to reduce the number of unnecessary handovers, and optimizes the system performance. We compare our simulation results to the Received Signal Strength (RSS) based method. The results show that the number of handovers decreases. Moreover, we demonstrate that the network selection result can differ from an application to another.
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.
Path constrained data gathering scheme for wireless sensor networks with mobi...ijwmn
Wireless Sensor Networks (WSNs) have emerged as a promising solution for variety of applications.
Recently, in order to increase the lifetime of the network, many proposals have introduced the use of
Mobile Elements (MEs) as a mechanical carrier to collect data. In this paper, we investigate the problem of
designing the mobile element tour to visit subset of the nodes, termed as caching points, where the length of
the mobile element tour is bounded by pre-determined length. Caching can be implemented at various
points on the network such that any node in the network is at most k-hops away from one of these caching
points. To address this problem, we present heuristic-based solution. Our solution works by partitioning
the network such that the depth of each partition is bounded by k. Then, in each partition, the minimum
number of required caching points is identified. We compare the resulting performance of our algorithm
with the best known comparable schemes in the literature.
Ulusal Marka Araştırması hakkında hazırladığımız bu slaytta marka araştırmasının Türk Patent Enstitüsü sitesinden nasıl yapılabileceğine dair resimlerle anlatım vardır.
Quality of experience aware network selection model for service provisioning...IJECEIAES
Heterogeneous wireless networks (HWNs) are capable of integrating the different radio access technologies that make it possible to connect mobile users based on the performance parameters. Further quality of service (QoS) is one of the major topics for HWNs, moreover existing radio access technology (RAT) methodology are designed to provide network QoS criteria. However, limited work has been carried out for the RAT selection mechanism considering user QoS preference and existing models are developed based on the multi-mode terminal under a given minimal density network. For overcoming research issues this paper present quality of experience (QoE) RAT (QOE-RAT) selection methodology, incorporating both network performance criteria and user preference considering multiple call and multi-mode HWNs environment. First, this paper presents fuzzy preference aware weight (FPAW) and multi-mode terminal preference aware TOPSIS (MMTPA-TOPSIS) for choosing the best RAT for gaining multiservices. Experiment outcomes show the QOE-RAT selection method achieves much superior packet transmission outcomes when compared with state-of-art Rat selection methodologies.
A vertical handover decision approaches in next generation wireless networks ...ijmnct
In next generation wireless network the most desirable feature is its ability to move seamlessly over various
access network regardless of the network infrastructure is used. The handover between these dissimilar
networks can be explored by using vertical handover algorithms. This paper focuses on the vertical
handover decision methods and algorithms effectiveness. Most of the algorithms which are based on RSS
values provide vertical handover with small delay at a lower rate of throughput. There are such algorithms
which provide significant improvements in throughput but at a cost of higher delays. As per the need for the
real time applications in next generation wireless networks there is a requirement of developing new
optimized algorithms that are able to produce high throughput and minimizing signalling cost and delay.
Multi-Criteria Handoff Decision Algorithms In Wireless Networksiosrjce
IOSR Journal of Mobile Computing & Application (IOSR-JMCA) aims to cover innovative topics to research findings to trends analysis on Mobile Computing and Application related theories, technologies, methods, applications, and services from all engineering, business and organizational perspectives
Research Inventy : International Journal of Engineering and Scienceinventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
An Intelligent Approach for Handover Decision in Heterogeneous Wireless Envir...CSCJournals
Vertical handoff is the basic requirement of the convergence of different access technologies. It is also the key characteristic and technology of overlay wireless network with appropriate network interfaces. The integration of diverse but complementary cellular and wireless technologies in the next generation wireless networks requires the design of intelligent vertical handoff decision algorithms to enable mobile users equipped with contemporary multi-interfaced mobile terminals to seamlessly switch network access and experience uninterrupted service continuity anywhere and anytime. Most existing vertical handoff decision strategies are designed to meet individual needs that may not achieve a good system performance. In this paper an intelligent approach is used for vertical handover decision. The intelligence is based on the fuzzy logic approach. So here, fuzzy logic is used for network selection and decision making for vertical handover.
USER CENTRIC NETWORK SELECTION IN WIRELESS HETNETSijwmn
The future generation wireless networks are expected to beheterogeneous networksconsisting of UMTS,
WLAN, WiMAX, LTE etc. A heterogeneous network provides users with different data rate and Quality of
Service (QoS). Users of future mobile networks will be able to choose from different radio access
technologies. These networks vary widely in service capabilities such as coverage area, bandwidth and
error characteristics. Network selection is a challenging task in heterogeneous networks and will
influence the performance metrics of importance for both service provider and subscriber.This paper
analysesuser centric network selection based on QoE (Quality of Experience) which include both
technical and economical aspects of the user. WLAN-WiMAX-UMTS networks are integrated and the
network selection for the integrated network is performed using game theory based network selection
algorithm.
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
Quality of Service Stability Based Multicast Routing Protocol for MANETsCSEIJJournal
Mobile Ad Hoc Networking Does Not Own Any Fixed Infrastructure And Hence, Stable Routing Is The
Major Problem. The Mobility Nature Of Manet’s Node Facilitates Rediscovery Of A New Path To
Organizing A Routing. In Order To Intensify The Quality Of Service And Routing Stability In Manet, We
Propose A Dynamic Quality Of Service Stability Based Multicast Routing Protocol By Modifying The
Cuckoo Search Algorithm Through A Modernizing Mechanism Which Is Derived From The Differential
Evolution Algorithm. Tuned Csa Is A Combined Feature Of Csa And De Algorithms. Periodically, Each
Node In The Network Creates Neighbour Stability And Qos Database At Every Node By Calculating The
Parameters Like Node And Link Stability Factor, Bandwidth Availability, And Delays. Finally, Multicast
Path Constructs Route Request And Route Reply Packets, Stability Information And Performing Route
Maintenance.
QUALITY OF SERVICE STABILITY BASED MULTICAST ROUTING PROTOCOL FOR MANETScseij
ABSTRACT :
Mobile Ad Hoc Networking Does Not Own Any Fixed Infrastructure And Hence, Stable Routing Is The Major Problem. The Mobility Nature Of Manet’s Node Facilitates Rediscovery Of A New Path To Organizing A Routing. In Order To Intensify The Quality Of Service And Routing Stability In Manet, We Propose A Dynamic Quality Of Service Stability Based Multicast Routing Protocol By Modifying The Cuckoo Search Algorithm Through A Modernizing Mechanism Which Is Derived From The Differential Evolution Algorithm. Tuned Csa Is A Combined Feature Of Csa And De Algorithms. Periodically, Each Node In The Network Creates Neighbour Stability And Qos Database At Every Node By Calculating The Parameters Like Node And Link Stability Factor, Bandwidth Availability, And Delays. Finally, Multicast Path Constructs Route Request And Route Reply Packets, Stability Information And Performing Route Maintenance.
Mobile Ad Hoc Networking Does Not Own Any Fixed Infrastructure And Hence, Stable Routing Is The
Major Problem. The Mobility Nature Of Manet’s Node Facilitates Rediscovery Of A New Path To
Organizing A Routing. In Order To Intensify The Quality Of Service And Routing Stability In Manet, We
Propose A Dynamic Quality Of Service Stability Based Multicast Routing Protocol By Modifying The
Cuckoo Search Algorithm Through A Modernizing Mechanism Which Is Derived From The Differential
Evolution Algorithm. Tuned Csa Is A Combined Feature Of Csa And De Algorithms. Periodically, Each
Node In The Network Creates Neighbour Stability And Qos Database At Every Node By Calculating The
Parameters Like Node And Link Stability Factor, Bandwidth Availability, And Delays. Finally, Multicast
Path Constructs Route Request And Route Reply Packets, Stability Information And Performing Route
Maintenance.
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
MULTI-CRITERIA HANDOVER DECISION FOR HETEROGENEOUS NETWORKS: CARRIER AGGREGAT...IJCNCJournal
Carrier aggregation and integration of heterogeneous networks allow the mobile user equipment to benefit from wider bandwidth and radio coverage of different access technologies. However, these technologies have increased handoff scenario probability through user equipment’s mobility, leading to high outage probability and low throughput. Handover is an important aspect of mobility management which allows users to migrate from one cell to another without losing connections. But no lone access technology meets the requirements of providing seamless communication without loss and delay. Therefore, high-quality service continuity and reliable user equipment access to network anywhere and at any time require the
design of an appropriate handover decision algorithm. In this paper, a multi-criteria based handover decision-making algorithm is proposed to evade loss of communication and provide better performance to the system. It adaptively makes handover decisions based on different decision criteria (load, availability of resources, and the handover scenario type) in addition to signal interference to noise ratio. The multicriteria handover decision making algorithm-based method chooses among the cells that satisfy the requirements for the handover. As compared to some existing handover decision algorithms, simulation result shows that this algorithm improves system performance in terms of handover failure by 93%, 72%,
and 58%; radio link failure reduction by 77%, 43%, and 22%; and handover ping–pong by 81%, 59%, and 36% over the conventional received signal strength, received wireless transmission line, and multiinfluence factor hand over decisions respectively.
MULTI-CRITERIA HANDOVER DECISION FOR HETEROGENEOUS NETWORKS: CARRIER AGGREGAT...IJCNCJournal
Carrier aggregation and integration of heterogeneous networks allow the mobile user equipment to benefit from wider bandwidth and radio coverage of different access technologies. However, these technologies have increased handoff scenario probability through user equipment’s mobility, leading to high outage probability and low throughput. Handover is an important aspect of mobility management which allows users to migrate from one cell to another without losing connections. But no lone access technology meets the requirements of providing seamless communication without loss and delay. Therefore, high-quality service continuity and reliable user equipment access to network anywhere and at any time require the
design of an appropriate handover decision algorithm. In this paper, a multi-criteria based handover decision-making algorithm is proposed to evade loss of communication and provide better performance to the system. It adaptively makes handover decisions based on different decision criteria (load, availability of resources, and the handover scenario type) in addition to signal interference to noise ratio. The multicriteria handover decision making algorithm-based method chooses among the cells that satisfy the requirements for the handover. As compared to some existing handover decision algorithms, simulation result shows that this algorithm improves system performance in terms of handover failure by 93%, 72%,
and 58%; radio link failure reduction by 77%, 43%, and 22%; and handover ping–pong by 81%, 59%, and 36% over the conventional received signal strength, received wireless transmission line, and multiinfluence factor hand over decisions respectively.
Research Inventy : International Journal of Engineering and Scienceinventy
Research Inventy : International Journal of Engineering and Science
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed
Electrically small antennas: The art of miniaturizationEditor IJARCET
We are living in the technological era, were we preferred to have the portable devices rather than unmovable devices. We are isolating our self rom the wires and we are becoming the habitual of wireless world what makes the device portable? I guess physical dimensions (mechanical) of that particular device, but along with this the electrical dimension is of the device is also of great importance. Reducing the physical dimension of the antenna would result in the small antenna but not electrically small antenna. We have different definition for the electrically small antenna but the one which is most appropriate is, where k is the wave number and is equal to and a is the radius of the imaginary sphere circumscribing the maximum dimension of the antenna. As the present day electronic devices progress to diminish in size, technocrats have become increasingly concentrated on electrically small antenna (ESA) designs to reduce the size of the antenna in the overall electronics system. Researchers in many fields, including RF and Microwave, biomedical technology and national intelligence, can benefit from electrically small antennas as long as the performance of the designed ESA meets the system requirement.
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered Quality
Volume 2-issue-6-2005-2008
1. ISSN: 2278 - 1323
International Journal of Advanced Research in Computer Engineering and Technology (IJARCET)
Volume 2, Issue 6, June 2013
www.ijarcet.org
2005
Abstract - Next Generation Wireless Networks (NGWN) consists of heterogeneous networks with the support for vertical handoff. Hence
vertical handoff algorithms (VHA) are the key components of NGWN. The vertical handoff decision may depend on the bandwidth
available for each wireless access network, cost for accessing network, the power usage requirements, user preference, Quality of Service
(QoS), and security. Hence vertical handoff decision may be solved using multi attribute decision making (MADM). Multi attribute decision
making (MADM) problems involve ranking or evaluating a finite number of alternatives with multiple, attributes. There are several vertical
handoffs decision algorithm proposed in the literature based on MADM techniques. In this paper we provide a overview on existing MADM
algorithms for vertical handoff.
Keywords: Multi attribute decision making, Simple additive weighting, Multiplicative Exponential Weighting, Grey relational analysis,
etc,.
1. INTRODUCTION
Next Generation Wireless Network (NGWN) aims to
integrate heterogeneous wireless systems with seamless
continuity as major goal. In such heterogeneous network
supporting vertical handoff becomes major challenging issue.
Vertical handoff is responsible for service continuity when a
connection needs to migrate across heterogeneous wireless
access networks [1]. The vertical handoff decision problem
deal with making selection between available candidate
networks which provide varies technologies and services with
respect to different criteria. This is a type of Multiple Attribute
Decision Making (MADM) problem [2][3]. In general,
MADM deals with the problem of choosing an alternative
from a set of alternatives which are considered in terms of
their attributes. For decision making multiple attribute,
multiple criteria and multiple objectives are the terms are often
used. Similarly vertical handoff decision algorithm should
consider many parameters such as available bandwidth, QoS,
security, power consumption, user preference, with proper
weightage for each parameter.
In general, the vertical handoff process consist of three
main steps [14][15], namely system discovery, handoff
decision, and handoff execution. The system discovery phase
is responsible for detecting and collecting information of all
the available networks. The mobile terminals which are
equipped with multiple interfaces have to determine which
networks can be used and the services available in each
network. The networks may also advertise the supported data
rates and other characteristics for different services. During
the handoff decision phase, the mobile device determines
which network it should connect to. The decision may depend
on various parameters such as available bandwidth, delay,
jitter, access cost, transmit power, current battery status of the
mobile device, and the user’s preferences. During the handoff
execution phase, connections need to be re-routed from the
existing network to the new network in a seamless manner.
This phase also includes the authentication and authorization,
and the transfer of user’s context information.
MADM problems are diverse in disciplines, but all share
the following common characteristics: alternatives to select,
multiple attributes describing the alternatives in different units
of measurement, and a set of weights representing the relative
importance among attributes [4]. MADM decision problem
can be expressed in an M x N decision matrix, where the jth
attribute of the ith network is represented as xij. The MADM
methods use scoring techniques to rank alternatives. An index
or score is calculated by taking into account the contributions
from each parameter. Before the calculation of the index,
normalization of the parameters is required to deal with
different units. Several vertical handoff algorithms based on
MADM methods have been proposed in the literature. The
MADM includes many methods such as Simple Additive
Weighting (SAW), Multiplicative Exponential Weighting
(MEW), Technique for Order Preference by Similarity to Ideal
Solution (TOPSIS), Analytic Hierarchy Process (AHP), Grey
Relational Analysis (GRA). In the next section we will
provide a brief introduction on these algorithms.
A. Simple Additive Weighting
Simple additive weighting (SAW) is one of the best known
and most widely used scoring methods because of its
A review of vertical handoff algorithms based
on Multi Attribute Decision Method
Manjaiah D.H,
Professor, Dept of Computer Science,
Mangalore University, Mangalagangothri, Mangalore - 574199. INDIA.
Payaswini P
Research Scholar, Dept of Computer Science,
Mangalore University, Mangalagangothri, Mangalore - 574199. INDIA.
2. ISSN: 2278 - 1323
International Journal of Advanced Research in Computer Engineering and Technology (IJARCET)
Volume 2, Issue 6, June 2013
www.ijarcet.org
2006
simplicity [3]. In SAW, the criteria value for each alternative
are normalized and is multiplied with the weights assigned to
the criteria [5]. If there are M networks and N number of
parameters for each network, then total score of each
candidate network i is obtained by adding the contributions
from each attribute rij multiplied by the importance weight wj
[4].
ASAW = arg j rij with the condition that
j = 1.
In [17], the authors proposed a SINR (Signal to
Interference plus Noise Ratio) and AHP (Analytic Hierarchy
Process) based SAW (Simple Additive Weighting)(SASAW)
vertical handoff algorithm. The algorithms uses the combined
effects of SINR, user required bandwidth, user traffic cost and
available bandwidth of the participating access networks to
make handoff decisions for multi-attribute QoS consideration
according to the features of the traffic. In [16] the authors
proposed a vertical handoff method based SAW which uses
user preference parameter like cost for selecting the target
network.
B. Multiplicative exponential weighting
In this technique a handoff decision matrix is formed
where a particular row and column corresponds to the ith
candidate network and jth attribute of that network,
respectively. The weighted product of the attributes is used to
determine the score Si of the candidate network as follows:
Si = ij
wj
where xij denotes attribute j of candidate
network i, wj denotes the weight of attributed j, and j = 1.
In [18] the authors proposed an improved MEW algorithm
for vertical handoff in heterogeneous wireless networks. It
introduced the signal to interference plus noise ratio (SINR)
effects, least square (LS) and information entropy method into
the algorithm. An attribute matrix is constructed considering
the parameters - SINR in the source network and the equivalent
SINR in the target network, the required bandwidth, the traffic
cost and the available bandwidth of participating access
networks. Handoff decision is made according to the traffic
features the meeting multi attribute quality of service (QoS)
requirement. The subjective weight relation of decision
elements is determined with LS method. The information
entropy method is employed to derive the objective weights of
the evaluation criteria, and lead to the comprehensive weight.
Finally decision is made using MEW algorithm based on the
attribute matrix and weight vector.
C. Technique for Order Preference by Similarity
to Ideal Solution
TOPSIS is based on the concept that the chosen alternative
should have the shortest geometric distance from the positive
ideal solution and the longest geometric distance from the
negative ideal solution. The ideal solution is a “hypothetical
solution” with the best values in each parameter while the
negative ideal solution is the opposite. The ideal solution is
obtained by using the best values for each metric. Let ci denote
the relative closeness (or similarity) of the candidate network i
to the ideal solution. The selected network ATOPSIS is:
ATOPSIS = arg i
Steps in TOPSIS method are as follows:
• Construct the normalized decision matrix,
• Construct the weighted normalized decision matrix
• Determine ideal and negative-ideal solutions
• Calculate the separation measure between the networks
and the positive and negative ideal networks.
• Calculate the relative closeness to the ideal solution.
In [11] authors proposed a vertical handoff based on
TOPSIS with the introduction of the utility function in Fuzzy
Utility TOPSIS which greatly influenced the ratings of the
alternatives. The proposed method was the first to utilize the
Fuzzy TOPSIS method for the aggregation of conflicting
criteria resolving the issue of possible inconsistency that would
arise if the standard TOPSIS method was used.
D. Grey Relational Analysis
Grey relational analysis (GRA) is suitable for solving
problems with complicated inter relationships between multiple
factors and variables. The Grey theory can provide a solution
of a system in which the model is unsure or the information is
incomplete. Besides, it provides an efficient solution to the
uncertainty, multi-input and discrete data problem [7]. GRA
solves MADM problems by combining the entire range of
performance attribute values being considered for every
3. ISSN: 2278 - 1323
International Journal of Advanced Research in Computer Engineering and Technology (IJARCET)
Volume 2, Issue 6, June 2013
www.ijarcet.org
2007
alternative into one, single value. This reduces the original
problem to a single attribute decision making problem.
The ranking of GRA is performed by building grey
relationships with a positive ideal network. A normalization
process to deal with benefit and cost metrics is required and the
Grey Relational Coefficient (GRC) of each network is
calculated. The GRC is the score used to describe the similarity
between each candidate network and the ideal network. The
selected network is the one which has highest similarity to the
ideal network. The selected network is given by
AGRA = arg , where Γ0,i is the GRC of network
i.
In [12] authors proposed algorithmic approach that can
realize dynamic interface selection with multiple alternatives
and using GRA. The alternative solutions are introduced to
reduce and eliminate the probability of rank inconsistency,
caused by the addition or deletion of an interface.
E. Analytic Hierarchy Process
This process decomposes a complex decision problem into
a hierarchical structure. The vertical handoff decision using
AHP decomposes the network selection problem into several
smaller problems and assigns a weight value to each of them.
As given in [10] to make a decision in an organized way to
generate priorities of the target network the decision is
decomposed into the following steps [10].
1. Define the problem and determine the kind of knowledge
sought.
2. Structure the decision hierarchy from the top with the
goal of the decision, then the objectives from a broad
perspective, through the intermediate levels to the lowest level.
3. Construct a set of pairwise comparison matrices. Each
element in an upper level is used to compare the elements in
the level immediately below with respect to it.
4. Use the priorities obtained from the comparisons to
weigh the priorities in the level immediately below. This is
done for every element. Then for each element in the level
below add its weighed values and obtain its overall or global
priority.
This process f weighing and adding is continued until the
final priorities of the alternatives in the bottom most level are
obtained.
In [13] proposed a network selection scheme for the
integration of UMTS and WLAN. Analytic hierarchy process
(AHP) is applied to decide the relative weights of evaluative
criteria set according to user preferences and service
applications.
II. CONCLUSION
Vertical handoff algorithms with the requirement of
seamless connectivity are the key requirement of next
generation wireless networks. A key issue that aids in
providing seamless vertical handoff is handoff decision, that is,
the ability to correctly decide at any given time whether or not
to carry out vertical handoff and determine the best handoff
candidate access network. Several classes of vertical handoff
methods are available in literature. Vertical handoff decision
problem can be formaulated as a MADM problem. Several
vertical handoff algorithms based on MADM method are
proposed in the literature. In this paper a detailed overview on
vertical handoff strategies based on MADM methods are
discussed.
III. ACKNOWLEDGEMENTS
The authors would like to acknowledge the funding
support from DST the under INSPIRE fellowship scheme
(Ref.No. DST/ INSPIRE Fellowship/2012/[82] dated August
17, 2012). Thanks also go to the dedicated research group in
the area of Computer Networking at the Dept of Computer
Science, Mangalore University, Mangalore, India, for many
stimulating discussions. Lastly but not least the author would
like to thank everyone, including the anonymous reviewers.
IV. REFERENCES
[1] Chi Sun; Stevens-Navarro, E.; Wong, V.W.S., "A Constrained MDP-
Based Vertical Handoff Decision Algorithm for 4G Wireless
Networks," Communications, 2008. ICC '08. IEEE International
Conference on, pp.2169-2174, 19-23 May 2008.
[2] W. Zhang, “Handover Decision Using Fuzzy MADM in Heterogeneous
Networks,” in Proc. of IEEE WCNC’04, Atlanta, GA, March 2004.
[3] Yoon, K. & Hwang, C., Multiple Attribute Decision Making: An
introduction, Ed. Sage Publications, 1995.
[4] Stevens-Navarro, E.; Martinez-Morales, J.D.; Pineda-Rico, U.,
Evaluation of Vertical Handoff Decision Algorithms Based on MADM
Methods for Heterogeneous Wireless Networks, Journal of Applied
Research and Technology, vol. 10, No. 4, pp. 534-548, 2012.
[5] H.A Vine, comparison between MADM algorithms for Vertical handoff
decision, Technical Journal, University of Engineering and Technology
Taxila, 2010.
[6] Stevens-Navarro, E. & Wong, V., Comparison between Vertical
Handoff Decision Algorithms for Heterogeneous Wireless Networks,
IEEE Vehicular Technology Conference – Spring, 2006, pp. 947-951,
Melbourne, Australia, May 2006.
[7] Chan WK and Tong TKL, (2007), Multi-criteria material selections and
end-of-life product strategy: Grey relational analysis approach, Materials
& Design, Volume 28, Issue 5, Pages 1539-1546
[8] Deng , J.L., "A course on Grey System Theory", HUST Press( in
Chinese ), Wuhan, 1990.
[9] Yiyo Kuo, Taho Yang, Guan-Wei Huang, The use of grey relational
analysis in solving multiple attribute decision-making problems,
Computers & Industrial Engineering, Volume 55, Issue 1, August 2008,
Pages 80-93.
[10] Thomas L. Saaty, Decision making with the analytic hierarchy
process, International Journal Services Sciences, Vol. 1, No. 1, pp. 83-
98, 2008.
4. ISSN: 2278 - 1323
International Journal of Advanced Research in Computer Engineering and Technology (IJARCET)
Volume 2, Issue 6, June 2013
www.ijarcet.org
2008
[11] I. Chamodrakas, I. Leftheriotis, D. Martakos, A utility-based fuzzy
TOPSIS method for energy efficient network selection in heterogeneous
wireless networks, Applied Soft Computing vol. 11 pp. 3734–3743,
2011.
[12] Huszák, A.; Imre, S., “Eliminating Rank Reversal Phenomenon in
GRA-Based Network Selection Method” IEEE International Conference
on Communications (ICC), pp. 1-6, 2010.
[13] Wei-wei Jiang, Hong-yan, Cui Qiang-jun, Van Xiao-juan, Wang
Jian-Ya Chen, “A Novel Application-Oriented Dynamic Network
Selection in an Integrated UMTS and WiMAX Environment”
,IEEE,2008.
[14] J. McNair and F. Zhu, “Vertical Handoffs in Fourth-generation
Multinet-work Environments,”IEEE Wireless Comm., vol. 11, no. 3,
June 2004.
[15] W. Chen, J. Liu, and H. Huang, “An Adaptive Scheme for Vertical
Handoff in Wireless Overlay Networks,” inProc. of ICPADS’04,New-
port Beach, CA, July 2004.
[16] Jorge Lima de Oliveira Filho, Edmundo Madeira, “A Mechanism
for Vertical Handover Based on SAW Using IEEE 802.21”, In
proceeding of Mobile Networks and Management - Second International
ICST Conference, MONAMI 2010, Santander, Spain, September 22-24,
2010.
[17] Liu Sheng-mei; Pan Su; Mi Zheng-kun; Meng Qing-min; Xu
Ming-hai, "A Simple Additive Weighting Vertical Handoff Algorithm
Based on SINR and AHP for Heterogeneous Wireless
Networks," Intelligent Computation Technology and Automation
(ICICTA), 2010 International Conference on , vol.1, no., pp.347-350,
11-12 May 2010.
[18] Liu Shengmei Pan Su Mi Zhengkun Meng Qingmin Xu Minghaim,
“An improved multiplicative exponent weighting vertical handoff
algorithm for WLAN/WCDMA heterogeneous wireless networks”, [J]
Engineering Sciences, Vol. 10, Issue 1, pp. 86-90, 2012.