Mostrar el registro sencillo del ítem

Otimização da largura de banda em redes BPL usando as técnicas nucleolus e max-min fairness;
Optimización del ancho de banda en redes BPL usando las técnicas nucleolus y max-min fairness

dc.contributor.authorVesga Ferreira, Juan Carlos
dc.contributor.authorGranados Acuna, Gerardo
dc.contributor.authorVesga Barrera, José Antonio
dc.date.accessioned2019-11-07T15:34:27Z
dc.date.available2019-11-07T15:34:27Z
dc.date.created2019-06-28
dc.identifier.issn1692-3324
dc.identifier.urihttp://hdl.handle.net/11407/5525
dc.description.abstractBPL power lines (Broadband Power Line) run under the HomePlug AV (HPAV) standard which uses the technologies CSMA/CA and TDMA as a mechanism of access to the medium, in which CSMA/CA is intended for the transmission of data packets and TDMA is used for the transmission of voice and video packets, in order to offer adequate levels of QoS. However, notwithstanding that the HPAV can reach high transfer rates, it lacks the adequate bandwidth (AB) allocation mechanism, which in turn interferes significantly with the network’s performance as the number of users rise due to the fact that only one node can transmit at once. In line with the raised above and taking into account that a BPL network can be represented as a cooperative game with transferable utilities (UT), the present paper proposes the use of two equitable bandwidth allocation techniques: nucleolus and max-min fairness, which are part of the cooperative game theory. In the comparison of the nucleolus y max-min fairness techniques as an strategy for resource allocation it was found that the latter produces the best results. Furthermore, it was made evident that game theory can be regarded as a groundbreaking strategy for the optimization of resources in a LAN network on BPL.eng
dc.description.abstractAs redes BPL (Broadband Power Line) operam sob o padrão HomePlug AV (HPAV), o qual utiliza as tecnologias CSMA/CA e TDMA como mecanismo de acesso ao meio, em que CSMA/CA está destinado à transmissão de pacotes de dados e TDMA à transmissão de pacotes de voz e vídeo, com o objetivo de oferecer adequados níveis de QoS. Contudo, embora o HPAV possa atingir altas taxas de transmissão, não conta com um adequado mecanismo de designação de largura de banda (LB), o que afeta consideravelmente o rendimento da rede à medida que aumenta o número de usuários devido a que unicamente um nó pode transmitir ao mesmo tempo. De acordo com o proposto e considerando que uma rede BPL pode ser representada como um jogo cooperativo de utilidade transferível (UT), neste artigo, propõe-se o uso de duas técnicas para a assignação equitativa de largura de banda: nucleolus e max-min fairness, as quais fazem parte da teoria de jogos cooperativos. Ao realizar o comparativo das técnicas nucleolus e max-min fairness como estratégia para a destinação de recursos, verificou-se que esta última gera os melhores resultados. Além disso, pôde-se evidenciar que a teoria de jogos pode ser considerada como uma nova estratégia para otimizar recursos em uma rede LAN sobre BPL.por
dc.description.abstractLas redes BPL (Broadband Power Line) operan bajo el estándar HomePlug AV (HPAV) el cual utiliza las tecnologías CSMA/CA y TDMA como mecanismo de acceso al medio, donde CSMA/CA está destinado para la transmisión de paquetes de datos y TDMA se utiliza para la transmisión de paquetes de voz y video, con el fin de ofrecer adecuados niveles de QoS. Sin embargo, pese a que el HPAV puede alcanzar altas tasas de transmisión, no cuenta con un adecuado mecanismo de asignación de ancho de banda (AB), lo cual afecta considerablemente el rendimiento de la red a medida que aumenta el número de usuarios debido a que únicamente un nodo puede transmitir a la vez. De acuerdo a lo planteado y, considerando que una red BPL puede ser representada como un juego cooperativo de utilidad transferible (UT), en el presente artículo se propone el uso de dos técnicas para la asignación equitativa de ancho de banda: nucleolus y max-min fairness, las cuales forman parte de la teoría de juegos cooperativos. Al realizar el comparativo de las técnicas nucleolus y max-min fairness como estrategia para la asignación de recursos, se encontró que esta última genera los mejores resultados. Además, se pudo evidenciar que la teoría de juegos puede ser considerada como una novedosa estrategia para la optimización de recursos en una red LAN sobre BPL.spa
dc.format.extentp. 165-180spa
dc.format.mediumElectrónicospa
dc.format.mimetypeapplication/pdf
dc.language.isospa
dc.publisherUniversidad de Medellínspa
dc.relation.urihttps://revistas.udem.edu.co/index.php/ingenierias/article/view/2188
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/*
dc.sourceRevista Ingenierías Universidad de Medellín; Vol. 18 Núm. 34 (2019): Enero-Junio; 165-180spa
dc.subjectHomePlugeng
dc.subjectNucleoluseng
dc.subjectMax-min fairnesseng
dc.subjectGame theoryeng
dc.subjectBPL Power Lineseng
dc.subjectHomePlugpor
dc.subjectNucleoluspor
dc.subjectMax-min fairnesspor
dc.subjectTeoria de jogospor
dc.subjectRedes BPLpor
dc.subjectHomePlugspa
dc.subjectNucleolusspa
dc.subjectMax-min fairnessspa
dc.subjectTeoría de juegosspa
dc.subjectRedes BPLspa
dc.titleBandwidth optimization in BPL power lines using nucleolus and max-min fairness techniqueseng
dc.titleOtimização da largura de banda em redes BPL usando as técnicas nucleolus e max-min fairnesspor
dc.titleOptimización del ancho de banda en redes BPL usando las técnicas nucleolus y max-min fairnessspa
dc.typeArticleeng
dc.rights.accessrightsinfo:eu-repo/semantics/openAccess
dc.identifier.doihttps://doi.org/10.22395/rium.v18n34a10
dc.relation.citationvolume18
dc.relation.citationissue34
dc.relation.citationstartpage165
dc.relation.citationendpage180
dc.audienceComunidad Universidad de Medellínspa
dc.publisher.facultyFacultad de Ingenieríasspa
dc.coverageLat: 06 15 00 N  degrees minutes  Lat: 6.2500  decimal degreesLong: 075 36 00 W  degrees minutes  Long: -75.6000  decimal degrees
dc.publisher.placeMedellínspa
dc.creator.affiliationVesga Ferreira, Juan Carlos; Universidad Nacional Abierta y a Distancia UNADspa
dc.creator.affiliationGranados Acuna, Gerardo; Universidad Nacional Abierta y a Distancia, Colombiaspa
dc.creator.affiliationVesga Barrera, José Antonio; Corporación Universitaria de Ciencia y Desarrollo (Colombia)spa
dc.relation.references[1] N. Anatory y J. Theethayi, Broadband Power-Line Communication Systems: Theory and Applications, Londres: WIT Press, 2010.spa
dc.relation.references[2] H. Latchman et al., Homeplug AV and IEEE 1901: A Handbook for PLC Designers and Users, Nueva Jersey: Wiley-IEEE Press, 2013.spa
dc.relation.references[3] S. Goldfisher y S. Tanabe, “IEEE 1901 access system: An overview of its uniqueness and motivation,” IEEE Commun. Mag., vol. 48, n.° 10, pp. 150–157, Oct. 2010.spa
dc.relation.references[4] S. Galli et al., “For the Grid and Through the Grid: The Role of Power Line Communications in the Smart Grid,” Proc. IEEE, vol. 99, n.° 6, pp. 998–1027, 2011.spa
dc.relation.references[5] E. V. Rogozhnikov et al., “Full-duplex power line communication system. Analog cancellation, system concept and implementation problems,” presentado en 2018 Moscow Workshop on Electronic and Networking Technologies (MWENT), pp. 1–5, 2018.spa
dc.relation.references[6] A. Mengi et al., “The ITU-T G.9960 broadband PLC communication concept for smartgrid applications,” presentado en 2017 IEEE International Conference on Smart Grid Communications (SmartGridComm), pp. 492–496, Dresden, 2017.spa
dc.relation.references7] J. Pérez et al., Teoría de juegos, Madrid: Pearson-Prentice Hall, 2003.spa
dc.relation.references[8] M. Seijo et al., “Planning and Performance Challenges in Power Line Communications Networks for Smart Grids,” Int. J. Distrib. Sens. Networks, vol. 12, n.° 3, pp. 1-17, 2016.spa
dc.relation.references[9] B. Peleg y P. Sudhölter, Introduction to the theory of cooperative games, Berlín: Springer, 2007.spa
dc.relation.references[10] A. Loni y F.A. Parand, “A survey of game theory approach in smart grid with emphasis on cooperative games,” presentado en 2017 IEEE International Conference on Smart Grid and Smart Cities (ICSGSC), 2017, pp. 237–242, Dresden, 2017.spa
dc.relation.references[11] M. Hajir et al., “Solidarity-based cooperative games for resource allocation with macro-users protection in HetNets,” presentado en 2016 IEEE International Conference on Communications (ICC), pp. 1–7, Kuala Lumpur, 2016.spa
dc.relation.references[12] P. Berens, “CircStat: a MATLAB toolbox for circular statistics,” J. Stat. Softw., vol.31, n.° 10, pp. 1–21, 2009.spa
dc.relation.references[13] X. Huang y B. Bensaou, “On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation,” presentado en Proc. 2nd ACM Int. Symp. Mob. ad hoc Netw. Comput., Long Beach, 2001.spa
dc.relation.references[14] Y. Sheng y M. H. MacGregor, “Dynamic Resource Allocation Based on Weighted Max-Min Fairness,” presentado en Communication Networks and Services Research Conference (CNSR), 2011 Ninth Annual, pp. 247–256, Ottawa, 2011.spa
dc.relation.references[15] E. L. Hahne, “Round-robin scheduling for max-min fairness in data networks,” IEEE J. Sel. Areas Commun., vol. 9, n.° 7, pp. 1024–1039, 1991.spa
dc.relation.references[16] J. Chen et al., “A local fairness algorithm for the MetaRing, and its performance study,” presentado en [Conference Record] GLOBECOM ’92 - Communications for Global Users: IEEE, pp. 1635–1641, Orlando, 1992.spa
dc.relation.references[17] J. S.-C. Chen, et al., “A local fairness algorithm for gigabit LAN’s/MAN’s with spatial reuse,” IEEE J. Sel. Areas Commun., vol. 11, n.° 8, pp. 1183–1192, 1993.spa
dc.relation.references[18] D. Schmeidler, “The Nucleolus of a Characteristic Function Game,” SIAM J. Appl. Math., vol. 17, n.° 6, pp. 1163–1170, 1969.spa
dc.relation.references[19] I. Curiel, Cooperative game theory and applications: cooperative games arising from combinatorial optimization problem, Dordrecht: Kluwer Academic Publishers, 1997.spa
dc.relation.references[20] D. Nace et al., “A tutorial on max-min fairness and its applications to routing, load-balancing and network design,” presentado en 4th IEEE Int. Conf. Comput. Sci. Res. Innov. Vis. Futur., p. 30, Santa Bárbara, 2006.spa
dc.relation.references[21] F. Canete, “User guide for PLC channel generator v.2,” Septiembre 2011. [En Línea]. Disponible: http://www.plc.uma.es/channel_generator/User_guide_v2.pdfspa
dc.relation.references[22] P. J. Pinero-Escuer et al., “ Homeplug-AV C SMA/CA C ross-Layer E xtension for Q oS Improvement of Multimedia Services,” IEEE Commun. Lett., vol. 18, n.° 4, pp. 704–707, 2014.spa
dc.relation.references[23] R. Walpole et al., Probabilidad y estadística para ingenieros. Ciudad de México: Pearson-Prentice Hall, 2007.spa
dc.rights.creativecommonsAttribution-NonCommercial-ShareAlike 4.0 International*
dc.identifier.eissn2248-4094
dc.type.coarhttp://purl.org/coar/resource_type/c_6501
dc.type.versioninfo:eu-repo/semantics/publishedVersion
dc.type.localArtículo científicospa
dc.type.driverinfo:eu-repo/semantics/article
dc.identifier.reponamereponame:Repositorio Institucional Universidad de Medellínspa
dc.identifier.repourlrepourl:https://repository.udem.edu.co/
dc.identifier.instnameinstname:Universidad de Medellínspa
dc.relation.ispartofjournalRevista Ingenierías Universidad de Medellínspa


Ficheros en el ítem

FicherosTamañoFormatoVer

No hay ficheros asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-ShareAlike 4.0 International
Excepto si se señala otra cosa, la licencia del ítem se describe como Attribution-NonCommercial-ShareAlike 4.0 International