Theoretical Aspects of Distributed Computing in Sensor Networks
Wireless ad hoc sensor networks has recently become a very active research subject. This book presents high-quality contributions by leading experts worldwide on the key algorithmic and complexity-theoretic aspects of wireless sensor networks.
Saved in:
| Main Authors | , |
|---|---|
| Format | eBook Book |
| Language | English |
| Published |
Berlin, Heidelberg
Springer Nature
2011
Springer Springer Berlin / Heidelberg Springer Berlin Heidelberg |
| Edition | 1 |
| Series | Monographs in Theoretical Computer Science. An EATCS Series |
| Subjects | |
| Online Access | Get full text |
| ISBN | 9783642148491 3642148492 3642148484 9783642148484 |
| ISSN | 1431-2654 |
| DOI | 10.1007/978-3-642-14849-1 |
Cover
| Abstract | Wireless ad hoc sensor networks has recently become a very active research subject. This book presents high-quality contributions by leading experts worldwide on the key algorithmic and complexity-theoretic aspects of wireless sensor networks. |
|---|---|
| AbstractList | Wireless ad hoc sensor networks has recently become a very active research subject. This book presents high-quality contributions by leading experts worldwide on the key algorithmic and complexity-theoretic aspects of wireless sensor networks. Wireless ad hoc sensor networks has recently become a very active research subject. Achieving efficient, fault-tolerant realizations of very large, highly dynamic, complex, unconventional networks is a real challenge for abstract modelling, algorithmic design and analysis, but a solid foundational and theoretical background seems to be lacking. This book presents high-quality contributions by leading experts worldwide on the key algorithmic and complexity-theoretic aspects of wireless sensor networks. The intended audience includes researchers and graduate students working on sensor networks, and the broader areas of wireless networking and distributed computing, as well as practitioners in the relevant application areas. The book can also serve as a text for advanced courses and seminars. |
| Author | Nikoletseas, Sotiris Rolim, José D. P |
| Author_xml | – sequence: 1 fullname: Nikoletseas, Sotiris – sequence: 2 fullname: Rolim, José D. P |
| BackLink | https://cir.nii.ac.jp/crid/1130000796191253632$$DView record in CiNii |
| BookMark | eNqN0UtP3DAQAGCjAuoW9gdwi6pKqIeAx8_4VNGFFiQEh6JeLTtx2HRDHGxv-fs4Gy7tCR9sefTNjB-f0P7gB4fQCeAzwFieK1mVtBSMlMAqpkrYQ8scozmyC8CH__b7aAGMQkkEZ4doITFQoUCpj2gZ4x-cB5NC8mqBvj2snQ8udbXpi4s4ujrFwrfFZRdT6Ow2uaZY-adxm7rhseiG4pcbog_FnUsvPmziMTpoTR_d8m09Qr9_XD2srsvb-583q4vb0jDCOS8ltxJa1aiWq9wdC8aJsIrWnAAoyxtrVNMQXjfCAsOECsuJqjHmbWtbyukR-joXNnHjXuLa9ynqv72z3m-i_uf22Z7PNo4hH9sFPSvAenrPSWuqs9e7BD1lnM4ZY_DPWxeT3hWu3ZCC6fXV95WgAATLd0jOpaAVfoekWAiKp-5fZjl0na67aQag0zdJJUAB4VRQktnnmdUmmj4z_eQH_xjMuI46k6rKr_AKmuqgTg |
| ContentType | eBook Book |
| Copyright | Springer-Verlag Berlin Heidelberg 2011 |
| Copyright_xml | – notice: Springer-Verlag Berlin Heidelberg 2011 |
| DBID | I4C RYH |
| DEWEY | 004 |
| DOI | 10.1007/978-3-642-14849-1 |
| DatabaseName | Casalini Torrossa eBooks Institutional Catalogue CiNii Complete |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science Engineering |
| EISBN | 9783642148491 3642148492 |
| Edition | 1 2011 edition. |
| Editor | Nikoletseas, Sotiris Rolim, José D.P |
| Editor_xml | – sequence: 1 fullname: Nikoletseas, Sotiris – sequence: 2 fullname: Rolim, José D.P |
| ExternalDocumentID | 9783642148491 191931 EBC6311207 EBC5576380 EBC3066301 BB04713120 5368878 |
| GroupedDBID | -T. .~Z 089 0D6 0DA 0E8 38. A4J AABBV AAINA AAJYQ AAMFE AATVQ ABBUY ABCYT ABFCV ABMNI ACDTA ACDUY AECAB AECMQ AEGQK AEHEY AEJLV AEKFX AETDV AEZAY AHNNE ALMA_UNASSIGNED_HOLDINGS ANXAN ATJMZ AZZ BBABE C9S C9V CZZ I4C IEZ JJU SBO TCUKC TPJZQ UZ6 Z7R Z7U Z7X Z7Z Z81 Z83 Z84 Z85 Z88 RYH |
| ID | FETCH-LOGICAL-a42555-75b71f9d9f59004064526b93c52119b5dba9dd25cd6b140236b529c005ffbf353 |
| ISBN | 9783642148491 3642148492 3642148484 9783642148484 |
| ISSN | 1431-2654 |
| IngestDate | Tue Sep 09 06:53:15 EDT 2025 Tue Jul 29 20:32:39 EDT 2025 Fri May 30 21:36:03 EDT 2025 Fri May 30 23:54:50 EDT 2025 Tue Sep 09 06:56:29 EDT 2025 Thu Jun 26 21:19:44 EDT 2025 Tue Sep 09 07:04:09 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum_Ident | Q |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a42555-75b71f9d9f59004064526b93c52119b5dba9dd25cd6b140236b529c005ffbf353 |
| Notes | Includes bibliographical references |
| OCLC | 701369199 707188941 |
| PQID | EBC3066301 |
| PageCount | 904 |
| ParticipantIDs | askewsholts_vlebooks_9783642148491 springer_books_10_1007_978_3_642_14849_1 proquest_ebookcentral_EBC6311207 proquest_ebookcentral_EBC5576380 proquest_ebookcentral_EBC3066301 nii_cinii_1130000796191253632 casalini_monographs_5368878 |
| PublicationCentury | 2000 |
| PublicationDate | 2011 c2011 2011-01-15 |
| PublicationDateYYYYMMDD | 2011-01-01 2011-01-15 |
| PublicationDate_xml | – year: 2011 text: 2011 |
| PublicationDecade | 2010 |
| PublicationPlace | Berlin, Heidelberg |
| PublicationPlace_xml | – name: Netherlands – name: Berlin – name: Berlin/Heidelberg – name: Berlin, Heidelberg |
| PublicationSeriesTitle | Monographs in Theoretical Computer Science. An EATCS Series |
| PublicationSeriesTitleAlternate | Monographs Theoret.Computer Science (formerly:EATCS) |
| PublicationYear | 2011 |
| Publisher | Springer Nature Springer Springer Berlin / Heidelberg Springer Berlin Heidelberg |
| Publisher_xml | – name: Springer Nature – name: Springer – name: Springer Berlin / Heidelberg – name: Springer Berlin Heidelberg |
| SSID | ssj0000476758 ssib002801809 |
| Score | 1.9637886 |
| Snippet | Wireless ad hoc sensor networks has recently become a very active research subject. This book presents high-quality contributions by leading experts worldwide... Wireless ad hoc sensor networks has recently become a very active research subject. Achieving efficient, fault-tolerant realizations of very large, highly... |
| SourceID | askewsholts springer proquest nii casalini |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Communications Engineering, Networks Computer Science Computer Systems Organization and Communication Networks Data processing Data processing Computer science Mobile computing Multisensor data fusion Sensor networks Sensor networks-Data processing Theory of Computation |
| TableOfContents | 3.3.1 One Antenna Per Sensor -- 3.3.2 Two Antennae Per Sensor -- 3.4 Sum of Angles of Antennae -- 3.4.1 Further Questions and Open Problems -- 3.5 Orienting Planar Spanners -- 3.5.1 Basic Construction -- 3.6 Conclusion -- References -- 4 Optimal Placement of Ad Hoc Devices Under a VCG-Style Routing Protocol -- Peter Widmayer, Luzi Anderegg, Stephan Eidenbenz, and Leon Peeters -- 4.1 Introduction -- 4.1.1 Model and Notation -- 4.1.2 The Device Placement Problem -- 4.1.3 Related Work -- 4.2 Placing Multiple Identical Devices for a Single Commodity -- 4.2.1 The Optimal Position of a Single Additional Device -- 4.2.2 Multiple Identical Devices -- 4.3 Single Device Placement for Multiple Commodities -- 4.3.1 Single Maximization Diagram Approach -- 4.3.2 Multiple Maximization Diagrams Approach -- 4.4 Placing Multiple Individual Devices for a Single Commodity -- 4.5 Placing Multiple Devices for Multiple Commodities -- 4.5.1 Set Devices -- 4.5.2 Element Devices -- 4.5.3 Global Destination Device -- 4.5.4 Element-Set Chain Devices -- 4.5.5 Set-Destination Chain Devices -- References -- 5 Population Protocols and Related Models -- Paul G. Spirakis -- 5.1 Introduction -- 5.2 Population Protocols -- 5.2.1 The Model -- 5.2.2 Stable Computation -- 5.3 Mediated Population Protocols -- 5.3.1 Formal Definition -- 5.3.2 Computational Power -- 5.4 The GDM Model -- 5.4.1 Formal Definition -- 5.4.2 Weakly Connected Graphs -- 5.4.3 All Possible Directed Graphs -- 5.5 Community Protocols -- 5.5.1 The Model -- 5.5.2 Computational Power -- 5.6 Logarithmic Space Machines -- 5.7 Algorithmic Verification of Population Protocols -- 5.7.1 Necessary Definitions -- 5.7.2 NP-Hardness Results -- 5.7.3 An Efficiently Solvable Special Case -- 5.7.4 Algorithmic Solutions for BPVER -- 5.8 Open Problems -- References Intro -- Foreword -- Preface -- Contents -- Contributors -- Part I Challenges for Wireless Sensor Networks -- 1 Composition and Scaling Challenges in Sensor Networks: An Interaction-Centric View -- T. Abdelzaher -- 1.1 Introduction -- 1.2 Functional Interactions -- 1.2.1 Troubleshooting Interactive Complexity -- 1.2.2 Troubleshooting Examples -- 1.3 Data Interactions -- 1.3.1 Privacy and Data Aggregation -- 1.3.2 Perturbation Examples and Time-Series Data -- 1.4 Temporal Interactions -- 1.4.1 Temporal Analysis of Distributed Systems -- 1.4.2 Reduction-Based Analysis and Delay Composition Algebra -- 1.5 Interactions of System Dynamics -- 1.5.1 Sources of Dynamics in Software -- 1.5.2 Examples of Dynamic Interactions -- 1.6 Summary -- References -- Part II Models, Topology, Connectivity -- 2 Scheduling and Power Assignments in the Physical Model -- Alexander Fanghänel and Berthold Vöcking -- 2.1 Introduction -- 2.1.1 Outline -- 2.2 Notation and Preliminaries -- 2.2.1 Robustness of the Physical Model -- 2.3 Scheduling with the Linear Power Assignment -- 2.3.1 Measure of Interference and Lower Bounds -- 2.3.2 Upper Bounds for the Linear Power Assignment -- 2.4 Scheduling with the Square Root Power Assignment -- 2.4.1 Scheduling Directed Requests -- 2.4.2 Scheduling Bidirectional Requests -- 2.5 The Gap of Oblivious Power Schemes -- 2.6 Summary and Open Problems -- References -- 3 Maintaining Connectivity in Sensor Networks Using Directional Antennae -- Evangelos Kranakis, Danny Krizanc, and Oscar Morales -- 3.1 Introduction -- 3.1.1 Antenna Orientation Problem -- 3.1.2 Preliminaries and Notation -- 3.1.3 Related Work -- 3.1.4 Outline of the Presentation -- 3.2 Orienting the Sensors of a Point Set -- 3.2.1 Sensors with One Antenna -- 3.2.2 Sensors with Multiple Antennae -- 3.3 Lower Bounds 8.6 Estimating Nodal Skews -- 8.7 Properties of the Least-Squares Solution -- 8.8 The Distributed Spatial Smoothing Algorithm Based on Coordinate Descent -- 8.9 Convergence Analysis of the Spatial Smoothing Algorithm -- 8.10 Decomposition Techniques to Speed Up Convergence -- 8.11 Conclusion -- References -- 9 Algorithmic Aspects of Sensor Localization -- Sajal K. Das, Jing Wang, R.K. Ghosh, and Rupert Reiger -- 9.1 Introduction -- 9.1.1 Importance of Localization -- 9.1.2 Generic Approach to Solution -- 9.1.3 Known Algorithmic Approaches -- 9.1.4 Inherent Challenges -- 9.1.5 Chapter Organization -- 9.2 Range-Free Localization -- 9.2.1 Anchor-Based Approaches -- 9.2.2 Anchor-Free Approaches -- 9.3 Range-Based Localization -- 9.3.1 Range Measurements -- 9.3.2 Localization Problems Using Range Measurements -- 9.3.3 Anchor-Based Approaches -- 9.3.4 Anchor-Free Approaches -- 9.4 Techniques with Additional Hardware -- 9.4.1 Angle Measurement -- 9.4.2 Localization with Angle Measurement -- 9.5 Techniques Based on Iterative Process -- 9.6 Mobility-Assisted Localization -- 9.7 Statistical Techniques -- 9.8 Summary on Localization Techniques -- 9.8.1 Localization Accuracy -- 9.8.2 Computation and Communication Costs -- 9.8.3 Network and Anchors Density -- 9.8.4 Summary of Performances -- 9.9 Open Issues -- 9.10 Conclusions -- References -- 10 Spatio-temporal Context in Wireless Sensor Networks -- Anahit Martirosyan and Azzedine Boukerche -- 10.1 Introduction -- 10.1.1 What Is Context? -- 10.2 Node Localization in WSNs -- 10.2.1 The Task of Localization Algorithms for WSNs -- 10.2.2 Estimation of Distances and Angles -- 10.2.3 Trilateration -- 10.2.4 Multilateration -- 10.2.5 Localization Algorithms for WSNs -- 10.3 Temporal Event Ordering in WSNs -- 10.3.1 Delaying Techniques -- 10.3.2 Heartbeat 10.3.3 Temporal Message Ordering Scheme -- 10.3.4 Ordering by Confirmation -- 10.3.5 An Efficient Algorithm for Preserving Events' Temporal Relationships in Wireless Sensor Actor Networks -- 10.3.6 Comparison of Features of the Temporal Event Ordering Algorithms -- 10.4 Time Synchronization in WSNs -- 10.4.1 Time Synchronization Techniques -- 10.4.2 Synchronization Algorithms for WSNs -- 10.4.3 Comparison of Features of the Time Synchronization Algorithms -- 10.5 Summary -- References -- 11 Coordination Problems in Ad Hoc Radio Networks -- Dariusz R. Kowalski -- 11.1 Introduction -- 11.1.1 Model and Problems -- 11.1.2 Results -- 11.2 Wake-Up on a Multiple-Access Channel -- 11.2.1 Deterministic Synchronization -- 11.2.2 Randomized Synchronization -- 11.2.3 Explicit Constructions -- 11.3 Wake-Up in Multi-hop Radio Networks -- 11.3.1 Deterministic Wake-Up -- 11.3.2 Randomized Wake-Up -- 11.4 Leader Election and Clock Synchronization -- 11.4.1 Leader Election Protocol -- 11.4.2 Clock Synchronization -- 11.5 Mutual Exclusion -- 11.5.1 From Wake-Up to Mutual Exclusion -- 11.6 Remarks and Open Problems -- References -- Part IV Data Propagation and Collection -- 12 Probabilistic Data Propagation in Wireless Sensor Networks -- Sotiris Nikoletseas and Paul G. Spirakis -- 12.1 Introduction -- 12.1.1 A Brief Overview of Wireless Sensor Networks -- 12.1.2 Critical Challenges -- 12.1.3 Models and Relations Between Them -- 12.1.4 The Energy Efficiency Challenge in Routing -- 12.2 LTP: A Single-Path Data Propagation Protocol -- 12.2.1 The Protocol -- 12.2.2 Analysis of the Expected Hops Efficiency -- 12.2.3 Local Optimization: The Min-Two Uniform Targets Protocol (M2TP) -- 12.2.4 Tight Upper Bounds to the Hops Distribution of the General Target Protocol -- 12.3 PFR--A Probabilistic Multi-path Forwarding Protocol 6 Theoretical Aspects of Graph Models for MANETs -- Josep Díaz, Dieter Mitsche, and Paolo Santi -- 6.1 Introduction -- 6.2 Static Properties -- 6.3 Mobility Models for MANETs -- 6.4 Structural Properties of Random Waypoint Mobile Networks -- 6.4.1 RWP Node Spatial Distribution -- 6.4.2 RWP Average Nodal Speed -- 6.4.3 The ``Perfect'' Simulation -- 6.5 Formal Studies of Connectivity on MANETs' Models -- 6.5.1 Connectivity Threshold for Mobility Models -- 6.5.2 Connectivity Periods on Mobile Models -- 6.5.3 The Effect of Mobility to Speed up Message Dissemination in Sparse Networks -- 6.6 Conclusions -- References -- 7 Networked Distributed Source Coding -- Shizheng Li and Aditya Ramamoorthy -- 7.1 Introduction -- 7.2 Basics of Distributed Source Coding -- 7.2.1 Slepian--Wolf Theorem -- 7.2.2 Equivalence Between Slepian--Wolf Coding and Channel Coding -- 7.2.3 Distributed Source Coding with a Fidelity Criterion -- 7.3 Networked Distributed Source Coding: An Introduction -- 7.4 Networked Distributed Source Coding: Single Terminal -- 7.4.1 Optimal Rate and Flow Allocation -- 7.5 Networked Distributed Source Coding: Multiple Terminals -- 7.5.1 A network Coding Primer -- 7.5.2 Multicasting Correlated Sources over a Network -- 7.5.3 Separating Distributed Source Coding and Network Coding -- 7.5.4 Practical Joint Distributed Source Coding and Network Coding -- 7.5.5 Resource Allocation for Multicasting Correlated Sources over a Network -- 7.6 Conclusion -- References -- Part III Localization, Time Synchronization, Coordination -- 8 The Spatial Smoothing Method of Clock Synchronization in Wireless Networks -- Arvind Giridhar and P.R. Kumar -- 8.1 Introduction -- 8.2 Synchronizing Two Clocks -- 8.3 A Network of Clocks -- 8.4 Estimating Node Offsets from Edge Offsets -- 8.4.1 Geometric Graphs -- 8.5 Spatial Smoothing 12.3.1 The Protocol |
| Title | Theoretical Aspects of Distributed Computing in Sensor Networks |
| URI | http://digital.casalini.it/9783642148491 https://cir.nii.ac.jp/crid/1130000796191253632 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=3066301 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=5576380 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=6311207 http://link.springer.com/10.1007/978-3-642-14849-1 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783642148491 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3Nb9MwFLdYubAL3yKMIQtxQKpSJXbsxCdER9FUwcRhTLtZdhxL0aYELRmH_fV7dj470BBcrCa1ktq_2n5fv_cQek8Y0Rk3JrRc0dBRIUOhDA9jm4g0yqNU-Yw330748Y9ke87OpzIdnl3S6lV-80deyf-gCvcAV8eS_Qdkx4fCDfgM-EILCEN7R_gdL0dwR_qh8mRJH5FhXBZcV8Cq8Fy1n9dtz1hpQFmtr5ZVF_M9itEn5UUNuDk7obeC1m0Ja365WU1umMuu2vK2bjqX-vLzavl9NbcVeMbc3FYw2Ap3dEjqqK5J1qUU_X1HnQdRQM_QdRVhPB0fY1Dfeh3BSUdjEu2hvTSNFujhp83269lo8oKvnXriGDbjO7scSNP14Hjuc__uvHMf7avmAvZ-OBfaxgkSqlGOPwpyQVWWOzrCHbe2lxZOn6CFY5A8RQ-K6hl6PNTNwP02-hx9nMGHe_hwbfEMPjzCh8sKd_DhAb4X6OzL5vToOOwLWYQKtkTGwpTpNLbCCOuKtCYuRyDhWtCcuQR7mhmthDGE5YZr0HgJ5ZoRkcMOaa22lNGXaFHVVfEK4Uil3Dp3apbESZEKrUGI04ZYYqiyogjQu9kkyV-X3uneyNksizhAB8PcSVgTXXL0RjLK4czJAnQI0ynz0rWx83cCHAI0bRCGKackQHiYaOmf3scRy836iDoRNorv68JAxaVZdF8XTkENiNIAfRhglN0ohiTbMBpJJYxH-gHJ-PVffvMBejQtiDdo0V5dF4cgTrb6bf83vQXSA2cA |
| linkProvider | Library Specific Holdings |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Theoretical+aspects+of+distributed+computing+in+sensor+networks&rft.au=Nikoletseas%2C+Sotiris+E.&rft.au=Rolim%2C+Jos%C3%A9+D.+P.&rft.date=2011-01-01&rft.pub=Springer&rft.isbn=9783642148484&rft_id=info:doi/10.1007%2F978-3-642-14849-1&rft.externalDocID=BB04713120 |
| thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97836421%2F9783642148491.jpg |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fmedia.springernature.com%2Fw306%2Fspringer-static%2Fcover-hires%2Fbook%2F978-3-642-14849-1 |