Algorithms for Sensor and Ad Hoc Networks Advanced Lectures
Wireless ad hoc and sensor networks have gained an incredible research momentum. Computer scientists and engineers of all flavors are embracing the area. Sensor networks have been adopted by researchers from many different fields, ranging from hardware technology to operating systems, from antenna d...
Saved in:
| Main Authors | , |
|---|---|
| Format | eBook Book |
| Language | English |
| Published |
Berlin, Heidelberg
Springer Nature
2007
Springer Springer Berlin / Heidelberg Springer Berlin Heidelberg |
| Edition | 1 |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
| ISBN | 3540749918 9783540749912 354074990X 9783540749905 |
| ISSN | 0302-9743 1611-3349 |
| DOI | 10.1007/978-3-540-74991-2 |
Cover
| Abstract | Wireless ad hoc and sensor networks have gained an incredible research momentum. Computer scientists and engineers of all flavors are embracing the area. Sensor networks have been adopted by researchers from many different fields, ranging from hardware technology to operating systems, from antenna design to databases, from information theory to networking, from graph theory to computational geometry. The purpose of this monograph - outcome of a GI-Dagstuhl Seminar held in Dagstuhl Castle in November 2005 - is to give a first overview of algorithmic results on wireless ad hoc and sensor networks. Its focus is on algorithms and protocols that allow for an analysis of their efficiency and efficacy. Many chapters deal with distributed algorithms, in particular local and localized algorithms. Importance is attached to topics combining both interesting aspects of wireless networks and attractive algorithmic methods. Each chapter provides a survey of some part of the field, whilst selected results are described in more detail. The structure and content of the book would make it a suitable basis for an advanced course. |
|---|---|
| AbstractList | Thousands of mini computers (comparable to a stick of chewing gum in size), equipped with sensors,are deployed in some terrain or other. After activation thesensorsformaself-organizednetworkandprovidedata,forexampleabout a forthcoming earthquake. The trend towards wireless communication increasingly a?ects electronic devices in almost every sphere of life. Conventional wireless networks rely on infrastructure such as base stations; mobile devices interact with these base stations in a client/server fashion. In contrast, current research is focusing on networks that are completely unstructured, but are nevertheless able to communicate (via several hops) with each other, despite the low coverage of their antennas. Such systems are called sensor orad hoc networks, depending on the point of view and the application. Wireless ad hoc and sensor networks have gained an incredible research momentum.Computerscientistsandengineersofall?avorsareembracingthe area. Sensor networks have been adopted by researchers in many ?elds: from hardware technology to operating systems, from antenna design to databases, from information theory to networking, from graph theory to computational geometry. Wireless ad hoc and sensor networks have gained an incredible research momentum. Computer scientists and engineers of all flavors are embracing the area. Sensor networks have been adopted by researchers from many different fields, ranging from hardware technology to operating systems, from antenna design to databases, from information theory to networking, from graph theory to computational geometry. The purpose of this monograph - outcome of a GI-Dagstuhl Seminar held in Dagstuhl Castle in November 2005 - is to give a first overview of algorithmic results on wireless ad hoc and sensor networks. Its focus is on algorithms and protocols that allow for an analysis of their efficiency and efficacy. Many chapters deal with distributed algorithms, in particular local and localized algorithms. Importance is attached to topics combining both interesting aspects of wireless networks and attractive algorithmic methods. Each chapter provides a survey of some part of the field, whilst selected results are described in more detail. The structure and content of the book would make it a suitable basis for an advanced course. |
| Author | Wagner, Dorothea Wattenhofer, Roger |
| Author_xml | – sequence: 1 fullname: Wagner, Dorothea – sequence: 2 fullname: Wattenhofer, Roger |
| BackLink | https://cir.nii.ac.jp/crid/1130282269101346048$$DView record in CiNii |
| BookMark | eNqNkUFv1DAQhQ20qLulP4BbhCpQD6YezyS2j8uqUKQKDiCuljd2dsOm8TYO9O_jbBDiBj74aeTvvZFnluykj31g7CWItyCEujZKc-QlCa7IGODyCVtiLo-VfsoWUAFwRDLP_n44YQuBQnKjCE_ZUuYog2WW59lhgJQABWfsIqXvIh_MKVov2NWq28ahHXf3qWjiUHwJfcriel-sfHEb6-JTGB_jsE8v2GnjuhQufus5-_b-5uv6lt99_vBxvbrjjpBKyUl545UIviRyAcBvTGkkVrpuvAroXVMr3UhFHhvRlOSdrhojCY3BTekcnrOrOdilfXhMu9iNyf7swibGfbJ5PH8-LTN7PbPpMLT9Ngx2pkDYaZgTbdFm3h4NdnK8mR2HIT78CGm0x-A69OPgOnvzbl0hSNKQydf_IBEVgPmPSBSVVHJqfjmTfdvaup1ugLw1LWVlQABSJUhn7NWM1S65LmP2PvZxO7jDLtkSCaq8wF-TUJqN |
| ContentType | eBook Book |
| Copyright | Springer-Verlag Berlin Heidelberg 2007 |
| Copyright_xml | – notice: Springer-Verlag Berlin Heidelberg 2007 |
| DBID | I4C RYH |
| DEWEY | 005 |
| DOI | 10.1007/978-3-540-74991-2 |
| DatabaseName | Casalini Torrossa eBooks Institutional Catalogue CiNii Complete |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISBN | 3540749918 9783540749912 |
| EISSN | 1611-3349 |
| Edition | 1 2007 edition. |
| Editor | Wagner, Dorothea Wattenhofer, Roger |
| Editor_xml | – sequence: 1 fullname: Wagner, Dorothea – sequence: 2 fullname: Wattenhofer, Roger |
| ExternalDocumentID | 9783540749912 152701 EBC6312481 EBC337119 EBC3062722 BA8334221X 5341600 |
| GroupedDBID | 089 0D6 0DA 0E8 2HV 38. A4J AABBV AABFA AAHDE AAJYQ AATVQ AAUKK ABBUY ABBVZ ABCYT ABMNI ACDTA ACDUY ACFGI ADQVG AEDXK AEHEY AEHWL AEJLV AEKFX AETDV AEZAY AGNDD AHMWK AHNNE ALMA_UNASSIGNED_HOLDINGS ATJMZ AZZ BBABE CZZ E6I I4C IEZ IV0 JJU LZA MA. MW~ NUP SBO TPJZQ TSXQS Z5O Z7R Z7S Z7U Z7V Z7W Z7X Z7Y Z7Z Z81 Z83 Z84 Z85 Z87 Z88 RYH AAFYB -DT -GH -~X 1SB 29L 2HA 5QI 875 AASHB ACGFS ADCXD AEFIE EJD F5P FEDTE HVGLF LAS LDH P2P RNI RSU SVGTG VI1 ~02 |
| ID | FETCH-LOGICAL-a43452-47d9d70ed544ae11db9592368cfd7e3dafc78f274d3f0f54da86f9243993b5aa3 |
| ISBN | 3540749918 9783540749912 354074990X 9783540749905 |
| ISSN | 0302-9743 |
| IngestDate | Fri Jul 25 04:36:10 EDT 2025 Wed Sep 17 03:29:29 EDT 2025 Tue Sep 09 06:53:49 EDT 2025 Tue Jun 10 23:59:02 EDT 2025 Tue Sep 09 06:53:44 EDT 2025 Thu Jun 26 23:32:42 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCN | 2007935200 |
| LCCallNum_Ident | Q |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a43452-47d9d70ed544ae11db9592368cfd7e3dafc78f274d3f0f54da86f9243993b5aa3 |
| Notes | "Tutorial"--Cover Includes bibliographical references and index |
| OCLC | 191470171 808680615 1113551211 |
| PQID | EBC3062722 |
| PageCount | 417 |
| ParticipantIDs | askewsholts_vlebooks_9783540749912 springer_books_10_1007_978_3_540_74991_2 proquest_ebookcentral_EBC6312481 proquest_ebookcentral_EBC337119 proquest_ebookcentral_EBC3062722 nii_cinii_1130282269101346048 casalini_monographs_5341600 |
| PublicationCentury | 2000 |
| PublicationDate | 2007 c2007 2007-09-27 |
| PublicationDateYYYYMMDD | 2007-01-01 2007-09-27 |
| PublicationDate_xml | – year: 2007 text: 2007 |
| PublicationDecade | 2000 |
| PublicationPlace | Berlin, Heidelberg |
| PublicationPlace_xml | – name: Netherlands – name: Berlin – name: Berlin/Heidelberg – name: Dordrecht – name: Berlin, Heidelberg |
| PublicationSeriesTitle | Lecture Notes in Computer Science |
| PublicationYear | 2007 |
| 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 |
| RelatedPersons | Kleinberg, Jon M. Mattern, Friedemann Nierstrasz, Oscar Steffen, Bernhard Kittler, Josef Vardi, Moshe Y. Weikum, Gerhard Sudan, Madhu Naor, Moni Mitchell, John C. Terzopoulos, Demetri Pandu Rangan, C. Kanade, Takeo Hutchison, David Tygar, Doug |
| RelatedPersons_xml | – sequence: 1 givenname: David surname: Hutchison fullname: Hutchison, David – sequence: 2 givenname: Takeo surname: Kanade fullname: Kanade, Takeo – sequence: 3 givenname: Josef surname: Kittler fullname: Kittler, Josef – sequence: 4 givenname: Jon M. surname: Kleinberg fullname: Kleinberg, Jon M. – sequence: 5 givenname: Friedemann surname: Mattern fullname: Mattern, Friedemann – sequence: 6 givenname: John C. surname: Mitchell fullname: Mitchell, John C. – sequence: 7 givenname: Moni surname: Naor fullname: Naor, Moni – sequence: 8 givenname: Oscar surname: Nierstrasz fullname: Nierstrasz, Oscar – sequence: 9 givenname: C. surname: Pandu Rangan fullname: Pandu Rangan, C. – sequence: 10 givenname: Bernhard surname: Steffen fullname: Steffen, Bernhard – sequence: 11 givenname: Madhu surname: Sudan fullname: Sudan, Madhu – sequence: 12 givenname: Demetri surname: Terzopoulos fullname: Terzopoulos, Demetri – sequence: 13 givenname: Doug surname: Tygar fullname: Tygar, Doug – sequence: 14 givenname: Moshe Y. surname: Vardi fullname: Vardi, Moshe Y. – sequence: 15 givenname: Gerhard surname: Weikum fullname: Weikum, Gerhard |
| SSID | ssj0000316188 ssj0002792 |
| Score | 1.9170622 |
| Snippet | Wireless ad hoc and sensor networks have gained an incredible research momentum. Computer scientists and engineers of all flavors are embracing the area.... Thousands of mini computers (comparable to a stick of chewing gum in size), equipped with sensors,are deployed in some terrain or other. After activation... |
| SourceID | askewsholts springer proquest nii casalini |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Ad hoc networks (Computer networks) Algorithm Analysis and Problem Complexity Communications Engineering, Networks Computer algorithms Computer Communication Networks Computer programming, programs, data Computer Science Congresses Information Storage and Retrieval Information Systems Applications (incl. Internet) Programming Sensor networks Sensor networks-Programming-Congresses Software Engineering |
| Subtitle | Advanced Lectures |
| TableOfContents | 10.5 Chapter Notes -- 11 Pseudo Geometric Routing for Sensor Networks -- 11.1 Introduction -- 11.2 Routing Algorithms for Sensor Networks -- 11.3 Virtual Coordinate Based Routing -- 11.4 Beacon Vector Routing -- 11.5 Algorithmic View -- 11.6 Related Work -- 11.7 Chapter Notes -- 12 Minimal Range Assignments for Broadcasts -- 12.1 Introduction -- 12.2 The Algorithm RAPMST and Its Analysis -- 12.3 Distributed Computation of an MST -- 12.4 Further Advances -- 12.5 Conclusion and Open Questions -- 12.6 Chapter Notes -- 13 Data Gathering in Sensor Networks -- 13.1 Introduction -- 13.2 Network Model -- 13.3 Minimum Energy Data Gathering -- 13.4 Maximum Lifetime Data Gathering -- 13.5 Chapter Notes -- 14 Location Services -- 14.1 Introduction -- 14.2 Grid Location Service (GLS) -- 14.3 Locality-Aware Location Service (LLS) -- 14.4 Mobility-Aware Location Service (MLS) -- 14.5 Outlook -- 14.6 Chapter Notes -- 15 Positioning -- 15.1 Introduction -- 15.2 Hardness Results -- 15.3 Algorithms -- 15.4 Chapter Notes -- 16 Security -- 16.1 Introduction -- 16.2 Symmetric Key Distribution -- 16.3 Public-Key Distribution -- 16.4 Open Questions -- 16.5 Chapter Notes -- 17 Trust Mechanisms and Reputation Systems -- 17.1 Introduction -- 17.2 General Trust Models -- 17.3 Reputation-Based Trust Protocols in Ad Hoc Networks -- 17.4 Open Problems -- 17.5 Chapter Notes -- 18 Selfish Agents and Economic Aspects -- 18.1 Introduction -- 18.2 Mechanism Design -- 18.3 Network Model -- 18.4 Unicast in Selfish Networks -- 18.5 Multicast in Selfish Networks -- 18.6 Chapter Notes -- 19 Time Synchronization -- 19.1 Introduction -- 19.2 Time Synchronization Approaches -- 19.3 Synchronizing Clocks in the Presence of Faults -- 19.4 Theoretical Bounds for Clock Synchronization and Ordering of Events -- 19.5 Gradient Clock Synchronization -- 19.6 Chapter Notes -- Bibliography -- Author Index Subject Index Intro -- Preface -- List of Contributors -- Contents -- 1 Applications of Sensor Networks -- 1.1 Introduction -- 1.2 Applications of Sensor Networks -- 1.3 Current Hardware Platforms -- 1.4 Upcoming Applications -- 1.5 Chapter Notes -- 2 Modeling Sensor and Ad Hoc Networks -- 2.1 Introduction -- 2.2 Distributed Algorithms -- 2.3 Communication -- 2.4 Energy -- 2.5 Mobility -- 2.6 Chapter Notes -- 3 Clustering -- 3.1 Introduction -- 3.2 Models -- 3.3 Clustering Algorithms for Unit Disk Graphs -- 3.4 Clustering Algorithms for General Graphs -- 3.5 Conclusions and Open Problems -- 3.6 Chapter Notes -- 4 MAC Layer and Coloring -- 4.1 Introduction -- 4.2 Algorithms for Vertex Coloring -- 4.3 Conclusion -- 4.4 Chapter Notes -- 5 Topology Control -- 5.1 Introduction -- 5.2 Quality Criteria -- 5.3 Locally Defined Geometric Graphs and Further Proximity Graphs -- 5.4 Localized Algorithms -- 5.5 Chapter Notes -- 6 Interference and Signal-to-Noise-Ratio -- 6.1 Introduction -- 6.2 Interference Models -- 6.3 Low-Interference Topologies -- 6.4 Topology Scheduling -- 6.5 Flow and Path Scheduling -- 6.6 Chapter Notes -- 7 Lower Bounds -- 7.1 Introduction -- 7.2 A Lower Bound on 3-Coloring a Ring -- 7.3 Locally Checkable Labelings -- 7.4 Minimum-Weight Spanning Trees -- 7.5 Chapter Notes -- 8 Facility Location -- 8.1 Introduction -- 8.2 Problem Definition -- 8.3 Centralized Approximations -- 8.4 Simple Distributed Approximation -- 8.5 Fast Distributed Approximation -- 8.6 Discussion and Outlook -- 8.7 Chapter Notes -- 9 Geographic Routing -- 9.1 Introduction -- 9.2 Related Work -- 9.3 Models and Preliminaries -- 9.4 Greedy Routing -- 9.5 Routing with Faces -- 9.6 A Lower Bound -- 9.7 Combining Greedy and Face Routing -- 9.8 Conclusion -- 9.9 Chapter Notes -- 10 Compact Routing -- 10.1 Introduction -- 10.2 Definitions -- 10.3 Overview -- 10.4 Algorithms Intro -- Title Page -- Preface -- List of Contributors -- Contents -- Applications of Sensor Networks -- Introduction -- Applications of Sensor Networks -- Current Hardware Platforms -- Upcoming Applications -- Chapter Notes -- Modeling Sensor and Ad Hoc Networks -- Introduction -- Distributed Algorithms -- Communication -- Energy -- Mobility -- Chapter Notes -- Clustering -- Introduction -- Models -- Clustering Algorithms for Unit Disk Graphs -- Clustering Algorithms for General Graphs -- Conclusions and Open Problems -- Chapter Notes -- MAC Layer and Coloring -- Introduction -- Algorithms for Vertex Coloring -- Conclusion -- Chapter Notes -- Topology Control -- Introduction -- Quality Criteria -- Locally Defined Geometric Graphs and Further Proximity Graphs -- Localized Algorithms -- Chapter Notes -- Interference and Signal-to-Noise-Ratio -- Introduction -- Interference Models -- Low-Interference Topologies -- Topology Scheduling -- Flow and Path Scheduling -- Chapter Notes -- Lower Bounds -- Introduction -- A Lower Bound on 3-Coloring a Ring -- Locally Checkable Labelings -- Minimum-Weight Spanning Trees -- Chapter Notes -- Facility Location -- Introduction -- Problem Definition -- Centralized Approximations -- Simple Distributed Approximation -- Fast Distributed Approximation -- Discussion and Outlook -- Chapter Notes -- Geographic Routing -- Introduction -- Related Work -- Models and Preliminaries -- Greedy Routing -- Routing with Faces -- A Lower Bound -- Combining Greedy and Face Routing -- Conclusion -- Chapter Notes -- Compact Routing -- Introduction -- Definitions -- Overview -- Algorithms -- Chapter Notes -- Pseudo Geometric Routing for Sensor Networks -- Introduction -- Routing Algorithms for Sensor Networks -- Virtual Coordinate Based Routing -- Beacon Vector Routing -- Algorithmic View -- Related Work -- Chapter Notes Minimal Range Assignments for Broadcasts -- Introduction -- The Algorithm RapMst and Its Analysis -- Distributed Computation of an MST -- Further Advances -- Conclusion and Open Questions -- Chapter Notes -- Data Gathering in Sensor Networks -- Introduction -- Network Model -- Minimum Energy Data Gathering -- Maximum Lifetime Data Gathering -- Chapter Notes -- Location Services -- Introduction -- Grid Location Service (GLS) -- Locality-Aware Location Service (LLS) -- Mobility-Aware Location Service (MLS) -- Outlook -- Chapter Notes -- Positioning -- Introduction -- Hardness Results -- Algorithms -- Chapter Notes -- Security -- Introduction -- Symmetric Key Distribution -- Public-Key Distribution -- Open Questions -- Chapter Notes -- Trust Mechanisms and Reputation Systems -- Introduction -- General Trust Models -- Reputation-Based Trust Protocols in Ad Hoc Networks -- Open Problems -- Chapter Notes -- Selfish Agents and Economic Aspects -- Introduction -- Mechanism Design -- Network Model -- Unicast in Selfish Networks -- Multicast in Selfish Networks -- Chapter Notes -- Time Synchronization -- Introduction -- Time Synchronization Approaches -- Synchronizing Clocks in the Presence of Faults -- Theoretical Bounds for Clock Synchronization and Ordering of Events -- Gradient Clock Synchronization -- Chapter Notes -- Bibliography -- Author Index -- Subject Index |
| Title | Algorithms for Sensor and Ad Hoc Networks |
| URI | http://digital.casalini.it/9783540749912 https://cir.nii.ac.jp/crid/1130282269101346048 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=3062722 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=337119 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=6312481 http://link.springer.com/10.1007/978-3-540-74991-2 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783540749912 |
| Volume | 4621 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lj9MwELbYcqEnniIsCxbigFQF1e-E2-5StFoBp2XpzXLiuK2oEmlTOPDrGSd2-uAluERtGtnxfIn7jWe-MUIvZSktLx1NaeFEygVzqQGWmyphWOUkK_jUa4c_fJQXn_jlXMy3G2h16pJN8br8_ktdyf-gCucAV6-S_Qdkh0bhBHwGfOEICMPxgPwOX0Nq8XrRgFe_7KspTFrwRUMypLGTZVNO6j67u-08_iHOv-4DBgON_mwWQe_ytrnxUqztHO3LbtbLxoWtkZtFyOKNCwTqYIEgLhDuOY5-tUeBs9NJnn-eRg8zJ_ylUaa4X5367DRjjFNK5kfoSClwf2-fzi7fXw_rXDBpSJJlQVbT9RkKH23vIUabQ8HfvT7HaGzaLzDhw5_BpvXswbTGi0aBDNSr1Z5jcBDL7ijC1V008rKRe-hWVd9H450yjw_QDlwY4MI9XBjgwsZigAtHuPAbHMHCEayH6Prd7Or8Ig3bVsBTzrigKVc2t2paWcG5qQixRS6AR8usdFZVzBpXqsxRxS1zUye4NZl04Ad7rlgIY9gjNKqbunqMcAa_58QaynLHCw6-HRjFKAc9FEUhswS92LGO_rbuQuyt3jEvoQk6jkbT8Ab0pdBbLYDAAN1N0AnYUZcrfyQ-jg2cUQKLJIxLmN8ThKOFddd6yBrWs7Nz5otcU-jg-e8vYYqQ_E-NSAYcMyMJehXh0_0gYkVtGIxmGoaju_Fo-uQvt3yM7mxfhKdotLn5Wp0Ad9wUz8Lj-QOuPWHd |
| 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=Algorithms+for+sensor+and+ad+hoc+networks+%3A+advanced+lectures&rft.au=Wagner%2C+Dorothea&rft.au=Wattenhofer%2C+Roger&rft.date=2007-01-01&rft.pub=Springer&rft.isbn=9783540749905&rft_id=info:doi/10.1007%2F978-3-540-74991-2&rft.externalDocID=BA8334221X |
| thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97835407%2F9783540749912.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-540-74991-2 |