Sharif Digital Repository

This paper considers the computation time of two algorithms for solving a structured constrained linear optimal control problem with finite horizon quadratic cost within the context of automated irrigation networks. The first is a standard centralized algorithm based on the interior point method that does not exploit problem structure. The second is distributed and based on a consensus algorithm, not specifically tailored to account for system structure, but devised rather to facilitate the management of conflicting computational and communication overheads. It is shown that there is a significant advantage in terms of computation time in using the second algorithm in large-scale networks.... 

Modeling arbitrary connectivity changes of mobile ad hoc networks (MANETs) makes application of automated formal verification challenging. We introduced constrained labeled transition systems (CLTSs) as a semantic model to represent mobility. To model check MANET protocol with respect to the underlying topology and connectivity changes, we here introduce a branching-time temporal logic interpreted over CLTSs. The temporal operators, from Action Computation Tree Logic with an unless operator, are parameterized by multi-hop constraints over topologies, to express conditions on successful scenarios of a MANET protocol. We moreover provide a bisimilarity relation with the same distinguishing... 

Nowadays, deployment of peer-to-peer video streaming systems over wireless mesh networks has attained raising popularity among large number of users around the world. In this paper, we present an efficient peer-to-peer live video streaming architecture over multi-hop wireless mesh networks. In our proposed architecture, we take the physical topology of network into account and based on a distributed distributed locality-aware neighbor selection algorithm in the overlay construction phase, we generate an efficient mesh-based overlay on top of wireless mesh networks. In locality-aware neighbor selection algorithm, instead of choosing randomly, peers find their best neighbors based on their... 

Recently, using Peer-to-Peer (P2P) overlay architectures have become a popular approach for live video streaming over the Internet. Since the peers in these systems are geographically distributed, the communication between them imposes huge redundant traffic into the Internet. One solution to address this problem is utilizing the locality aware algorithms to optimize the neighbor selection policy. However, for real-time applications like live video streaming we need to consider the trade-off between localizing the traffic and service quality. In this paper, we propose a novel pure P2P framework through two phases; (1) Local tracker selection, and (2) Overlay mesh construction. We introduce... 

This paper proposes an efficient mechanism that mitigates crosstalk faults in Network-on-Chips (NoCs). This is done by using a Packet Manipulating mechanism called PAM for reliable data transfer of NoCs. PAM investigates the transitions of a packet to minimize the forbidden transition patterns appearing during the flit traversal in NoCs. To do this, the content of a packet is manipulated using three different manipulating mechanisms. In other words, PAM manipulates the content of packet in three manipulating modes including: vertical, horizontal and diagonal modes. Then, comparing the transitions of these manipulating mechanisms, a packet with minimum numbers of transitions is selected to be... 

Topology is widely known as the most important characteristic of networks-on-chip (NoC), since it highly affects overall network performance, cost, and power consumption. In this paper, we propose a reconfigurable architecture and design flow for NoCs on which a customized topology for any target application can be implemented. In this structure, the nodes are grouped into some clusters interconnected by a reconfigurable communication infrastructure. The nodes inside a cluster are connected by a mesh to benefit from the interesting characteristics of the mesh topology, i.e. regular structure and efficient handling of local traffic. A reconfigurable inter-cluster topology then eliminates the... 

In order to respond to drastically increased traffic demands in mobile networks such as cellulars, opportunistic communication has been introduced as a data offloading strategy. Delivering the contents using peer-to-peer data dissemination is more preferable compared to epidemic diffusion schemes. To implement peer-to-peer dissemination, one needs to define the peer selection and content dissemination policies. Efficient content dissemination relies on the selection of suitable peers. Besides that, the peers require to choose what contents to be transmitted between them. In this paper, we propose multi-level master/slave peer selection algorithm (MMSA) and variance-based multi-metric chunk... 

Monitoring large-scale networks is a critical yet challenging task. Enormous number of nodes and links, limited power, and lack of direct access to the entire network are the most important difficulties. In applications such as network routing, where all nodes need to monitor the status of the entire network, the situation is even worse. In this letter, a collaborative model in which nodes pick up information from measurements generated by other nodes is proposed. Using this model, for the first time, an upper bound is derived for the number of measurements that each node must generate, such that the expected number of measurements observed by each node is sufficient to provide a global view... 

Today P2P networks are responsible for a large amount of traffic on the Internet, as many Internet users employ such networks for content distribution. At the same time, P2P networks are vulnerable to security threats such as Internet worms and facilitate their propagation. Internet worms and more generally malware are a major concern to the network security community. There are many different type of worms in the wild, mostly categorized based on how they find and infect their new victims (i.e. active, passive, etc.). In this paper, we investigate a new approach for detecting passive worms and malware in P2P networks based on the popularity of files in the network. As part of our... 

