Maryam Ashtari Mahini; Mohammad Teshnehlab; Mojtaba Ahmadieh khanehsar
Volume 1, Issue 3 , August 2015, Pages 1-8
Abstract
Neural networks are applicable in identification systems from input-output data. In this report, we analyze theHammerstein-Wiener models and identify them. TheHammerstein-Wiener systems are the simplest type of block orientednonlinear systems where the linear dynamic block issandwiched in between two ...
Read More
Neural networks are applicable in identification systems from input-output data. In this report, we analyze theHammerstein-Wiener models and identify them. TheHammerstein-Wiener systems are the simplest type of block orientednonlinear systems where the linear dynamic block issandwiched in between two static nonlinear blocks, whichappear in many engineering applications; the aim of nonlinearsystem identification by Hammerstein-Wiener neural networkis finding model order, state matrices and system matrices. Wepropose a robust approach for identifying the nonlinear systemby neural network and subspace algorithms. The subspacealgorithms are mathematically well-established and noniterativeidentification process. The use of subspace algorithmmakes it possible to directly obtain the state space model.Moreover the order of state space model is achieved usingsubspace algorithm. Consequently, by applying the proposedalgorithm, the mean squared error decreases to 0.01 which isless than the results obtained using most approaches in theliterature.
Computer Networks and Distributed Systems
Zahra Kamaei; Hamidreza Bakhshi; Behrooz Masoumi
Volume 1, Issue 3 , August 2015, Pages 9-16
Abstract
Wireless Sensor Networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as Wireless. The main goal of these networks is collecting data from neighboring environment of network sensors. Since the sensor nodes are battery ...
Read More
Wireless Sensor Networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as Wireless. The main goal of these networks is collecting data from neighboring environment of network sensors. Since the sensor nodes are battery operated and there is no possibility of charging or replacing the batteries, the lifetime of the networks is dependent on the energy of sensors. The objective of this research, is to combine the Harmony Search Algorithm and Ant Colony Optimization Algorithm, as successful meta heuristic algorithm to routing at wireless sensor to increase lifetime at this type of networks. To this purpose, algorithm called HS-ACO is suggested. In this algorithm, two criterion of reduction consumption of energy and appropriate distribution of consumption energy between nodes of sensor leads to increase lifetime of network is considered. Results of simulations, show the capability of the proposed algorithm in finding the Proper path and establishment appropriate balance in the energy consumed by the nodes. Propose algorithm is better than Harmony Search algorithm and Ant Colony Optimization algorithm and Genetic Ant algorithm.
Computer Networks and Distributed Systems
Somayeh Taherian Dehkordi; Vahid Khatibi Bardsiri
Volume 1, Issue 3 , August 2015, Pages 17-22
Abstract
Since software systems play an important role in applications more than ever, the security has become one of the most important indicators of softwares.Cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. Presenting a proper scheduling ...
Read More
Since software systems play an important role in applications more than ever, the security has become one of the most important indicators of softwares.Cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. Presenting a proper scheduling method can lead to efficiency of resources by decreasing response time and costs. This research studies the existing approaches of task scheduling and resource allocation in cloud infrastructures and assessment of their advantages and disadvantages. Afterwards, a compound algorithm is presented in order to allocate tasks to resources properly and decrease runtime. In this paper we proposed a new method for task scheduling by learning automata (LA). This method where has named RAOLA is trained by historical information of task execution on the cloud, then divide task to many classes and evaluate them. Next, manage virtual machine for capture physical resources at any period based on rate of task classes, such that improve efficiency of cloud network.
Computer Networks and Distributed Systems
Seyedeh Roudabeh Hosseini; Sepideh Adabi; Reza Tavoli
Volume 1, Issue 3 , August 2015, Pages 23-32
Abstract
Migration of Virtual Machine (VM) is a critical challenge in cloud computing. The process to move VMs or applications from one Physical Machine (PM) to another is known as VM migration. In VM migration several issues should be considered. One of the major issues in VM migration problem is selecting an ...
Read More
Migration of Virtual Machine (VM) is a critical challenge in cloud computing. The process to move VMs or applications from one Physical Machine (PM) to another is known as VM migration. In VM migration several issues should be considered. One of the major issues in VM migration problem is selecting an appropriate PM as a destination for a migrating VM. To face this issue, several approaches are proposed that focus on ranking potential destination PMs by addressing migration objectives. In this paper we propose a new hierarchal fuzzy logic system for ranking potential destination PMs for a migrating VM by considering following parameters: Performance efficiency, Communication cost between VMs, Power consumption, Workload, Temperature efficiency and Availability. Using hierarchal fuzzy logic systems which consider the mentioned six parameters which have great role in ranking of potential destination PMs for a migrating VM together, the accuracy of PMs ranking approach is increased, furthermore the number of fuzzy rules in the system are reduced, thereby reducing the computational time (which is critical in cloud environment). In our experiments, we compare our proposed approach that is named as (HFLSRPM: Hierarchal Fuzzy Logic Structure for Ranking potential destination PMs for a migrating VM) with AppAware algorithm in terms of communication cost and performance efficiency. The results demonstrate that by considering more effective parameters in the proposed PMs ranking approach, HFLSRPM outperforms AppAware algorithm.
Computer Networks and Distributed Systems
Hamid Haj Seyyed Javadi; Mohaddese Anzani
Volume 1, Issue 3 , August 2015, Pages 33-38
Abstract
Key distribution is an important problem in wireless sensor networks where sensor nodesare randomly scattered in adversarial environments.Due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. To establish a secure communication, two nodes ...
Read More
Key distribution is an important problem in wireless sensor networks where sensor nodesare randomly scattered in adversarial environments.Due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. To establish a secure communication, two nodes must share common key from their key-rings. Otherwise, they can find a key- path in which ensures that either two neighboring nodes have a key in common from source to destination. Com-binatorial designs are powerful mathematical tools with comprehensive and simple structures. Recently, many researchers have used combinatorial designs as key pre-distribution scheme in wireless sensor networks. In this paper we consider a hybrid key pre-distribution scheme based on Balanced Incomplete Block Design. We consider a new approach for choosing key-rings in the hybrid symmetric design to improve the connectivity and resilience. Performance and security properties of the proposed scheme are studied both analytically and computationally. Theobtained results show that our scheme provides better resilience than symmetric design.
Computer Networks and Distributed Systems
Bita Amirshahi; Ali Ahangari
Volume 1, Issue 3 , August 2015, Pages 39-45
Abstract
Abstract—Today, botnets have become a serious threat to enterprise networks. By creation of network of bots, they launch several attacks, distributed denial of service attacks (DDoS) on networks is a sample of such attacks. Such attacks with the occupation of system resources, have proven to be ...
Read More
Abstract—Today, botnets have become a serious threat to enterprise networks. By creation of network of bots, they launch several attacks, distributed denial of service attacks (DDoS) on networks is a sample of such attacks. Such attacks with the occupation of system resources, have proven to be an effective method of denying network services. Botnets that launch HTTP packet flood attacks against Web servers are one of the newest and most troublesome threats in networks. In this paper, we present a system called HF-Blocker that detects and prevents the HTTP flood attacks. The proposed system, by checking at the HTTP request in three stages, a Java-based test, check cookies and then check the user agent, detects legitimate source of communication from malicios source, such as botnets. If it is proved the source of connection to be bot, HF-Blocker blocks the request and denies it to access to resources of the web server and thereby prevent a denial of service attack. Performance analysis showed that HF-Blocker, detects and prevents the HTTP-based attacks of botnets with high probability.