Titlebook: Algorithms for Sensor Systems; 9th International Sy Paola Flocchini,Jie Gao,Friedhelm Meyer auf der He Conference proceedings 2014 Springer

Neutropenia

Counting in Anonymous Dynamic Networks: An Experimental Perspective,us dynamic networks, counting is far from being trivial as nodes have no identity and the knowledge about the network is limited to the local perception of the process itself. Moreover, nodes have to cope with continuous changes of the topology imposed by an external adversary. A relevant example of

granite

Station Assignment with Applications to Sensing, must periodically upload physiological data. Another example is participatory sensing, where communities of mobile device users upload periodically information about their environment. We assume that devices or sensors (generically called .) join and leave the system continuously, and they must upl

墻壁

On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model,h a schedule each node should be able to transmit one message to its neighbors. Our construction requires only . time slots, where . is the maximum node degree in the network and . the number of nodes. We prove that the length of the constructed schedule is asymptotically optimal, i.e. of length ..

Psa617

The Effect of Forgetting on the Performance of a Synchronizer,rpose of synchronizers is to maintain a virtual (discrete) round structure. Their idea essentially is to let processes continuously exchange round numbers and to allow a process to proceed to the next round only after it has witnessed that all processes have already started its own current round..In

假

On the Complexity of Barrier Resilience for Fat Regions, like to remove the minimum number of regions so that two fixed points can be connected without crossing any region. In this paper, we show that the problem is NP-hard when the regions are arbitrarily fat regions (even when they are axis-aligned rectangles of aspect ratio .). We also show that the p

PANT

領(lǐng)袖氣質(zhì)

Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes, autonomous and identical, they enter the space from a single point, and move in coordination with other robots, relying only on sensed local information within a restricted radius. The existing solutions for the problem require either the robots to be synchronous or the space to be without holes an

Outwit

On the Complexity of Fixed-Schedule Neighbourhood Learning in Wireless Ad Hoc Radio Networks,D from ., where .. In the ., each node . must produce a set . of IDs such that ID . if and only if . has a neighbour with ID .. We study the complexity of this task when it is assumed that each node fixes its entire transmission schedule at the start of the algorithm. We prove a .-slot lower bound o

流浪者

消息靈通

The Wake Up Dominating Set Problem,m uniform placements, this problem can be solved within a constant factor competitive ratio with high probability, i.e. ...For a restricted adversary with a reduced wake-up range of . we present a deterministic wake-up algorithm with a competitive ratio of . for the general problem in two dimensions