Scalable and efficient graph colouring in 3 dimensions using emergence engineering principles

This paper describes ways in which emergence engineering principles can be applied to the development of distributed applications. A distributed solution to the graph-colouring problem is used as a vehicle to illustrate some novel techniques. Each node acts autonomously to colour itself based only on its local view of its neighbourhood, and following a simple set of carefully tuned rules. Randomness breaks symmetry and thus enhances stability. The algorithm has been developed to enable self-configuration in wireless sensor networks, and to reflect real-world configurations the algorithm operates with 3 dimensional topologies (reflecting the propagation of radio waves and the placement of sensors in buildings, bridge structures etc.). The algorithm’s performance is evaluated and results presented. It is shown to be simultaneously highly stable and scalable whilst achieving low convergence times. The use of eavesdropping gives rise to low interaction complexity and high efficiency in terms of the communication overheads

Aplicación de técnicas de negociación a la coloración de grafos y su aplicación en redes cognitivas

El objetivo del siguiente TFG consiste en implementar en Python una serie de algoritmos ya existentes relacionados con la coloración de grafos, una de las técnicas más utilizadas para mejorar el aprovechamiento del espectro electromagnético en redes inalámbricas, para posteriormente poderlos contrastar con otros que incluyen métodos de negociación automática. Éstos, junto a la incorporación de nuevas capas de coloreado y nuevos pesos, diferentes a los tradicionales entre vértices y aristas, son necesarios para conducir el carácter simplista de los algoritmos ya existentes hacia el caso real de las redes presentes actualmenteThe purpose of the following work is to implement a number of existing algorithms in Python related to graph coloring, one of the most used techniques to improve the electromagnetic spectrum exploitation in wireless networks, so later they can be contrasted with other algorithms based on auto-negotiation techniques. These techniques, together with the addition of new coloring layers and weights, different from the traditional ones between vertex and edges, are necessary to drive the existing algorithms to the real case of nowadays networks.Grado en Ingeniería Telemátic