Sharif Digital Repository

Let P be a set of points in the plane, each equipped with a directional antenna that can cover a sector of angle α and range r. In the symmetric model of communication, two antennas u and v can communicate to each other, if and only if v lies in u’s coverage area and vice versa. In this paper, we introduce the concept of fault-tolerant spanners for directional antennas, which enables us to construct communication networks that retain their connectivity and spanning ratio even if a subset of antennas are removed from the network. We show how to orient the antennas with angle α and range r to obtain a k-fault-tolerant spanner for any positive integer k. For α ≥ π, we show that the range 13 for... 

Topology of a mobile wireless sensor/ad hoc network is prone to link breakages due to node mobility which compels the periodic re-construction of the topology in so called ""hello"" intervals. The problem addressed in this paper is determining the maximum ""hello"" interval preserving the connectivity of a homogeneous topology with high probability. In order to study the optimum ""hello"" interval, statistical topology lifetime (STL) is formally defined as a value of ""hello"" interval that ensures statistical connectivity with a given threshold. Temporal properties of the topology are studied based on two phenomena; one concerning a connectivity phase transition with time and the other one... 

Data aggregation is a key, yet time-consuming functionality introduced to conserve energy in wireless sensor networks (WSNs). In this paper, to minimize time latency, we focus on aggregation scheduling problem and propose an efficient distributed algorithm that generates a collision-free schedule with the least number of time slots. In contrast to others, our approach named FAST mainly contributes to both tree construction, where the former studies employ Connected 2-hop Dominating Sets, and aggregation scheduling that was previously addressed through the Competitor Sets computation. We prove that the latency of FAST under the protocol interference model is upper-bounded by 12R+Δ-2, where R... 

Let P be a set of points in the plane, each equipped with a directional antenna that covers a sector of angle α and range r. In the symmetric model of communication, two antennas u and v can communicate to each other, if and only if v lies in u's coverage area and vice versa. In this paper, we introduce the concept of fault-tolerant spanners for directional antennas, which enables us to construct communication networks that retain their connectivity and spanning ratio even if a subset of antennas are removed from the network. We show how to orient the antennas with angle α and range r to obtain a k-fault-tolerant spanner for any positive integer k. For α≥π, we show that the range 13 for the... 

This paper deals with the consensus problem in an uncertain multi-agent system whose agents communicate with each other through a weighted undirected (primary) graph. The considered multi-agent system is described by an uncertain state-space model in which the involved matrices belong to some matrix boxes. As the main contribution of the paper, a unified optimization-based framework is proposed for simultaneously reducing the weights of the edges of the primary communication graph (optimizing the network topology) and synthesizing a controller such that the consensus in the considered uncertain multi-agent system is ensured with an adjustable convergence rate. Considering the NP-hardness... 

We address the performance of the 802.11p protocol in terms of the packet delivery ratio (PDR) and the packet reception ratio (PRR) for broadcasting safety messages in highway environments. Regarding the semi-sparse and intermediate traffic, we try to answer to questions such as what are the upper, dominant and lower bounds of PDR and PRR in each traffic condition? How they may deviate from their average values? and What fraction of vehicles may experience such bounds? To answer to such questions, we propose to consider the communication graph formed among vehicles as a special type of the complex networks and we apply the recently proposed obligatory attachment ruleto synthesize such... 

Topology of a mobile wireless sensor/ad hoc network is prone to link breakages due to node mobility which compels the periodic re-construction of the topology in so called "hello" intervals. The problem addressed in this paper is determining the maximum "hello" interval preserving the connectivity of a homogeneous topology with high probability. In order to study the optimum "hello" interval, statistical topology lifetime (STL) is formally defined as a value of "hello" interval that ensures statistical connectivity with a given threshold. Temporal properties of the topology are studied based on two phenomena; one concerning a connectivity phase transition with time and the other one... 

In this paper, we present a concretely efficient protocol for private set intersection (PSI) in the multi-party setting using oblivious pseudorandom function (OPRF). In fact, we generalize the approach used in the work of Chase and Miao [CRYPTO 2020] towards deploying a lightweight multi-point OPRF construction for two-party PSI. Our protocol only includes oblivious transfer (OT) extension and garbled Bloom filter as its main ingredients and avoids computationally expensive operations. From a communication pattern perspective, the protocol consists of two types of interactions. The first type is performed over a star-like communication graph in which one designated party interacts with all... 

In this paper, an approach for topology control has been proposed which make use of distance estimation and angle of arrival (AoA) estimation techniques. Every node in the network tries to keep the number of its neighbors to 4 or 3. These neighbors have been selected from the nearest neighbors of each node and are located in different four quarters of axis. The angular difference between these neighbors is between a minimum and maximum value. This protocol guarantees connectivity on the communication graph with high probability and enforces symmetry on the resulting communication graph, thereby easing the operation of higher level protocols. The performance of the protocol when nodes are... 

k-Neigh is a basic neighbor-based topology control protocol based on the construction of k-neighbor graph as logical communication graph. Several topological aspects of the constructed topology which are crucial to the performance of the protocol are not yet analytically investigated. Moreover, the problem of determining the maximum "Hello" interval preserving the connectivity with high probability has not been extensively addressed yet. Since execution of the protocol is a resource consuming task, this problem is of great importance on the performance of the protocol in sense of power consumption and topology control overhead. In this paper, first, several topological properties of the... 

k-Neigh is a basic neighbor-based topology control protocol based on the construction of k-neighbor graph as logical communication graph. Although k-Neigh is based on a connectivity theory, several topological aspects of the constructed topology are not yet analytically investigated. In this paper, several topological properties of the constructed topology after execution of the protocol, including probability density function of the distance between each node to its ith neighbor, probability of unidirectional links after execution of the first phase of the protocol, average logical degree, and average final transmission range, are investigated analytically. Moreover, an extensive simulation... 

Topology control protocols construct a logical topology out of the physical communication graph. Logical topology is maintained by logical neighbor lists in every node. Logical topology is used by several upper-layer protocols as a substantial communication map and is prone to link breakages due to node mobility which compels the periodic re-execution of the topology control protocol in so called "Hello" intervals. The problem addressed in this paper is determining the maximum "Hello" interval preserving the connectivity with high probability which is not extensively concerned yet. The simplest form of topology control, homogeneous topology control, is chosen for start. Two connectivity...