Sharif Digital Repository

Although many complex real-world networks are weighted, unweighted networks are used in many applications such as sensor networks. In this Letter it is shown using properly weighted networks the performance can be greatly enhanced by reducing the time necessary for the average consensus. Random geographical models are adapted as network models and a method based on mutually coupled phase oscillators is used for providing average consensus over the network. The consensus time is calculated by numerically solving the network's differential equations and monitoring the average error. The simulation results on some sample networks show that the consensus time is dramatically reduced when the... 

Online social networks play a major role in modern societies, and they have shaped the way social relationships evolve. Link prediction in social networks has many potential applications such as recommending new items to users, friendship suggestion and discovering spurious connections. Many real social networks evolve the connections in multiple layers (e.g. multiple social networking platforms). In this article, we study the link prediction problem in multiplex networks. As an example, we consider a multiplex network of Twitter (as a microblogging service) and Foursquare (as a location-based social network). We consider social networks of the same users in these two platforms and develop a... 

Synchronization is a phenomenon that occurs in systems of interacting units, and is widespread in nature, society and technology. Recent studies have enlightened us regarding the interplay between synchronization dynamics and interaction structure. However, most of these studies neglect that real-world networks may actually be directed and disconnected. Here, we study the synchronization of directed networks with multiple leaders using the Kuramoto model. We found that in networks with high driving strength, the steady-state frequency of each node is determined by the linear combination of leaders natural frequencies, with structural coe?cients that can be calculated using the eigenvectors... 

A class of networks are those with both positive and negative links. In this manuscript, we studied the interplay between positive and negative ties on mesoscopic level of these networks, i.e., their community structure. A community is considered as a tightly interconnected group of actors; therefore, it does not borrow any assumption from balance theory and merely uses the well-known assumption in the community detection literature. We found that if one detects the communities based on only positive relations (by ignoring the negative ones), the majority of negative relations are already placed between the communities. In other words, negative ties do not have a major role in community... 

This paper studies the relationship between the position of individual scientists within co-authorship networks and their scientific performance. Using co-authorship data from African scientists in the Health and Medical Sciences within a timespan of 15 years (2000–2015), we characterize the collaboration networks and calculate centrality measures for each scientist to explore how scientific production and impact can be associated with their position within the network. Our findings reveal that authors who occupy a better position within their network and are deemed to actively collaborate with others also have a higher research impact. In this regard, South African scientists do not differ... 

Purpose: The purpose of this paper is to scrutinize the existing literature and provide a comprehensive overview by compiling and synthesizing the dispersed body of knowledge in the networking capability (NC) literature stream. Therefore, this review study contributes to the research by presenting a summary of the NC complex construct. Design/methodology/approach: The authors have tried to cover the literature gap in the NC area through a systematic review. Findings: The theoretical contributions of this study to the NC literature stream are fourfold. First, while critically reviewing existing definitions, the authors present an integrated definition of NC. Second, the authors delineate the... 

In this paper, we introduce a new class of interconnection networks for multiprocessor systems which we refer to as Stretched-Hypercubes, or shortly the Stretched-Cube networks. These networks are obtained by replacing an edge of the well-known hypercube network with an array of processors. Two interesting features of the proposed topology are its area-efficient VLSI layout and superior scalability over the traditional hypercube network. Some topological properties of the proposed network are studied. In addition, an area-efficient VLSI layout for the stretched-cube is suggested and some comparisons between the proposed network and previously studied networks such as the star and hypercube... 

Online social networks (OSNs) can be considered as huge success. However, this success costs users their privacy and loosing ownership of their own data; Sometimes the operators of social networking sites, have some business incentives adverse to users’ expectations of privacy. These sort of privacy breaches have inspired research toward privacy- preserving alternatives for social networking in a decentralized fashion. Yet almost all alternatives lack proper feasibility and efficiency, which is because of a huge mismatch between aforementioned goal and today’s network’s means of achieving it. Current Internet architecture is showing signs of age. Among a variety of proposed directions for a... 

In this paper we use the Output Statistics of Random Binning (ORSB) framework to extend the noisy network coding of Lim et al. to include an eavesdropper  

Pore network modeling uses a network of pores connected by throats to model the void space of a porous medium and tries to predict its various characteristics during multiphase flow of various fluids. In most cases, a non-realistic regular lattice of pores is used to model the characteristics of a porous medium. Although some methodologies for extracting geologically realistic irregular networks from pore space images have been presented, these methods require some experimental data which are either unavailable or costly to obtain. 3-dimensional image or 2-dimensional SEM images are among these types of data. In this paper a new irregular lattice algorithm for the construction of these... 

