Sharif Digital Repository

Many technological networks can experience random and/or systematic failures in their components. More destructive situations can happen if the components have limited capacity, where the failure in one of them might lead to a cascade of failures in other components, and consequently break down the structure of the network. In this paper, the tolerance of cascaded failures was investigated in weighted networks. Three weighting strategies were considered including the betweenness centrality of the edges, the product of the degrees of the end nodes, and the product of their betweenness centralities. Then, the effect of the cascaded attack was investigated by considering the local weighted flow... 

Considering the weaknesses of cryptography algorithms and the attacks performed against them, cryptography alone cannot guarantee the security of communication in a wireless network. With regard to the developments in wireless communication networks brought about by smart array antennas, security can be sought in the physical layer as well, aiming to restrict the access of the data in a wireless network and limit it to authorized users only in order to further restrain malicious data accesses. In this paper, we analysis a strategy for restricting data access using smart array antennas and present the results in security by a parameter called exposure region. For this strategy afterwards we... 

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  

In the past few years, the study of complex networks has attracted the attention of researchers. Many real networks, ranging from technological networks such as the Internet to biological networks, have been considered as special types of complex networks. Through application of the network science, important structural properties of such networks have been analyzed and the mechanisms that form such characteristics have been introduced. In this paper, we address the structural characteristics of a technological network called Vehicular Ad hoc Networks (VANETs). Recent studies reveal that the communication graph of VANETs has some interesting characteristics including: the Gaussian degree... 

Network on chip (NoC) is a scalable interconnection architecture for ever increasing communication demand between processing cores. However, in nanoscale technology size, NoC lifetime is limited due to aging processes of negative bias temperature instability, hot carrier injection, and electromigration. Usually, because of unbalanced utilization of NoC resources, some parts of the network experience more thermal stress and duty cycle in comparison with other parts, which may accelerate chip failure. To slow down the aging rate of NoC, this paper proposes an oblivious routing algorithm called location-based aging-resilient Xy-Yx (LAXY) to distribute packet flow over entire network. LAXY is... 

Online social networks, World Wide Web, media, and technological networks, and other types of so-called information networks are ubiquitous nowadays. These information networks are inherently heterogeneous and dynamic. They are heterogeneous as they consist of multi-Typed objects and relations, and they are dynamic as they are constantly evolving over time. One of the challenging issues in such heterogeneous and dynamic environments is to forecast those relationships in the network that will appear in the future. In this article, we try to solve the problem of continuous-Time relationship prediction in dynamic and heterogeneous information networks. This implies predicting the time it takes... 

In this paper, we consider the network coding in networks with broadcast channels (called hypernetworks) as the first step for applying network coding to wireless networks. We first prove a Max-Flow Min-Cut theorem for such networks. While we propose an algorithm to achieve this bound, we will introduce new definitions and provide sufficient tools to extend many of the theorems stated for flows in wireline networks to the case of hypernetworks. As an example, we will extend the Max-Flow Min-Cut condition for feasibility of the point-to-point connection in wireline networks to the case of hypernetworks. Then, we will extend the algebraic approach of Koetter and Medard in [3] to the...