By Topic

Multi-sink data aggregation routing and scheduling with dynamic radii in WSNs

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

2 Author(s)
Lin, F.Y.-S. ; Dept. of Inf. Manage., Nat. Taiwan Univ., Taipei ; Yean-Fu Wen

In wireless sensor networks (WSNs) with multiple sink nodes, energy is wasted on idle listening, redundant transmissions, and unnecessary power consumption. The total energy consumption may be minimized by properly scheduling communications in conjunction with aggregating data and dynamically adjusting radii. We propose near-optimal data aggregation routing and duty cycle scheduling heuristics, denoted by MDAR and O-MAC, which achieve energy efficiency and bound latency within a reasonable range. These heuristics outperform other general data aggregation routing heuristics (e.g., CNS, GIT, and SPT) and scheduling protocols (e.g., S-MAC and T-MAC) by 7%-45%, according to our experimental results.

Published in:

Communications Letters, IEEE  (Volume:10 ,  Issue: 10 )