Skip to Main content Skip to Navigation
Conference papers

A Novel Family of Geometric Planar Graphs for Wireless Ad Hoc Networks

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 some open problems.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/inria-00587873
Contributor : Nathalie Mitton <>
Submitted on : Thursday, April 21, 2011 - 3:47:45 PM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM
Long-term archiving on: : Friday, July 22, 2011 - 2:59:46 AM

File

1569339509.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00587873, version 1

Collections

Citation

Xu Li, Nathalie Mitton, Isabelle Simplot-Ryl, David Simplot-Ryl. A Novel Family of Geometric Planar Graphs for Wireless Ad Hoc Networks. Proc. 30th IEEE International Conference on Computer Communications (IEEE INFOCOM 2011), Apr 2011, Shanghai, China. ⟨inria-00587873⟩

Share

Metrics

Record views

470

Files downloads

396