Localized topology generation mechanisms for wireless sensor networks

  • Zhou C
  • 12

    Readers

    Mendeley users who have this article in their library.
  • 49

    Citations

    Citations of this article.

Abstract

The basic topology desired in data-gathering wireless sensor networks is a spanning tree, since the traffic is mainly in the form of many-to-one flows. Nodes in the network can selfconfigure themselves into such a topology by a two-phase process: a flood initiated by the root node, followed by parent selection by all nodes. We present four localized topology generation mechanisms – earliest-first, randomized, nearest-first, and weighted-randomized parent selection. We also compare the network performance of these mechanisms on the basis of the following metrics: node degree, robustness, channel quality, data aggregation and latency; our study shows how localized selfconfiguration mechanisms can impact the global network behavior.

Author-supplied keywords

  • aggregation tree
  • and localized
  • constructed by a two-step
  • extraction
  • global
  • information
  • is a spanning tree
  • network topology generation
  • parent selection
  • spanning tree
  • this tree can be
  • wireless sensor networks

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • C. Zhou

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free