標(biāo)題: Titlebook: Algorithms for Sensor Systems; 6th International Wo Christian Scheideler Conference proceedings 2010 Springer Berlin Heidelberg 2010 algori [打印本頁] 作者: ODDS 時(shí)間: 2025-3-21 17:15
書目名稱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:24
https://doi.org/10.1007/978-3-662-41825-3 and angles between three network nodes can be inferred..The approach is tested in numerous simulations and in indoor and outdoor settings where the relative positions of mobile devices are determined utilizing only the sound produced by assistants with noisemakers.作者: 輕觸 時(shí)間: 2025-3-22 01:41 作者: Phonophobia 時(shí)間: 2025-3-22 07:25 作者: 威脅你 時(shí)間: 2025-3-22 11:55 作者: 一條卷發(fā) 時(shí)間: 2025-3-22 15:27
Virtual Raw Anchor Coordinates: A New Localization Paradigm,duce multi-dimensional coordinates. We prove that the image of the physical two-dimensional Euclidean space is a two-dimensional surface, and we show that it is possible to adapt geographic routing strategies on this surface, simply, efficiently and successfully.作者: 報(bào)復(fù) 時(shí)間: 2025-3-22 19:14
Das Arbeiten mit den Vorrichtungen, in the sense that (i) it ensures the planarity of the whole spanner while previous algorithms ensure only the planarity of a backbone subgraph; (ii) the hop stretch factor of our spanner is significantly smaller.作者: superfluous 時(shí)間: 2025-3-22 22:21
https://doi.org/10.1007/978-3-662-40185-9ast ..Our bounds close the previously known gap of upper and lower bounds for square grids. Moreover, our lower bound is . for 3?≤?.?≤?18, which matches a naive upper bound within a constant term for ..作者: 錯(cuò) 時(shí)間: 2025-3-23 02:18
https://doi.org/10.1007/978-3-642-88680-5al number of nodes in the system nor on a common startup time. Additionally, we introduce a condition on mobility that is sufficient to ensure the existence of the paths required by our RCLE algorithm.作者: LVAD360 時(shí)間: 2025-3-23 07:12 作者: GEON 時(shí)間: 2025-3-23 09:50 作者: 作繭自縛 時(shí)間: 2025-3-23 16:15 作者: 有組織 時(shí)間: 2025-3-23 19:06
Das Arbeiten mit den Vorrichtungen,rmed and repaired. Hence it is a suitable interconnection model for an ad hoc wireless network. Our structure has expected constant degree, diameter logarithmic in the size of the set and good spanner-like properties in a probabilistic sense.作者: fertilizer 時(shí)間: 2025-3-24 02:03
Aufgaben und Elemente der Vorrichtungen,igh average connectivity. The algorithm scales well to large and sparse networks with complex topologies and outperforms previous algorithms when the noise levels are high. The algorithm is simple to implement and is available, along with source code, executables, and experimental results, at ..作者: esculent 時(shí)間: 2025-3-24 03:08
Brief Announcement: Hierarchical Neighbor Graphs: A Sparse Connected Structure for Euclidean Point rmed and repaired. Hence it is a suitable interconnection model for an ad hoc wireless network. Our structure has expected constant degree, diameter logarithmic in the size of the set and good spanner-like properties in a probabilistic sense.作者: GLIB 時(shí)間: 2025-3-24 07:05 作者: 共同給與 時(shí)間: 2025-3-24 11:15 作者: monochromatic 時(shí)間: 2025-3-24 17:23 作者: 小木槌 時(shí)間: 2025-3-24 19:00
https://doi.org/10.1007/978-3-662-40185-9uniform power assignment and can be implemented online. We also compare the model of atomic multicasts (where all receivers of a multicast must receive the transmission in the same round) to the model of splittable multicasts (where a multicast sender can transmit in several rounds, each time servin作者: Kidney-Failure 時(shí)間: 2025-3-24 23:13
https://doi.org/10.1007/978-3-662-41827-7teady state, which is asymptotically optimal in terms of energy and time efficiency. As a by-product, a protocol for the synchronization of a Sensor Network is also proposed. Furthermore, the protocols are resilient to an arbitrary node power-up schedule and a general node failure model.作者: Acquired 時(shí)間: 2025-3-25 04:25
Aufgaben und Elemente der Vorrichtungen,sion trees can ”count” rather effectively. Specifically, we show that zero-error 2. decision trees can compute the threshold-of-. symmetric function with .(.) expected queries (and that Ω(.) is a lower bound even for two-sided error 2. decision trees). Interestingly, this feature is not shared by 1.作者: 嫌惡 時(shí)間: 2025-3-25 10:12
Scheduling Multicast Transmissions under SINR Constraints,uniform power assignment and can be implemented online. We also compare the model of atomic multicasts (where all receivers of a multicast must receive the transmission in the same round) to the model of splittable multicasts (where a multicast sender can transmit in several rounds, each time servin作者: Alpha-Cells 時(shí)間: 2025-3-25 12:59
Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks,teady state, which is asymptotically optimal in terms of energy and time efficiency. As a by-product, a protocol for the synchronization of a Sensor Network is also proposed. Furthermore, the protocols are resilient to an arbitrary node power-up schedule and a general node failure model.作者: CLOUT 時(shí)間: 2025-3-25 19:47
,, Decision Trees,sion trees can ”count” rather effectively. Specifically, we show that zero-error 2. decision trees can compute the threshold-of-. symmetric function with .(.) expected queries (and that Ω(.) is a lower bound even for two-sided error 2. decision trees). Interestingly, this feature is not shared by 1.作者: 溫室 時(shí)間: 2025-3-25 23:15 作者: 邊緣帶來墨水 時(shí)間: 2025-3-26 03:24 作者: FLEET 時(shí)間: 2025-3-26 05:59 作者: 苦惱 時(shí)間: 2025-3-26 12:21
Algorithms for Sensor Systems978-3-642-16988-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Acetabulum 時(shí)間: 2025-3-26 15:54
0302-9743 Overview: 978-3-642-16987-8978-3-642-16988-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: incision 時(shí)間: 2025-3-26 17:07 作者: Lucubrate 時(shí)間: 2025-3-27 00:26
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153236.jpg作者: CORD 時(shí)間: 2025-3-27 01:09
https://doi.org/10.1007/978-3-662-01256-7present a very simple . algorithm that, given ., constructs a subgraph of . of degree at most 11 that is a geometric spanner of . with stretch factor 2.86, and hence a geometric spanner of . with stretch factor
作者: 爭論 時(shí)間: 2025-3-27 09:04
Das Arbeiten mit den Vorrichtungen,≤?1. The problem of constructing planar spanners of Unit Disk Graphs with respect to the Euclidean distance has received considerable attention from researchers in computational geometry and ad-hoc wireless networks. In this paper, we present an algorithm that, given a set . of terminals in the plan作者: 分貝 時(shí)間: 2025-3-27 11:51
Das Arbeiten mit den Vorrichtungen,neighbor graphs. The structure has a flavor of hierarchical clustering and requires only local knowledge and minimal computation at each node to be formed and repaired. Hence it is a suitable interconnection model for an ad hoc wireless network. Our structure has expected constant degree, diameter l作者: Ptosis 時(shí)間: 2025-3-27 16:49 作者: AROMA 時(shí)間: 2025-3-27 20:55 作者: placebo-effect 時(shí)間: 2025-3-27 22:27 作者: 遠(yuǎn)地點(diǎn) 時(shí)間: 2025-3-28 04:52 作者: 調(diào)整 時(shí)間: 2025-3-28 07:46
https://doi.org/10.1007/978-3-642-88680-5sly-changing environment of mobile ad-hoc networks. We assume that mobile nodes can fail by crashing, and might enter or exit the region of interest at any time. We require the existence of certain paths which ensures a bound on the time for propagation of information within the region. We present a作者: endarterectomy 時(shí)間: 2025-3-28 10:46 作者: 談判 時(shí)間: 2025-3-28 15:22 作者: 知識(shí) 時(shí)間: 2025-3-28 20:21 作者: photopsia 時(shí)間: 2025-3-29 00:08
Aufgaben und Elemente der Vorrichtungen,or nearby sensors. The algorithm is anchor-free and does not require particular network topology, rigidity of the underlying communication graph, or high average connectivity. The algorithm scales well to large and sparse networks with complex topologies and outperforms previous algorithms when the 作者: CLAMP 時(shí)間: 2025-3-29 05:03
https://doi.org/10.1007/978-3-662-41825-3niques are dependent on hardware that is sometimes unavailable (e.g. GPS), or on sophisticated virtual localization calculus which have a costly overhead..Instead of actually localizing nodes in the physical two-dimensional Euclidean space, we use directly the raw distance to a set of anchors to pro作者: Atmosphere 時(shí)間: 2025-3-29 10:59 作者: FECK 時(shí)間: 2025-3-29 11:46
Improved Local Algorithms for Spanner Construction,present a very simple . algorithm that, given ., constructs a subgraph of . of degree at most 11 that is a geometric spanner of . with stretch factor 2.86, and hence a geometric spanner of . with stretch factor
作者: Ingredient 時(shí)間: 2025-3-29 16:45 作者: 貴族 時(shí)間: 2025-3-29 21:02
Brief Announcement: Hierarchical Neighbor Graphs: A Sparse Connected Structure for Euclidean Point neighbor graphs. The structure has a flavor of hierarchical clustering and requires only local knowledge and minimal computation at each node to be formed and repaired. Hence it is a suitable interconnection model for an ad hoc wireless network. Our structure has expected constant degree, diameter l作者: 我怕被刺穿 時(shí)間: 2025-3-30 02:15 作者: 抱狗不敢前 時(shí)間: 2025-3-30 07:59
Scheduling Multicast Transmissions under SINR Constraints,cently. While previous work has considered the unicast case where each transmission has one sender and one receiver, we consider the setting of multicast requests where each transmission has one sender and a set of receivers. A set of multicast transmissions can be scheduled in the same round if the作者: indoctrinate 時(shí)間: 2025-3-30 08:29
Deterministic Recurrent Communication and Synchronization in Restricted Sensor Networks, of such infrastructure, the delay between any two consecutive communications should be minimized. The problem is challenging because, in a restricted Sensor Network, the communication is carried out through a single and shared radio channel without collision detection. Dealing with collisions is cr作者: pericardium 時(shí)間: 2025-3-30 15:22
