Skip to main navigation Skip to search Skip to main content

A fault tolerant topology control algorithm for large-scale sensor networks

  • Lili Wang*
  • , Huihua Jin
  • , Jianxun Dang
  • , Yi Jin
  • *Corresponding author for this work
  • Beihang University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we present a Distributed Geography-based Fault Tolerant topology control algorithm (DGFT) for static large-scale wireless sensor networks. We introduce the scale-free characteristic of complex networks into the topology of large-scale wireless sensor networks to obtain robustness and time efficiency. DGFT enables wireless nodes to define the topology by neighbor relationship, based on certain initialized weights whose distribution follows a negative power law. We prove that the topology constructed under DGFT is strongly connected and bidirectional. Simulation studies show that the resulting topology has good network performance in terms of transmission delay and robustness.

Original languageEnglish
Title of host publication18th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2007
Pages407-412
Number of pages6
DOIs
StatePublished - 2007
Event18th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2007 - Adelaide, SA, Australia
Duration: 3 Dec 20076 Dec 2007

Publication series

NameParallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings

Conference

Conference18th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2007
Country/TerritoryAustralia
CityAdelaide, SA
Period3/12/076/12/07

Keywords

  • Robustness
  • Scale-free
  • Topology control
  • Transmission delay
  • Wireless sensor networks

Fingerprint

Dive into the research topics of 'A fault tolerant topology control algorithm for large-scale sensor networks'. Together they form a unique fingerprint.

Cite this