|| R. Szewczyk, A. Mainwaring, J. Anderson, and D. Culler, “An analysis of a large scale habit monitoring applicarion,” in Proc. ACM SenSys, 2004.|
 T. He, S. Krishnamurthy, J. A. Stankovic, T. Abdelzaher, and et al., “An energy-efficient surveillance system using wireless sensor networks,” in Proc. ACM MobiSys, 2004.
 S. Kumar, T. H. Lai, and A. Arora, “Barrier Coverage with Wireless Sensors,” in Proc. ACM MobiCom, 2005.
 C. E. Perkins and E. Bhagwat, “Highly dynamic destination-sequenced distance-vextor routin(DSDV) for mobile computer,” in Proc. ACM SIGCOMM, 1994.
 T. Clausen et al, “Optimized link state routing protocol,” IETF Internet Draft , 2003.
 D. Johnson and D. Maltz, “Dynamic source routing in ad hoc wireless networks,” in Proc. ACM Mobicom, 1996.
 C. Perkins and E. M. Royer, “ad hoc on-demand distance vector routing,” in Proc. IEEE WMCSA, 1999.
 V. D. Park and M. S. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks,” in Proc. IEEE INFOCOM, 1997.
 P. Bahl and V. N. Padmanabhan, “RADAR: An In-Building RF-Based User Location and Tracking System,” in Proc. IEEE INFOCOM, 2000.
 T. He, C. Huang, B. M. Blum, J. A. Stankovic, T. Abdelzaher, “Range-Free Localization Schemes for Large Scale Sensor Networks,” in Proc. ACM MobiCom, 2003.
 A. Harter, A. Hopper and P. Steggles, “A. Ward and P.Webster, The anatomy of a context-aware application, ” in Proc. ACM MobiCom, 1999.
 B. Karp and H. T. Kung, “GPSR : Greedy perimeter stateless routing for wireless networks,” in Proc. ACM Mobicom, 2000.
 A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica, “Geographic routing without location information,” in Proc. ACM MobiCom, 2003.
 J. Bruck, J. Gao, A. Jiang, “MAP:Medial Axis Based Geometric Routing in Sensor Networks,” in Proc. ACM Mobicom, 2005.
 Q. Fang, J. Gao, L. Guibas, V. de Silva, and L. Zhang, “GLIDER: Gradient landmark-based distributed routing for sensor networks,” in Proc. IEEE INFOCOM, 2005.
 G. Tan, M. Bertier and A-M. Kermarrec, “Visibility-Graph-based Shortest-Path Geographic Routing in Sensor Networks,” in Proc. IEEE INFOCOM, 2009.
 G. Tan, M. Bertier and A-M. Kermarrec, “Convex Partition of Sensor Networks and Its Use in Virtual Coordinate Geographic Routing,” in Proc. IEEE INFOCOM, 2009.
 X. Zhu, R. Sarkar, and J. Gao, “Shape segmentation and applications in sensor networks,” in Proc. IEEE INFOCOM, 2008.
 G. Tan and A-M. Kermarrec, “Greedy Geographic Routing in Large-Scale Sensor Networks: A Minimum Network Decomposition Approach,” in Proc. ACM Mobihoc, 2010.
 C. Zhang, Y. Zhang and Y. Fang, “Localized algorithms for coverage boundary detection in wireless sensor networks,” Wireless Networks, 2007.
 L. P. Chew and R. L. Drysdale, “Voronoi diagrams based on convex distance functions,” in Proc. ACM Sympos.Comput. Geom., 1985.
 D. T. Lee and F. P. Preparata, “Location of a point in a planar subdivision and its applications,” SIAM Journal on Computing, vol. 6, pp. 594–606, 1977.
 K. Mulmuley, “A fast planar partition algorithm,” Journal of Symbolic Computation, vol. 10, pp. 253–280, 1990.
 D. Lichtenstein, “Planar Formulae and Their Uses,” SIAM Journal on Computing, vol. 11, pp. 329-343, 1982.
 A-M Kermarrec and G. Tan, “Greedy Geographic Routing in Large-Scale Sensor Networks: A Minimum Network Decomposition Approach,” Technical report of INRIA-Rennes, July, 2010.
 S.-Y. Ni, Y.-C. Tseng, Y.-S Chen, and J.-P. Sheu, “The broadcast storm problem in a mobile ad hoc network,” in Proc. ACM Mobicom, 1999.
 Y-B Ko, and N. H. Vaidya, “Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms,” in Proc. IEEE MCSA, 1999.