23,99 €
inkl. MwSt.
Versandfertig in 6-10 Tagen
12 °P sammeln
Andere Kunden interessierten sich auch für
![Route Optimization in Mobile IP]( "Route Optimization in Mobile IP")
Route Optimization in Mobile IP30,99 €![Loop Problem Solving in Route Redist.of Routg.Proto.EGRIP,OSPF UsgGNS3]( "Loop Problem Solving in Route Redist.of Routg.Proto.EGRIP,OSPF UsgGNS3")
Loop Problem Solving in Route Redist.of Routg.Proto.EGRIP,OSPF UsgGNS323,99 €![Network Design using Genetic Algorithm]( "Network Design using Genetic Algorithm")
Network Design using Genetic Algorithm45,99 €![Route optimization security in mobile IPv6 networks]( "Route optimization security in mobile IPv6 networks")
Route optimization security in mobile IPv6 networks32,99 €![Enhanced Intrusion Detection System Using Machine Learning Techniques]( "Enhanced Intrusion Detection System Using Machine Learning Techniques")
Enhanced Intrusion Detection System Using Machine Learning Techniques42,99 €![Feature Selection using Genetic Algorithm to improve SVM Classifier]( "Feature Selection using Genetic Algorithm to improve SVM Classifier")
Feature Selection using Genetic Algorithm to improve SVM Classifier36,99 €![Node Mobility Based Route Selection in AODV Routing Protocol]( "Node Mobility Based Route Selection in AODV Routing Protocol")
Node Mobility Based Route Selection in AODV Routing Protocol26,99 €
Optimized network saves the cost of the network as well as it is faster in the terms of data delivery. In wired network, optimization is directly related to the cost and speed of the network while in wireless network it reflects to reliability and performance. An Optimized network can be represented in the form of constrained spanning tree where the term constrained is represented by different parameters like degree, cost, speed, reliability and fault tolerance etc. Degree Constraint Minimum Spanning Tree is special class of constrained spanning tree where degree of the node represents the connectivity of the node with other nodes. This DCMST problem belongs to the category of NP-hard problem and so far no optimal solution has been developed to find it. This project work has developed an approach using Genetic Algorithm. Genetic Algorithm is a class of evolutionary algorithm which works on the principle of "Survival of the fittest". Parallel solutions are developed in genetic algorithm which is further selected and genetic operators are applied followed by fitness function. Solutions are improved from generation to generation and reaches to the stage of optimal solution.