Distributed Computing in Sensor Systems : 6th IEEE International Conference, DCOSS 2010, Santa Barbara, CA, USA, June 21-23, 2010, Proceedings / / edited by Rajmohan Rajaraman, Thomas Moscibroda, Adam Dunkels, Anna Scaglione |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (XVII, 410 p. 152 illus.) |
Disciplina | 004.68 |
Collana | Computer Communication Networks and Telecommunications |
Soggetto topico |
Computer communication systems
Application software Algorithms Software engineering Information storage and retrieval Operating systems (Computers) Computer Communication Networks Information Systems Applications (incl. Internet) Algorithm Analysis and Problem Complexity Software Engineering Information Storage and Retrieval Operating Systems |
ISBN |
1-280-38717-3
9786613565099 3-642-13651-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Tables: A Spreadsheet-Inspired Programming Model for Sensor Networks -- Optimized Java Binary and Virtual Machine for Tiny Motes -- ZeroCal: Automatic MAC Protocol Calibration -- Programming Sensor Networks Using Remora Component Model -- Stateful Mobile Modules for Sensor Networks -- Design and Implementation of a Robust Sensor Data Fusion System for Unknown Signals -- Control Theoretic Sensor Deployment Approach for Data Fusion Based Detection -- Approximate Distributed Kalman Filtering for Cooperative Multi-agent Localization -- Thermal-Aware Sensor Scheduling for Distributed Estimation -- Decentralized Subspace Tracking via Gossiping -- Building (1????) Dominating Sets Partition as Backbones in Wireless Sensor Networks Using Distributed Graph Coloring -- On Multihop Broadcast over Adaptively Duty-Cycled Wireless Sensor Networks -- A Novel Mobility Management Scheme for Target Tracking in Cluster-Based Sensor Networks -- Suppressing Redundancy in Wireless Sensor Network Traffic -- Ensuring Data Storage Security against Frequency-Based Attacks in Wireless Networks -- Time-Critical Data Delivery in Wireless Sensor Networks -- MetroTrack: Predictive Tracking of Mobile Events Using Mobile Phones -- Mobile Sensor Network Localization in Harsh Environments -- AEGIS: A Lightweight Firewall for Wireless Sensor Networks -- Halo: Managing Node Rendezvous in Opportunistic Sensor Networks -- Optimal Data Gathering Paths and Energy Balance Mechanisms in Wireless Networks -- Programming Sensor Networks with State-Centric Services -- Fast Decentralized Averaging via Multi-scale Gossip -- Wormholes No More? Localized Wormhole Detection and Prevention in Wireless Networks -- Wireless Jamming Localization by Exploiting Nodes’ Hearing Ranges -- Self-stabilizing Synchronization in Mobile Sensor Networks with Covering -- Sensor Allocation in Diverse Environments -- Data Spider: A Resilient Mobile Basestation Protocol for Efficient Data Collection in Wireless Sensor Networks. |
Altri titoli varianti | DCOSS'10 |
Record Nr. | UNISA-996465844003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Proceedings of the 2010 ACM Workshop on Cognitive Radio Networks |
Autore | Chandra Ranveer |
Pubbl/distr/stampa | [Place of publication not identified], : ACM, 2010 |
Descrizione fisica | 1 online resource (38 pages) |
Collana | ACM Conferences |
Soggetto topico |
Electrical & Computer Engineering
Engineering & Applied Sciences Telecommunications |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Altri titoli varianti | Proceedings of the 2010 Association for Computing Machinery Workshop on Cognitive Radio Networks |
Record Nr. | UNINA-9910376002403321 |
Chandra Ranveer
![]() |
||
[Place of publication not identified], : ACM, 2010 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Proceedings of the 6th International Workshop on Foundations of Mobile Computing |
Autore | Richa Andrea |
Pubbl/distr/stampa | [Place of publication not identified], : ACM, 2010 |
Descrizione fisica | 1 online resource (95 pages) |
Collana | ACM Conferences |
Soggetto topico |
Engineering & Applied Sciences
Computer Science |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Altri titoli varianti | DIAL M-POMC'10 the sixth International Workshop on Foundations of Mobile Computing, Cambridge, MA, USA - September 16 - 16, 2010 |
Record Nr. | UNINA-9910376029903321 |
Richa Andrea
![]() |
||
[Place of publication not identified], : ACM, 2010 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Structural Information and Communication Complexity [[electronic resource] ] : 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers / / edited by Thomas Moscibroda, Adele A. Rescigno |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XX, 348 p. 53 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer networks Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer Communication Networks Discrete Mathematics in Computer Science Data Science |
ISBN | 3-319-03578-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Distributed Community Detection in Dynamic Graphs -- Exploration of the T -Interval-Connected Dynamic Graphs: The Case of the Ring -- A Characterization of Dynamic Networks Where Consensus Is Solvable -- Self-adjusting Grid Networks to Minimize Expected Path Length -- On Advice Complexity of the k-server Problem under Sparse Metrics -- Connected Surveillance Game -- Non-Additive Two-Option Ski Rental -- Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie -- A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations -- Self-organizing Flows in Social Networks -- Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters -- Influence Diffusion in Social Networks under Time Window Constraints -- Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications -- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery -- Maintaining Balanced Trees for Structured Distributed Streaming Systems -- Rendezvous of Two Robots with Constant Memory -- Pattern Formation by Mobile Robots with Limited Visibility -- Optimal Gathering of Oblivious Robots in Anonymous Graphs -- Probabilistic Connectivity Threshold for Directional Antenna Widths -- Broadcasting in Ad Hoc Multiple Access Channels -- Profit Maximization in Flex-Grid All-Optical Networks -- Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies -- Optimal Buffer Management for 2-Frame Throughput Maximization -- Dynamically Maintaining Shortest Path Trees under Batches of Updates -- Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems -- Steiner Problems with Limited Number of Branching Nodes -- Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs -- Maximum Distance Separable Codes Based on Circulant Cauchy Matrices. |
Record Nr. | UNISA-996465386903316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Structural Information and Communication Complexity : 20th International Colloquium, SIROCCO 2013, Ischia, Italy, July 1-3, 2013, Revised Selected Papers / / edited by Thomas Moscibroda, Adele A. Rescigno |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XX, 348 p. 53 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer networks Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Computer Communication Networks Discrete Mathematics in Computer Science Data Science |
ISBN | 3-319-03578-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Distributed Community Detection in Dynamic Graphs -- Exploration of the T -Interval-Connected Dynamic Graphs: The Case of the Ring -- A Characterization of Dynamic Networks Where Consensus Is Solvable -- Self-adjusting Grid Networks to Minimize Expected Path Length -- On Advice Complexity of the k-server Problem under Sparse Metrics -- Connected Surveillance Game -- Non-Additive Two-Option Ski Rental -- Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie -- A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations -- Self-organizing Flows in Social Networks -- Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters -- Influence Diffusion in Social Networks under Time Window Constraints -- Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications -- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery -- Maintaining Balanced Trees for Structured Distributed Streaming Systems -- Rendezvous of Two Robots with Constant Memory -- Pattern Formation by Mobile Robots with Limited Visibility -- Optimal Gathering of Oblivious Robots in Anonymous Graphs -- Probabilistic Connectivity Threshold for Directional Antenna Widths -- Broadcasting in Ad Hoc Multiple Access Channels -- Profit Maximization in Flex-Grid All-Optical Networks -- Measuring the Impact of Adversarial Errors on Packet Scheduling Strategies -- Optimal Buffer Management for 2-Frame Throughput Maximization -- Dynamically Maintaining Shortest Path Trees under Batches of Updates -- Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems -- Steiner Problems with Limited Number of Branching Nodes -- Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs -- Maximum Distance Separable Codes Based on Circulant Cauchy Matrices. |
Record Nr. | UNINA-9910483380003321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|