Sharif Digital Repository

In cloud computing, services play key roles. Services are well defined and autonomous components. Nowadays, the demand of using Fuzzy inference as a service is increasing in the domain of complex and critical systems. In such systems, along with the development of the software, the cost of detecting and fixing software defects increases. Therefore, using formal methods, which provide clear, concise, and mathematical interpretation of the system, is crucial for the design of these Fuzzy systems. To obtain this goal, we introduce the Fuzzy Inference Cloud Service (FICS) and propose a novel discipline for formal modeling of the FICS. The FICS provides the service of Fuzzy inference to the... 

Wireless sensor networks include small nodes which have sensing ability; calculation and connection extend themselves everywhere soon. Such networks have source limitation on connection, calculation and energy consumption. So, since the nodes have limited energy in sensor networks, the optimized energy consumption in these networks is of more importance and has created many challenges. The previous works have shown that by organizing the network nodes in a number of clusters, the energy consumption could be reduced considerably. So the lifetime of the network would be increased. In this paper, we used the Queen-bee algorithm to create energy efficient clusters in wireless sensor networks.... 

The manner of organizing the sensors in the wireless sensor network for increasing the capability and optimized using of the sensors is of great importance. Hence considering coverage parameter in every Wireless Sensor Network (WSN) is extremely essential and critical. The matter of overlapping covered area by sensors in 2D space had been considered until now. This paper is suggested a pattern in which no more are the sensors located at the same surface, but using the 3D geometrical figures like cube, pyramid and etc, in which the sensors were spreading about the different surfaces. Locating the sensors on the different surfaces can be useful under conditions where the space is not in same... 

Sensor networks are systems of many small units that work together to monitor a given environment. A mixed sensor network is composed of a collection of static and mobile nodes that has sensing, computation, communication, and locomotion capabilities. Sensor mobility can be used to compensate for the lack of sensors and improve network coverage. This paper aims to describe an algorithm called Coin for mixed sensor network deployment in an unknown environment by using a small number of mobile sensors. It allows the network to achieve maximum coverage with minimum energy consumption. Our solution includes distributed schemes for: 1) determining the exact size of a coverage hole; 2) determining... 

Fog computing has risen into a popular topic in recent years with the idea of deploying computation and communication closer to end-users. The capability of the fog model to face serious challenges like high latency and power consumption is of paramount research significance, notably in the context of the Internet of Things (IoT), given the volume and requirements of IoT applications. Accordingly, issues such as using the capacity of the fog layer maximally, minimizing latency while maintaining reliability, and efficiently distributing the workload across the network can be well explored. This motivated us to propose a scheme for partial computation offloading and resource allocation in the... 

Intrusion Detection Systems (IDS) for Mobile Ad hoc NETworks (MANETs) are necessary when they are deployed in reality. In This paper, we have presented a combined method of selecting IDS agent nodes in mobile ad hoc networks. Since, the IDS agents in MANET due to more activities need to more battery power. In our method, first, compromised nodes are detected and then the nodes with the highest energy power from among valid nodes as IDS agent nodes are considered. So, with this method, some valid nodes contribute in intrusion detection activities and costs of the network monitoring will be reduced and the network lifetime will be increased. © 2009 IEEE  

Mobile Ad hoc NETworks (MANET) due to different characteristics from wired networks are more vulnerable to security attacks. Construction of Intrusion Detection Systems (IDS) for MANETs is complicated by the fact that they are lack of fixed infrastructure and lack of central management for authentication and distribution of cryptographic keys. On the other hand, the network lifetime is an important issue in MANETs because of the energy power of mobile nodes is limited. In this paper is presented a proposed Method that in the first step, authorized nodes are detected by non-interactive zero knowledge technique and in the second step, nodes with the highest battery power from among authorized... 

In this paper we develop a formal semantics of security protocols. Its main virtue is that it is a generic model, in the sense that it is parameterized over e.g. the intruder model. Further characteristics of the model are a straightforward handling of parallel execution of multiple protocols, locality of security claims, the binding of local constants to role instances, and explicitly defined initial intruder knowledge. We validate our framework by analyzing the Needham-Schroeder-Lowe protocol  

Wireless sensor networks consist of a large number of nodes which are distributed sporadically in a geographic area. The energy of all nodes on the network is limited. For this reason, providing a method of communication between nodes and network administrator to manage energy consumption is crucial. For this purpose, one of the proposed methods with high performance, is clustering methods. The big challenge in clustering methods is dividing network into several clusters that each cluster is managed by a cluster head (CH). In this paper, a centralized genetic-based clustering (CGC) protocol using onion approach is proposed. The CGC protocol selects the appropriate nodes as CHs according to... 

the failure in cluster at a high level can bring up great damages to the system in wireless sensor networks where clustering techniques are used. Certain methods have been reported in the literature in recovering the sensors from a failure cluster. One of the most important methods is to recover the sensors in run-time and without clustering. But it is so much ideal to suppose that all the sensors will be recovered. In this paper, we proposed a method that can operate on the remained sensors that are not recovered. © 2009 IEEE  

