By Topic

A TDMA-based Scheduling and Routing Algorithm for Data-Centric Wireless Sensor Networks

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

3 Author(s)
Yean-Fu Wen ; Univ. of Technol., Taipei ; Lin, F.Y.-S. ; Hung-Shi Wang

Recharging the batteries of a moribund sensor deployed as part of a wireless sensor network is often infeasible due to logistical considerations. With the purpose of prolonging sensor lifetime in such data-centric wireless sensor networks and with emphasis on TDMA-based routing and the efficient scheduling of sensor activities, we propose a mixed-integer nonlinear programming mathematical model, the objective of which is to minimize the total energy consumed by nodes and encompasses dynamic power range, collision free transmission, routing paths, and data aggregation tree constraints. Performing Lagrangean relaxation, we find a near-optimal solution and verify that our proposed algorithm is energy efficient and bounds latency within a reasonable range. Our experiment results confirm improvement over data aggregation algorithms.

Published in:

Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE

Date of Conference:

26-30 Nov. 2007