Networking Wireless SensorsWireless sensor networks promise an unprecedented fine-grained interface between the virtual and physical worlds. They are one of the most rapidly developing information technologies, with applications in a wide range of fields including industrial process control, security and surveillance, environmental sensing, and structural health monitoring. Originally published in 2005, this book provides a detailed and organized survey of the field. It shows how the core challenges of energy efficiency, robustness, and autonomy are addressed in these systems by networking techniques across multiple layers. The topics covered include network deployment, localization, time synchronization, wireless radio characteristics, medium-access, topology control, routing, data-centric techniques, and transport protocols. Ideal for researchers and designers seeking to create algorithms and protocols and engineers implementing integrated solutions, it also contains many exercises and can be used by graduate students taking courses in networks. |
Contents
Introduction | 1 |
12 Networked wireless sensor devices | 2 |
13 Applications of wireless sensor networks | 4 |
14 Key design challenges | 6 |
15 Organization | 9 |
Network deployment | 10 |
22 Structured versus randomized deployment | 11 |
23 Network topology | 12 |
66 Contentionfree protocols | 96 |
67 Summary | 100 |
Exercises | 101 |
Sleepbased topology control | 103 |
72 Constructing topologies for connectivity | 105 |
73 Constructing topologies for coverage | 109 |
74 Set Kcover algorithms | 113 |
75 Crosslayer issues | 114 |
24 Connectivity in geometric random graphs | 14 |
25 Connectivity using power control | 18 |
26 Coverage metrics | 22 |
27 Mobile deployment | 26 |
28 Summary | 27 |
Exercises | 28 |
Localization | 31 |
32 Key issues | 32 |
33 Localization approaches | 34 |
35 Finegrained node localization using detailed information | 39 |
36 Networkwide localization | 43 |
37 Theoretical analysis of localization techniques | 51 |
38 Summary | 53 |
Exercises | 54 |
Time synchronization | 57 |
42 Key issues | 58 |
43 Traditional approaches | 60 |
44 Finegrained clock synchronization | 61 |
45 Coarsegrained data synchronization | 67 |
46 Summary | 68 |
Wireless characteristics | 70 |
53 Radio energy considerations | 77 |
54 The SINR capture model for interference | 78 |
55 Summary | 79 |
Exercises | 80 |
Mediumaccess and sleep scheduling | 82 |
63 Energy efficiency in MAC protocols | 86 |
64 Asynchronous sleep techniques | 87 |
65 Sleepscheduled techniques | 91 |
76 Summary | 116 |
Energyefficient and robust routing | 119 |
83 Routing with diversity | 122 |
84 Multipath routing | 125 |
85 Lifetimemaximizing energyaware routing techniques | 128 |
86 Geographic routing | 130 |
87 Routing to mobile sinks | 133 |
88 Summary | 136 |
Exercises | 137 |
Datacentric networking | 139 |
92 Datacentric routing | 140 |
93 Datagathering with compression | 143 |
94 Querying | 147 |
95 Datacentric storage and retrieval | 156 |
96 The database perspective on sensor networks | 159 |
97 Summary | 162 |
Exercises | 163 |
Transport reliability and congestion control | 165 |
102 Basic mechanisms and tunable parameters | 167 |
103 Reliability guarantees | 168 |
104 Congestion control | 170 |
105 Realtime scheduling | 175 |
106 Summary | 177 |
Exercises | 178 |
Conclusions | 179 |
112 Further topics | 180 |
References | 183 |
| 197 | |
Other editions - View all
Common terms and phrases
active node aggregation algorithm applications approach assumed B-MAC backoff beacon broadcast broadcast domain clock drift cluster-heads communication compression congestion control connected topology connectivity constraints Constructing topologies coordinates cost D-MAC data-centric data-gathering deployed deployment destination detection determine devices distance distributed end-to-end energy efficiency ensure environment estimates event forwarding function geographic routing geometric random graph grid hidden node problem IEEE illustrated in Figure INFOCOM intermediate nodes iterative K-covered link quality localization technique MAC protocols maximal breach medium-access minimize minimum multi-hop multi-path multiple neighboring nodes network localization network topology node's number of nodes optimal packet reception rate parameters path period priority Proceedings of ACM propagation query queue radio range receiver reference nodes reliability robustness routing techniques S-MAC sensor nodes sleep mode sleep scheduling slots synchronization TDMA threshold timer tradeoff traffic trajectory transitional region transmit unique unknown node wake-up wireless networks wireless sensor networks
Popular passages
Page 196 - Y. Yu. R. Govindan, and D. Estrin. "Geographical and Energy Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks," UCLA Computer Science Department Technical Report UCLA/CSD-TR-01-0023, May 2001.
Page 190 - A. Manjeshwar and DP Agrawal, "TEEN: A routing protocol for enhanced efficiency in wireless sensor networks," in IEEE International Parallel Distributed Processing Symposium, 2001.
Page 189 - GPSR: greedy perimeter stateless routing for wireless networks," in Proceedings of the sixth annual international conference on Mobile computing and networking, August 2000.
Page 190 - In Proceedings of the First ACM International Workshop on Wireless Sensor Networks and Applications (WSNA 2002).
Page 194 - S. Slijepcevic and M. Potkonjak. Power efficient organization of wireless sensor networks.
Page i - Ph.D. candidate in the Department of Electrical Engineering - Systems at the University of Southern California, Los Angeles, California, USA.
Page 189 - P. Levis and D. Culler. Mate': A Tiny Virtual Machine for Sensor Networks.