IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
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.
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.
Performance evaluation of transaction processing in mobile data base systemsijdms
The document discusses performance evaluation of transaction processing in mobile database systems. It analyzes three execution strategies - mobile host strategy (MHS), fixed host strategy (FHS), and combined host strategy (CHS) - and finds that CHS performs best. Under CHS, some transaction operations execute on the mobile host and some on the fixed host, utilizing benefits of both MHS and FHS while minimizing their individual performance penalties. The integrated approach of CHS is shown to match or improve upon the performance of MHS and FHS for various workload mixtures.
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
ORCHESTRATING BULK DATA TRANSFERS ACROSS GEO-DISTRIBUTED DATACENTERSShakas Technologies
This document discusses orchestrating bulk data transfers across geo-distributed datacenters using software defined networking (SDN). It proposes modeling data transfer requests as delay tolerant migration tasks with deadlines and optimally routing distinct data chunks to maximize timely completions. Three dynamic algorithms are presented with varying levels of optimality and scalability. The document also describes building an SDN system based on OpenFlow to implement the bulk data transfer algorithms and conduct experiments comparing their performance.
CONGESTION CONTROL USING FUZZY BASED LSPS IN MULTIPROTOCOL LABEL SWITCHING NE...ijfcstjournal
In this paper, we have proposed a fuzzy based decision making component for high volume traffic MPLS
networks, by implementing Traffic Engineering, Quality of Service and Multipath routing. The approach
explicitly proves to be successful in solving the issues and challenges pertaining to stability, scalability in
high volume and dynamic traffic. Furthermore, it will work to handle congestion by higher link utilization
and provides efficient rerouting of traffic along with fault tolerance in the network. In this research work,
fuzzy calculations are done for fixing the attributes of the MPLS label(s), which is put on particular packet
representing the Forwarding Equivalence Class. Fuzzy controller consists of two sub fuzzy systems- Label
Switched Path setup System (LsS) and Traffic Splitting System (TSS). The computation of dynamic status of
Load and Delay is utilized by LsS to arrange the paths in preference order. The attained Link Capacity and
Utilization Rate are employing by TSS for maintaining congestion free path. The impact of this is to
facilitate, we have better decision making for splitting the traffic for different promising paths. This was
apparent from the series of traffic scenarios. Observations are obtained using this realization.
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.
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.
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.
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.
Performance evaluation of transaction processing in mobile data base systemsijdms
The document discusses performance evaluation of transaction processing in mobile database systems. It analyzes three execution strategies - mobile host strategy (MHS), fixed host strategy (FHS), and combined host strategy (CHS) - and finds that CHS performs best. Under CHS, some transaction operations execute on the mobile host and some on the fixed host, utilizing benefits of both MHS and FHS while minimizing their individual performance penalties. The integrated approach of CHS is shown to match or improve upon the performance of MHS and FHS for various workload mixtures.
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
ORCHESTRATING BULK DATA TRANSFERS ACROSS GEO-DISTRIBUTED DATACENTERSShakas Technologies
This document discusses orchestrating bulk data transfers across geo-distributed datacenters using software defined networking (SDN). It proposes modeling data transfer requests as delay tolerant migration tasks with deadlines and optimally routing distinct data chunks to maximize timely completions. Three dynamic algorithms are presented with varying levels of optimality and scalability. The document also describes building an SDN system based on OpenFlow to implement the bulk data transfer algorithms and conduct experiments comparing their performance.
CONGESTION CONTROL USING FUZZY BASED LSPS IN MULTIPROTOCOL LABEL SWITCHING NE...ijfcstjournal
In this paper, we have proposed a fuzzy based decision making component for high volume traffic MPLS
networks, by implementing Traffic Engineering, Quality of Service and Multipath routing. The approach
explicitly proves to be successful in solving the issues and challenges pertaining to stability, scalability in
high volume and dynamic traffic. Furthermore, it will work to handle congestion by higher link utilization
and provides efficient rerouting of traffic along with fault tolerance in the network. In this research work,
fuzzy calculations are done for fixing the attributes of the MPLS label(s), which is put on particular packet
representing the Forwarding Equivalence Class. Fuzzy controller consists of two sub fuzzy systems- Label
Switched Path setup System (LsS) and Traffic Splitting System (TSS). The computation of dynamic status of
Load and Delay is utilized by LsS to arrange the paths in preference order. The attained Link Capacity and
Utilization Rate are employing by TSS for maintaining congestion free path. The impact of this is to
facilitate, we have better decision making for splitting the traffic for different promising paths. This was
apparent from the series of traffic scenarios. Observations are obtained using this realization.
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.
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.
DYNAMIC TASK SCHEDULING BASED ON BURST TIME REQUIREMENT FOR CLOUD ENVIRONMENTIJCNCJournal
Cloud computing has an indispensable role in the modern digital scenario. The fundamental challenge of cloud systems is to accommodate user requirements which keep on varying. This dynamic cloud environment demands the necessity of complex algorithms to resolve the trouble of task allotment. The overall performance of cloud systems is rooted in the efficiency of task scheduling algorithms. The dynamic property of cloud systems makes it challenging to find an optimal solution satisfying all the evaluation metrics. The new approach is formulated on the Round Robin and the Shortest Job First algorithms. The Round Robin method reduces starvation, and the Shortest Job First decreases the average waiting time. In this work, the advantages of both algorithms are incorporated to improve the makespan of user tasks.
This document lists several Java/J2EE/J2ME projects related to utility computing environments, schema matching, fuzzy ontology generation, wireless sensor networks, wireless MAC protocols, distributed cache updating, selfish routing, collaborative key agreement, TCP congestion control, global roaming in mobile networks, GPS-based emergency response systems, network intrusion detection, honey pots, voice over IP, vehicle tracking, SIP-based teleconferencing, online security systems, and location-aided routing in ad hoc networks. The projects cover a wide range of topics related to distributed systems, wireless networks, and Internet applications.
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.
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.
AN ENTROPIC OPTIMIZATION TECHNIQUE IN HETEROGENEOUS GRID COMPUTING USING BION...ijcsit
This document summarizes a research paper that proposes a new method for improving both fault tolerance and load balancing in grid computing networks. The method converts the tree structure of grid computing nodes into a distributed R-tree index structure and then applies an entropy estimation technique. This entropy estimation helps discard nodes with high entropy from the tree, reducing complexity. The method then uses thresholding and control algorithms to select optimal route paths based on load balance and fault tolerance. Various optimization techniques like genetic algorithms, ant colony optimization, and particle swarm optimization are also applied to reach better solutions. Experimental results showed the proposed method improved performance over other existing methods.
Handover Algorithm based VLP using Mobility Prediction Database for Vehicular...IJECEIAES
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.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Irrational node detection in multihop cellular networks using accounting centereSAT Journals
Abstract In multihop cellular networks mobile nodes typically transmit packets during intermediate mobile nodes for enhancing recital. Stingy nodes typically don't collaborate that incorporates a negative result on the network fairness and recital. A fair, inexpensive and best incentive mechanism by Selfish Node Detection (FESCIMbySND) has been projected to stimulate the mobile node’s cooperation. Hashing operations area unit employed in order to extend the safety. Trivial Hash perform has been wont to improve end-to-end delay and outturn. Additionally Cyclic Redundancy Check Mechanism has been used to spot the ridiculous nodes that involve themselves in sessions with the intention of dropping the in sequence packets. Moreover, to cut back the impact at the Accounting Center a Border node has been commend the task of propose the checks employing a digital signature. Keywords: Border Node Mechanism, Cyclic Redundancy Check, Selfish nodes, Trivial Hash Function
A Survey on the Common Network Traffic Sources ModelsCSCJournals
Selecting the appropriate traffic model can lead to the successful design of networks. The more accurate is the traffic model the better is the system quantified in terms of its performance Successful design lead to enhancement the overall performance of the whole of network .in literature there is innumerous traffic models proposed for understanding and analyzing the traffic characteristics of networks. Consequently, the study of traffic models to understand the features of the models and identify eventually the best traffic model, for a concerned environment has become a crucial and lucrative task. Good traffic modeling is also a basic requirement for accurate capacity planning. This paper provides an overview of some of the widely used network traffic models, highlighting the core features of the model and traffic characteristics they capture best. Finally we found that the N_BURST traffic model can capture the traffic characteristics of most types of networks, under every possible circumstance rather than any type of traffic model.
Performance Simulation and Analysis for LTESystem Using Human Behavior Queue ...ijwmn
Understanding the nature of traffic has been a key concern of the researchers particularly over the last
two decades and it has been noticed through extensive high quality studies that traffic found in different
kinds of IP/wireless IP networks is human operators . Despite the recent findings of real time human
behavior in measured traffic from data networks, much of the current understanding of IP traffic
modeling is still based on simplistic probability distributed traffic. Unlike most existing studies that are
primarily based on simplistic probabilistic model and traditional scheduling algorithms, this research
presents an analytical performance model for real time human behavior queue systems with intelligent
task management traffic input scheduled by a novel and promising scheduling mechanism for 4G-LTE
system. Our proposed model is substantiated on human behavior queuing system that considers real time
of traffic exhibiting homogeneous tasks characteristics. We analyze the model on the basis of newly
proposed scheduling scheme for 4G-LTE system. We present closed form expressions of expected
response times for real time traffic classes. We develop a discrete event simulator to understand the
behavior of real time of arriving tasks traffic under this newly proposed scheduling mechanism for 4GLTE system . The results indicate that our proposed scheduling algorithm provides preferential treatment
to real-time applications such as voice and video but not to that extent that data applications are starving
for bandwidth and outperforms all other scheduling schemes that are available in the market.
Fpga based 128 bit customised vliw processor for executing dual scalarvector ...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Experimental investigation on halloysite nano tubes & clay an infilled compos...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Power saving mechanism for hybrid routing protocol using scheduling techniqueeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
The document discusses a study on the properties of banana fiber reinforced composites. Banana fibers were treated with sodium hydroxide and used to reinforce both epoxy and vinyl ester resin matrices. Coconut shell powder was also used along with the fibers. Various mechanical properties including tensile strength, flexural strength, and impact strength were tested for the untreated and treated fiber composites. The treated fiber composites showed improved mechanical properties compared to the untreated fibers due to better adhesion between the fiber and matrix. A hybrid composite containing both banana fiber and coconut shell powder showed higher strength values than the banana fiber only composite.
A novel association rule mining and clustering based hybrid method for music ...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
This document summarizes a study on the heat transfer through a journal bearing. It describes the methodology used, which included collecting data on the bearing, performing design calculations, creating a geometric model, and conducting thermal analysis using FEA software. The analysis found that the bearing's temperature ranged from 79.76 to 90.96 degrees C, with most of the surface between 84-88 degrees C. It also determined that up to 14,328 watts of heat was generated within the bearing and up to 1,932 watts of heat was dissipated from the bearing casing through convection.
This document describes different types of smart wrist watches that have embedded cell phone capabilities. It discusses three main types: watches with keypads, watches with smart applications, and watches running the Android operating system. It provides examples and comparisons of features for each type, such as price, design, battery life, and multimedia/connectivity options. The document also proposes additional health-related functions the watches could incorporate, such as blood testing, diabetes monitoring, and calculators for metrics like BMI, BMR, and calorie counting. It concludes the wrist watch can function like a mobile phone and that future concepts could further develop health and technical capabilities while considering economic and technical feasibility.
This document summarizes a research paper that proposes a parallel k-nearest neighbors (kNN) algorithm using OpenCL on a GPU architecture. The key points are:
1) kNN classification is computationally intensive, especially for large datasets, creating a need for parallelization.
2) The authors designed and implemented a parallel kNN algorithm using OpenCL to distribute distance computations across GPU cores.
3) Experimental results on UCI datasets showed the parallel kNN approach improved performance over a serial kNN implementation.
A hydration study by xrdrietveld analysis of cement regenerated from complete...eSAT Publishing House
This document summarizes a study that used X-ray diffraction and Rietveld analysis to examine the hydration of cement regenerated from concrete designed to be completely recyclable. Specifically, it analyzed samples of cement paste in which hydration was arrested at various time points up to 28 days. The results showed that the alite and belite phases decreased over time as portlandite and amorphous calcium silicate hydrate (C-S-H) increased. Aluminate phases dissolved completely while ferrite decreased. Some differences were seen in the mineralogy of cement produced from recycled concrete versus ordinary portland cement, but the hydration processes were similar. The study highlighted the importance of sample preparation methods on the
DYNAMIC TASK SCHEDULING BASED ON BURST TIME REQUIREMENT FOR CLOUD ENVIRONMENTIJCNCJournal
Cloud computing has an indispensable role in the modern digital scenario. The fundamental challenge of cloud systems is to accommodate user requirements which keep on varying. This dynamic cloud environment demands the necessity of complex algorithms to resolve the trouble of task allotment. The overall performance of cloud systems is rooted in the efficiency of task scheduling algorithms. The dynamic property of cloud systems makes it challenging to find an optimal solution satisfying all the evaluation metrics. The new approach is formulated on the Round Robin and the Shortest Job First algorithms. The Round Robin method reduces starvation, and the Shortest Job First decreases the average waiting time. In this work, the advantages of both algorithms are incorporated to improve the makespan of user tasks.
This document lists several Java/J2EE/J2ME projects related to utility computing environments, schema matching, fuzzy ontology generation, wireless sensor networks, wireless MAC protocols, distributed cache updating, selfish routing, collaborative key agreement, TCP congestion control, global roaming in mobile networks, GPS-based emergency response systems, network intrusion detection, honey pots, voice over IP, vehicle tracking, SIP-based teleconferencing, online security systems, and location-aided routing in ad hoc networks. The projects cover a wide range of topics related to distributed systems, wireless networks, and Internet applications.
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.
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.
AN ENTROPIC OPTIMIZATION TECHNIQUE IN HETEROGENEOUS GRID COMPUTING USING BION...ijcsit
This document summarizes a research paper that proposes a new method for improving both fault tolerance and load balancing in grid computing networks. The method converts the tree structure of grid computing nodes into a distributed R-tree index structure and then applies an entropy estimation technique. This entropy estimation helps discard nodes with high entropy from the tree, reducing complexity. The method then uses thresholding and control algorithms to select optimal route paths based on load balance and fault tolerance. Various optimization techniques like genetic algorithms, ant colony optimization, and particle swarm optimization are also applied to reach better solutions. Experimental results showed the proposed method improved performance over other existing methods.
Handover Algorithm based VLP using Mobility Prediction Database for Vehicular...IJECEIAES
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.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Irrational node detection in multihop cellular networks using accounting centereSAT Journals
Abstract In multihop cellular networks mobile nodes typically transmit packets during intermediate mobile nodes for enhancing recital. Stingy nodes typically don't collaborate that incorporates a negative result on the network fairness and recital. A fair, inexpensive and best incentive mechanism by Selfish Node Detection (FESCIMbySND) has been projected to stimulate the mobile node’s cooperation. Hashing operations area unit employed in order to extend the safety. Trivial Hash perform has been wont to improve end-to-end delay and outturn. Additionally Cyclic Redundancy Check Mechanism has been used to spot the ridiculous nodes that involve themselves in sessions with the intention of dropping the in sequence packets. Moreover, to cut back the impact at the Accounting Center a Border node has been commend the task of propose the checks employing a digital signature. Keywords: Border Node Mechanism, Cyclic Redundancy Check, Selfish nodes, Trivial Hash Function
A Survey on the Common Network Traffic Sources ModelsCSCJournals
Selecting the appropriate traffic model can lead to the successful design of networks. The more accurate is the traffic model the better is the system quantified in terms of its performance Successful design lead to enhancement the overall performance of the whole of network .in literature there is innumerous traffic models proposed for understanding and analyzing the traffic characteristics of networks. Consequently, the study of traffic models to understand the features of the models and identify eventually the best traffic model, for a concerned environment has become a crucial and lucrative task. Good traffic modeling is also a basic requirement for accurate capacity planning. This paper provides an overview of some of the widely used network traffic models, highlighting the core features of the model and traffic characteristics they capture best. Finally we found that the N_BURST traffic model can capture the traffic characteristics of most types of networks, under every possible circumstance rather than any type of traffic model.
Performance Simulation and Analysis for LTESystem Using Human Behavior Queue ...ijwmn
Understanding the nature of traffic has been a key concern of the researchers particularly over the last
two decades and it has been noticed through extensive high quality studies that traffic found in different
kinds of IP/wireless IP networks is human operators . Despite the recent findings of real time human
behavior in measured traffic from data networks, much of the current understanding of IP traffic
modeling is still based on simplistic probability distributed traffic. Unlike most existing studies that are
primarily based on simplistic probabilistic model and traditional scheduling algorithms, this research
presents an analytical performance model for real time human behavior queue systems with intelligent
task management traffic input scheduled by a novel and promising scheduling mechanism for 4G-LTE
system. Our proposed model is substantiated on human behavior queuing system that considers real time
of traffic exhibiting homogeneous tasks characteristics. We analyze the model on the basis of newly
proposed scheduling scheme for 4G-LTE system. We present closed form expressions of expected
response times for real time traffic classes. We develop a discrete event simulator to understand the
behavior of real time of arriving tasks traffic under this newly proposed scheduling mechanism for 4GLTE system . The results indicate that our proposed scheduling algorithm provides preferential treatment
to real-time applications such as voice and video but not to that extent that data applications are starving
for bandwidth and outperforms all other scheduling schemes that are available in the market.
Fpga based 128 bit customised vliw processor for executing dual scalarvector ...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Experimental investigation on halloysite nano tubes & clay an infilled compos...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Power saving mechanism for hybrid routing protocol using scheduling techniqueeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
The document discusses a study on the properties of banana fiber reinforced composites. Banana fibers were treated with sodium hydroxide and used to reinforce both epoxy and vinyl ester resin matrices. Coconut shell powder was also used along with the fibers. Various mechanical properties including tensile strength, flexural strength, and impact strength were tested for the untreated and treated fiber composites. The treated fiber composites showed improved mechanical properties compared to the untreated fibers due to better adhesion between the fiber and matrix. A hybrid composite containing both banana fiber and coconut shell powder showed higher strength values than the banana fiber only composite.
A novel association rule mining and clustering based hybrid method for music ...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
This document summarizes a study on the heat transfer through a journal bearing. It describes the methodology used, which included collecting data on the bearing, performing design calculations, creating a geometric model, and conducting thermal analysis using FEA software. The analysis found that the bearing's temperature ranged from 79.76 to 90.96 degrees C, with most of the surface between 84-88 degrees C. It also determined that up to 14,328 watts of heat was generated within the bearing and up to 1,932 watts of heat was dissipated from the bearing casing through convection.
This document describes different types of smart wrist watches that have embedded cell phone capabilities. It discusses three main types: watches with keypads, watches with smart applications, and watches running the Android operating system. It provides examples and comparisons of features for each type, such as price, design, battery life, and multimedia/connectivity options. The document also proposes additional health-related functions the watches could incorporate, such as blood testing, diabetes monitoring, and calculators for metrics like BMI, BMR, and calorie counting. It concludes the wrist watch can function like a mobile phone and that future concepts could further develop health and technical capabilities while considering economic and technical feasibility.
This document summarizes a research paper that proposes a parallel k-nearest neighbors (kNN) algorithm using OpenCL on a GPU architecture. The key points are:
1) kNN classification is computationally intensive, especially for large datasets, creating a need for parallelization.
2) The authors designed and implemented a parallel kNN algorithm using OpenCL to distribute distance computations across GPU cores.
3) Experimental results on UCI datasets showed the parallel kNN approach improved performance over a serial kNN implementation.
A hydration study by xrdrietveld analysis of cement regenerated from complete...eSAT Publishing House
This document summarizes a study that used X-ray diffraction and Rietveld analysis to examine the hydration of cement regenerated from concrete designed to be completely recyclable. Specifically, it analyzed samples of cement paste in which hydration was arrested at various time points up to 28 days. The results showed that the alite and belite phases decreased over time as portlandite and amorphous calcium silicate hydrate (C-S-H) increased. Aluminate phases dissolved completely while ferrite decreased. Some differences were seen in the mineralogy of cement produced from recycled concrete versus ordinary portland cement, but the hydration processes were similar. The study highlighted the importance of sample preparation methods on the
This document summarizes a study on the nitrate adsorption characteristics of red soil. The objectives were to determine the optimum contact time, adsorbent dosage, and pH for nitrate removal. Batch experiments showed that equilibrium was reached after 130 minutes of contact time, with 86% removal efficiency at a dosage of 1400mg. Higher adsorption occurred at pH 6.0. The adsorption kinetics followed a first order rate equation and the data fit the Langmuir and Freundlich isotherm models well. The results indicate that red soil is effective at removing nitrate.
Availability analysis of parallel transit fuel system in petrol engine under ...eSAT Publishing House
This document summarizes a research paper that analyzes the availability of a parallel transit fuel system in a petrol engine. The fuel system has two subsystems (A and B) in series, with subsystem A having two fuel sources as a backup. Subsystem failures follow an exponential distribution and repairs follow a general distribution. The author uses Laplace transforms to obtain equations governing the behavior of the system and its state probabilities. Key results include expressions for the steady-state probabilities of different system states and the long-term availability of the overall fuel system.
Product aspect ranking using domain dependent and domain independent revieweSAT Publishing House
This document discusses methods for identifying and ranking important product aspects from online customer reviews. It begins by explaining how online reviews have become an important source of information for customers but are challenging to analyze due to their unorganized nature. The document then reviews existing methods for identifying product aspects, including supervised and unsupervised approaches. It proposes a new approach to automatically determine the most important product aspects by calculating an importance score for each aspect, in order to help customers better understand reviewer opinions on key product attributes.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Experimental investigation on the effect of fin pitch on the performance of p...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
This document summarizes research on inter-vehicular communication using packet network theory. It discusses how vehicle-to-vehicle and vehicle-to-infrastructure communication can improve road safety and efficiency. The paper proposes using localization techniques combined with GPS to determine vehicle positions, and applying congestion algorithms to decongest traffic lanes. It also outlines algorithms for lane detection, pedestrian detection, and modifying Dijkstra's algorithm for optimal vehicle routing.
A distributed system can be viewed as an environment in which, number of computers/nodes are connected and resources are shared among these computers/nodes. But unfortunately, distributed systems often face the problem of traffic, which can degrade the performance of the system. Traffic management is used to improve scalability and overall system throughput in distributed systems using Software Defined Network (SDN) based systems. Traffic management improves system performance by dividing the work traffic effectively among the participating computers/nodes. Many algorithms were proposed for traffic management and their performance is measured based on certain parameters such as response time, resource utilization, and fault tolerance. Traffic management algorithms are broadly classified into two categories- scheduling and machine learning traffic management. This work presents the study of performance analysis of traffic management algorithms. This analysis can further help in the design of new algorithms. However, when multiple servers are assigned to compile the mysterious code, different kinds of techniques are used. One common example is traffic management. The processes are managed based on power efficiency, networking bandwidth, Processor speed. The desired output will again send back to the developer. If multiple programs have to be compiled then appropriate technique such as scheduling algorithm is used. So the compilation process becomes faster and also the other process can get a chance to compile. SDN based clustering algorithm based on Simulated Annealing whose main goal is to increase network lifetime while maintaining adequate sensing coverage in scenarios where sensor nodes produce uniform or non-uniform data traffic.
This document summarizes a research paper on fair scheduling techniques in wireless mesh networks (WMNs) with multiple gateways. It begins with background on WMNs and challenges of scheduling. It then reviews existing fair scheduling algorithms and classifies them. The document proposes a new fair scheduling approach for WMNs with multiple gateways consisting of 4 steps: demand tables, demand propagation, group generation, and schedule generation. Simulation results show the proposed approach improves performance metrics like fairness and throughput compared to approaches without fair scheduling.
There are number of cluster based routing algorithms in mobile ad hoc networks. Since ad hoc networks are not accompanied by fixed access points, efficient routing is a must for such networks. Clustering approach is applied in mobile ad hoc network because clusters are more easily manageable and are more viable. It consists of segregating the given network into several reasonable clusters by using a clustering algorithm. By performing clustering we elect a worthy node from the cluster as the cluster head in such a way that we strive to reduce the management overheads and thus increasing the efficiency of routing. As for the fact that nodes in mobile ad hoc network have frequent host change and frequent topology change routing plays an important role for maintenance and backup mechanism to stabilize network performance. This paper aims to review the previous research papers and provide a survey on the various cluster based routing protocols in mobile ad hoc network. This paper presents analytical study of cluster based routing algorithms from literature. Index Terms— Ad- hoc networks, Cluster head, Clustering, Protocol, Route selection.
The document describes Mercury, a messaging system for intelligent transportation systems that aims to provide reliable, low-latency communication between vehicles and infrastructure. Mercury uses a publish/subscribe model with a centralized broker that aggregates data and calculates relevant message recipients based on location. The system was prototyped and evaluated on a testbed, demonstrating its functional capabilities and latency performance.
Network Monitoring and Traffic Reduction using Multi-Agent TechnologyEswar Publications
In this paper the algorithms which could improve Transmission band and Network Traffic reduction for computer network has been shown. Problem solving is an area with which many Multiagent-based applications are concerned. Multiagent systems are computational systems in which several agents interact or work together to achieve some purposes. It includes distributed solutions to problems, solving distributed problems and distributed techniques for problem solving. Multiagent using for maximizing group performance with planning, execution, monitoring, communication and coordination. This paper also addresses some critical issues in developing
Multi agent-based traffic control and monitoring systems, such as interoperability, flexibility, and extendibility. Finally, several future research directions toward the successful deployment of Multiagent technology in traffic control and monitoring systems are discussed.
Traffic-aware adaptive server load balancing for softwaredefined networks IJECEIAES
Servers in data center networks handle heterogeneous bulk loads. Load balancing, therefore, plays an important role in optimizing network bandwidth and minimizing response time. A complete knowledge of the current network status is needed to provide a stable load in the network. The process of network status catalog in a traditional network needs additional processing which increases complexity, whereas, in software defined networking, the control plane monitors the overall working of the network continuously. Hence it is decided to propose an efficient load balancing algorithm that adapts SDN. This paper proposes an efficient algorithm TAASLB-traffic-aware adaptive server load balancing to balance the flows to the servers in a data center network. It works based on two parameters, residual bandwidth, and server capacity. It detects the elephant flows and forwards them towards the optimal server where it can be processed quickly. It has been tested with the Mininet simulator and gave considerably better results compared to the existing server load balancing algorithms in the floodlight controller. After experimentation and analysis, it is understood that the method provides comparatively better results than the existing load balancing algorithms.
International Journal of Engineering and Science Invention (IJESI)inventionjournals
This document summarizes a research paper on improving traffic detection algorithms using an extended floating car data (xFCD) system. The xFCD system collects data from vehicles including location, speed, direction and visual data from a forward-facing camera. It is tested under different lighting and traffic conditions. The paper investigates using xFCD data and information from road sensors to construct a hybrid model characterizing traffic states. A traffic detection algorithm is proposed to improve network performance metrics like throughput, delivery ratio and packet delay. Simulation results show the proposed approach improves these metrics compared to existing methods.
An Improved Greedy Parameter Stateless Routing in Vehicular Ad Hoc NetworkIJAAS Team
Congestion problem and packet delivery related issues in the vehicular ad hoc network environment is a widely researched problem in recent years. Many network designers utilize various algorithms for the design of ad hoc networks and compare their results with the existing approaches. The design of efficient network protocol is a major challenge in vehicular ad hoc network which utilizes the value of GPS and other parameters associated with the vehicles. In this paper GPSR protocol is improved and compared with the existing GPSR protocol and AODV protocol on the basis of various performance parameters like throughput of the network, delay and packet delivery ratio. The results also validate the performance of the proposed approach.
Improving QoS in VANET Using Dynamic Clustering TechniqueKaushik Padmanabhan
The document presents a new dynamic multi-clustering technique to improve quality of service (QoS) in vehicular ad hoc networks (VANETs) used for vehicle platooning. It begins by discussing limitations of existing single clustering approaches. It then proposes a hierarchical clustering approach that forms multiple clusters within each platoon dynamically based on traffic conditions. A new Relative Multi-Head Disturbance Adaptation (RMDA) algorithm is introduced to select cluster heads. This algorithm considers both relative distance and mobility between nodes to select stable cluster heads. Simulation results show the approach improves QoS metrics like packet delay, throughput and packet loss ratio over existing single clustering techniques.
A new conceptual algorithm for adaptive route changing in urban environmentseSAT Journals
Abstract In this paper an attempt is shown in a Mathematical Model of an alternating route adapting for large scale, which was previously done in small scale. This evaluation is done considering 75 and above traffic junctions with a scale of 4 to 6 vehicular density per second in each junction. The main objective of this paper is to show how an Adaptive Route Changing [ARC] application responds to assumed scenario & also proposing effective software architecture to monitor traffic in all the junctions at real time to minimise traffic congestion. Keywords : ARC, Intelligent transport system, Traffic Monitoring.
Effective and Efficient Job Scheduling in Grid ComputingAditya Kokadwar
The integration of remote and diverse resources and the increasing computational needs of Grand Challenges problems combined with the faster growth of the internet and communication technologies leads to the development of global computational grids. Grid computing is a prevailing technology, which unites underutilized resources in order to support sharing of resources and services distributed across numerous administrative region. An efficient and effective scheduling system is essentially required in order to achieve the promising capacity of grids. The main goal of scheduling is to maximize the resource utilization and minimize processing time and cost of the jobs. In this research, the objective is to prioritize the jobs based on execution cost and then allocate the resources with minimum cost by merging it with conventional job grouping strategy to provide the solution for better and more efficient job scheduling which is beneficial to both user and resource broker. The proposed scheduling approach in grid computing employs a dynamic cost-based job scheduling algorithm for making an efficient mapping of a job to available resources in the grid. It also improves communication to computation ratio (CCR) and utilization of available resources by grouping the user jobs before resource allocation.
This document lists several Java/J2EE/J2ME projects involving topics like adaptive resource allocation in utility computing, automatic schema matching, fuzzy ontology generation for the semantic web, energy efficient routing in wireless sensor networks, wireless MAC protocols, distributed cache updating, selfish routing in internet-like environments, distributed collaborative key agreement, TCP low priority service, distributed database architecture for global roaming, shortest path finding using GPS navigation, network intrusion detection, honey pots for security, voice over internet protocol, GPS vehicle location tracking, SIP-based teleconferencing, online security systems using motion detection, and location aided routing in ad-hoc networks.
This document lists several Java/J2EE/J2ME projects including:
1. A project on adaptive resource allocation in utility computing clusters that observed a 14% increase in resource provider profit and 20% reduction in user request response time.
2. A project on automatic schema matching that introduced a framework for composing schema matchers and generating ranked schema mappings.
3. A project on automatic fuzzy ontology generation for the semantic web using fuzzy formal concept analysis.
4. A project on energy efficient routing in wireless sensor networks that jointly optimized data transmission and fusion costs.
The document describes 10 Java/J2EE/J2ME projects covering topics such as:
1) Adaptive resource allocation in utility computing and its impact on provider profit and user response times.
2) Using schema meta-matching to generate consensus mappings between schemas by composing multiple schema matchers.
3) Automatically generating fuzzy ontologies for the semantic web using fuzzy formal concept analysis.
4) An adaptive data fusion algorithm for energy efficient routing in wireless sensor networks.
5) An implicitly pipelined MAC protocol to improve channel utilization for wireless networks.
6) A distributed cache updating algorithm for the dynamic source routing protocol.
7) Investigating selfish routing in Internet-like environments using game
This document lists several Java/J2EE/J2ME projects related to utility computing environments, schema matching, fuzzy ontology generation, wireless sensor networks, wireless MAC protocols, distributed cache updating, selfish routing, collaborative key agreement, TCP congestion control, global roaming in mobile networks, GPS-based emergency response systems, network intrusion detection, honey pots, voice over IP, vehicle tracking, SIP-based teleconferencing, online security systems, and location-aided routing in ad hoc networks. The projects cover a wide range of topics related to distributed systems, wireless networks, and Internet protocols.
The document describes 10 Java/J2EE/J2ME projects covering topics such as:
1) Adaptive resource allocation in utility computing and its impact on provider profit and user requirements.
2) Using schema meta-matching to generate consensus rankings from multiple schema matchers to improve automatic schema matching.
3) The FOGA framework for automatically generating fuzzy ontologies for representing uncertainty on the Semantic Web.
4) The Adaptive Fusion Steiner Tree algorithm for optimizing energy efficiency in wireless sensor networks by adaptively determining whether to perform data fusion.
This document lists several Java/J2EE/J2ME projects related to utility computing environments, schema matching, fuzzy ontology generation, wireless sensor networks, wireless MAC protocols, distributed cache updating, selfish routing, collaborative key agreement, TCP congestion control, global roaming in mobile networks, GPS-based emergency response systems, network intrusion detection, honey pots, voice over IP, vehicle tracking, SIP-based teleconferencing, online security systems, and location-aided routing in ad hoc networks. The projects cover a wide range of topics related to distributed systems, wireless networks, and Internet protocols.
This document lists several Java/J2EE/J2ME projects related to utility computing environments, schema matching, fuzzy ontology generation, wireless sensor networks, wireless MAC protocols, distributed cache updating, selfish routing, collaborative key agreement, TCP congestion control, global roaming in mobile networks, GPS-based emergency response systems, network intrusion detection, honey pots, voice over IP, vehicle tracking, SIP-based teleconferencing, online security systems, and location-aided routing in ad hoc networks. The projects cover a wide range of topics related to distributed systems, wireless networks, and Internet protocols.
This document lists several Java/J2EE/J2ME projects related to utility computing environments, schema matching, fuzzy ontology generation, wireless sensor networks, wireless MAC protocols, distributed cache updating, selfish routing, collaborative key agreement, TCP congestion control, global roaming in mobile networks, GPS-based emergency response systems, network intrusion detection, honey pots, voice over IP, vehicle tracking, SIP-based teleconferencing, online security systems, and location-aided routing in ad hoc networks. The projects cover a wide range of topics related to distributed systems, wireless networks, and Internet protocols.
Similar to Grid fabrication of traffic maintenance system clustering at road junctions (20)
Hudhud cyclone caused extensive damage in Visakhapatnam, India in October 2014, especially to tree cover. This will likely impact the local environment in several ways: increased air pollution as trees absorb less; higher temperatures without tree canopy; increased erosion and landslides. It also created large amounts of waste from destroyed trees. Proper management of solid waste is needed to prevent disease spread. Suggested measures include restoring damaged plants, building fountains to reduce heat, mandating light-colored buildings, improving waste management, and educating public on health risks. Overall, changes are needed to water, land, and waste practices to rebuild the environment after the cyclone removed green cover.
Impact of flood disaster in a drought prone area – case study of alampur vill...eSAT Publishing House
1) In September-October 2009, unprecedented heavy rainfall and dam releases caused widespread flooding in Alampur village in Mahabub Nagar district, a historically drought-prone area.
2) The flood damaged or destroyed homes, buildings, infrastructure, crops, and documents. It displaced many residents and cut off the village.
3) The socioeconomic conditions and mud-based construction of homes in the village exacerbated the flood's impacts, making damage more severe and recovery more difficult.
The document summarizes the Hudhud cyclone that struck Visakhapatnam, India in October 2014. It describes the cyclone's formation, rapid intensification to winds of 175 km/h, and landfall near Visakhapatnam. The cyclone caused extensive damage estimated at over $1 billion and at least 109 deaths in India and Nepal. Infrastructure like buildings, bridges, and power lines were destroyed. Crops and fishing boats were also damaged. The document then discusses coping strategies and improvements needed to disaster management plans to better prepare for future cyclones.
Groundwater investigation using geophysical methods a case study of pydibhim...eSAT Publishing House
This document summarizes the results of a geophysical investigation using vertical electrical sounding (VES) methods at 13 locations around an industrial area in India. The VES data was interpreted to generate geo-electric sections and pseudo-sections showing subsurface resistivity variations. Three main layers were typically identified - a high resistivity topsoil, a weathered middle layer, and a basement rock. Pseudo-sections revealed relatively more weathered areas in the northwest and southwest. Resistivity sections helped identify zones of possible high groundwater potential based on low resistivity anomalies sandwiched between more resistive layers. The study concluded the electrical resistivity method was useful for understanding subsurface geology and identifying areas prospective for groundwater exploration.
Flood related disasters concerned to urban flooding in bangalore, indiaeSAT Publishing House
1. The document discusses urban flooding in Bangalore, India. It describes how factors like heavy rainfall, population growth, and improper land use have contributed to increased flooding in the city.
2. Flooding events in 2013 are analyzed in detail. A November rainfall caused runoff six times higher than the drainage capacity, inundating low-lying residential areas.
3. Impacts of urban flooding include disrupted daily life, damaged infrastructure, and decreased economic activity in affected areas. The document calls for improved flood management strategies to better mitigate urban flooding risks in Bangalore.
Enhancing post disaster recovery by optimal infrastructure capacity buildingeSAT Publishing House
This document discusses enhancing post-disaster recovery through optimal infrastructure capacity building. It presents a model to minimize the cost of meeting demand using auxiliary capacities when disaster damages infrastructure. The model uses genetic algorithms to select optimal capacity combinations. The document reviews how infrastructure provides vital services supporting recovery activities and discusses classifying infrastructure into six types. When disaster reduces infrastructure services, a gap forms between community demands and available support, hindering recovery. The proposed research aims to identify this gap and optimize capacity selection to fill it cost-effectively.
Effect of lintel and lintel band on the global performance of reinforced conc...eSAT Publishing House
This document analyzes the effect of lintels and lintel bands on the seismic performance of reinforced concrete masonry infilled frames through non-linear static pushover analysis. Four frame models are considered: a frame with a full masonry infill wall; a frame with a central opening but no lintel/band; a frame with a lintel above the opening; and a frame with a lintel band above the opening. The results show that the full infill wall model has 27% higher stiffness and 32% higher strength than the model with just an opening. Models with lintels or lintel bands have slightly higher strength and stiffness than the model with just an opening. The document concludes lintels and lintel
Wind damage to trees in the gitam university campus at visakhapatnam by cyclo...eSAT Publishing House
1) A cyclone with wind speeds of 175-200 kph caused massive damage to the green cover of Gitam University campus in Visakhapatnam, India. Thousands of trees were uprooted or damaged.
2) A study assessed different types of damage to trees from the cyclone, including defoliation, salt spray damage, damage to stems/branches, and uprooting. Certain tree species were more vulnerable than others.
3) The results of the study can help in selecting more wind-resistant tree species for future planting and reducing damage from future storms.
Wind damage to buildings, infrastrucuture and landscape elements along the be...eSAT Publishing House
1) A visual study was conducted to assess wind damage from Cyclone Hudhud along the 27km Visakha-Bheemli Beach road in Visakhapatnam, India.
2) Residential and commercial buildings suffered extensive roof damage, while glass facades on hotels and restaurants were shattered. Infrastructure like electricity poles and bus shelters were destroyed.
3) Landscape elements faced damage, including collapsed trees that damaged pavements, and debris in parks. The cyclone wiped out over half the city's green cover and caused beach erosion around protected areas.
1) The document reviews factors that influence the shear strength of reinforced concrete deep beams, including compressive strength of concrete, percentage of tension reinforcement, vertical and horizontal web reinforcement, aggregate interlock, shear span-to-depth ratio, loading distribution, side cover, and beam depth.
2) It finds that compressive strength of concrete, tension reinforcement percentage, and web reinforcement all increase shear strength, while shear strength decreases as shear span-to-depth ratio increases.
3) The distribution and amount of vertical and horizontal web reinforcement also affects shear strength, but closely spaced stirrups do not necessarily enhance capacity or performance.
Role of voluntary teams of professional engineers in dissater management – ex...eSAT Publishing House
1) A team of 17 professional engineers from various disciplines called the "Griha Seva" team volunteered after the 2001 Gujarat earthquake to provide technical assistance.
2) The team conducted site visits, assessments, testing and recommended retrofitting strategies for damaged structures in Bhuj and Ahmedabad. They were able to fully assess and retrofit 20 buildings in Ahmedabad.
3) Factors observed that exacerbated the earthquake's impacts included unplanned construction, non-engineered buildings, improper prior retrofitting, and defective materials and workmanship. The professional engineers' technical expertise was crucial for effective post-disaster management.
This document discusses risk analysis and environmental hazard management. It begins by defining risk, hazard, and toxicity. It then outlines the steps involved in hazard identification, including HAZID, HAZOP, and HAZAN. The document presents a case study of a hypothetical gas collecting station, identifying potential accidents and hazards. It discusses quantitative and qualitative approaches to risk analysis, including calculating a fire and explosion index. The document concludes by discussing hazard management strategies like preventative measures, control measures, fire protection, relief operations, and the importance of training personnel on safety.
Review study on performance of seismically tested repaired shear wallseSAT Publishing House
This document summarizes research on the performance of reinforced concrete shear walls that have been repaired after damage. It begins with an introduction to shear walls and their failure modes. The literature review then discusses the behavior of original shear walls as well as different repair techniques tested by other researchers, including conventional repair with new concrete, jacketing with steel plates or concrete, and use of fiber reinforced polymers. The document focuses on evaluating the strength retention of shear walls after being repaired with various methods.
Monitoring and assessment of air quality with reference to dust particles (pm...eSAT Publishing House
This document summarizes a study on monitoring and assessing air quality with respect to dust particles (PM10 and PM2.5) in the urban environment of Visakhapatnam, India. Sampling was conducted in residential, commercial, and industrial areas from October 2013 to August 2014. The average PM2.5 and PM10 concentrations were within limits in residential areas but moderate to high in commercial and industrial areas. Exceedance factor levels indicated moderate pollution for residential areas and moderate to high pollution for commercial and industrial areas. There is a need for management measures like improved public transport and green spaces to combat particulate air pollution in the study areas.
Low cost wireless sensor networks and smartphone applications for disaster ma...eSAT Publishing House
This document describes a low-cost wireless sensor network and smartphone application system for disaster management. The system uses an Arduino-based wireless sensor network comprising nodes with various sensors to monitor the environment. The sensor data is transmitted to a central gateway and then to the cloud for analysis. A smartphone app connected to the cloud can detect disasters from the sensor data and send real-time alerts to users to help with early evacuation. The system aims to provide low-cost localized disaster detection and warnings to improve safety.
Coastal zones – seismic vulnerability an analysis from east coast of indiaeSAT Publishing House
This document summarizes an analysis of seismic vulnerability along the east coast of India. It discusses the geotectonic setting of the region as a passive continental margin and reports some moderate seismic activity from offshore in recent decades. While seismic stability cannot be assumed given events like the 2004 tsunami, no major earthquakes have been recorded along this coast historically. The document calls for further study of active faults, neotectonics, and implementation of improved seismic building codes to mitigate vulnerability.
Can fracture mechanics predict damage due disaster of structureseSAT Publishing House
This document discusses how fracture mechanics can be used to better predict damage and failure of structures. It notes that current design codes are based on small-scale laboratory tests and do not account for size effects, which can lead to more brittle failures in larger structures. The document outlines how fracture mechanics considers factors like size effect, ductility, and minimum reinforcement that influence the strength and failure behavior of structures. It provides examples of how fracture mechanics has been applied to problems like evaluating shear strength in deep beams and investigating a failure of an oil platform structure. The document argues that fracture mechanics provides a more scientific basis for structural design compared to existing empirical code provisions.
This document discusses the assessment of seismic susceptibility of reinforced concrete (RC) buildings. It begins with an introduction to earthquakes and the importance of vulnerability assessment in mitigating earthquake risks and losses. It then describes modeling the nonlinear behavior of RC building elements and performing pushover analysis to evaluate building performance. The document outlines modeling RC frames and developing moment-curvature relationships. It also summarizes the results of pushover analyses on sample 2D and 3D RC frames with and without shear walls. The conclusions emphasize that pushover analysis effectively assesses building properties but has limitations, and that capacity spectrum method provides appropriate results for evaluating building response and retrofitting impact.
A geophysical insight of earthquake occurred on 21 st may 2014 off paradip, b...eSAT Publishing House
1) A 6.0 magnitude earthquake occurred off the coast of Paradip, Odisha in the Bay of Bengal on May 21, 2014 at a depth of around 40 km.
2) Analysis of magnetic and bathymetric data from the area revealed the presence of major lineaments in NW-SE and NE-SW directions that may be responsible for seismic activity through stress release.
3) Movements along growth faults at the margins of large Bengal channels, due to large sediment loads, could also contribute to seismic events by triggering movements along the faults.
Effect of hudhud cyclone on the development of visakhapatnam as smart and gre...eSAT Publishing House
This document discusses the effects of Cyclone Hudhud on the development of Visakhapatnam as a smart and green city through a case study and preliminary surveys. The surveys found that 31% of participants had experienced cyclones, 9% floods, and 59% landslides previously in Visakhapatnam. Awareness of disaster alarming systems increased from 14% before the 2004 tsunami to 85% during Cyclone Hudhud, while awareness of disaster management systems increased from 50% before the tsunami to 94% during Hudhud. The surveys indicate that initiatives after the tsunami improved awareness and preparedness. Developing Visakhapatnam as a smart, green city should consider governance
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsVictor Morales
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
Using recycled concrete aggregates (RCA) for pavements is crucial to achieving sustainability. Implementing RCA for new pavement can minimize carbon footprint, conserve natural resources, reduce harmful emissions, and lower life cycle costs. Compared to natural aggregate (NA), RCA pavement has fewer comprehensive studies and sustainability assessments.
A review on techniques and modelling methodologies used for checking electrom...nooriasukmaningtyas
The proper function of the integrated circuit (IC) in an inhibiting electromagnetic environment has always been a serious concern throughout the decades of revolution in the world of electronics, from disjunct devices to today’s integrated circuit technology, where billions of transistors are combined on a single chip. The automotive industry and smart vehicles in particular, are confronting design issues such as being prone to electromagnetic interference (EMI). Electronic control devices calculate incorrect outputs because of EMI and sensors give misleading values which can prove fatal in case of automotives. In this paper, the authors have non exhaustively tried to review research work concerned with the investigation of EMI in ICs and prediction of this EMI using various modelling methodologies and measurement setups.
Understanding Inductive Bias in Machine LearningSUTEJAS
This presentation explores the concept of inductive bias in machine learning. It explains how algorithms come with built-in assumptions and preferences that guide the learning process. You'll learn about the different types of inductive bias and how they can impact the performance and generalizability of machine learning models.
The presentation also covers the positive and negative aspects of inductive bias, along with strategies for mitigating potential drawbacks. We'll explore examples of how bias manifests in algorithms like neural networks and decision trees.
By understanding inductive bias, you can gain valuable insights into how machine learning models work and make informed decisions when building and deploying them.
6th International Conference on Machine Learning & Applications (CMLA 2024)ClaraZara1
6th International Conference on Machine Learning & Applications (CMLA 2024) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of on Machine Learning & Applications.
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
Literature Review Basics and Understanding Reference Management.pptxDr Ramhari Poudyal
Three-day training on academic research focuses on analytical tools at United Technical College, supported by the University Grant Commission, Nepal. 24-26 May 2024
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.
Advanced control scheme of doubly fed induction generator for wind turbine us...
Grid fabrication of traffic maintenance system clustering at road junctions
1. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
_______________________________________________________________________________________
Volume: 03 Issue: 07 | Jul-2014, Available @ http://www.ijret.org 221
GRID FABRICATION OF TRAFFIC MAINTENANCE SYSTEM
CLUSTERING AT ROAD JUNCTIONS
Avula Anitha1
1
School of Informatics, Hawassa University, Ethiopia
Abstract
Controlling congestion has become an important task in current traffic conditions. Different techniques are introduced to control
the same. This paper designs and develops a novel traffic flow strategy based on simultaneous and dynamic clustering named
Grid Fabrication of Traffic Maintenance System (GFTMS) Clustering algorithm which stands efficient while deciding the route to
take to reach the intended destination within the expected time.
Keywords: Congestion, simultaneous and dynamic Clustering, GFTMS Clustering.
--------------------------------------------------------------------***----------------------------------------------------------------------
1. INTRODUCTION
The basic purpose of Traffic Management System is to
control the congestion in the road network. To achieve this
several congestion control techniques are given. But, when it
should be controlled, it is necessary to exchange the
information so that routing the vehicles through the less
congested route may decrease the time to reach the
destination. It can be through VANETs [4] and can also be
through the Grid Computing [2, 3, 7]. When the vehicles get
accumulated at junctions, the junctions have to take the
responsibility of scheduling vehicles through less congested
routes which can minimize both the travel time and the loss
occurring due to extended waiting in the traffic jams.
For exchanging the information and for publishing aspects
among the nodes of road traffic network by developing the
routing strategies or alternative routing strategies which are
computationally intensive High Performance Computing
Facilities, distributed computing and synchronization of
nodes are required. Grid Computing using Grid Services will
stand useful. Thus a Grid Fabrication for Traffic Maintenance
System (GFTMS) [1] is thought as a better solution which
provides computational support as well as stateful web
service.
If decision making is done at junctions, treated as Grid nodes
[1], vehicles scheduled through the less congested routes
leads to inferior solution because the addition of this load
leads to inferior performance. Thus, load distribution among
alternate paths for effective throughput needs to be worked
out. Hence distributing the traffic among alternate routes is
the subject of our work. To achieve this, some technique
should be there to group the vehicles according to different
criteria such as destination, priority, type of vehicle, so that
routing of emergency, important and higher priority vehicles
can be done through less congested route. Therefore, for
grouping the vehicles at junctions or nodes, clustering stands
an efficient technique. In this paper, for clustering of vehicles
at nodes, the GFTMS-Clustering algorithm is proposed. This
algorithm addresses step 1 of the proposed Grid Fabrication
in [1] and it is a combination of Hierarchical clustering as the
clustering is done through different levels and Leaders
algorithm [11] as the number of clusters to be created cannot
be decided prior. The number of clusters created depends
purely on type, destination and priority of the vehicles
considered. In the present study we are confining to only
these features and one can consider all the features which
influence QOS characteristics of traffic network instead.
The work of [10] has lead to the idea of constructing more
stable clusters of vehicles to route the important, higher
priority vehicles through the less congested routes.
In this paper, the following Section 2 gives the traffic
maintenance analogy in Grid System. In Section 3 an
overview of Grid System and clustering is covered. Section 4
covers the related work in controlling congestion using VAN
based, Grid based approaches and some clustering strategies.
Motivation for proceeding with this work and the proposed
algorithm for clustering the vehicles at junction are given in
Section 5. Section 6 demonstrates GFTMS-Clustering
strategy and provides embedding strategy for real time road
traffic monitoring and controlling system along with the
comparison of the works which has motivated to proceed
further with this paper. Section 7 provides simulation results
for the contributions made in this paper and represents the
comparison with and without using the proposed clustering
approach. Conclusion is dealt in Section 8.
2. TRAFFIC MAINTENANCE ANALOGY IN
GRID SYSTEM
The work proposed in [1], describes junctions as Grid Nodes.
Road is a connection between two nodes. These are the
services or resources available at nodes. The resources are
utilized by the vehicles which will occupy the capacity and
forms the load. The vehicles are the users and mobiles in the
road network. Each vehicle will publish the information to
the Grid Node or junction. The Grid node will compute the
traffic parameters for the resources connected to it and will in
2. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
_______________________________________________________________________________________
Volume: 03 Issue: 07 | Jul-2014, Available @ http://www.ijret.org 222
turn exchange the information with other Grid nodes linked to
it directly. This exchanging of information among Grid nodes
will help the nodes to decide about the next best hop and the
alternate hop to be taken by each vehicle accurately to avoid
the formation of congestion at other nodes and also implicit
occupation of the resources. The same analogy is considered
even in this paper also
3. GRID SYSTEM AND CLUSTERING
3.1 Grid System
The supercomputing held in San Diego in 1995 has lead to
the emergence of Grid Computing platform. The Global Grid
Forum (GGF) also known as Open Grid Forum (OGF)
developed standard interfaces, behaviour, core semantics etc.
for grid applications based upon web services [8].
We can classify service state management in web services
into two forms. 1. Interaction aware state, in which a client
may interact with a server for a long period of time. These
interactions are correlated with some information passed from
the client along with the message such as session-id, cookies
etc. In this the server will not create a specific instance for
client and it won‟t manage any client state information. 2.
Application aware state, in which the services are aware of its
clients and create a specific instance for the specific client and
pass the instance information back to the client for
interaction. Therefore the client is holding a reference to the
specific instance of the service/application and hence can
interact with the service instance without passing any
correlation information. These services are referred to as
stateful services. Grid services are the stateful web services
with a well-defined interfaces and behaviour for interactions.
In our problem, at any moment any junction can behave as an
information requestor or information responder and to achieve
this Service Oriented Approach (SOA) is required which can
be done using either Web Services or Grid Services. As Web
Services are stateless and the information gathered should be
valid and existing for a long time, the statefulness should be
provided. Therefore in our approach Grid Technology is
used.
Grid Resource Access Manager is the module in Grid that
provides the remote execution and status management of the
execution. When a job is submitted by a client, the request is
sent to the remote host and handled by the gatekeeper daemon
located in the remote host. The gatekeeper creates a job
manager to start and monitor the job. When the job is
finished, the job manager sends the status information back to
the client and terminates. Job manager is created by the
gatekeeper daemon as part of the job requesting process using
Resource Specification Language (RSL) by the clients. All
job submission requests are described in RSL including the
executable file and condition on which it must be executed.
Job manager provides the interface that controls the allocation
of each local resource manager such as a job scheduler like
PBS or load-leveller. The functions are parse RSL, allocate
job requests to the local resource manager, send call-backs to
clients, receive status, cancel requests from clients and send
output results to clients using Global Access to Secondary
Storage if requested (GASS) [9].
3.2 Clustering
Clustering typically groups data into sets in such a way that
the intra-cluster similarity is maximized while the inter-
cluster similarity is minimized. The clustering technique has
been extensively studied in many fields such as pattern
recognition, customer segmentation similarity search and
trend analysis. Data clustering is a method in which we make
cluster of objects that are somehow similar in characteristics.
The criterion for checking the similarity is implementation
dependent. Clustering is often confused with classification,
but there is some difference between the two. In classification
the objects are assigned to predefined classes, whereas in
clustering the classes are also to be defined. Precisely, Data
Clustering is a technique in which, the information that is
logically similar is physically stored together. In order to
increase the efficiency in the database systems the number of
disk accesses is to be minimized. In clustering the objects of
similar properties are placed in one class of objects and a
single access to the disk makes the entire class available. The
distance between two clusters involves some or all elements
of the two clusters. The clustering method determines how the
distance should be computed.
A similarity measure SIMILAR (Di, Dj) can be used to
represent the similarity between the documents or records.
Typical similarity generates values of 0 for exhibiting no
agreement among the assigned indexed terms and 1 when
perfect agreement is detected. Intermediate values are
obtained for cases of partial agreement. Threshold is used as
the lowest possible input value of similarity required to join
two objects in one cluster. Similarity between objects
calculated by the function SIMILAR (Di, Dj), represented in
the form of a matrix is called a similarity matrix. The
dissimilarity coefficient of two clusters is defined to be the
distance between them. The smaller the value of dissimilarity
coefficient, the more similar two clusters are. First document
or object considered of a cluster is defined as the initiator of
that cluster i.e. every incoming object‟s similarity is
compared with the initiator. The initiator is called the cluster
seed.
There are many clustering methods available, and each of
them may give a different grouping of a dataset. The choice
of a particular method will depend on the type of output
desired, the known performance of method with particular
types of data, the hardware and software facilities available
and the size of the dataset.
In general, clustering methods may be divided into two
categories based on the cluster structure which they produce.
1. The non-hierarchical methods divide a dataset of N objects
into M clusters, with or without overlap. These methods are
sometimes divided into partitioning methods, in which the
classes are mutually exclusive, and the less common
clumping method, in which overlap is allowed. Each object is
a member of the cluster with which it is more similar.
However, the threshold of similarity has to be defined. The
3. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
_______________________________________________________________________________________
Volume: 03 Issue: 07 | Jul-2014, Available @ http://www.ijret.org 223
hierarchical methods produce a set of nested clusters in which
each pair of objects or clusters is progressively nested in a
larger cluster until only one cluster remains. 2. The
hierarchical methods can be further divided into
agglomerative or divisive methods. In agglomerative method,
the hierarchy is build up in a series of N-1 agglomerations, or
fusion, of pairs of objects, beginning with the un-clustered
dataset. The less common divisive methods begin with all
objects in a single cluster and at each of N-1 steps divide
some clusters into two smaller clusters, until each object
resides in its own cluster.
4. RELATED WORK
4.1 Vanet Based
Road traffic management mainly concentrates on alleviating
the congestion and reducing the time taken by the vehicles to
reach the intended destination by providing alternative routes
based on the road conditions. The congestion controlling
techniques introduced in wireless networks mainly VANETs
are evolving much. The vehicular communication facilitates
the exchange of information between vehicles in the
prerequisite not only for extending the access to internet while
on the road, but also to cater for special applications such as
of road traffic and travel management. Novel vehicular
communication system for road traffic congestion detection
and dissipation by disseminating and exploiting road
information is proposed in [4]. In this a method is provided
for tuning mechanism to select the importance given to the
least congestions over the travel distance. A flooding based
geo-cast protocol using the Zone of Relevance(ZOR) concept
for disseminating and exchanging road traffic information in a
real time way and a modified version of Dijkstra algorithm
which is used to dynamically recalculate the vehicles route to
a given destination by finding the least congested route is
introduced.
In [5] a method for scheduling visits of a tour is discussed and
the routes used for each of several thousands of users which
satisfy their needs as much as possible, while avoiding
congestion. Given the tour plans of users in advance, the
proposed method predicts congestion on each road and at
each destination for every second, it generates a feasible
schedule for each user by modifying each plan, so that the
user can visit as many places as possible within the overall
constraints. In this a heuristic algorithm to determine
schedules of users from a given road network with service
spots and tour plans of the users is introduced. The
algorithm iteratively removes the least important spot from
each user‟s plans of all users so that the set of modified plans
of all users satisfies time constraints, taking into account the
capacity of the roads and the destinations.
In [6] a new routing protocol called CCSR to improve the
performance of multipath routing protocol for adhoc wireless
networks is proposed. The CCSR uses the cumulative
congestion status of the path rather than congestion status of
the neighbourhood. According to the values of the congestion
status for the path stored in a separate table and maintained by
source node for processing the source node will distribute the
packets such that more packets move to paths with less
congestion. In this CCSR outperforms both Adhoc on-
demand Distance Vector routing protocol (AODV) and
Dynamic Source Routing protocol (DSR) because it balances
the load according to the situation of the network and
adaptively changes the decision by source node.
In road traffic management, the concept of clustering is
playing an important role. In Vehicular Networks [10],
constructing clusters can improve the performance of wireless
communications such as data forwarding, handoff, etc. In this
N-hop cluster is a cluster in which the cluster head node is the
N-hop neighbour of all cluster member nodes. As a result,
the maximum distance in hops between the cluster head node
and the cluster member nodes is N. The beacon messages are
broadcasted by the vehicles. Upon receiving them vehicle
nodes can calculate relative mobility with other vehicle nodes
in its N-hop neighbourhood.
4.2 Grid Based
In [7] the vehicles are navigated and assigned to the optimal
routes according to the information of real time and predicted
traffic flow so that the optimization of traffic flow system and
traveller‟s satisfaction degree can be both achieved. In this
paper Genetic Algorithm is employed to solve the
optimization problem in which the genes of each
chromosome(decision variable) are to record the path number
from the intersection before running the vehicle to the
destination with constant signalling scheme at intersection.
Through genetic operators the best routes can be evolved out.
The web services are utilized to realize the grid computing of
parallel Genetic Algorithm, where several services such as
initializing parameters, selection, crossover and mutation are
computed parallel.
4.3 Clustering Strategies
The paper [12] studies and compares different data clustering
algorithm such as K-means, Hierarchical, Self-Organizing
Maps and Expectation Maximization algorithms. All these
algorithms are compared according to the following factors:
size of dataset, number of clusters and type of dataset used.
5. MOTIVATION AND PROPOSED APPROACH
5.1 Motivation
K-Means[12] is a partitioning clustering method where
partitions of a database of N objects constructs a set of K
clusters with respect to an objective function. In this the input
K i.e. number of clusters for partitioning is mandatory. In
road network monitoring and management system, the
dynamic nature of accumulation of vehicles at junctions
makes it difficult to give exact K value. At different
instances, different number of clusters is created depending
on type, destination and priority of the vehicles accumulated
at junction, hence K cannot be predicted. As, K-means is
restricted to the notion of centre (centroid), assuming the
centre object (here vehicle) is difficult.
4. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
_______________________________________________________________________________________
Volume: 03 Issue: 07 | Jul-2014, Available @ http://www.ijret.org 224
DBScan [12] is a density based clustering method. These
methods permit the growing of a given cluster until the
number of objects or data points (i.e. density) in the
neighborhood exceeds some limits. In case of clustering of
vehicles at junctions, the limit cannot be predetermined,
because at a given instance, there may be a situation where all
vehicles may be of same type or some times, the percentage
of different types of vehicles with different priorities and
destinations will be varying.
Model based clustering Methods [13] builds a cluster on the
basis of a model that receives the best data among others. A
density function is built by model-based algorithm to locate
clusters. The density function defines the spatial distribution
of the data points. The COBWEB is a conceptual learning
algorithm that performs probability analysis and takes
„concept‟ for modelling clusters. Expectation Maximization
is based on statistical modelling and performs expectation
maximization analysis. Self-Organizing Maps is a neural
network based algorithm. It maps high dimensional data into
a 2D or 3D feature map. When the vehicles are getting
accumulated at junctions, there will be no choice of receiving
best data among others. Every object (vehicle) will be
important and every object has to be scheduled.
Hierarchical Agglomerative clustering [12] starts with every
object forming a separate group and then successively
combines the objects or groups that are near to one another
until all groups are combined into one termination condition
is satisfied. This is also referred to as bottom-up approach.
In Hierarchical Divisive clustering [12], it starts with all
objects in a single cluster and then on successive iterations a
cluster is broken down into smaller clusters until each cluster
has a single object or until termination condition is satisfied.
This method is also referred to as top-down approach.
Hierarchical Divisive clustering can be applied to cluster the
vehicles at junctions with buffer zones. This requires that all
the data objects (here vehicles) should be existing to apply the
respective algorithms. The algorithm cannot be triggered
until the completion of accumulation of vehicles at the buffer
zone. If it is triggered prior, then the new vehicle joining the
junction cannot be added to the existing, already created
clusters. This is because the hierarchical clustering will not
allow addition or reallocation once the step of dividing or
combining is completed. As, we are clustering the vehicles
using the vehicle properties, i.e. type, destination and
priority, the hierarchical clustering strategy can be adopted,
by using each vehicle property at each level in the hierarchy.
Hence, with the support of the existing general clustering
algorithm an approach should be introduced where the
number of clusters should not be predicted and can able to
handle the dynamic situation at junctions where the vehicles
should be clustered depending on the type, destination and
priority of vehicles with the similarity as that of hierarchical
clustering
The work of [10] has given that constructing clusters in
VANET‟s can improve the performance for wireless
communications, such as data forwarding etc. It is difficult to
create stable clusters as VANET‟s are dynamic. The solution
for constructing stable clusters by giving importance to
reduce cluster head changes and increasing cluster member
duration, a new mobility metric to represent N-hop mobility
for vehicular networks is proposed. Based on this multi-hop
clustering scheme is presented. Clustering the vehicles in
VANET‟s is to grab the advantage of data forwarding,
communication of congestion etc. As, we are performing
clustering, for scheduling the vehicle through the best hop or
alternate best hop, the clusters created at Grid Nodes, should
be stable. Till they are not reaching the destination node, the
clustering should be done at each node. By following this
work the idea for creating stable clusters instead of dynamic
clusters has emerged. These stable clusters will be valid only
while the red light duration is active.
Vehicles which are having some similarity i.e. association and
which are obeying the interrelation of some characteristics of
vehicles and which are expected to behave more coherently
need to be routed through the same route. Thus association
scheme based grouping is expected to give better, reliable,
cohesive transport system with less data inconsistencies. This
work stood as the initiation for proceeding with GFTMS-
Clustering.
5.2 Proposed Approach
The following is a snapshot of road network with 9 nodes.
The single channel roads are considered here. The vehicles
start from junction „W‟ and reach the junction „A‟. At
Junction „A‟ according to [1], clustering of vehicles is done as
a first step.
Fig 5.1 Snapshot of Road Network
Each vehicle maintains the information about Vehicle-Id,
Source node, intermediate node, destination node, type of
vehicle, priority of vehicle, dimension, colour of vehicle,
speed range, best speed for that vehicle, etc. As soon as the
vehicles reach a junction, they publish their information to the
junction. The junction or node will maintain this captured
information in a table known as Vehicle-Info table. Our
proposed algorithm called „GFTMS-Clustering‟ is invoked.
The algorithm will cluster the vehicles according to the type
of the vehicle, destination of the vehicle and the priority of
the vehicle.
Each vehicle may be of different types such as emergency,
public and normal vehicles and each may want to travel
towards intended destination. Each vehicle can also set its
priority randomly depending on the emergency. The priority
levels considered here are very high i.e. level 5 for emergency
vehicles, high i.e. level 4 for public vehicles and between
medium to low i.e. 1 to 3 for normal vehicles respectively.
5. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
_______________________________________________________________________________________
Volume: 03 Issue: 07 | Jul-2014, Available @ http://www.ijret.org 225
For any higher priority normal vehicle, the level considered is
4.
Our clustering algorithm is a hybridized type of algorithm
where the new cluster is created depending upon the newly
encountered criteria. As the number of clusters cannot be
predefined in a traffic environment, the proposed hybrid
method is designed by addressing this aspect, in contrast to k-
means algorithm. It is also having the features of hierarchical
because the clusters are created by taking first, type of vehicle
into consideration and then further sub-clustering is done
depending on destination of vehicle and then on priority.
For example, type of vehicles considered are 3, destinations
of the vehicles can be any of the 2 destinations and each
vehicle is having priorities ranging in between 1 to 5 (5 is for
emergency, 4 is for public vehicles and 1 to 4 for normal
vehicles). Then, according to our algorithm the maximum
number of clusters created will be atmost 3*2*5=30 clusters.
The vehicles will fall into one of these clusters. In a given
snapshot instance, the clusters may be 1 or 2 or few. Hence,
though upper bound is known, the actual number of clusters is
not possible to predict. The number of clusters created is
dynamic, it depends upon the type of vehicles, destination and
priorities which we are considering in this example.
In this algorithm, the first level clusters are created on “type”
attribute. This cluster set is referred as CS1. For each element
of clusters of CS1 again clustering is done on “destination”
attribute. Thereby, sub-clusters of clusters in CS1 are formed.
This is referred as CS2. For each sub-cluster of cluster set
CS2 at second level clustering, again clustering is done on
“priority” attribute. Thereby, sub-clusters are again created
for each element of cluster set CS2. This is referred as cluster
set CS3. This algorithm can be generalized for other
applications, where the attribute values can be changed
accordingly and where the prior knowledge of number of
clusters to be created is not known. The order for clustering
i.e. type, then destination and then priority can be changed. It
depends on the order of importance which we want to give to
the vehicle attributes while clustering.
The following GFTMS-Clustering algorithm is used for
clustering the vehicles at junctions.
Begin
1. Let RS is the Record Set of Vehicle-Info
table at node.
2. First Level Clustering (let on „type‟ attribute)
2a. Initially Cluster Set CS1 is empty.
2b. Take each record and find the group or cluster to
which it belongs to depending on cluster attribute
„type‟.
2c. Let Dtype is the domain of „type‟ attribute.
Dtype= {N, E, P}
2d. call GFTMS-Clustering (CS1, RS, type)
3. Now, we get Cluster Set CS1={C1,C2,C3}
4. Second level clustering(let on „destination‟
attribute)
4a. initially cluster set CS2 is empty
4b. For each element E of CS1
4c. call GFTMS-Clustering (CS2, E, destination)
5. Third Level Clustering(let on „priority‟
attribute)
5a. Initially CS3 is empty.
5b. For each element E of CS2
5c. call GFTMS-Clustering (CS3, E, priority)
End of 5b
End of 4b
Algorithm GFTMS-Clustering (CS, RS, attr)
// CS Cluster Set initially is empty & RS is the record set of
Vehicle-Info table
Begin
While RS has unread tuple
t=readCurrentTuple ()
If CS is empty
addNewCluster (id, t.attr)
addTupletoCluster (id)
else
for each available cluster c in CS
similarity (t.attr, c.attr)
end of for
get the maximum value of similarity max-similarity
getid of „c‟ with maximum similarity
if max-similarity >= 1
addTupletoCluster (c.id)
else
addNewCluster (id,t. attr)
addTupletoCluster (id)
end of if
end of if
end of while
end GFTMS-Clustering
similarity (p1, p2)
Begin
if equal (p1, p2)
return 1
return 0
end similarity
addTupletoCluster (id)
// adds the tuple to the cluster with id
End addTupletoCluster
addNewCluster (id, label)
//create new cluster with id and label
End addNewCluster
6. DEMONSTRATION
In this section we are going to apply the clustering strategy
i.e. GFTMS-Clustering for data given in table Table 6.1.
Let us consider the following data for 12 cars which are
having the same destination D
6. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
_______________________________________________________________________________________
Volume: 03 Issue: 07 | Jul-2014, Available @ http://www.ijret.org 226
Table 6.1 Snapshot of vehicle details at Node „A‟
Vehicle-id Type Destination Priority Time-
stamp(secs)
c1 N D 1 1
c2 N D 4 1
c3 P D 4 2
c4 E D 5 2
c5 E D 5 2
c6 N D 2 3
c7 P D 4 3
c8 N D 3 4
c9 E D 5 4
c10 N D 1 4
c11 N D 4 5
c12 N D 2 5
In this section we are going to apply the clustering strategy
i.e. GFTMS-Clustering for data given in table Table 6.1.
The domain of type considered here is Dtype= {N, P, E},
where N stands for Normal vehicles, P stands for Public
vehicles and E stands for Emergency vehicles. In this only
one Destination is considered i.e. D. The valid priorities
considered for normal, public and emergency vehicles are 1
or 2 or 3 or 4, 4 and 5 respectively.
For our data the number of clusters created by using the
vehicle properties (roles) specified is shown in Table 6.2.
This table is used for demonstrating the clustering strategy.
According to Table 6.2., we get 6 clusters, therefore we
should have 6 routes to route the vehicles. But, the number of
alternate less congested available routes will not be equal to
number of clusters created.
Table 6.2 Vehicle Properties used for clustering
Vehicle Properties(VP) Vehicles Cluster-
number
r1={Type=N,Dest=D,Priority=1} {c1,c10} TCL1
r2={Type=N,Dest=D,Priority=2} {c6,c12} TCL2
r3={Type=N,Dest=D,Priority=3} {c8} TCL3
r4={Type=N,Dest=D,Priority=4} {c2,c11} TCL4
r5={Type=P,Dest=D,Priority=4} {c3,c7} TCL5
r6={Type=E,Dest=D,Priority=5} {c4,c5,c9} TCL6
In our example according to Figure 5.1, graph of road
network, we are having only 3 routes to D from A. Our
clustering algorithm will be triggered at node A. Hence, there
is a requirement to again agglomerate the clusters depending
on the shared vehicle properties framed.
In our example we are using following policies.
Table 6.3 Shared Vehicle Properties
Now, we will apply the following clustering strategy on the
data present in Table 6.1., by considering the Vehicle
properties (VPs) considered in Table 6.2., and by using the
Shared Vehicle Properties given in Table 6.3.
6.1 Demonstration Using GFTMS Clustering
Step1
By applying GFTMS clustering, initially 1st
level clustering is
done on the attribute “type”. The following cluster set CS1 is
created. In this each cluster grows and also the new clusters
are created simultaneously.
The format used to represent the clusters is (Label, {objects})
After 1st
level clustering
CS1={(N,{c1,c2,c6,c8,c10,c11,c12}),(P,{c3,c7}),
(E,{c4,c5,c9})}
Therefore CS1= {CL1, CL2, CL3}
Step2
On each element of resultant cluster set CS1 again apply 2nd
level clustering on attribute destination is applied. As,
destination considered here is single i.e. D, the sub-clusters
for each element of CS1 will not be created. For every
element of CS1 only one sub-cluster will be created.
Therefore CS2 is
CS2= {SCL1, SCL2, SCL3}
Step3
Third level clustering is performed using priority attribute on
each element of CS2 cluster set created in 2nd level
clustering. As, there are 3 elements in CS2, 3 calls are done
GFTMS_Clustering (CS3, SCL1, priority)
CS3={(1,{c1,10}),(2,{c6,c12}),(3,{c8}),(4,{c2,c11})}
Therefore CS3= {TCL1, TCL2, TCL3, TCL4}
GFTMS_Clustering (CS3, SCL2, priority)
CS3=CS3 + (4, {c3, c7})
CS3= {TCL1, TCL2, TCL3, TCL4, TCL5}
GFTMS_Clustering (CS3, SCL3, priority)
CS3=CS3 + {(5, {c4, c5, c9})
CS3= {TCL1, TCL2, TCL3, TCL4, TCL5, TCL6}
Depending upon the timestamp of the arrival of the vehicles
given in Table 6.1 the Simultaneous and Dynamic cluster
creation is as follows.
Shared
Vehicle
Properti
es(SVP)
Type Destination Priority Vehicle
properties
shared by SVP
(Set of VPs to
agglomerate the
clusters)
P1 N D 1 or 2
or 3
{r1,r2,r3}
P2 N or
P
D 4 (r4,r5}
P3 E D 5 {r6}
7. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
_______________________________________________________________________________________
Volume: 03 Issue: 07 | Jul-2014, Available @ http://www.ijret.org 227
Table 6.4 Temporal Simultaneous and Dynamic Clustering
Tim
e
Sta
mp
Vehi
cle
1st
Level(t
ype)
2nd
Level(desti
nation)
3rd
Level(priority)
T1 c1
c2
{N,{c1,
c2}}
T2 c3
c4
c5
{N,{c1,
c2}}
{P,{c3}
}
{E,{c4+
c5}}
{D,{c1,c2}}
T3 c6
c7
{N,{c1,
c2+c6}}
{P,{c3+
c7}}
{E,{c4,
c5}}
{D,{c1,c2}}
{D,{c3}}
{D,{c4,c5}}
{1,{c1}} (TCL1)
{4,{c2}} (TCL4)
T4 c8
c9
c10
{N,{c1,
c2,c6+c
8,c10}}
{P,{c3,c
7}}
{E,{c4,
c5+c9}}
{D,{c1,c2+c
6}}
{D,{c3+c7}
}
{D,{c4,c5}}
{1,{c1}} (TCL1)
{4,{c2}} (TCL4)
{4,{c3}} (TCL5)
{5,{c4,c5}}
(TCL6)
T5 c11
c12
{N,{c1,
c2,c6,c8
,c10+c1
1,c12}}
{P,{c3,c
7}}
{E,{c4,
c5,c9}}
{D,{c1,c2,c
6+c8,c10}}
{D,{c3,c7}}
{D,{c4,c5+c
9}}
{1,{c1}} (TCL1)
{4,{c2}} (TCL4)
{2,{c6}} (TCL2)
{4,{c3+c7}}
(TCL5)
{5,{c4,c5}}
(TCL6)
T6 {N,{c1,
c2,c6,c8
,c10,c11
,c12}}
{P,{c3,c
7}}
{E,{c4,
c5,c9}}
{D,{c1,c2,c
6,c8,c10+c1
1,c12}}
{D,{c3,c7}}
{D,{c4,c5,c
9}}
{1,{c1,c10}}
(TCL1)
{4,{c2}} (TCL4)
{2,{c6}} (TCL2)
{3,{c8}} (TCL3)
{4,{c3,c7}}
(TCL5)
{5,{c4,c5,c9}}
(TCL6)
T7 {N,{c1,
c2,c6,c8
,c10,c11
,c12}}
{P,{c3,c
7}}
{E,{c4,
c5,c9}}
{D,{c1,c2,c
6,c8,c10,c11
,c12}}
{D,{c3,c7}}
{D,{c4,c5,c
9}}
{1,{c1,c10}}
(TCL1)
{4,{c2,c11}}
(TCL4)
{2,{c6,c12}}
(TCL2)
{3,{c8}} (TCL3)
{4,{c3,c7}}
(TCL5)
{5,{c4,c5,c9}}(T
CL6)
Depending upon the red light clearance duration, the partial
clusters will be created and they can be scheduled
immediately instead of waiting for complete clusters creation.
The complete clusters created due to this are shown in Figure
6.4.
Fig 6.1 GFTMS-Clustering
6.2 Observation
The different types of vehicles with different priorities may
arrive simultaneously. Therefore, the need arises to create the
different clusters simultaneously as well as to grow the
existing cluster. In snow ball technique clusters cannot be
created simultaneously. Hence GFTMS-clustering stands
useful.
In this system, decision should be on fly i.e. when clusters are
ready, we need not wait till end. We can trigger the
scheduling i.e. dispatching as a second step of [1] for the
existing clusters.
If there is a situation where more number of vehicles is
getting accumulated at node then the scheduling need not be
postponed, it can be applied for the existing clusters which are
ready to get dispatch. When the scheduling event is triggered,
the organized clusters or partial clusters should be scheduled
and parallelly cluster growing strategy also be operative.
Thus it provides real time multi-tasking traffic scheduling
strategy. Let the red light clearance duration is 4 secs, then the
TCL1,TCL4,TCL5,TCL6 are the partial clusters created. The
vehicles of these partial clusters can be scheduled. It the red
light clearance is 7 secs then the complete clusters scheduling
can be possible. Therefore, there should be consistency
between the red light clearance time and the clusters
completion time. If the red light time is short then partial
clusters creation is more. Simultaneous dynamic cluster
creation as shown in the timestamp demonstration is
simulated using multithreading.
Hence, GFTMS-Clustering stand useful when there is a road
network of dynamic nature where different types of vehicles
arrive at different time stamps and when scheduling or
dispatching decision should be done on fly.
As, the number of clusters created in each technique is not
equal to the number of available routes in the road network,
there is a necessity to agglomerate the clusters. Merge the
clusters using the SVPs specified in table 6.3. Therefore,
agglomerate TCL1, TCL2, TCL3 of GFTMS clustering to
MC1, TCL4, and TCL5 to MC2 and TCL6 to MC3.
MC1= {TCL1, TCL2, TCL3}
MC2= {TCL4, TCL5}
MC3= {TCL6}
Each agglomerated cluster can be scheduled to each available
route by taking the different traffic parameters into
8. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
_______________________________________________________________________________________
Volume: 03 Issue: 07 | Jul-2014, Available @ http://www.ijret.org 228
consideration such as density, capacity of the road, congestion
level etc. The scheduling should be done by dispatching the
highest priority cluster through less congested route.
7. SIMULATION RESULTS
Java, Jdk1.6. with the concepts of applets and animation using
multithreading is utilized for the development of simulation
program. This simulation program has the following phases.
1. Road network design phase, in which the road networks is
designed with a nodes or junctions. Figure 5.1 is the Road
network graph designed with this simulation program.
2. Generation of vehicles phase will generate the vehicles at
W and they travel towards junction A. The vehicles are
clustered at A and the scheduling is done at A as a second
step of [1]. For the cluster having public vehicles the
scheduling is not done and they have to reach the destination
with the pre-specified route here it is ACD. And in our
simulation the 3 types of clusters are concentrated. They are
1.Clusters with normal vehicles with priority 1, 2, and 3 with
destination D as MC1. 2. Clusters with all public vehicles
and normal vehicles with priority 4 with destination D as
MC2. 3. Clusters with emergency vehicles with destination D
and with priority 5 are merged as MC3. Here only clusters
with only destination D are considered and simulation results
are shown for the clusters with destination D.
For MC1 cluster the path with long distance is scheduled i.e.
AYBCD. Assumption: long distance, high congestion and
less speed.
For MC2 cluster, ACD is scheduled. Assumption: normal
distance, medium congestion and average speed.
For MC3 cluster, AXD is scheduled. Assumption: short
distance, less congestion and hence high speed.
The simulation program is run without using our approach
where the vehicles are selecting the normal frequently used
route. Hence, it is taken as ACD. All the vehicles immaterial
of type and priority with destination „D‟ will use this route.
The maximum time taken to reach the destination is
calculated for different speeds i.e. 20, 40, 60, 80,100 and
120km/hr. Here the max-time is the time taken by the last
vehicle to reach the destination. The number of vehicles
generated at W in this simulation program is 100.
The following graph shows the max-time taken vs. speed
graph without using proposed approach.
Fig 7.1 Vehicle by Vehicle dispatch without using GFTMS-
Clustering
Now again the simulation program is run by invoking our
proposed algorithm at junction A and to reduce the
complexity it has further grouped the clusters into 3 main
clusters i.e. MC1, MC2 and MC3 as mentioned earlier. The
simulation program is run for 100 vehicles and scheduled the
3 clusters according to the path AYBCD, ACD and AXD for
different speeds 20,40,60,80,100 and 120km/hr and the max-
time taken is calculated. Here max-time taken is the time
taken by the last vehicle of the last cluster which reached the
destination. The following is the max-time taken vs. speed
graph for the same.
Fig 7.2 Cluster of vehicles dispatch using GFTMS-Clustering
It is observed that when clusters use different paths, the time
taken for the maximum vehicles reaching the intended
destination is reduced.
The comparison of results with and without using proposed
approach is as follows.
Fig 7.3 Comparison of results without and with using
GFTMS-Clustering
It is observed that the max-time taken by the proposed
approach has reduced considerably.
Our simulation program clusters the vehicles at junction A
and schedules the clusters through different routes. Using
this, the highest priority clusters are sent through the route
with less congestion. The vehicles travelling through the less
congested routes can accelerate their speed and can reach the
0
500
1000
0 50 100 150
Max-Time(secs)
Speed(km/hr)
Vehicle By Vehicle dispatch:-Speed(km/hr) vs
max-Time(secs)
Vehicle By
Vehicle
dispatch:-
Speed(km/hr) vs
max-Time(secs)
0
200
400
0 50 100 150
Max-Time(secs)
Speed(km/hr)
Cluster of Vehicles dispatch:-
Speed(km/hr) Vs max- Time(secs)
Cluster of
Vehicles
dispatch:-
Speed(km/hr)
Vs max-
Time(secs)
(time taken…
670
382
257
180
122
56
215 175 131 96 53 12
Time(VehbyVeh
dispatch)
670 382 257 180 122 56
Time(Cluster
dispatch by
considering only
two clusters)
215 175 131 96 53 12
Time
Speed
Comparision of 2 types of dispatch of
vehicles(max time taken to reach same
destination)
Time(VehbyVeh dispatch)
Time(Cluster dispatch by
considering only two clusters)
9. IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
_______________________________________________________________________________________
Volume: 03 Issue: 07 | Jul-2014, Available @ http://www.ijret.org 229
destination soon compared to the vehicles travelling through
the normal or highly congested routes. While demonstrating
this the time taken by different clusters following different
routes to reach a destination is calculated at different speeds
i.e. 20,40,60,80,100 and 120km/hr.
The following graph shows the time taken vs. speed for
different clusters. It can be observed that C3 cluster of
vehicles takes less time to reach compared to C2 and C1.
Fig 7.4 Results showing time taken versus speed for different
clusters
8. CONCLUSIONS
In this paper we have proposed a novel solution for clustering
the vehicles at junctions. In this the clustering is done at a
junction. The proposed algorithm has reduced the maximum
time taken to reach the destination. It is observed that the
performance has been improved in terms of maximum time
taken at different speed when compared without using our
approach.
At junction, different criteria such as distance, congestion in
that route can be taken into consideration and after clustering,
different clusters except public vehicles can be scheduled to
different routes depending on type, destination and priority.
Clusters having public vehicles are not scheduled, as public
vehicles have to follow the predefined route and we cannot
alter the predefined routes.
In this paper as a first step of [1] clustering procedure is
mentioned. The different issues should be considered for
scheduling the vehicles which is reserved for the future work.
In this congestion, distance through different routes are
assumed while scheduling the vehicles. The solution in this
paper is an example for alleviating the traffic jams and for
avoiding the traffic jams by dissipating vehicles after
clustering them
REFERENCES
[1] AvulaAnitha, Rajeev Wankar and C. RaghavendraRao,
“A Grid Fabrication of Traffic Maintenance System”,
International Conference on Advances in Computer
Science, Engineering and Applications, Advances in
Intelligent and Soft Computing, SpringerLink, Volume
167/2012, 999-1008, 978-3-642-30111-7_96, 2012.
[2] Feilong Tang, MinyiGuo, Minglu li and Cho-Li Wang,
“Implementation of an Intelligent Urban Traffic
Management System Based on a City Grid
Infrastructure”, Journal of Information Science and
Engineering 24, 1821-1836, 2008.
[3] Subhhamita Mukherjee, Indraji Pan and
KashiNathDey, “Traffic Organization by utilization of
resources through Grid Computing Concept,”, World
Congress on Nature & Biologically Inspired
Computing (NaBIC 2009) [IEEE], 2009.
[4] AbderrahmaneLakas, MoumenaCheqfah, “Detectionn
and Dissipation of Road Traffic Congestion Using
Vehicular Communication”, Microwave Symposium,
Mediterranrean, IEEE Communications, 978-1-4244-
4665-0/09, 2009.
[5] HisakKuriyama, Yoshihiro Murata, Naoki Shibata
Keiichi Yaumoto etzal, “Congestion Alleviationn
Scheduling Technique for Car Drivers Based on
Prediction of Future Congestion on Roads and Spots”,
Intelligent Transportation Systems, IEEE, ISBN-978-
1-4244-1396-6, 2007.
[6] Rambabu Yerajana, A.K. Sarje, “An Adaptive
Multipath Souurce Routing Protocol for Congestion
Control and Load Balancing in MANET”, International
Conference on Advances in Computing,
Communication and Control (ICAC3), ACM, ISBN
978-1-160558-351-8, 2009, pp.456-459.
[7] Yonghua Zhou, “Web Services-based Grid Computing
for Traffic Flow Predictive Control”, Global Congress
on Intelligent Systems, IEEE, 978-7695-3571-5, 2009.
[8] Kunszt P.Z. and Guy L.P., “The open grid services
architecture and data grids. In Grid Computing
Making the Global Infrastructure a Reality”, Berman F,
fox GC, Hey AJG (eds). Wiley series in
Communications, Networking and Distributed
Systems, Wiley:Chichester, 2003, pp 9-50.
[9] Cameron D.G., Carvajal-Schiaffino R, Millar A.P.,
Nicholsan C, Stockinger K., and Zini F., “Evaluating
scheduling and replica optimization strategies”,
Proceedings of the Fourth International Workshops on
Grid Computing (GRID‟03), 2003, pp-65-77.
[10] Zhenxia Zhang, AzzedineBoukerche and Richard W.
Pazzi, “A Novel Multi-hop Clustering Scheme for
Vehicular Ad-Hoc Networks”, MobiWac., ACM, 978-
1-4503-0901-1/11/10,2011.
[11] P.A.Vijaya, M. Narasimha Murthy, D.K. Subramanian,
“ Leaders-SubLeaders An Efficient Hierarchical
Clustering Algorithm for Large Data Sets, Pattern
Recognition Letters, Elsevier, vol 25,pp 505-513,
2004.
[12] Osama Abu Abbas, “Comparisons between Data
Clustering Algorithms” International Arab Journal of
Information Technology, Volume 5, No. 3, July 2008.
[13] Marina Meila, David Heckerman, “An Experimental
Comparison of several clustering and initialization
methods”, Technical Report, MSR-TR-98-06,
February, 1998.
01000
0 50 100 150
Time(secs)
Speed(km/hr)
Cluster of vehicles travelling through
different routes to reach same
destination
Time(C1)
Time(C2)
Time(C3)