Skip to Main content Skip to Navigation

Planarisation de graphes dans les réseaux ad-hoc

Abstract : We propose a radically new family of geometric graphs, i.e., Hypocomb, Reduced Hypocomb and Local Hypocomb. The first two are extracted from a complete graph; the last is extracted from a Unit Disk Graph (UDG). We analytically study their properties including connectivity, planarity and degree bound. All these graphs are connected (provided the original graph is connected) planar. Hypocomb has unbounded degree while Reduced Hypocomb and Local Hypocomb have maximum degree 6 and 8, respectively. To our knowledge, Local Hypocomb is the first strictly-localized, degree-bounded planar graph computed using merely 1-hop neighbor position information. We present a construction algorithm for these graphs and analyze its time complexity. Hypocomb family graphs are promising for wireless ad hoc networking. We report our numerical results on their average degree and their impact on FACE routing. We discuss their potential applications and pinpoint some interesting open problems for future research.
Complete list of metadata
Contributor : Nathalie Mitton Connect in order to contact the contributor
Submitted on : Thursday, July 22, 2010 - 9:52:29 AM
Last modification on : Thursday, February 24, 2022 - 3:10:13 AM
Long-term archiving on: : Thursday, March 30, 2017 - 1:14:19 AM


Files produced by the author(s)


  • HAL Id : inria-00504683, version 2



Xu Li, Nathalie Mitton, Isabelle Simplot-Ryl, David Simplot-Ryl. Planarisation de graphes dans les réseaux ad-hoc. [Research Report] RR-7340, INRIA. 2010. ⟨inria-00504683v2⟩



Record views


Files downloads