Journal of South China University of Technology (Natural Science Edition) ›› 2016, Vol. 44 ›› Issue (5): 143-150.doi: 10.3969/j.issn.1000-565X.2016.05.022

• Computer Science & Technology • Previous Articles    

Smallest Enclosing Rectangle Planning for Spatial Target Distribution on the Basis of Boolean Search

WEI Xing HAN Jiang-hong   

  1. School of Computer and Information∥Engineering Research Center of Safety Critical Industrial Measurement and Control Technology of the Ministry of Education,Hefei University of Technology,Hefei 230009,Anhui,China
  • Received:2015-01-14 Revised:2015-09-08 Online:2016-05-25 Published:2016-04-12
  • Contact: 卫星(1980-)，男，副教授，主要从事物联网工程、离散事件动态系统研究． E-mail:weixing72510@163.com
  • About author:卫星(1980-)，男，副教授，主要从事物联网工程、离散事件动态系统研究．
  • Supported by:
    Supported by the National Natural Science Foundation of China(61370088)，the International S & T Cooperation Program of China(2014DFB10060)and the Natural Science Foundation of Anhui Province(1408085MKL80)

PDF

232

Abstract: In order to save the searching cost of passive target location in two-dimension planes,a smallest enclo- sing rectangle problem for randomly-deployed WSN (Wireless Sensor Network) nodes is investigated.Firstly,a smallest enclosing rectangle planning method for WSN nodes,which makes anchors continuously approach target nodes with the depth-first searching strategy,is proposed on the basis of Boolean search.Then,a coordinate max- min algorithm is put forward to compute the minimum enclosing rectangle according to aforementioned anchors’lo- cation.The results of both simulation and algorithm analysis show that the proposed strategy possesses less computa- tion complexity than such searching strategies as traversal methods for smallest enclosing rectangle and circle,and helps obtain the enclosing rectangle with minimum area more precisely.

Key words: wireless localization, smallest enclosing rectangle, cover circle, convex planning

CLC Number: