Related papers: Relay-Based Synchronization of Replicated Data Typ…
Collaborative working is increasingly popular, but it presents challenges due to the need for high responsiveness and disconnected work support. To address these challenges the data is optimistically replicated at the edges of the network,…
Opportunistic analysis has traditionally relied on independence assumptions that break down in many interesting and useful network topologies. This paper develops techniques that expand opportunistic analysis to a broader class of networks,…
Distributed storage systems employ replication to improve performance and reliability. To provide low latency data access, replicas are often required to accept updates without coordination with each other, and the updates are then…
The technique of cooperative communication has recently gained momentum in the research community; this technique utilizes the notion of relay, as an intermediate node between the source and the destination, to enhance the overall system…
Opportunistic network is a type of Delay Tolerant Network which is characterized by intermittent connectivity amongst the nodes and communication largely depends upon the mobility of the participating nodes. The network being highly…
Mobile multi-robot teams deployed for monitoring or search-and-rescue missions in urban disaster areas can greatly improve the quality of vital data collected on-site. Analysis of such data can identify hazards and save lives.…
***** This design is a duplicate of a Causal Length Set (see notes in the comments). We leave nonetheless the original paper here because the proofs are referred to in another submission.***** The 2P-Set Conflict-Free Replicated Data Type…
Finding a provably correct subquadratic synchronization algorithm for many filesystem replicas is one of the main theoretical problems in Operational Transformation (OT) and Conflict-free Replicated Data Types (CRDT) frameworks. Based on…
This paper develops a contention-based opportunistic feedback technique towards relay selection in a dense wireless network. This technique enables the forwarding of additional parity information from the selected relay to the destination.…
In this paper, we propose a new relaying protocol for large multihop networks combining the concepts of cooperative diversity and opportunistic relaying. The cooperative relaying protocol is based on two diversity mechanisms, incremental…
All 26 neural network merge strategies we tested including weight averaging, SLERP, TIES, DARE, Fisher merging, and evolutionary approaches -- fail the algebraic properties (commutativity, associativity, idempotency) required for…
An increasing number of mobile applications share location-dependent information, from collaborative applications and social networks to location-based games. For such applications, peer-to-peer architectures where mobile devices share…
User cooperation although improves performance of wireless systems, it requires incentives for the potential cooperating nodes to spend their energy acting as relays. Moreover, these potential relays are better informed than the source…
Chronofold is a replicated data structure for versioned text. It is designed for use in collaborative editors and revision control systems. Past models of this kind either retrofitted local linear orders to a distributed system (the OT…
WSNs can be considered a distributed control system designed to react to sensor information with an effective and timely action. For this reason, in WSNs it is important to provide real-time coordination and communication to guarantee…
Relay (or remote) synchronization between two not directly connected oscillators in a network is an important feature allowing distant coordination. In this work, we report a systematic study of this phenomenon in multiplex networks, where…
Relay selection enhances the performance of the cooperative networks by selecting the links with higher capacity. Meanwhile link adaptation improves the spectral efficiency of wireless data-centric networks through adapting the modulation…
Commutative Replicated Data-Type (CRDT) is a new class of algorithms that ensures scalable consistency of replicated data. It has been successfully applied to collaborative editing of texts without complex concurrency control. In this…
Rapidly Exploring Random Trees (RRT) is one of the most widely used algorithms for motion planning in the field of robotics. To reduce the exploration time, RRT-Connect was introduced where two trees are simultaneously formed and eventually…
Reliable low-latency communication is a key requirement for mission-critical and mobile autonomous systems, including teleoperation, autonomous navigation, and real-time uplink-dominant telemetry applications. While commercial 5G networks…