Due to the advent of new technologies, devices, and communication tools such as social networking sites, the amount of data produced by mankind is growing rapidly every year. Big data is a collection of large datasets that cannot be processed using traditional computing techniques. MapReduce has been introduced to solve large-data computational problems. It is specifically designed to run on commodity hardware, and it depends on dividing and conquering principles. Nowadays, the focus of researchers has shifted towards Hadoop MapReduce. One of the most outstanding characteristics of MapReduce is data locality-aware scheduling. Data locality-aware scheduler is a further efficient solution to... 

In the last decade various crypto-currencies opened new doors to a decentralized electronic monetary system. Emergence of new Blockchain platforms, such as Ethereum, introduced new features for the implementation of decentralized software or smart contracts. The applications of blockchain technology for secure and efficient information systems is rapidly increasing. However, due to the limitations of this platform including high computational and storage cost, it is not possible to run sophisticated and computationally expensive software on the blockchain. In this paper, a new framework for execution of smart programs on blockchain called the Smart Program Runner Framework (SPRF) is... 

In the last decade various crypto-currencies opened new doors to a decentralized electronic monetary system. Emergence of new Blockchain platforms, such as Ethereum, introduced new features for the implementation of decentralized software or smart contracts. The applications of blockchain technology for secure and efficient information systems is rapidly increasing. However, due to the limitations of this platform including high computational and storage cost, it is not possible to run sophisticated and computationally expensive software on the blockchain. In this paper, a new framework for execution of smart programs on blockchain called the Smart Program Runner Framework (SPRF) is... 

We consider a firm real-time system with a single processor working in two power modes depending on whether it is idle or executing a job. The system is equipped with dynamic thermal management through a cooling subsystem which can switch between two cooling modes. Real-time jobs which arrive to the system have stochastic properties and are prone to soft errors. A successful job is one that enters the system and completes its execution with no timing or soft error. Appropriateness of the system is evaluated based on its performance, temperature behavior, reliability, and energy consumption. It is noteworthy that these criteria have mutual interactions to each other: the stochastic nature of... 

Data aggregation is an effective technique which is introduced to conserve energy by reducing packet transmissions in wireless sensor networks (WSNs). In addition, it is possible to consume less energy by using the spatial correlation and redundancy of data in dense networks to form clusters of nodes sensing similar values and, in turn, transmit one data packet per cluster. In this paper, we propose a Data-Aware Clustering and Aggregation scheme (DACA) to manage the energy constraint in a query-driven WSN. The DACA selects cluster head nodes by forming a new factor as a function of three parameters including the residual energy, the data value, and the number of neighbors at each node.... 

We introduced Computed Network Process Theory to reason about protocols for mobile ad hoc networks (MANETs). Here we explore the applicability of our framework in two regards: model checking and equational reasoning. The operational semantics of our framework is based on constrained labeled transition systems (CLTSs), in which each transition label is parameterized with the set of topologies for which this transition is enabled. We illustrate how through model checking on CLTSs one can analyze mobility scenarios of MANET protocols. Furthermore, we show how by equational theory one can reason about MANETs consisting of a finite but unbounded set of nodes, in which all nodes deploy the same... 

Reo is an exogenous coordination language for synchronizing components participating in a component-based system. In this paper we provide a verification framework for model checking of Reo connectors. The proposed framework applies an extension of Büchi automata as the operational semantic model for Reo connectors and a record-based extension of linear time temporal logic (LTL) for expressing properties. Several aspects of Reo connectors, specially synchronization, context dependencies and fairness constraints, are addressed by this model checker due to its supported underlying model. The main ideas behind this implementation are to introduce a symbolic representation for the main elements... 

We consider a DVS-enabled single-processor firm real-time (FRT) system with Poisson arrival jobs having exponential execution times and generally distributed relative deadlines. The queue size of the system bounds the number of jobs which may be available therein. Further, the processor speed depends on the number of jobs in the system which varies because of the job arrivals, service completions, and dead-line misses. Thus, the processor power consumption, includling both the dynamic and leakage powers, depends on the stochastic nature of the system. More specifically, the instantaneous dynamic power consumption lonely depends on the number of jobs at that moment. However, the instantaneous... 

Key pre-distribution algorithms have recently emerged as efficient alternatives of key management in today's secure communications landscape. Secure routing techniques using key pre-distribution algorithms require special algorithms capable of finding optimal secure overlay paths. To the best of our knowledge, the literature of key pre-distribution systems is still facing a major void in proposing optimal overlay routing algorithms. In the literature work, traditional routing algorithms are typically used twice to find a NETWORK layer path from the source node to the destination and then to find required cryptographic paths. In this paper, we model the problem of secure routing using... 

We provide an equational theory for Restricted Broadcast Process Theory to reason about ad hoc networks. We exploit an extended algebra called Computed Network Theory to axiomatize restricted broadcast. It allows one to define the behavior of an ad hoc network with respect to the underlying topologies. We give a sound and ground-complete axiomatization for CNT terms with finite-state behavior, modulo what we call rooted branching computed network bisimilarity