標(biāo)題: Titlebook: Algorithms for Sensor Systems; 9th International Sy Paola Flocchini,Jie Gao,Friedhelm Meyer auf der He Conference proceedings 2014 Springer [打印本頁] 作者: Iridescent 時(shí)間: 2025-3-21 16:36
書目名稱Algorithms for Sensor Systems影響因子(影響力)
書目名稱Algorithms for Sensor Systems影響因子(影響力)學(xué)科排名
書目名稱Algorithms for Sensor Systems網(wǎng)絡(luò)公開度
書目名稱Algorithms for Sensor Systems網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms for Sensor Systems被引頻次
書目名稱Algorithms for Sensor Systems被引頻次學(xué)科排名
書目名稱Algorithms for Sensor Systems年度引用
書目名稱Algorithms for Sensor Systems年度引用學(xué)科排名
書目名稱Algorithms for Sensor Systems讀者反饋
書目名稱Algorithms for Sensor Systems讀者反饋學(xué)科排名
作者: 蛙鳴聲 時(shí)間: 2025-3-21 21:36
Autonomous Mobile Robots: A Distributed Computing Perspective,, artificial intelligence, artificial life, robotics. Generally, in these areas, the problem is studied mostly from an empirical point of view..Recently, the study of what can be computed by such team of robots has become increasingly popular in theoretical computer science and especially in distrib作者: 機(jī)構(gòu) 時(shí)間: 2025-3-22 00:33
Token Dissemination in Geometric Dynamic Networks,ork (as introduced by Kuhn et?al. STOC 2010). In contrast to general dynamic networks, our dynamic networks are unit disk graphs, i.e., nodes are embedded into the Euclidean plane and two nodes are connected if and only if their distance is at most .. Our worst-case adversary is allowed to move the 作者: 新字 時(shí)間: 2025-3-22 07:59
The Wake Up Dominating Set Problem,close-by nodes. We model the wake-up range by the unit-disk graph. Such wake-up radio signals are very energy expensive and limited in range. Therefore, the number of signals must be minimized. So, we revisit the Connected Dominating Set (CDS) problem for unit-disk graphs and consider an online vari作者: 簡略 時(shí)間: 2025-3-22 08:44 作者: heterogeneous 時(shí)間: 2025-3-22 13:21 作者: meditation 時(shí)間: 2025-3-22 17:11 作者: 圍巾 時(shí)間: 2025-3-23 00:05 作者: 善于騙人 時(shí)間: 2025-3-23 02:35 作者: 消滅 時(shí)間: 2025-3-23 06:07 作者: Neutropenia 時(shí)間: 2025-3-23 10:32
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 時(shí)間: 2025-3-23 15:29
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作者: 墻壁 時(shí)間: 2025-3-23 20:45
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 時(shí)間: 2025-3-23 22:44
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作者: 假 時(shí)間: 2025-3-24 05:12
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 時(shí)間: 2025-3-24 08:17 作者: 領(lǐng)袖氣質(zhì) 時(shí)間: 2025-3-24 12:08
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 時(shí)間: 2025-3-24 17:33
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作者: 流浪者 時(shí)間: 2025-3-24 19:29 作者: 消息靈通 時(shí)間: 2025-3-25 00:18
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作者: 西瓜 時(shí)間: 2025-3-25 06:37
Counting in Anonymous Dynamic Networks: An Experimental Perspective,odes to the leader to converge to an exact count of the number of nodes having no knowledge on the dynamic network. Unfortunately . is an . counting algorithm, i.e., the algorithm eventually converges to the exact count but there is no node in the network that is able to detect when this happens. In作者: 遺產(chǎn) 時(shí)間: 2025-3-25 07:34 作者: 確認(rèn) 時(shí)間: 2025-3-25 14:25 作者: Visual-Field 時(shí)間: 2025-3-25 18:18 作者: angina-pectoris 時(shí)間: 2025-3-25 22:43
A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetrithm gives an .-approximation ratio and has a runtime bound of . where . is the diameter of the graph and . denotes the transmission ratio . with . and . being the maximum and minimum transmission range, respectively. Moreover, we apply our algorithm on the subgraph of disk graphs consisting of only 作者: 外面 時(shí)間: 2025-3-26 01:13
Optimal Nearest Neighbor Queries in Sensor Networks, approximation for . cost in the constant-doubling graph model, where . and ., respectively, are the number of nodes and the diameter of the network. We also give polylogarithmic approximations for both . and . cost in the general graph model. Our bounds are deterministic and hold in the worst-case.作者: micronutrients 時(shí)間: 2025-3-26 08:12 作者: TERRA 時(shí)間: 2025-3-26 08:46 作者: adroit 時(shí)間: 2025-3-26 13:31
https://doi.org/10.1007/978-3-662-02219-1connected clients, a client ., which bounds the maximum time that an active client is not transmitting to some base station, and a ., which bounds the minimum bandwidth that a client requires in each transmission. Under the model described, we study the problem of assigning clients to base stations 作者: 暗諷 時(shí)間: 2025-3-26 18:38
Das Arbeiten mit den Vorrichtungen, slots are required to simulate synchronized . algorithms in the SINR model of interference, where . is the diameter of the network. For our algorithms we assume location information to be given. Regarding the case without location information we argue that a deterministic algorithm to compute local作者: GEN 時(shí)間: 2025-3-26 23:45 作者: 反話 時(shí)間: 2025-3-27 02:03 作者: PATHY 時(shí)間: 2025-3-27 08:25 作者: neuron 時(shí)間: 2025-3-27 12:23
0302-9743 d in this volume were carefully reviewed and selected from 30 submissions. They deal with sensor network algorithms, wireless networks and distributed robotics algorithms; and experimental algorithms.978-3-642-45345-8978-3-642-45346-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: HARD 時(shí)間: 2025-3-27 14:59
https://doi.org/10.1007/978-3-662-01424-0ce-augmented algorithms for several variants of the problem. Among others, we show that the decision problem is NP-hard already for a single source, and we present a 2-approximation algorithm for the problem of finding the minimum energy that can be assigned to each agent such that the agents can deliver the data.作者: 遺產(chǎn) 時(shí)間: 2025-3-27 20:23
Aufgaben und Elemente der Vorrichtungen,roblem is fixed-parameter tractable (FPT) for such regions. Using our FPT algorithm, we show that if the regions are .-fat and their arrangement has bounded ply ., there is a .-approximation that runs in . time, where ..作者: 彩色的蠟筆 時(shí)間: 2025-3-27 22:10
Data Delivery by Energy-Constrained Mobile Agents,ce-augmented algorithms for several variants of the problem. Among others, we show that the decision problem is NP-hard already for a single source, and we present a 2-approximation algorithm for the problem of finding the minimum energy that can be assigned to each agent such that the agents can deliver the data.作者: VALID 時(shí)間: 2025-3-28 03:23
On the Complexity of Barrier Resilience for Fat Regions,roblem is fixed-parameter tractable (FPT) for such regions. Using our FPT algorithm, we show that if the regions are .-fat and their arrangement has bounded ply ., there is a .-approximation that runs in . time, where ..作者: 利用 時(shí)間: 2025-3-28 08:09
Das Arbeiten mit den Vorrichtungen,onary obstacles, we prove that it is NP-hard to decide whether a given initial configuration can be transformed into a desired target configuration. On the positive side, we provide constructive algorithms to design workspaces that efficiently implement arbitrary permutations between different configurations.作者: 易碎 時(shí)間: 2025-3-28 14:12
https://doi.org/10.1007/978-3-662-41823-9t that pebbles have eventually to be placed at: (i) a set of vertices that form a . subgraph of the . induced by ., say . (.), and (ii) a set of vertices that form a . of . (.). We will show that these two problems are actually hard to approximate, even for the seemingly simpler case in which the hop distance is considered.作者: COMMA 時(shí)間: 2025-3-28 16:37
https://doi.org/10.1007/978-3-662-01424-0te Gaussian measurement noise and the far field assumption is reasonable if the distance between transmitters and receivers is at least four times the distance between the receivers. In an indoor experiment using sound we reconstruct the microphone positions up to a mean error of 5?cm.作者: 和平 時(shí)間: 2025-3-28 21:13
https://doi.org/10.1007/978-3-662-00645-0uce a new generalization of cover-free families of sets, which may be of independent interest. We also show a separation between the class of fixed-schedule algorithms and the class of algorithms where nodes can choose to leave out some transmissions from their schedule.作者: pulse-pressure 時(shí)間: 2025-3-29 01:56 作者: anaerobic 時(shí)間: 2025-3-29 06:13 作者: AMEND 時(shí)間: 2025-3-29 10:33
Minimal Solvers for Unsynchronized TDOA Sensor Network Calibration,te Gaussian measurement noise and the far field assumption is reasonable if the distance between transmitters and receivers is at least four times the distance between the receivers. In an indoor experiment using sound we reconstruct the microphone positions up to a mean error of 5?cm.作者: LAY 時(shí)間: 2025-3-29 12:26 作者: Proponent 時(shí)間: 2025-3-29 18:47 作者: dyspareunia 時(shí)間: 2025-3-29 22:37 作者: effrontery 時(shí)間: 2025-3-30 00:21
https://doi.org/10.1007/978-3-662-01308-3investigations on the algorithmic limitations of what autonomous mobile robots can do with respect to different coordination problems, and overview the main research topics that are gaining attention in this area.作者: 騎師 時(shí)間: 2025-3-30 07:04 作者: 向下五度才偏 時(shí)間: 2025-3-30 10:24
https://doi.org/10.1007/978-3-662-41823-9e network around the POI with maximum radius in . steps, where . is the sum of the initial distances of the sensors from the POI. This significantly improves the previous bound on the coverage time. The theoretical results are also validated by simulations.作者: Incise 時(shí)間: 2025-3-30 13:40 作者: 飛鏢 時(shí)間: 2025-3-30 18:57 作者: Abduct 時(shí)間: 2025-3-30 22:02 作者: Stable-Angina 時(shí)間: 2025-3-31 04:27 作者: 大方不好 時(shí)間: 2025-3-31 07:30 作者: Harass 時(shí)間: 2025-3-31 11:48
Approximation Bounds for the Minimum ,-Storage Problem,. We then propose a local search algorithm which guarantees a constant approximation factor. We conducted extended experiments to show that the algorithm performs very well in many different scenarios. Further, we prove that the problem is not in . if we consider directed links, unless ..作者: 粗糙 時(shí)間: 2025-3-31 14:50
Uniform Dispersal of Asynchronous Finite-State Mobile Robots in Presence of Holes, uniformly fill the unknown space, avoiding any collisions, when endowed with only . bits of persistent memory and . visibility radius. Our protocols are asymptotically optimal in terms of visibility and memory requirements, and these results can be achieved without any direct means of communication among the robots.
