Convex Partition of Sensor Networks and Its Use in Virtual Coordinate Geographic Routing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Convex Partition of Sensor Networks and Its Use in Virtual Coordinate Geographic Routing

Abstract

Virtual coordinate geographic routing is an appealing geographic routing approach for its ability to work without physical location information. We examine two representative such routing protocols, namely NoGeo and BVR, and show through experiments and theoretical analysis their limitation in adapting to complex field topologies, in particular fields with concave holes. Based on the new insights, we propose a distributed convex partition protocol that divides the field to subareas with convex shapes, using only connectivity information. A new geographic routing protocol, called CONVEX , that builds upon the partitioning protocol is then described. Simulations demonstrate significant performance improvement of the new routing protocol over NoGeo and BVR, in terms of transmission stretch and maintenance overheads.
Fichier principal
Vignette du fichier
convex.pdf (476.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00430145 , version 1 (05-11-2009)

Identifiers

  • HAL Id : inria-00430145 , version 1

Cite

Guang Tan, Marin Bertier, Anne-Marie Kermarrec. Convex Partition of Sensor Networks and Its Use in Virtual Coordinate Geographic Routing. INFOCOM 2009, Apr 2009, Rio de Janeiro, Brazil. ⟨inria-00430145⟩
200 View
299 Download

Share

Gmail Facebook X LinkedIn More