By Topic

A novel algorithm based on weakly connected dominating set and learning automata and its application to clustering and routing the 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)
Naseri, N.A. ; Dept. of Comput. Eng., Islamic Azad Univ., Arak, Iran ; Meybodi, M.R. ; Torkestani, J.A.

A wireless sensor network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments. Prolonged network lifetime and scalability are important requirements for many sensor network applications. Clustering is an effective topology control approach in wireless sensor networks, which can increase network scalability and lifetime. Clustering sensors into groups so that sensors communicate information only to cluster heads and then the cluster heads communicate the aggregated information to the processing center, may save energy. The weakly connected dominating set (WCDS) is very suitable for cluster formation. Then we find a suitable route for sending packets with a new routing algorithm with the help of the created cluster. In this paper, we propose a distributed, algorithm for WCDS construction in wireless sensor networks based on distributed learning automata. To evaluate the performance of the proposed algorithm several experiments have been conducted.

Published in:

Information Technology and Multimedia (ICIM), 2011 International Conference on

Date of Conference:

14-16 Nov. 2011