Despliegue de MDMS para ami basado en árboles de expansión usando Minimun Steiner Tree
This purpose of this article is to perform an optimum deployment of MDMS for AMI, based in the theory of expansion trees through Minimum Steiner Tree (SMT), for a geographic area of network users, randomly distributed. For this purpose, it is firstly needed to group together each one of the users (M...
| Autor Principal: | Guanoliquín Alvaro, Luis Daniel |
|---|---|
| Formato: | bachelorThesis |
| Idioma: | spa |
| Publicado: |
Universidad Politécnica Salesiana. Carrera de Ingeniería Eléctrica. Sede Quito
2017
|
| Materias: | |
| Acceso en línea: |
Guanoliquín Alvaro, L. D. (2017). Despliegue de MDMS para ami basado en árboles de expansión usando Minimun Steiner Tree. Universidad Politécnica Salesiana. Carrera de Ingeniería Eléctrica. Sede Quito |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: |
This purpose of this article is to perform an optimum deployment of MDMS for AMI, based in the theory of expansion trees through Minimum Steiner Tree (SMT), for a geographic area of network users, randomly distributed. For this purpose, it is firstly needed to group together each one of the users (Meters) in a uniform way in clusters, distributed in length and width of the geographical area. Later, an algorithm of cluster named K-means is used, which is in charge to group the network elements (Meters) in K central groups, the distance of the elements to the nearest centroid determines the cluster that is formed (MDMS). A solution to the MDMS optimum deployment problem for Communication networks in AMI is proposed, based on graph theory, which can make a coverage of all the MDMS inside AMI, through a topology of expansion trees. For this purpose, the Minimum Steiner Tree (SMT) has been used, which determines the topology of optimum network for the link´s minimization distance between MDMS, given as the MDMS cost-Development Function. |
|---|