By Topic

Minimum Cost Routing with a Lifetime Guarantee in 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)
Lihui Tu ; Ningbo Inst. of Technol., Zhejiang Univ., Ningbo, China ; Huanjie Hong ; Gang Zhou

In this paper, we focus on minimum cost routing in the Wireless Sensor Networks (WSNs). In-network data is often routed in such a way that it can minimize overall energy consumption or it can maximize the network lifetime. However, these metrics do not take into account other costs such as queueing delay and congestion. We solve the problem by introducing a comprehensive cost function and formulating the problem as minimizing the overall cost with a lifetime guarantee. We demonstrate the convexity of the problem and introduce Lagrangian Duality method to decompose the problem. A gradient projection based algorithm is proposed to solve the problem in a fully distributed way. The convergence of the algorithm is verified theoretically. We show through extensive numerical results that our proposed algorithm converges quickly to the optimal solution, and that our algorithm has a better performance than existing algorithms.

Published in:

Green Computing and Communications (GreenCom), 2010 IEEE/ACM Int'l Conference on & Int'l Conference on Cyber, Physical and Social Computing (CPSCom)

Date of Conference:

18-20 Dec. 2010