Sari Branch, Islamic Azad University
Journal of Advances in Computer Research
2345-606X
2345-6078
4
1
2013
01
01
Modeling Cooperation between Nodes in Wireless Networks by APD Game
1
12
EN
Abbas
Arghavani
Computer and Information Technology Department, Qazvin Islamic Azad University, Qazvin, Iran
a.arghavani@qiau.ac.ir
Abdorasoul
Ghasemi
Faculty of Electrical and Computer Engineering Department, K. N. Toosi University of Technology, Tehran, Iran
Cooperation is the foundation of many protocols in wireless networks. Without cooperation, the performance of a network significantly decreases. Hence, all nodes in traditional networks are required to cooperate with each other. In this paper, instead of traditional networks, a network of rational and autonomous nodes is considered, which means that each node itself can decide whether to cooperate with its neighbor or not and performs something that benefits it. We have used Alternative Prisoner’s Dilemma game which is one of the classic games in the field of game theory, to model node's behavior in a nontraditional network. Then, by providing an approach based on Learning Automata, we've tried to encourage the nodes to cooperate with each other.
Wireless Network,Cooperation,Game Theory,Prisoner’s Dilemma,APD Game
http://jacr.iausari.ac.ir/article_2512.html
http://jacr.iausari.ac.ir/article_2512_ae07ffd62ffcb9045aa5ed203362352a.pdf
Sari Branch, Islamic Azad University
Journal of Advances in Computer Research
2345-606X
2345-6078
4
1
2013
01
01
Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
13
29
EN
Marjan
Abdeyazdan
Department of Computer Engineering, Science and Research branch, Islamic Azad University,Tehran, Iran
m.abdeyazdan@srbiau.ac.ir
Saeed
Parsa
Department of Computer Engineering, Iran University of Science and Technology, Tehran, Iran
Amir Masoud
Rahmani
Department of Computer Engineering, Science and Research branch, Islamic Azad University,Tehran, Iran
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the other one. The problem is to achieve the trade-off between these two parameters. Pre-scheduling algorithms are mainly aimed at modifying the structure of task graph to gain optimal scheduling. In the proposed algorithm the suitable number of processors for scheduling the task graph is computed. The idea of Nash equilibrium is mainly applied to compute the appropriate number of processors in such a way that the idle time of the processors is reduced while their processing power is increased. Also, considering the communication costs and interdependencies, the tasks are merged as their earliest start time is reduced. In this way, the length of the critical path is reduced while the degree of parallelism is increased and ultimately the completion time is reduced.Our experimental result on a number of known benchmark graphs demonstrates the effect of our proposed algorithm.
schedule,pre-schedule,Task Graph,Game Theory,Optimization,Nash equilibrium
http://jacr.iausari.ac.ir/article_2524.html
http://jacr.iausari.ac.ir/article_2524_43c019431670d74c4167cfe38747aa65.pdf
Sari Branch, Islamic Azad University
Journal of Advances in Computer Research
2345-606X
2345-6078
4
1
2013
01
01
VRED: An improvement over RED algorithm by using queue length growth velocity
31
38
EN
Shahram
Jamali
Computer Engineering Department, University of MohagheghArdabili, Ardabil, Iran
jamali@iust.ac.ir
Bita
Alipasandi
Department of Computer Engineering, Zanjan Branch, Islamic Azad University, Zanjan, Iran
Neda
Alipasandi
Sama technical and vocational training college, Islamic Azad University,Ardabil Branch,
Ardabil, Iran
Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED algorithm uses only the average queue length as a congestion meter to trigger packet dropping or packet marking as a congestion feedback. Since the average queue length considers only long–term behavior of any queue, this approach fails to see instantaneous changes of the queue length and hence its reaction is not fast enough. This paperincludes another meter i.e. queue length growth velocity to measure congestion level in the router. This leads to fast reaction to the congestion and hence improves the network performance. Simulation results show that the proposed algorithm outperforms RED algorithm in terms of number of dropped packets and bottleneck utilization.
Congestion Control,active queue management,Random Early Detection,packet dropping,Utilization
http://jacr.iausari.ac.ir/article_2510.html
http://jacr.iausari.ac.ir/article_2510_962b60d94170e8445aaf4a8b997a5407.pdf
Sari Branch, Islamic Azad University
Journal of Advances in Computer Research
2345-606X
2345-6078
4
1
2013
01
01
An Improved Shuffled Frog Leaping Algorithm for Simultaneous Design of Power System Stabilizer and Supplementary Controller for SVC
39
53
EN
Leila
Esteki
Dep. of Electrical Engineering, Shahr-e-Kord Branch, Islamic Azad University, Shahr-e-Kord, Iran
l_esteki@iaushk.ac.ir
Maryam
Shahriari-kahkeshi
Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran
m.shahriyarikahkeshi@ec.iut.ac.ir
Ehsan
Bijami
Department of Electrical and Computer Engineering, Isfahan University of Technology, Isfahan, Iran
e.bijami@ec.iut.ac.ir
This paper presents a new Modified Shuffled Frog Leaping Algorithm (MSFLA) applied to design simultaneous coordinated tuning of damping controllers to damp the power system low frequency oscillations. For this, a new frog leaping rule is proposed to improve the local exploration and performance of the original SFLA and the genetic mutation operator is employed for new frog generation instead of random frog generation to improve the performance and quicker algorithm convergence. In order to verify the effectiveness of the proposed method, a 2-area-4-machine and a 5-area-16-machine power system are considered which two power system stabilizers (PSSs) are designed coordinately for the first system and one PSS for a generator and one supplementary controller for a Static Var Compensator (SVC) are designed simultaneously for the second system. To show the effectiveness of the designed controllers, study systems are tested under two different operating conditions and simulation studies are presented.
Shuffled Frog Leaping Algorithm,Low frequency Oscillation,SVC
http://jacr.iausari.ac.ir/article_2960.html
http://jacr.iausari.ac.ir/article_2960_c5dcd40d5d5d891b24a8166e9c465b92.pdf
Sari Branch, Islamic Azad University
Journal of Advances in Computer Research
2345-606X
2345-6078
4
1
2013
01
01
A Recursive Formula for the Number of Fuzzy
Subgroups of Finite Cyclic Groups
55
63
EN
Mahdi
Imanparast
Department of Computer Science, University of Bojnord, Bojnord, Iran
m.imanparast@ub.ac.ir
Hamid
Darabi
Department of Mathematics, Mashhad Branch, Islamic Azad University, Mashhad, Iran
darabi@iauesf.ut.ac.ir
Fuzzy groups and fuzzy theory have a lot of applications in several sciences such as mathematics, computer science, computer and electrical engineering. Hence, counting the number of fuzzy subgroups of finite groups to classify them is an important issue in fuzzy theory. The Main goal of this paper is to give an explicit formula for the number of fuzzy subgroups of a finite cyclic group G Z p1 Z p 2 Z p 3 Z pk = ´ ´ ´´ , where k p , p ,..., p 1 2 are distinct prime numbers. We introduce a very simple recursive formula to count the number of subgroups of G.
Fuzzy groups,Lattice,Finite cyclic groups,Chains
http://jacr.iausari.ac.ir/article_2961.html
http://jacr.iausari.ac.ir/article_2961_02dc5efc0373ca5fb564e81b05039638.pdf
Sari Branch, Islamic Azad University
Journal of Advances in Computer Research
2345-606X
2345-6078
4
1
2013
01
01
RSSAT: A Wireless Intrusion Detection System Based on Received Signal Strength Acceptance Test
65
80
EN
S.Mobarakeh
Moosavirad
Iran University of Science and Technology (IUST), Center for ELearning, Tehran, Iran
moosavirad@vu.iust.ac.ir
Peyman
Kabiri
Iran University of Science and Technology (IUST), School of Computer Engineering, Tehran , Iran
peyman.kabiri@ iust.ac.ir
Hamidreza
Mahini
Islamic Azad University (IAU) , Science and Research Branch, Department of Computer Engineering,
Tehran, Iran
hamidreza.mahini@srbiau.ac.ir
Intrusion detection in wireless networks has been a challenging research problem in network security for more than half a century. This paper presents a novel intrusion detection method based on Received Signal Strength Acceptance Test (RSSAT) to improve the IDS capabilities in anomaly-based Host-based Intrusion Detection Systems (HIDS). The new system can identify suspicious behaviors detecting anomalies in the received signal strength from the access points. Several scenarios are implemented in Omnet++ environment to evaluate the performance of the proposed scheme. A test criterion is used to improve accuracy in detecting forged signal powers and at the same time to reduce number of the false positives i.e. number of false attack alerts resulted from the legitimate signal powers.
Intrusion Detection System,Wireless,WIDS,security
http://jacr.iausari.ac.ir/article_2962.html
http://jacr.iausari.ac.ir/article_2962_e15701c043a07a264222939a5de2a617.pdf
Sari Branch, Islamic Azad University
Journal of Advances in Computer Research
2345-606X
2345-6078
4
1
2013
01
01
Optimized Reversible Programmable Logic Array (PLA)
81
88
EN
Aliakbar
Niknafs
Faculty of Computer Engineering, Shahid Bahonar University of Kerman, Iran
niknafs@uk.ac.ir
Reversible logic circuits have found emerging attentions in nanotechnology, optical computing, quantum computing and low power design. A programmable logic array (PLA) is a universal circuit which is used to implement combinational logic circuits. The main part of a PLA is its AND array. In this study we propose two types of optimized reversible programmable logic array (RPLA) circuits. The first type is based on a “2-to-4” AND array, and is proposed for the first time. The second type is based on a “3-to-8” AND array. For each type, we bring some different designs. These circuits are compared with the existing counterparts in terms of number of constant inputs and garbage outputs, delay and the quantum cost and are shown that all parameters in proposed circuits are improved.
Optimization,Reversible logic,PLA,Genetic algorithm
http://jacr.iausari.ac.ir/article_2963.html
http://jacr.iausari.ac.ir/article_2963_fe62c57510297ee06f9aa39a60fdfeac.pdf
Sari Branch, Islamic Azad University
Journal of Advances in Computer Research
2345-606X
2345-6078
4
1
2013
01
01
Solving the Capacitated Clustering Problem by a
Combined Meta-Heuristic Algorithm
89
100
EN
Narges
Mahmoodi Darani
Department of Mathematic, Malayer Branch, Islamic Azad University, Malayer, Iran
Vahid
Ahmadi
Department of Mathematic, Ahvaz Branch, Islamic Azad University, Ahvaz, Iran
vahid.ahmadi7@yahoo.com
Zahra
Saadati Eskandari
Young Researchers & Elite Club, Fereydan Branch, Islamic Azad University, Fereydan, Iran
saadat.zahra@yahoo.com
Majid
Yousefikhoshbakht
Young Researchers & Elite Club, Hamedan Branch, Islamic Azad University, Hamedan, Iran
khoshbakht@iauh.ac.ir
The capacitated clustering problem (CCP) is one of the most important combinational optimization problems that nowadays has many real applications in industrial and service problems. In the CCP, a given n nodes with known demands must be partitioned into k distinct clusters in which each cluster is detailed by a node acting as a cluster center of this cluster. The objective is to minimize the sum of distances from all cluster centers to all other nodes in their cluster, such that the sum of the corresponding node weights does not exceed a fixed capacity and every node is allocated to exactly one cluster. This paper presents a hybrid three-phase meta-heuristic algorithm (HTMA) including sweep algorithm (SA), ant colony optimization (ACO) and two local searches for the CCP. At the first step, a feasible solution of CCP is produced by the SA, and at the second step, the ACO, insert and swap moves are used to improve solutions. Extensive computational tests on standard instances from the literature confirm the effectiveness of the presented approach compared to other meta-heuristic algorithms.
Capacitated Clustering Problem,NP-hard Problems,Ant Colony Optimization,Sweep Algorithm,Local Search
http://jacr.iausari.ac.ir/article_2964.html
http://jacr.iausari.ac.ir/article_2964_ac89a21ab33eabe70518e773ccb08738.pdf