By Topic

Toward Quasiregular Sensor Networks: Topology Control Algorithms for Improved Energy Efficiency

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

Uniformly random or Poisson distributions are widely accepted models for the location of the nodes in wireless sensor networks if nodes are deployed in large quantities and there is little control over where they are dropped. On the other hand, by placing nodes in regular topologies, we expect benefits both in coverage and efficiency of communication. We describe and analyze a basic localized algorithm and three modifications for topology control that provide a tradeoff between performance and deployment cost. The objective is to regularize the topology for improved energy efficiency. The basic algorithm produces quasiregular networks, which only use nodes as sentries and relays that are approximately evenly spaced, thereby emulating a regular grid topology. It is shown that quasiregular networks have a significant energy and lifetime advantage compared with purely random networks. We consider two specific types of quasiregular networks: the ones that are based on a Gaussian deviation about an ideal grid point (type A), and the ones that consist of a subset of nodes taken from a Poisson point process (type B). We show that the two types are equivalent for a certain density of the Poisson point process and, in particular, that in both cases the deviation from the ideal regular grid follows a Rayleigh distribution, whereas the distance between nearest neighbors is Ricean

Published in:

IEEE Transactions on Parallel and Distributed Systems  (Volume:17 ,  Issue: 9 )