A comparative study of distributed frequency assignment algorithms for wireless sensor networks

Wireless sensor networks are composed of energy constrained nodes embedding limited transmission, processing and sensing capabilities. The main research efforts in this area sought to prolong the network lifetime by reducing energy consumption of network operations. Data gathering mechanisms such as clustering have been shown to achieve significant energy savings. However, such benefits can be obtained only if neighboring clusters operate on different frequencies (channels). As the salient characteristics of wireless sensor networks favor a distributed approach, we analyze the performance of several distributed frequency assignment algorithms with a focus on energy consumption. In this context, we find that a heuristic may achieve better results than backtracking-based algorithms.