Results 1  10
of
13
Full connectivity: corners, edges and faces
, 2012
"... ∗To whom correspondence should be addressed. We develop a cluster expansion for the probability of full connectivity of high density random networks in confined geometries. In contrast to percolation phenomena at lower densities, boundary effects, which have previously been largely neglected, are n ..."
Abstract

Cited by 14 (12 self)
 Add to MetaCart
(Show Context)
∗To whom correspondence should be addressed. We develop a cluster expansion for the probability of full connectivity of high density random networks in confined geometries. In contrast to percolation phenomena at lower densities, boundary effects, which have previously been largely neglected, are not only relevant but dominant. We derive general analytical formulas that show a persistence of universality in a different form to percolation theory, and provide numerical confirmation. We also demonstrate the simplicity of our approach in three simple but instructive examples and discuss the practical benefits of its application to different models. 1
Data Networks
 Upper Saddle River
, 1992
"... filtering + clustering technique for powerlaw ..."
(Show Context)
Optimal Selection of Sink Nodes in Wireless Sensor Networks in Adversarial Environments
"... Abstract—In this paper, we address the problem of assigning the sink role to a subset of nodes in a wireless sensor network with a given topology such that the resulting network configuration is robust against denialofservice type attacks such as node destruction, battery exhaustion and jamming. I ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract—In this paper, we address the problem of assigning the sink role to a subset of nodes in a wireless sensor network with a given topology such that the resulting network configuration is robust against denialofservice type attacks such as node destruction, battery exhaustion and jamming. In order to measure robustness, we introduce new metrics based on a notion defined in [1]. We argue that our metrics are more appropriate to measure the robustness of network configurations than the widely known connectivity based metrics. We formalize the problem of selecting the sink nodes as an optimization problem aiming at minimizing the deployment budget while achieving a certain level of robustness. We propose an efficient greedy heuristic algorithm that approximates the optimal solution reasonably well. Keywordswireless sensor networks; denialofservice attacks; topology robustness measures I.
1Connectivity of Confined Dense Networks: Boundary Effects and Scaling Laws
"... In this paper, we study the probability that a dense network confined within a given geometry is fully connected. We employ a cluster expansion approach often used in statistical physics to analyze the effects that the boundaries of the geometry have on connectivity. To maximize practicality and app ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
In this paper, we study the probability that a dense network confined within a given geometry is fully connected. We employ a cluster expansion approach often used in statistical physics to analyze the effects that the boundaries of the geometry have on connectivity. To maximize practicality and applicability, we adopt four important pointtopoint link models based on outage probability in our analysis: singleinput singleoutput (SISO), singleinput multipleoutput (SIMO), multipleinput singleoutput (MISO), and multipleinput multipleoutput (MIMO). Furthermore, we derive diversity and power scaling laws that dictate how boundary effects can be mitigated (to leading order) in confined dense networks for each of these models. Finally, in order to demonstrate the versatility of our theory, we analyze boundary effects for dense networks comprising MIMO pointtopoint links confined within a right prism, a polyhedron that accurately models many geometries that can be found in practice. We provide numerical results for this example, which verify our analytical results.
Network connectivity through small openings
 in Proceedings of the Tenth International Symposium on Wireless Communication Systems (ISWCS 2013), 2013
"... Abstract—Network connectivity is usually addressed for convex domains where a direct line of sight exists between any two transmitting/receiving nodes. Here, we develop a general theory for the network connectivity properties across a small opening, rendering the domain essentially nonconvex. Our ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
Abstract—Network connectivity is usually addressed for convex domains where a direct line of sight exists between any two transmitting/receiving nodes. Here, we develop a general theory for the network connectivity properties across a small opening, rendering the domain essentially nonconvex. Our analytic approach can go only so far as we encounter what is referred to in statistical physics as quenched disorder making the problem nontrivial. We confirm our theory through computer simulations, obtain leading order approximations and discuss possible extensions and applications. I.
Connectivity in Dense Networks Confined within Right Prisms
"... Abstract—We consider the probability that a dense wireless network confined within a given convex geometry is fully connected. We exploit a recently reported theory to develop a systematic methodology for analytically characterizing the connectivity probability when the network resides within a co ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract—We consider the probability that a dense wireless network confined within a given convex geometry is fully connected. We exploit a recently reported theory to develop a systematic methodology for analytically characterizing the connectivity probability when the network resides within a convex right prism, a polyhedron that accurately models many geometries that can be found in practice. To maximize practicality and applicability, we adopt a general pointtopoint link model based on outage probability, and present example analytical and numerical results for a network employing 2 × 2 multipleinput multipleoutput (MIMO) maximum ratio combining (MRC) link level transmission confined within particular bounding geometries. Furthermore, we provide suggestions for extending the approach detailed herein to more general convex geometries. Index Terms—Connectivity, percolation, outage, MIMO, diversity, power scaling.
Redundancy reduction in wireless sensor networks via centrality metrics Redundancy reduction in Wireless Sensor Networks via Centrality Metrics
"... AbstractThe advances in wireless communications, together with the need of sensing and controlling various nature or human made systems in a large number of points (e.g. smart traffic control, environmental monitoring), lead to the emergence of Wireless Sensor Networks (WSN) as a powerful tool to ..."
Abstract
 Add to MetaCart
