By Topic

A Realistic Weighted Clustering algorithm for data gathering in single hop cell phone based sensor network

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

4 Author(s)
Shah, M.B. ; Electr. Eng. Dept., Indian Inst. of Technol. Bombay, Mumbai, India ; Tamhankar, P.S. ; Merchant, S.N. ; Desai, U.B.

We present Weight based Realistic Clustering algorithm (WRCA) for energy efficient data collection from human based wireless network such as cell phone based sensor network. The WRCA creates better load balanced and stable clusters for data gathering in a realistic human mobility scenario as compared to WCA algorithm of mobile adhoc networks. Traditional way of stable clustering used to select stable Cluster Heads (CHs) based on instantaneous mobility criteria. While our algorithm incorporate only a pause time weighting parameter to leverage pause time distribution of human mobility for selection of more stable CHs. Load balancing aspect of WRCA tackles realistic scenario of inhomogeneous node distribution. Improvement in load balancing with WRCA assure better aggregation of sensor data and MAC layer performance. This is accomplished by incorporating a density center weighting parameter. This information is used to select density centered CHs. WRCA requires fewer messages to find density centered nodes as compared to TASC. Simulation results demonstrate the overall superiority in performance of the WRCA when mobility according to a realistic mobility model called Self similar Least Action Walk (SLAW) is considered. Simulation result shows that our proposed algorithm consumes 20% less energy and 50% more network lifetime as compared to WCA algorithm.

Published in:

GLOBECOM Workshops (GC Wkshps), 2011 IEEE

Date of Conference:

5-9 Dec. 2011