2,928 research outputs found
Separation of Circulating Tokens
Self-stabilizing distributed control is often modeled by token abstractions.
A system with a single token may implement mutual exclusion; a system with
multiple tokens may ensure that immediate neighbors do not simultaneously enjoy
a privilege. For a cyber-physical system, tokens may represent physical objects
whose movement is controlled. The problem studied in this paper is to ensure
that a synchronous system with m circulating tokens has at least d distance
between tokens. This problem is first considered in a ring where d is given
whilst m and the ring size n are unknown. The protocol solving this problem can
be uniform, with all processes running the same program, or it can be
non-uniform, with some processes acting only as token relays. The protocol for
this first problem is simple, and can be expressed with Petri net formalism. A
second problem is to maximize d when m is given, and n is unknown. For the
second problem, the paper presents a non-uniform protocol with a single
corrective process.Comment: 22 pages, 7 figures, epsf and pstricks in LaTe
Deterministic Secure Positioning in Wireless Sensor Networks
Properly locating sensor nodes is an important building block for a large
subset of wireless sensor networks (WSN) applications. As a result, the
performance of the WSN degrades significantly when misbehaving nodes report
false location and distance information in order to fake their actual location.
In this paper we propose a general distributed deterministic protocol for
accurate identification of faking sensors in a WSN. Our scheme does \emph{not}
rely on a subset of \emph{trusted} nodes that are not allowed to misbehave and
are known to every node in the network. Thus, any subset of nodes is allowed to
try faking its position. As in previous approaches, our protocol is based on
distance evaluation techniques developed for WSN. On the positive side, we show
that when the received signal strength (RSS) technique is used, our protocol
handles at most faking sensors. Also, when the
time of flight (ToF) technique is used, our protocol manages at most misbehaving sensors. On the negative side, we prove
that no deterministic protocol can identify faking sensors if their number is
. Thus our scheme is almost optimal with respect
to the number of faking sensors. We discuss application of our technique in the
trusted sensor model. More precisely our results can be used to minimize the
number of trusted sensors that are needed to defeat faking ones
Comparison of Two Self-organization and Hierarchical Routing Protocols for Ad Hoc Networks
International audienceIn this article, we compare two self-organization and hierarchical routing protocols for ad hoc networks. These two protocols apply the reverse approach from the classical one, since they use a reactive routing protocol inside the clusters and a proactive routing protocol between the clusters. We compare them regarding the cluster organization they provide and the routing that is then performed over it. This study gives an idea of the impact of the use of recursiveness and of the partition of the DHT on self-organization and hierarchical routing in ad hoc networks
Design and analysis of adaptive hierarchical low-power long-range networks
A new phase of evolution of Machine-to-Machine (M2M) communication has started where vertical Internet of Things (IoT) deployments dedicated to a single application domain gradually change to multi-purpose IoT infrastructures that service different applications across multiple industries. New networking technologies are being deployed operating over sub-GHz frequency bands that enable multi-tenant connectivity over long distances and increase network capacity by enforcing low transmission rates to increase network capacity. Such networking technologies allow cloud-based platforms to be connected with large numbers of IoT devices deployed several kilometres from the edges of the network. Despite the rapid uptake of Long-power Wide-area Networks (LPWANs), it remains unclear how to organize the wireless sensor network in a scaleable and adaptive way. This paper introduces a hierarchical communication scheme that utilizes the new capabilities of Long-Range Wireless Sensor Networking technologies by combining them with broadly used 802.11.4-based low-range low-power technologies. The design of the hierarchical scheme is presented in detail along with the technical details on the implementation in real-world hardware platforms. A platform-agnostic software firmware is produced that is evaluated in real-world large-scale testbeds. The performance of the networking scheme is evaluated through a series of experimental scenarios that generate environments with varying channel quality, failing nodes, and mobile nodes. The performance is evaluated in terms of the overall time required to organize the network and setup a hierarchy, the energy consumption and the overall lifetime of the network, as well as the ability to adapt to channel failures. The experimental analysis indicate that the combination of long-range and short-range networking technologies can lead to scalable solutions that can service concurrently multiple applications
Self-stabilizing k-clustering in mobile ad hoc networks
In this thesis, two silent self-stabilizing asynchronous distributed algorithms are given for constructing a k-clustering of a connected network of processes. These are the first self-stabilizing solutions to this problem. One algorithm, FLOOD, takes O( k) time and uses O(k log n) space per process, while the second algorithm, BFS-MIS-CLSTR, takes O(n) time and uses O(log n) space; where n is the size of the network. Processes have unique IDs, and there is no designated leader. BFS-MIS-CLSTR solves three problems; it elects a leader and constructs a BFS tree for the network, constructs a minimal independent set, and finally a k-clustering. Finding a minimal k-clustering is known to be NP -hard. If the network is a unit disk graph in a plane, BFS-MIS-CLSTR is within a factor of O(7.2552k) of choosing the minimal number of clusters; A lower bound is given, showing that any comparison-based algorithm for the k-clustering problem that takes o( diam) rounds has very bad worst case performance; Keywords: BFS tree construction, K-clustering, leader election, MIS construction, self-stabilization, unit disk graph
- …