Shape Estimation Using Networked Binary Sensors

An estimation method for the shape and size of a target object by using networked binary sensors whose locations are unknown is proposed. Each of those sensors, which individually are incapable of monitoring the target object's shape and size, sends only binary data describing whether or not it detects at every moment the target object. By using these data and the explicit formulas derived in this paper, we can estimate the size and the perimeter length of the target object even without sensor location information. An additional parameter, which is a function of the shape of the target object, can also be estimated when the target object is non-convex.

[1]  Shu Du,et al.  RMAC: A Routing-Enhanced Duty-Cycle MAC Protocol for Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[2]  D. Manjunath,et al.  WSN04-3: On the Path Coverage by a Non Homogeneous Sensor Field , 2006, IEEE Globecom 2006.

[3]  Radha Poovendran,et al.  Stochastic coverage in heterogeneous sensor networks , 2006, TOSN.

[4]  Donald F. Towsley,et al.  A study of the coverage of large-scale sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[5]  J. Degesys,et al.  DESYNC: Self-Organizing Desynchronization and TDMA on Wireless Sensor Networks , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[6]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[7]  Leonidas J. Guibas,et al.  Lightweight Coloring and Desynchronization for Networks , 2009, IEEE INFOCOM 2009.

[8]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[9]  J. Seaman.  Introduction to the theory of coverage processes , 1990 .

[10]  Adrian Kosowski,et al.  On Greedy Graph Coloring in the Distributed Model , 2006, Euro-Par.

[11]  Ümit V. Çatalyürek,et al.  A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers , 2005, HPCC.

[12]  Shigeo Shioda,et al.  Shape and size estimation using stochastically deployed networked sensors , 2008, 2008 IEEE International Conference on Systems, Man and Cybernetics.

[13]  Masahiro Umehira,et al.  Wide area ubiquitous network: the network operator's view of a sensor network , 2008, IEEE Communications Magazine.

[14]  Sandeep S. Kulkarni,et al.  Self-stabilizing Deterministic TDMA for Sensor Networks , 2005, ICDCIT.

[15]  Gyula Simon,et al.  The flooding time synchronization protocol , 2004, SenSys '04.

[16]  B. Ripley,et al.  Introduction to the Theory of Coverage Processes. , 1989 .

[17]  Radhika Nagpal,et al.  Desynchronization: The Theory of Self-Organizing Algorithms for Round-Robin Scheduling , 2007, First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007).

[18]  Öjvind Johansson.  Simple Distributed Delta+1-coloring of Graphs , 1999, Inf. Process. Lett..

[19]  Milind Dawande,et al.  Link scheduling in sensor networks: distributed edge coloring revisited , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[20]  Kristofer S. J. Pister,et al.  SoC Issues for RF Smart Dust , 2006, Proceedings of the IEEE.