793 research outputs found
A PROTOCOL SUITE FOR WIRELESS PERSONAL AREA NETWORKS
A Wireless Personal Area Network (WPAN) is an ad hoc network that consists of devices that surround an individual or an object. Bluetooth® technology is especially suitable for formation of WPANs due to the pervasiveness of devices with Bluetooth® chipsets, its operation in the unlicensed Industrial, Scientific, Medical (ISM) frequency band, and its interference resilience. Bluetooth® technology has great potential to become the de facto standard for communication between heterogeneous devices in WPANs.
The piconet, which is the basic Bluetooth® networking unit, utilizes a Master/Slave (MS) configuration that permits only a single master and up to seven active slave devices. This structure limitation prevents Bluetooth® devices from directly participating in larger Mobile Ad Hoc Networks (MANETs) and Wireless Personal Area Networks (WPANs). In order to build larger Bluetooth® topologies, called scatternets, individual piconets must be interconnected. Since each piconet has a unique frequency hopping sequence, piconet interconnections are done by allowing some nodes, called bridges, to participate in more than one piconet. These bridge nodes divide their time between piconets by switching between Frequency Hopping (FH) channels and synchronizing to the piconet\u27s master.
In this dissertation we address scatternet formation, routing, and security to make Bluetooth® scatternet communication feasible. We define criteria for efficient scatternet topologies, describe characteristics of different scatternet topology models as well as compare and contrast their properties, classify existing scatternet formation approaches based on the aforementioned models, and propose a distributed scatternet formation algorithm that efficiently forms a scatternet topology and is resilient to node failures.
We propose a hybrid routing algorithm, using a bridge link agnostic approach, that provides on-demand discovery of destination devices by their address or by the services that devices provide to their peers, by extending the Service Discovery Protocol (SDP) to scatternets.
We also propose a link level security scheme that provides secure communication between adjacent piconet masters, within what we call an Extended Scatternet Neighborhood (ESN)
Keeping Authorities "Honest or Bust" with Decentralized Witness Cosigning
The secret keys of critical network authorities - such as time, name,
certificate, and software update services - represent high-value targets for
hackers, criminals, and spy agencies wishing to use these keys secretly to
compromise other hosts. To protect authorities and their clients proactively
from undetected exploits and misuse, we introduce CoSi, a scalable witness
cosigning protocol ensuring that every authoritative statement is validated and
publicly logged by a diverse group of witnesses before any client will accept
it. A statement S collectively signed by W witnesses assures clients that S has
been seen, and not immediately found erroneous, by those W observers. Even if S
is compromised in a fashion not readily detectable by the witnesses, CoSi still
guarantees S's exposure to public scrutiny, forcing secrecy-minded attackers to
risk that the compromise will soon be detected by one of the W witnesses.
Because clients can verify collective signatures efficiently without
communication, CoSi protects clients' privacy, and offers the first
transparency mechanism effective against persistent man-in-the-middle attackers
who control a victim's Internet access, the authority's secret key, and several
witnesses' secret keys. CoSi builds on existing cryptographic multisignature
methods, scaling them to support thousands of witnesses via signature
aggregation over efficient communication trees. A working prototype
demonstrates CoSi in the context of timestamping and logging authorities,
enabling groups of over 8,000 distributed witnesses to cosign authoritative
statements in under two seconds.Comment: 20 pages, 7 figure
Integrating Blockchain and Fog Computing Technologies for Efficient Privacy-preserving Systems
This PhD dissertation concludes a three-year long research journey on the integration of Fog Computing and Blockchain technologies. The main aim of such integration is to address the challenges of each of these technologies, by integrating it with the other. Blockchain technology (BC) is a distributed ledger technology in the form of a distributed transactional database, secured by cryptography, and governed by a consensus mechanism. It was initially proposed for decentralized cryptocurrency applications with practically proven high robustness. Fog Computing (FC) is a geographically distributed computing architecture, in which various heterogeneous devices at the edge of network are ubiquitously connected to collaboratively provide elastic computation services. FC provides enhanced services closer to end-users in terms of time, energy, and network load. The integration of FC with BC can result in more efficient services, in terms of latency and privacy, mostly required by Internet of Things systems
Broadcasting in Hyper-cylinder graphs
Broadcasting in computer networking means the dissemination of information, which is known initially only at some nodes, to all network members. The goal is to inform every node in the minimal time possible. There are few models for broadcasting; the simplest and the historical model is called the Classical model. In the Classical model, dissemination happens in synchronous rounds, wherein a node may only inform one of its neighbors. The broadcast question is: What is the minimum number of rounds needed for broadcasting, and what broadcast scheme achieves it?
For general graphs, these questions are NP-hard, and it is known to be at least 3 - ε inapproximable for any real ε > 0. Even for some very restricted classes of graphs, the questions remain as an NP-hard problem. Little is known about broadcasting in restricted graphs, and only a few classes have a polynomial solution.
Parallel and distributed computing is one of the important domains which relies on efficient broadcasting. Hypercube and torus are the most used network topology in this domain. The widespread use is not only due to their simplicity but also is for their efficiency and high robustness (e.g., fault tolerance) while having an acceptable number of links. In this thesis, it is observed that the Cartesian product of a number of path and cycle graphs produces a valuable set of topologies, we called hyper-cylinders, which contain hypercube and Torus as well. Any hyper-cylinder shares many of the beneficial features of hypercube and torus and might be a suitable substitution in some cases. Some hyper-cylinders are also similar to other practically used topologies such as cube-connected cycles. In this thesis, the effect of the Cartesian product on broadcasting and broadcasting of hyper-cylinders under the Classical and Messy models is studied. This will add a valuable class of graphs to the limited classes of graphs which have a polynomially computable broadcast time. In the end, the relation between worst-case originators and diameters in trees is studied, which may help in the broadcast study of a larger class of graphs where any tree is allowed instead of a path in the Cartesian product
Broadcast CONGEST Algorithms against Adversarial Edges
We consider the corner-stone broadcast task with an adaptive adversary that
controls a fixed number of edges in the input communication graph. In this
model, the adversary sees the entire communication in the network and the
random coins of the nodes, while maliciously manipulating the messages sent
through a set of edges (unknown to the nodes). Since the influential work
of [Pease, Shostak and Lamport, JACM'80], broadcast algorithms against
plentiful adversarial models have been studied in both theory and practice for
over more than four decades. Despite this extensive research, there is no round
efficient broadcast algorithm for general graphs in the CONGEST model of
distributed computing. We provide the first round-efficient broadcast
algorithms against adaptive edge adversaries. Our two key results for -node
graphs of diameter are as follows:
1. For , there is a deterministic algorithm that solves the problem
within rounds, provided that the graph is 3
edge-connected. This round complexity beats the natural barrier of
rounds, the existential lower bound on the maximal length of edge-disjoint
paths between a given pair of nodes in . This algorithm can be extended to a
-round algorithm against adversarial edges in
edge-connected graphs.
2. For expander graphs with minimum degree of , there is
an improved broadcast algorithm with rounds against
adversarial edges. This algorithm exploits the connectivity and conductance
properties of G-subgraphs obtained by employing the Karger's edge sampling
technique.
Our algorithms mark a new connection between the areas of fault-tolerant
network design and reliable distributed communication.Comment: accepted to DISC2
Broadcasting in highly connected graphs
Throughout history, spreading information has been an important task. With computer networks expanding, fast and reliable dissemination of messages became a problem of interest for computer scientists. Broadcasting is one category of information dissemination that transmits a message from a single originator to all members of the network. In the past five decades the problem has been studied by many researchers and all have come to demonstrate that despite its easy definition, the problem of broadcasting does not have trivial properties and symmetries. For general graphs, and even for some very restricted classes of graphs, the question of finding the broadcast time and scheme remains NP-hard. This work uses graph theoretical concepts to explore mathematical bounds on how fast information can be broadcast in a network. The connectivity of a graph is a measure to assess how separable the graph is, or in other words how many machines in a network will have to fail to disrupt communication between all machines in the network.
We initiate the study of finding upper bounds on broadcast time b(G) in highly connected graphs. In particular, we give upper bounds on b(G) for k-connected graphs and graphs with a large minimum degree.
We explore 2-connected (biconnected) graphs and broadcasting in them. Using Whitney's open ear decomposition in an inductive proof we propose broadcast schemes that achieve an upper bound of ceil(n/2) for classical broadcasting as well as similar bounds for multiple originators. Exploring further, we use a matching-based approach to prove an upper bound of ceil(log(k)) + ceil(n/k) - 1 for all k-connected graphs. For many infinite families of graphs, these bounds are tight.
Discussion of broadcasting in highly connected graphs leads to an exploration of dependence between the minimum degree in the graph and the broadcast time of the latter. By using similar techniques and arguments we show that if all vertices of the graph are neighboring linear numbers of vertices, then information dissemination in the graph can be achieved in ceil(log(n)) + C time.
To the best of our knowledge, the bounds presented in our work are a novelty. Methods and questions proposed in this thesis open new pathways for research in broadcasting
Whalesong
Survival: the key is your desire to live -- O'Dowd speaks out: University needs to become more unified -- Eaglecrest on an uphill glide -- Diet critical for maintaining health -- Watergate: Then and now -- Editorial page -- Bruce Cockburn: The new age comes back to earth -- The Juneau body: what are the positive aspects? -- Whale b-ball schedule released -- Anders returns from six-week China journey -- Saturday night alive performers at Smith Hall -- U.S.A., Japan team up for summer of researc
- …