Due to significant advancements in embedded systems, sensor devices, and wireless communication technology, sensor networks have been attracting widespread attention in areas such as target tracking, monitoring, and surveillance. Technological advancements made it possible to deploy a large number of inexpensive but technically advanced sensors to cover wide areas. However, when a tracking system has to track a large number of targets, the computation and communication loads arise. In this paper, we compare two task assignment methods that might be used in the multiple target tracking problem. The first one is the brute force method and the second one is based on linear matrix inequalities. We provide performance and load testing results for these methods.