摘要
Detection coverage control is one of the most important topics in the intrusion detection problem of wireless sensor networks （WSN）. However, its converse, i.e., to design an object locomotion trajectory in WSN, has not received enough attention. This article proposes a heuristic algorithm, namely, the security ＆ speed （SS） algorithm, to depict such a trajectory that takes into consideration both security and speed. The merit of the SS algorithm is its topology independency. When compared with traditional algorithms, the SS algorithm approaches the optimal trajectory better, and enjoys considerably lower computational load, and a better and adjustable tradeoff between trajectory security and speed.
Detection coverage control is one of the most important topics in the intrusion detection problem of wireless sensor networks （WSN）. However, its converse, i.e., to design an object locomotion trajectory in WSN, has not received enough attention. This article proposes a heuristic algorithm, namely, the security ＆ speed （SS） algorithm, to depict such a trajectory that takes into consideration both security and speed. The merit of the SS algorithm is its topology independency. When compared with traditional algorithms, the SS algorithm approaches the optimal trajectory better, and enjoys considerably lower computational load, and a better and adjustable tradeoff between trajectory security and speed.
基金
the National Natural Science Foundation of China （60672107）
the Hi-tech Research and Development Program of China （10Z2,10A3）
the National Basic Research Program of China （2007CB307105）.
