<p>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 increasin
Algorithms for Sensor and Ad Hoc Networks: Advanced Lectures
โ Scribed by Hans-Joachim Hof (auth.), Dorothea Wagner, Roger Wattenhofer (eds.)
- Publisher
- Springer-Verlag Berlin Heidelberg
- Year
- 2007
- Tongue
- English
- Leaves
- 417
- Series
- Lecture Notes in Computer Science 4621
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
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.
โฆ Table of Contents
Front Matter....Pages -
Applications of Sensor Networks....Pages 1-20
Modeling Sensor and Ad Hoc Networks....Pages 21-36
Clustering....Pages 37-61
MAC Layer and Coloring....Pages 63-80
Topology Control....Pages 81-98
Interference and Signal-to-Noise-Ratio....Pages 99-116
Lower Bounds....Pages 117-130
Facility Location....Pages 131-159
Geographic Routing....Pages 161-185
Compact Routing....Pages 187-202
Pseudo Geometric Routing for Sensor Networks....Pages 203-213
Minimal Range Assignments for Broadcasts....Pages 215-235
Data Gathering in Sensor Networks....Pages 237-263
Location Services....Pages 265-281
Positioning....Pages 283-304
Security....Pages 305-323
Trust Mechanisms and Reputation Systems....Pages 325-336
Selfish Agents and Economic Aspects....Pages 337-358
Time Synchronization....Pages 359-380
Back Matter....Pages -
โฆ Subjects
Computer Communication Networks; Software Engineering; Algorithm Analysis and Problem Complexity; Information Storage and Retrieval; Information Systems Applications (incl.Internet); Communications Engineering, Networks
๐ SIMILAR VOLUMES
<p><P><EM>Sensor and Ad-Hoc Networks: Theoretical and Algorithmic Aspects</EM> contains an analysis of various important networking problems and brings together recent trends and emerging works in the areas of sensor and ad-hoc networks. This book identifies the areas that are in need of special att
<p><P>Wireless ad hoc networks, mobile or static, have special resource requirements and topology features, which make them different from classic computer networks in resource management, routing, media access control, and QoS provisioning. Some of our day-to-day situations directly relate to ad ho
<p><p>This book constitutes the refereed proceedings of the 13th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2017, held in Beijing, China, in December 2017. </p><p>The 39 revised full papers presented were carefully reviewed and selected from 145 submissions. The papers addres