By Topic

Distributed relay scheduling for maximizing lifetime in clustered 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)
Pengfei Zhang ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore, Singapore ; Gaoxi Xiao ; Hwee-Pink Tan

Clustering and relaying techniques are important approaches towards mitigating the problem of finite network lifetime in wireless sensor networks. To this end, given a clustered wireless sensor network (WSN) (with defined cluster heads and their associated clusters) and a given relay node placement, we present a distributed service allocation algorithm for the relay node for maximizing network lifetime. We evaluate the performance of our method through theoretical analysis as well as simulations, and demonstrate the superior performance of our proposed method compared to a greedy periodic approach.

Published in:

Communication Systems (ICCS), 2012 IEEE International Conference on

Date of Conference:

21-23 Nov. 2012