Citation Context

...yet: What is the highest ratio of failures that can be tolerated with a constant 10number of communication rounds, while still providing linearizability and always terminating. Several papers, e.g., =-=[15, 18, 25]-=-, attempt to port the simulation to modern network technologies, which are more ad-hoc and contain mobile nodes, and to sensor networks. The dynamic nature of these systems means these algorithms have...

Citation Context

... Data Gathering After the dissemination of data to the network, a mobile sink placed at a random position visits the node at this position and then chooses the next position to visit, as described in =-=[6]-=-. When visiting a node, the sink gathers all data stored at this node. This procedure continues until all nodes have been visited. Fig. 4.3.1 shows the aggregated number of collected IDs (representing...

Citation Context

...gy cannot be controlled. Hence, maintaining a logical topology that differs from the physical one requires expensive routing. A probabilistic quorums approach to location services has been studied in =-=[13]-=-. In particular, several approaches to implementing probabilistic quorums have been investigated and analyzed both theoretically and by simulations. All the approaches in [13] require a replication le...

Citation Context

...nce of a content-location service that nodes 3A graph is regular if each of its vertices has the same number of neighbors. can access to obtain the identity of the closest content replica (see, e.g., =-=[15]-=- and references therein). A query for the closest replica node is then propagated using sequence numbers to detect and discard duplicate queries, as well as an applicationdriven broadcast that optimal...

Citation Context

...ased approach gets a high performance in terms of representativeness: it only requires the visit of any 2.3 √ n nodes to collect information from about 90% of the nodes (as implied by the analysis of =-=[6]-=- and results from [14]). Nevertheless, this is achieved at the expense of generating a high communication overhead, i.e. O(n2 √ n) point-to-point messages. A lower communication overhead can be obtain...

Citation Context

...enerates queries for that item is λ=0.01 requests/s. Also, we assume the presence of a content-location service that nodes can access to obtain the identity of the closest content replica (see, e.g., =-=[11]-=- and references therein). A query for the closest replica node is then propagated using sequence numbers to detect and discard duplicate queries, as well as an application-driven broadcast that optima...

Citation Context

...ased approach gets a high performance in terms of representativeness: it only requires the visit of any 2.3 √ n nodes to collect information from about 90% of the nodes (as implied by the analysis of =-=[6]-=- and results from [14]). Nevertheless, this is achieved at the expense of generating a high communication overhead, i.e. O(n 2√ n) point-to-point messages. A lower communication overhead can be obtain...

Citation Context

...ng and disseminating overhead and have been improved by reducing the traffic overhead to O(n 1.5 ) when every node exchanges its link state table with only O( √ n) nodes selected by the quorum system =-=[12]-=-. The improved approach ensures that for every node pair there exists at least one rendezvous node that receives the link state tables from both members of that node pair; hence, the best backup path ...