论文部分内容阅读
Wireless sensor networks are suffering from serious frequency interference.In this paper,we propose a channel assignment algorithm based on graph theory in wireless sensor networks.We first model the conflict infection graph for channel assignment with the goal of global optimization minimizing the total interferences in wireless sensor networks.The channel assignment problem is equivalent to the generalized graph-coloring problem which is a NP-complete problem.We further present a meta-heuristic Wireless Sensor Network Parallel Tabu Search(WSN-PTS) algorithm,which can optimize global networks with small numbers of iterations.The results from a simulation experiment reveal that the novel algorithm can effectively solve the channel assignment problem.
Wireless sensor networks are suffering from serious frequency interference. In this paper, we propose a channel assignment algorithm based on graph theory in wireless sensor networks. We first model the conflict infection graph for channel assignment with the goal of global optimization minimizing the total interferences in wireless sensor networks. The channel assignment problem is equivalent to the generalized graph-coloring problem which is a NP-complete problem. We also present a meta-heuristic Wireless Sensor Network Parallel Tabu Search (WSN-PTS) algorithm, which can optimize global networks with small numbers of iterations.The results from a simulation experiment reveal that the novel algorithm can effectively solve the channel assignment problem.