AbstractThe advances in wireless communications, together with the need of sensing and controlling various nature or human made systems in a large number of points (e.g. smart traffic control, environmental monitoring), lead to the emergence of Wireless Sensor Networks (WSN) as a powerful tool to fulfill the above requirements. Due to the large amount of wireless devices needed and cost constraints, such networks are usually made by lowcost devices with limited energy and computational capabilities, these further on being subject to easy communication or hardware fails. At the same time, the deployment of such devices in harsh environments (e.g. in the ocean) may lead to uncontrollable redundant topologies which have to be often refined during the exploitation phase of these networks in an automated manner. In the scope of these arguments, in this paper, we take advantage of the latest theoretical advances in complex networks and we propose an automated solution to refine the topology of WSNs by using centrality metrics to detect the redundant nodes and links in a network, and further on to shut down them safely. Our solution may work in both ways, centralized or decentralized, by choosing a centralized or a decentralized centrality metric, this choice being driven by the application goal. The experiments performed on a wide variety of network topologies with different sizes (e.g. number of nodes and links), using different centrality metrics, validate our approach and recommend it as a solution for the automatic control of WSNs topologies during the exploitation phase of such networks to optimize, for instance, their life time.
DOI 10.1007/s109550120493y Full Connectivity: Corners, Edges and Faces
"... Abstract We develop a cluster expansion for the probability of full connectivity of high density random networks in confined geometries. In contrast to percolation phenomena at lower densities, boundary effects, which have previously been largely neglected, are not only relevant but dominant. We der ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract We develop a cluster expansion for the probability of full connectivity of high density random networks in confined geometries. In contrast to percolation phenomena at lower densities, boundary effects, which have previously been largely neglected, are not only relevant but dominant. We derive general analytical formulas that show a persistence of universality in a different form to percolation theory, and provide numerical confirmation. We also demonstrate the simplicity of our approach in three simple but instructive examples and discuss the practical benefits of its application to different models.
Designing
"... robust network topologies for wireless sensor networks in adversarial environments ..."
Abstract
 Add to MetaCart
(Show Context)
robust network topologies for wireless sensor networks in adversarial environments
Network Topology Vulnerability/Cost Tradeoff: Model, Application, and Computational Complexity
"... Technological networks (e.g. telephone and sensor networks, Internet) have provided modern society with increased efficiency, but have also exposed us to the risks posed by their vulnerability to attacks. Mitigating these risks involves designing robust network topologies in situations where resou ..."
Abstract
 Add to MetaCart
(Show Context)
Technological networks (e.g. telephone and sensor networks, Internet) have provided modern society with increased efficiency, but have also exposed us to the risks posed by their vulnerability to attacks. Mitigating these risks involves designing robust network topologies in situations where resources are economically constrained. In this paper, we consider the vulnerability of network topologies from an economic viewpoint and propose security metrics, which are necessary for assessing the efficiency of our solutions. We define the vulnerability of a network as the potential loss in connectivity due to the actions of a strategic adversary. To derive vulnerability metrics, we revisit our recently introduced network blocking game models, which provide a framework for quantifying network topology vulnerability in adversarial environments. We assume that the network operator takes both security and economic goals into consideration. To model these goals, we generalize previous models by introducing usage costs and budget constraints for the operator. We study two natural constraint formulations, the maximum and the expected cost constraints, and derive the feasible vulnerability/cost region. Since the proposed metrics are based on gametheoretic models, computing them can be challenging. To elucidate these challenges, we provide a thorough complexity analysis for solving the proposed games.