By Topic

On lexicographic max-min node lifetime for 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)
Hou, Y.T. ; Bradley Dept. of Electr. & Comput. Eng., Virginia Tech., Blacksburg, VA, USA ; Yi Shi ; Sherali, H.D.

We study the network lifetime problem by considering not only the maximized time until the first node fails, but also the maximized lifetime for all the nodes in the network which we define as the lexicographic max-min (LMM) node lifetime problem. The main contributions of this paper are two-fold. First, we develop a polynomial-time algorithm to derive the LMM-optimal node lifetime vector, which effectively circumvents the computational complexity problem associated with an existing state-of-the-art approach, which is exponential. Second, we present a simple (also polynomial-time) algorithm to calculate the flow routing schedule such that the LMM-optimal node lifetime vector can be achieved. Our results in this paper advance the state-of-the-art algorithmic design to network-wide node lifetime problems.

Published in:

Communications, 2004 IEEE International Conference on  (Volume:7 )

Date of Conference:

20-24 June 2004