A Distributed Algorithm for Constructing Minimum Connected Dominating Set in Mobile Wireless Network

Kheyrihassankandi, J. and Singh, Y. P. and Ho, Chin Kuan (2012) A Distributed Algorithm for Constructing Minimum Connected Dominating Set in Mobile Wireless Network. In: 2012 International Conference on Computer and Communication Engineering (ICCCE). IEEE, 396 -401. ISBN 978-1-4673-0478-8

Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?...

Abstract

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.

Item Type: Book Section
Subjects: Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Computing and Informatics (FCI)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 31 Oct 2013 05:48
Last Modified: 01 Nov 2013 05:09
URI: http://shdl.mmu.edu.my/id/eprint/4335

Actions (login required)

View Item View Item