A Heuristic Track Strategy for Wireless Sensor Networks

Qin Ning-ning; Zhang Lin; Shan Xiu-ming; Xu Bao-guo

doi:10.3724/SP.J.1146.2006.01324

Volume 30 Issue 3

Dec. 2010

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2008 > 30(3): 707-711

Qin Ning-ning, Zhang Lin, Shan Xiu-ming, Xu Bao-guo. A Heuristic Track Strategy for Wireless Sensor Networks[J]. Journal of Electronics & Information Technology, 2008, 30(3): 707-711. doi: 10.3724/SP.J.1146.2006.01324

Citation:

Qin Ning-ning, Zhang Lin, Shan Xiu-ming, Xu Bao-guo. A Heuristic Track Strategy for Wireless Sensor Networks[J]. Journal of Electronics & Information Technology, 2008, 30(3): 707-711. doi: 10.3724/SP.J.1146.2006.01324

Citation:

PDF( 296 KB)

A Heuristic Track Strategy for Wireless Sensor Networks

doi: 10.3724/SP.J.1146.2006.01324 cstr: 32379.14.SP.J.1146.2006.01324

Received Date: 2006-09-06
Rev Recd Date: 2007-04-06
Publish Date: 2008-03-19

Abstract

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.

FullText(HTML)

References(1)

References

Meguerdichian S, Koushanfar F, Potkonjak M, andSrivastava M B. Coverage problems in wireless ad-hoc sensornetworks [C]. Proc. IEEE Inforcom 2001, Anchorage, USA,Apr. 2001, vol 3: 1380-1387.[2]Kumar S, Lai T H, and Arora A. Barrier coverage withwireless sensors [C].[J]. MobiCom0.2005,Cologne:-[3]Meguerdichian S, Koushanfar F, Potkonjak M, andSrivastava M B. Worst and best-case coverage in sensornet-works [J].IEEE Trans. on Mobile Computing.2005, 4(1):84-92[4]Veltri G, Huang Q, Qu G, and Potkonjak M. Minimal andmaximal exposure path algorithms for wireless embeddedsensor networks [C]. Proc. ACM Int1 SENSYS, L.A., Calif.,USA, Nov. 2003: 40-50.[5]Corts J, Martnez S, Karatas T, and Bull F. Coverage controlfor mobile sensing networks [C][J].IEEE Trans. on Roboticsand Automation.2004, 20(2):243-255[6]Li X Y, Wan P J , and Frieder O. Coverage in wireless ad hocsensor networks [C]. IEEE Trans. on Computers, 2003, 52(6):115-121.[7]Meguerdichian S, Koushanfar F, Qu G, and Potkonjak M.Exposure in wireless ad hoc sensor networks [C]. Proc.ACMInternational Conference on Mobile Computing andNetworking (MobiCom), Rome, Italy, Jul. 2001: 139-150.[8]Adlakha S and Srivastava M. Critical density thresholds forcoverage in wireless sensor networks [C][J].Proc. IEEEWCNC2003, New Orleans, La., USA, Mar.2003, vol.3:1615-1620[9]Zhang H and Hou J C. Maintaining sensing coverage andconnectivity in large sensor networks [J]. Wireless Ad Hocand Sensor Networks, 2005, 1(1/2): 89-124.[10]Tian D and Georganas N D. Connectivity maintenanceandcoverage preservation in wireless sensor networks [J]. Ad Hocnetwork Journal, 2005, 3(5): 744-761.[11]Qin N N and Xu B G. An attacking track in wireless sensornetwork[C]. ChianCOM 2006, Beijing, China, 2006: 1-5.

Relative Articles

Supplements(0)

Cited By

Proportional views