Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

Topology Control for Wireless Sensor Networks with Irregular and Dynamic Radio Coverage

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
$31 $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

4 Author(s)
Ababneh, N. ; TELECOM ParisTech, Paris, France ; Selvakennedy, S. ; Hassan, J. ; Boukhatem, N.

A critical issue in wireless sensor networks isrepresented by the limited availability of energy withinsensor nodes. An effective approach for energy conservationis scheduling sleep intervals for extraneous nodes, while theremaining nodes stay active to provide continuous service.Most previous solutions assumed a perfect radio conditionwith a static, circular coverage. However, in real situations,radio signals are very dynamic and irregular in theircoverage. This is especially true for wireless sensornetworks, which usually employ low quality radio modulesto reduce the cost. Assuming no location information isavailable, we approach the problem in this paper from twoaspects: space and time. We present a topology controlalgorithm, termed OTC, for sensor networks withconsideration of radio irregularity and dynamic radiocoverage. It uses two-hop neighborhood information to selecta subset of nodes to be active among all nodes in theneighborhood. Each node in the network selects its own setof active neighbors from among its one-hop neighbors. Thisset is determined such that it covers all two-hop nodes. OTCis evaluated against a well-known algorithm from theliterature, namely Span through realistic simulations usingTOSSIM. The results show that under dense deploymentand irregular and dynamic radio coverage, our algorithmoutperforms Span.

Published in:

Communication Networks and Services Research Conference (CNSR), 2010 Eighth Annual

Date of Conference:

11-14 May 2010