Performance comparison of distributed frequency assignment algorithms for wireless sensor networks

Minimizing energy consumption of network operations remain a major concern in wireless sensor networks due to the limited energy capacity embedded in sensor nodes. Clustering has been proposed as a potential solution to address this issue, some nodes being responsible for the data gathering of nodes located in their vicinity. However, in order to avoid inter-cluster interference, neighboring clusters must acquire different frequencies. As the specific constraints of wireless sensor networks favor a distributed approach, we analyze modified versions of distributed backtracking, distributed weak commitment and randomized algorithms with a focus on energy consumption. In this context. we find that a heuristic may achieve better results than backtracking-based algorithms.