122,344 research outputs found
Computing on Anonymous Quantum Network
This paper considers distributed computing on an anonymous quantum network, a
network in which no party has a unique identifier and quantum communication and
computation are available. It is proved that the leader election problem can
exactly (i.e., without error in bounded time) be solved with at most the same
complexity up to a constant factor as that of exactly computing symmetric
functions (without intermediate measurements for a distributed and superposed
input), if the number of parties is given to every party. A corollary of this
result is a more efficient quantum leader election algorithm than existing
ones: the new quantum algorithm runs in O(n) rounds with bit complexity
O(mn^2), on an anonymous quantum network with n parties and m communication
links. Another corollary is the first quantum algorithm that exactly computes
any computable Boolean function with round complexity O(n) and with smaller bit
complexity than that of existing classical algorithms in the worst case over
all (computable) Boolean functions and network topologies. More generally, any
n-qubit state can be shared with that complexity on an anonymous quantum
network with n parties.Comment: 25 page
A Faster Counting Protocol for Anonymous Dynamic Networks
We study the problem of counting the number of nodes in a slotted-time
communication network, under the challenging assumption that nodes do not have
identifiers and the network topology changes frequently. That is, for each time
slot links among nodes can change arbitrarily provided that the network is
always connected. Tolerating dynamic topologies is crucial in face of mobility
and unreliable communication whereas, even if identifiers are available, it
might be convenient to ignore them in massive networks with changing topology.
Counting is a fundamental task in distributed computing since knowing the size
of the system often facilitates the design of solutions for more complex
problems. Currently, the best upper bound proved on the running time to compute
the exact network size is double-exponential. However, only linear complexity
lower bounds are known, leaving open the question of whether efficient Counting
protocols for Anonymous Dynamic Networks exist or not. In this paper we make a
significant step towards answering this question by presenting a distributed
Counting protocol for Anonymous Dynamic Networks which has exponential time
complexity. Our algorithm ensures that eventually every node knows the exact
size of the system and stops executing the algorithm. Previous Counting
protocols have either double-exponential time complexity, or they are
exponential but do not terminate, or terminate but do not provide running-time
guarantees, or guarantee only an exponential upper bound on the network size.
Other protocols are heuristic and do not guarantee the correct count
TP-DS: A Heuristic Approach for Traffic Pattern Discovery System in MANETās
As mobile ad hoc network (MANET) systems research has matured and several testbeds have been built to study MANETs, research has focused on developing new MANET applications such as collaborative games, collaborative computing, messaging systems, distributed security schemes, MANET middleware, peer-to-peer file sharing systems, voting systems, resource management and discovery, vehicular computing and collaborative education systems. Many techniques are proposed to enhance the anonymous communication in case of the mobile ad hoc networks (MANETs). However, MANETs are vulnerable under certain circumstances like passive attacks and traffic analysis attacks. Traffic analysis problem expose some of the methods and attacks that could infer MANETs are still weak under the passive attacks. In this Research, proposed āTraffic pattern Discovery System in MANETās, aheuristic approach(TP-DS) , enables a passive global adversary to accurately infer the traffic pattern in an anonymous MANET without compromising any node. TP-DS works well on existing on-demand anonymous MANET routing protocols to determine the source node, destination node and the end-to-end communication path. Detailed simulations show that TP-DS can infer the hidden traffic pattern with accuracy as high than the TP-DS and gives the result with accuracy of 95%.
DOI: 10.17762/ijritcc2321-8169.150310
Beeping a Maximal Independent Set
We consider the problem of computing a maximal independent set (MIS) in an
extremely harsh broadcast model that relies only on carrier sensing. The model
consists of an anonymous broadcast network in which nodes have no knowledge
about the topology of the network or even an upper bound on its size.
Furthermore, it is assumed that an adversary chooses at which time slot each
node wakes up. At each time slot a node can either beep, that is, emit a
signal, or be silent. At a particular time slot, beeping nodes receive no
feedback, while silent nodes can only differentiate between none of its
neighbors beeping, or at least one of its neighbors beeping.
We start by proving a lower bound that shows that in this model, it is not
possible to locally converge to an MIS in sub-polynomial time. We then study
four different relaxations of the model which allow us to circumvent the lower
bound and find an MIS in polylogarithmic time. First, we show that if a
polynomial upper bound on the network size is known, it is possible to find an
MIS in O(log^3 n) time. Second, if we assume sleeping nodes are awoken by
neighboring beeps, then we can also find an MIS in O(log^3 n) time. Third, if
in addition to this wakeup assumption we allow sender-side collision detection,
that is, beeping nodes can distinguish whether at least one neighboring node is
beeping concurrently or not, we can find an MIS in O(log^2 n) time. Finally, if
instead we endow nodes with synchronous clocks, it is also possible to find an
MIS in O(log^2 n) time.Comment: arXiv admin note: substantial text overlap with arXiv:1108.192
An anonymous inter-network routing protocol for the Internet of Things
With the diffusion of the Internet of Things (IoT), computing is becoming increasingly pervasive, and different heterogeneous networks are integrated into larger systems. However, as different networks managed by different parties and with different security requirements are interconnected, security becomes a primary concern. IoT nodes, in particular, are often deployed āin the openā, where an attacker can gain physical access to the device. As nodes can be deployed in unsurveilled or even hostile settings, it is crucial to avoid escalation from successful attacks on a single node to the whole network, and from there to other connected networks. It is therefore necessary to secure the communication within IoT networks, and in particular, maintain context information private, including the network topology and the location and identity of the nodes. In this paper, we propose a protocol achieving anonymous routing between different interconnected networks, designed for the Internet of Things and based on the spatial Bloom filter (SBF) data structure. The protocol enables private communication between the nodes through the use of anonymous identifiers, which hide their location and identity within the network. As routing information is encrypted using a homomorphic encryption scheme, and computed only in the encrypted domain, the proposed routing strategy preserves context privacy, preventing adversaries from learning the network structure and topology. This, in turn, significantly reduces their ability to gain valuable network information from a successful attacks on a single node of the network, and reduces the potential for attack escalation
Recommended from our members
Two Lower Bounds In Asynchronous Distributed Computation
We introduce new techniques for deriving lower bounds on the message complexity in asynchronous distributed computation. These techniques combine the choice of specific patterns of communication delays and crossing sequence arguments with consideration of the speed of propagation of messages, together with careful counting of messages in different parts of the network. They enable us to prove the following results, settling two open problems: An ĆĀ©(n log* n) lower bound for the number of messages sent by an asynchronous algorithm for computing any nonconstant function on a bidirectional ring of n anonymous processors. An ĆĀ©(n log n) lower bound for the average number of messages sent by any maximum finding algorithm on a ring of n processors, in case n is known
Mobile Edge Computing Platform Deployment in 4G LTE Networks: A Middlebox Approach
This paper has been presented at : USENIX Workshop on Hot Topics in Edge Computing (Hot Edge '18)Low-latency demands for cellular networks have at-tracted much attention. Mobile edge computing (MEC), which deploys a cloud computing platform at the edge closer to mobile users, has been introduced as an enabler of low-latency performance in 4G and 5G networks. In this paper, we propose an MEC platform deployment so-lution in 4G LTE networks using a middlebox approach. It is standard-compliant and transparent to existing cel-lular network components, so they need not be modiļ¬ed. The MEC middlebox sits on the S1 interface, which con-nects an LTE base station to its core network, and does trafļ¬c ļ¬ltering, manipulation and forwarding. It enables the MEC service for mobile users by hosting application servers. Such middlebox approach can save deployment cost and be easy to install. It is different from other stud-ies that require modiļ¬cations on base stations or/and core networks. We have conļ¬rmed its viability through a pro-totype based on the OpenAirInterface cellular platform.We thank our shepherd Weisong Shi for his help, and also thank the anonymous reviewers for their valuable comments on improving this paper. This work was partially supported by the Ministry of Science and Technology, Taiwan, under grant numbers 106-2622-8-009-017 and 106-2218-E-009-018, and by the H2020 collaborative Europe/Taiwan research project 5G-CORAL (grant number 761586)
- ā¦