A distributed strict strong coloring algorithm for broadcast applications in ad hoc networks

Abstract

A challenging research area in computer networks is ad hoc networks. These are defined to be spontaneous and totally autonomous networks. Many communication protocols (like routing, resources sharing, ...) use broadcasting mechanism to diffuse or gather information. A strict strong coloring of a graph G is a vertex proper coloring of G such that each vertex of G is adjacent to at least one non empty color class. In this paper, we give a novel broadcasting approach based on a distributed algorithm for strict strong coloring.