Skip to main navigation Skip to search Skip to main content

Full-coverage and k-connectivity (k =14, 6) three dimensional networks

  • Xiaole Bai
  • , Chuanlin Zhang
  • , Dong Xuan
  • , Weijia Jia

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

In this paper, we study the problem of constructing full-coverage three dimensional networks with multiple connectivity. We design a set of patterns for full coverage and two representative connectivity requirements, i.e. 14- and 6-connectivity. We prove their optimality under any ratio of the communication range over the sensing range among regular lattice deployment patterns. We also conduct a study on the proposed patterns under practical settings. To our knowledge, our work is the first one that provides deployment patterns with proven optimality that achieve both coverage and connectivity in three dimensional networks.© 2009 IEEE.
Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
Pages388-396
DOIs
Publication statusPublished - 2009
Event28th Conference on Computer Communications (IEEE INFOCOM 2009) - Rio de Janeiro, Brazil
Duration: 19 Apr 200925 Apr 2009

Publication series

Name
ISSN (Print)0743-166X

Conference

Conference28th Conference on Computer Communications (IEEE INFOCOM 2009)
PlaceBrazil
CityRio de Janeiro
Period19/04/0925/04/09

Fingerprint

Dive into the research topics of 'Full-coverage and k-connectivity (k =14, 6) three dimensional networks'. Together they form a unique fingerprint.

Cite this