Collision-free Routing in Sink-Centric Sensor Networks with Coarse-Grain Coordinates

When the environment does not allow to access directly to disseminated data, a sensor network could be one of the most appropriate solution to retrieve the map of interesting areas. Based on existing approaches, we start our study from the standard random deployment of a sensor network and then we consider a coarse-grain localization algorithm which associates sensors with coordinates related to a central node, called sink. Once each sensor is related to an estimated position, it starts to send data to the sink according to a provided scheduling of communications which takes care of energy consumption, collisions and time. We propose a scheduling of communications based on distributed and fast coloring algorithms which require O(1) computational time. As the localization is referred to coarse-grain coordinates, it happens that more than one sensor is associated with the same coordinates, hence leader-election mechanism is considered.