By Topic

In-Network Distributed Algorithm for Energy Optimal Routing Based on Dual Decomposition of Linear Programming

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)
Trdlicka, J. ; Czech Tech. Univ. in Prague, Prague, Czech Republic ; Hanzalek, Z.

This work proposes an in-network distributed algorithm for the energy optimal routing in a wireless sensor network. The routing problem is described as a minimum-cost multi-commodity network flow problem by Linear programming. Based on the convex programming theory we use the dual decomposition theorem to derive the distributed algorithm on a mathematical basic. The algorithm computes the exact energy optimal routing in the network without any central node or the knowledge about the whole network structure, using only peer-to-peer communication between neighboring nodes. In contrast to other works in this area, the presented approach is not limited to strictly convex objective functions and it handles linear objective functions.

Published in:

Communications, IEEE Transactions on  (Volume:60 ,  Issue: 6 )