predicting the latency between hosts in the internet can play a significant rolein the improvement of the performance of many services that use latency distances among hosts as a decision making input. Although, the information regarding the point to point delay among internet peers is required in many applications, such information is not easily available to the peers. Latency data acquisition requires a considerableamount of measurements to be performed at each node in order for that node to keep a recordof its latency to all the other nodes. Moreover, the measurements need to be regularly repeated in order to be updatedagainst the network dynamics where the latency values are frequently... 

Today, peer-to-peer networks are become more popular among internet users and more than millions peers share high volume of data from anywhere. Sending and receiving these data increase the network traffics terribly. By improving the performance of these networks not only the efficiency of these networks increase but also the overall performance of the internet augments. To achieve high performance and resilience to failures, a peer can make connections with those other peers that are geographically closer to it. In this paper, we present a novel mechanism for placing peers on the overlay network, which supports locality without increasing network traffic seriously  

This paper presents a new balanced, distributed data structure for storing data with multidimensional keys in a peer-to-peer network. It supports range queries as well as single point queries which are routed in O (log n) hops. Our structure, called SkipTree, is fully decentralized with each node being connected to O (log n) other nodes. We propose modifications to the structures, so that the memory usage for maintaining the link structure at each node is reduced from the worst case of O (n) to O (log n log log n) on the average and O (log2 n) in the worst case. It is also shown that the load balancing is guaranteed to be within a constant factor. Our experimental results verify our... 

Online Social Networks (OSNs) have become widely popular in recent years. In spite of users' interest to join OSNs, sharing vast amounts of personal information and resources in these networks might result in privacy issues for them. In the centralized OSNs, access control policies defined by users are enforced by OSN providers. Moreover, as these shared resources are stored by providers, they can access them. To avoid such problems, various architectures for decentralized OSNs are proposed. But the proposed architectures for P2P OSNs yet do not support any mechanism for collaborative privacy management on the shared content. By increasing the amount of resources such as photos which is... 

Wireless sensor networks (WSNs) usually consist of many tiny sensor nodes and a Sink. Problems like nodes' misbehavior due to malicious, compromised or selfishness intentions, and WSNs' security vulnerabilities against different attacks due to free and unprotected communications, untrusted and broadcasted transmissions, hostile environments and limited resources, degrade the security and overall performance of WSNs. In another direction, most of the traditional security mechanisms are unsuitable for WSNs. One significant security solution against these problems is Trust Management System (TMS); TMS enhances the security by detecting the nodes' abnormal behaviors; it improves the cooperation... 

Topology is widely known as the most important characteristic of networks-on-chip (NoC), since it highly affects overall network performance, cost, and power consumption. In this paper, we propose a reconfigurable architecture and design flow for NoCs on which a customized topology for any target application can be implemented. In this structure, the nodes are grouped into some clusters interconnected by a reconfigurable communication infrastructure. The nodes inside a cluster are connected by a mesh to benefit from the interesting characteristics of the mesh topology, i.e. regular structure and efficient handling of local traffic. A reconfigurable inter-cluster topology then eliminates the... 

During the last years, researchers have proposed solutions to help smartphones offload heavy tasks to remote entities in order to improve execution time and reduce energy consumption. Lately, inspired by the promising results of message forwarding in opportunistic networks, many researchers have proposed strategies for task offloading towards nearby mobile devices. None of these strategies, though, proposes any mechanism that considers selfish users and, most importantly, that motivates and defrays the participating devices who spend their resources. In this paper, we address these problems and propose the design of a framework that integrates an incentive scheme and a reputation mechanism.... 

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... 

Cloud manufacturing is an emerging service-oriented manufacturing paradigm that integrates and manages distributed manufacturing resources through which complex manufacturing demands with a high degree of customization can be fulfilled. The process of service selection optimization and scheduling (SSOS) is an important issue for practical implementation of cloud manufacturing. In this paper, we propose new mixed-integer programming (MIP) models for solving the SSOS problem with basic composition structures (i.e., sequential, parallel, loop, and selective). Through incorporation of the proposed MIP models, the SSOS with a mixed composition structure can be tackled. As transportation is... 

We consider load balancing in a network of caching servers delivering contents to end users. Randomized load balancing via the so-called power of two choices is a well-known approach in parallel and distributed systems that reduces network imbalance. In this paper, we propose a randomized load balancing scheme which simultaneously considers cache size limitation and proximity in the server redirection process. Since the memory limitation and the proximity constraint cause correlation in the server selection process, we may not benefit from the power of two choices in general. However, we prove that in certain regimes, in terms of memory limitation and proximity constraint, our scheme results... 

Peer-to-Peer (P2P) cloud systems are becoming more popular due to the high computational capability, scalability, reliability, and efficient data sharing. However, sending and receiving a massive amount of data causes huge network traffic leading to significant communication delays. In P2P systems, a considerable amount of the mentioned traffic and delay is owing to the mismatch between the physical layer and the overlay layer, which is referred to as locality problem. To achieve higher performance and consequently resilience to failures, each peer has to make connections to geographically closer peers. To the best of our knowledge, locality problem is not considered in any well known P2P...