Abstract: In recent years, many researchers are involved in the
field of fuzzy theory. However, there are still a lot of issues to be
resolved. Especially on topics related to controller design such as the
field of robot, artificial intelligence, and nonlinear systems etc.
Besides fuzzy theory, algorithms in swarm intelligence are also a
popular field for the researchers. In this paper, a concept of utilizing
one of the swarm intelligence method, which is called Bacterial-GA
Foraging, to find the stabilized common P matrix for the fuzzy
controller system is proposed. An example is given in in the paper, as
well.
Abstract: In the context of spectrum surveillance, a new method
to recover the code of spread spectrum signal is presented, while the
receiver has no knowledge of the transmitter-s spreading sequence. In
our previous paper, we used Genetic algorithm (GA), to recover
spreading code. Although genetic algorithms (GAs) are well known
for their robustness in solving complex optimization problems, but
nonetheless, by increasing the length of the code, we will often lead
to an unacceptable slow convergence speed. To solve this problem we
introduce Particle Swarm Optimization (PSO) into code estimation in
spread spectrum communication system. In searching process for
code estimation, the PSO algorithm has the merits of rapid
convergence to the global optimum, without being trapped in local
suboptimum, and good robustness to noise. In this paper we describe
how to implement PSO as a component of a searching algorithm in
code estimation. Swarm intelligence boasts a number of advantages
due to the use of mobile agents. Some of them are: Scalability, Fault
tolerance, Adaptation, Speed, Modularity, Autonomy, and
Parallelism. These properties make swarm intelligence very attractive
for spread spectrum code estimation. They also make swarm
intelligence suitable for a variety of other kinds of channels. Our
results compare between swarm-based algorithms and Genetic
algorithms, and also show PSO algorithm performance in code
estimation process.
Abstract: Mobile Ad hoc network consists of a set of mobile
nodes. It is a dynamic network which does not have fixed topology.
This network does not have any infrastructure or central
administration, hence it is called infrastructure-less network. The
change in topology makes the route from source to destination as
dynamic fixed and changes with respect to time. The nature of
network requires the algorithm to perform route discovery, maintain
route and detect failure along the path between two nodes [1]. This
paper presents the enhancements of ARA [2] to improve the
performance of routing algorithm. ARA [2] finds route between
nodes in mobile ad-hoc network. The algorithm is on-demand source
initiated routing algorithm. This is based on the principles of swarm
intelligence. The algorithm is adaptive, scalable and favors load
balancing. The improvements suggested in this paper are handling of
loss ants and resource reservation.