Unstructured wireless networks such as mobile ad hoc networks and wireless sensor networks have been rapidly growing in the past decade. Security is known as a challenging issue in such networks, in which there is no fixed infrastructure or central trusted authority. Further, node limitations in processing power, storage, and energy consumption add further complexity to addressing security in such networks. While cryptography has proven to be an effective solution capable of satisfying most network security requirements, it requires the use of efficient key pre-distribution algorithms compatible with the limitation of unstructured wireless networks. Typically, a key pre-distribution... 

The Publisher regrets an incorrect figure was placed in the pdf version of the article. © 2018 Springer Science+Business Media, LLC, part of Springer Nature  

3g wireless communication is the next version of mobile networks. Load balancing in networks causes efficient using of network resources. In this paper, we propose an efficient algorithm for load balancing of Radio Network Controllers (RNCs) in Radio Access Networks (RANs). As the characteristics of connections between RNCs and BTSs in a RAN are similar to those of graphs, we make use of graphs to solve our problem. The algorithm is based on the finding a path by which the RNCs could exchange their overloads. By using these paths the algorithm load balances the RNCs in an efficient and fast way. By testing our algorithm on networks with different topology and comparing the results, the... 

Unlike those on Internet, the media providers on P2P networks are ordinary nodes whose contribution bandwidth is limited. Multi-sender methods are the best solutions known to video streaming on P2P networks. In this paper, we propose use of a multi-cast method on the top of an arbitrary multi-sender method so that all requesting peers receive almost the same expected bit-rate. That is while the existing multi-sender methods maximize the bit-rate delivered to the first receiver and cannot provide acceptable bit-rates to the next requesting nodes. © 2006 IEEE  

The Hopfield network is studied from the standpoint of taking it as a computational model in optimizing the fuel management of pressurized water reactors (PWRs). In this paper, the flattening of the neutron flux is considered as the objective function. By this consideration, the power peaking inside the reactor core is also minimized. Regarding the local minimum problem of Hopfield network, the simulated annealing method is applied to improve the Hopfield solution. The method is applied to Bushehr Nuclear Power Plant (PWR design) and the result is compared with the core configuration purposed by the designer  

In this paper, we present a decentralized algorithm to find minimum cost quality of service (QoS) flow subgraphs in network coded multicast schemes. The main objective is to find minimum cost subgraphs that also satisfy user-specified QoS constraints, specifically with respect to rate and delay demands. We consider networks with multiple multicast sessions. Although earlier network coding algorithms in this area have demonstrated performance improvements in terms of QoS parameters, the proposed QoS network coding approach provides a framework that guarantees QoS constraints are actually met over the network. Flow optimization, network coding, quality of service (QoS)  

We introduce a method by which stochastic processes are mapped onto complex networks. As examples, we construct the networks for such time series as those for free-jet and low-temperature helium turbulence, the German stock market index (the DAX), and white noise. The networks are further studied by contrasting their geometrical properties, such as the mean length, diameter, clustering, and average number of connections per node. By comparing the network properties of the original time series investigated with those for the shuffled and surrogate series, we are able to quantify the effect of the long-range correlations and the fatness of the probability distribution functions of the series... 

In optoelectronic OTIS architectures, electrical and optical interconnects are used for local and global communication, respectively. Interesting instances of the OTIS architecture are the OTIS-hypercube and OTIS-mesh. This paper conducts a performance evaluation and comparison of these networks under different structural conditions and traffic loads. All judgments made, are based on observations from extensive simulation results of the interconnection networks. We conclude that, when the OTIS-hypercube and equivalent 2-D OTIS-mesh are compared under the constraint of equal bisection bandwidth, the performance of the OTIS-hypercube is of superior performance. We however show that the... 

Network survivability gauges the ability of a network to support the committed Quality of Services (QoS) continuously in the presence of various failure scenarios. We perceive that both performance and availability are integral components of survivability. Therefore, we propose a composite model for survivability that consists of performance and availability analysis. A analytical technique is presented to find the excess loss due to failure (ELF) when the system is operating in gracefully degraded states. An algorithm is proposed to carry out the availability analysis of the network even when the available paths between nodes are non-disjoint. These two models are combined to construct a...