|
|
|
| A Heuristic Track Strategy for Wireless Sensor Networks |
| Qin Ning-ning①; Zhang Lin②; Shan Xiu-ming②; Xu Bao-guo① |
| ①The School of Communication and Control Engineering, Southern Yangtze University, Wuxi 214122, China; ②The Department of Electronic Engineering, Tsinghua University, Beijing 100084, China |
|
|
|
|
Abstract The coverage problem has been expanded with presenting the reverse problem which has not yet been thoroughly studied, i.e., given an intrusion detecting WSN, how to design an object locomotion track with high security and fast speed. Based on this goal, a heuristic algorithm, namely, the SS (shortened Security and Speed) algorithm is introduced to build the corresponding tracks with adjusting the secure and speedy parameters under the varying application demands without the support of the global topology information. And the corresponding Integrated Gain (IG) will be posed to measure the SS ability. Simulations show that, the SS algorithm is not sensitive to the density and distribution of sensors, and solves the defects of working blind spot and track flooding. Compared with the traditional Voronoi algorithm, the proposed SS algorithm matches the results of the optimal more closely and has the smaller complexity than the optimal approach.
|
|
Received: 06 September 2006
|
|
|
|
|
|
|
|
|
2008, Vol. 30 
