By Topic

A distributed algorithm for constructing minimum connected dominating set in mobile wireless 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

3 Author(s)
Kheyrihassankandi, J. ; Fac. of Comput. & Inf., Multimedia Univ., Cyberjaya, Malaysia ; Singh, Y.P. ; Chin Kuan Ho

In this paper, we propose an Artificial Bee Colony (ABC) algorithm, a swarm-based artificial intelligence algorithm, for computing a connected dominating set (CDS) in ad hoc wireless networks, which include mobile ad hoc networks (MANETS). ABC Algorithm is an optimization algorithm based on the intelligent behavior of honey bee swarm. Wireless ad hoc networks appear in a wide variety of applications, including mobile wireless networks. In this work ABC algorithm is proposed as optimizing heuristic algorithm for the connected dominating set problem in dynamic environment. This approach guarantees properties of correctness, progressiveness, locality, and seamlessness, and also has better throughput than cyclic iterative local solution (CILS) and seamless iterative local solution (SILS). Extensive simulations are conducted to evaluate the effectiveness of the proposed approach in both static and dynamic environments.

Published in:

Computer and Communication Engineering (ICCCE), 2012 International Conference on

Date of Conference:

3-5 July 2012