Position Estimation Error in Edge Detection for Wireless Sensor Networks using Local Convex View

Intuitively, identification of nodes close to the network edge is key to the successful setup, and continued operation, of many sensor network protocols and applications. In a previous study [1] we introduced local convex view (lcv) as a means to identify nodes close to the network edge by computing the convex hull of nodes within range. In this paper we evaluate lcv in the presence of position estimation error. Extensive simulations with networks of varying size and topology reveal the surprising observation that lev seems unaffected by estimation error. Motivated by this observation we enumerate a complete set of base node configurations seen by lcv. An analysis reveals that lcv is immune to two of these configurations. Further simulations show the frequency of false-positives and false-negatives imposed by a third, ambiguous, configuration to be low. The frequency of the ambiguous case is 10% in the worst case, for all networks tested. We conclude that the geometric properties underlying lcv are responsible for its resilience to error.

[1]  Stefan Funke,et al.  Hole detection or: "how much geometry hides in connectivity?" , 2006, SCG '06.

[2]  B. R. Badrinath,et al.  Error characteristics of ad hoc positioning systems (aps) , 2004, MobiHoc '04.

[3]  Sándor P. Fekete,et al.  Deterministic boundary recognition and topology extraction for large sensor networks , 2005, SODA '06.

[4]  Herbert Edelsbrunner,et al.  Three-dimensional alpha shapes , 1992, VVS.

[5]  Tarek F. Abdelzaher,et al.  A Scalable Logical Coordinates Framework for Routing in Wireless Sensor Networks , 2004, RTSS.

[6]  David E. Culler,et al.  Beacon vector routing: scalable point-to-point routing in wireless sensornets , 2005, NSDI.

[7]  Jie Gao,et al.  Boundary recognition in sensor networks by topological methods , 2006, MobiCom '06.

[8]  Hussein T. Mouftah,et al.  Network Boundary Identification using Local Information , 2007 .

[9]  Ying Zhang,et al.  Localization from mere connectivity , 2003, MobiHoc '03.

[10]  Michael Kaufmann,et al.  A New Approach for Boundary Recognition in Geometric Sensor Networks , 2005, CCCG.

[11]  David E. Culler,et al.  The effects of ranging noise on multihop localization: an empirical study , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[12]  Mirela Ben-Chen,et al.  Routing with Guaranteed Delivery on Virtual Coordinates , 2006, CCCG.

[13]  Leonidas J. Guibas,et al.  Locating and bypassing routing holes in sensor networks , 2004, IEEE INFOCOM 2004.

[14]  Yao Zhao,et al.  Efficient hop ID based routing for sparse ad hoc networks , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[15]  Sándor P. Fekete,et al.  Neighborhood-Based Topology Recognition in Sensor Networks , 2004, ALGOSENSORS.

[16]  Mani B. Srivastava,et al.  IEEE TRANSACTIONS ON MOBILE COMPUTING 1 An Analysis of Error Inducing Parameters in Multihop Sensor Node Localization , 2004 .

[17]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.

[18]  Leonidas J. Guibas,et al.  GLIDER: gradient landmark-based distributed routing for sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..