Comparing different topology construction algorithms for Wireless Sensor Networks

Research output: Chapter in Book/Report/Conference proceedingMeeting abstract (Book)Research

Abstract

Wireless Sensor Networks are autonomous sensors forwarding collected data to a sink node along multi-hop wireless paths.
The main constraint is the limited (battery) power. We will focus on solutions based on topology control and power control. If the density of the network is high, we show that the cost-field creation technique used in GRAB, produces a non optimal tree (in the sense that it will not lead to an equal load on the nodes during data forwarding), if the hop-count cost measure is used. The number of messages used to build the tree, is also much bigger than the number of nodes. These results suggest that the cost-field algorithm used in GRAB is not sufficient, alone, to build an efficient tree topology, at least when the node density is too high.
Original languageEnglish
Title of host publicationProceeding of the 15th IEEE Workshop on Local and Metropolitan Area Networks June 10-13, 2007, Princeton NJ, USA
Publication statusPublished - 10 Jun 2007

Keywords

  • Wireless Sensor Networks
  • Routing
  • Topology Control

Fingerprint

Dive into the research topics of 'Comparing different topology construction algorithms for Wireless Sensor Networks'. Together they form a unique fingerprint.

Cite this