Self-organizing approach to graph vertex colouring in the applications of ad hoc networks

Authors:
Toomas Kirt;Leo Vohandu
Affiliations:
Institute of Informatics, Tallinn University of Technology, Tallinn, Estonia;Institute of Informatics, Tallinn University of Technology, Tallinn, Estonia
Venue:
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Year:
2006

Citing 3
Cited 0

Flocks, herds and schools: A distributed behavioral model

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Optimization with extremal dynamics

Complexity - Complex Adaptive systems: Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a self-organizing method for the graph colouring problem. The proposed self-organizing method for the graph colouring extends the chemical casting model and makes it possible to find the number of colours needed to colour the graph. The self-organizing approach is needed to solve scheduling tasks in the applications of ad hoc networks. Nodes in ad hoc networks are usually not managed centrally and can use only local information. An ad hoc network can be considered as a self-organizing system where structure is created by local interactions between the system components without any external force responsible for it. The proposed method for the graph colouring takes into account the restrictions caused by the organization of ad hoc networks and shows good performance.