Muutke küpsiste eelistusi

Protocols and Architectures for Wireless Sensor Networks [Pehme köide]

(Technische Universitaet Berlin, Germany), (University of Pottsdam, Germany)
  • Formaat: Paperback / softback, 528 pages, kõrgus x laius x paksus: 248x171x29 mm, kaal: 879 g
  • Ilmumisaeg: 29-Aug-2007
  • Kirjastus: Wiley-Interscience
  • ISBN-10: 0470519231
  • ISBN-13: 9780470519233
  • Formaat: Paperback / softback, 528 pages, kõrgus x laius x paksus: 248x171x29 mm, kaal: 879 g
  • Ilmumisaeg: 29-Aug-2007
  • Kirjastus: Wiley-Interscience
  • ISBN-10: 0470519231
  • ISBN-13: 9780470519233
Learn all you need to know about wireless sensor networks!

Protocols and Architectures for Wireless Sensor Networks provides a thorough description of the nuts and bolts of wireless sensor networks.

The authors give an overview of the state-of-the-art, putting all the individual solutions into perspective with one and other.  Numerous practical examples, case studies and illustrations demonstrate the theory, techniques and results presented.  The clear chapter structure, listing learning objectives, outline and summarizing key points, help guide the reader expertly through the material.

 Protocols and Architectures for Wireless Sensor Networks:            

  • Covers architecture and communications protocols in detail with practical implementation examples and case studies.
  • Provides an understanding of mutual relationships and dependencies between different protocols and architectural decisions.
  • Offers an in-depth investigation of relevant protocol mechanisms. 
  • Shows which protocols are suitable for which tasks within a wireless sensor network and in which circumstances they perform efficiently. 
  • Features an extensive website with the bibliography, PowerPoint slides, additional exercises and worked solutions.

This text provides academic researchers, graduate students in computer science, computer engineering, and electrical engineering, as well as practitioners in industry and research engineers with an understanding of the specific design challenges and solutions for wireless sensor networks. 

Check out www.wiley.com/go/wsn for accompanying course material!

"I am deeply impressed by the book of Karl & Willig. It is by far the most complete source for wireless sensor networks...The book covers almost all topics related to sensor networks, gives an amazing number of references, and, thus, is the perfect source for students, teachers, and researchers. Throughout the book the reader will find high quality text, figures, formulas, comparisons etc. - all you need for a sound basis to start sensor network research."

Prof. Jochen Schiller, Institute of Computer Science, Freie Universität Berlin

Arvustused

"this book represents an authoritative yet open-minded source to acquire a solid understanding of the fundamentals of WSNs.  It is a recommended and enjoy read." (Computing Reviews, March 11, 2008)

Preface xiii
List of abbreviations
xv
A guide to the book xxiii
Introduction
1(14)
The vision of Ambient Intelligence
1(2)
Application examples
3(3)
Types of applications
6(1)
Challenges for WSNs
7(3)
Characteristic requirements
7(2)
Required mechanisms
9(1)
Why are sensor networks different?
10(3)
Mobile ad hoc networks and wireless sensor networks
10(2)
Fieldbuses and wireless sensor networks
12(1)
Enabling technologies for wireless sensor networks
13(2)
PART I ARCHITECTURES
15(68)
Single-node architecture
17(42)
Hardware components
18(18)
Sensor node hardware overview
18(1)
Controller
19(2)
Memory
21(1)
Communication device
21(10)
Sensors and actuators
31(1)
Power supply of sensor nodes
32(4)
Energy consumption of sensor nodes
36(9)
Operation states with different power consumption
36(2)
Microcontroller energy consumption
38(1)
Memory
39(1)
Radio transceivers
40(4)
Relationship between computation and communication
44(1)
Power consumption of sensor and actuators
44(1)
Operating systems and execution environments
45(9)
Embedded operating systems
45(1)
Programming paradigms and application programming interfaces
45(2)
Structure of operating system and protocol stack
47(1)
Dynamic energy and power management
48(2)
Case Study: TinyOS and nesC
50(3)
Other examples
53(1)
Some examples of sensor nodes
54(2)
The ``Mica Mote'' family
54(1)
EYES nodes
54(1)
BTnodes
54(1)
Scatterweb
54(1)
Commercial solutions
55(1)
Conclusion
56(3)
Network architecture
59(24)
Sensor network scenarios
60(3)
Types of sources and sinks
60(1)
Single-hop versus multihop networks
60(2)
Multiple sinks and sources
62(1)
Three types of mobility
62(1)
Optimization goals and figures of merit
63(4)
Quality of service
64(1)
Energy efficiency
65(1)
Scalability
66(1)
Robustness
67(1)
Design principles for WSNs
67(7)
Distributed organization
67(1)
In-network processing
67(3)
Adaptive fidelity and accuracy
70(1)
Data centricity
70(3)
Exploit location information
73(1)
Exploit activity patterns
73(1)
Exploit heterogeneity
73(1)
Component-based protocol stacks and cross-layer optimization
74(1)
Service interfaces of WSNs
74(4)
Structuring application/protocol stack interfaces
74(2)
Expressibility requirements for WSN service interfaces
76(1)
Discussion
77(1)
Gateway concepts
78(3)
The need for gateways
78(1)
WSN to Internet communication
79(1)
Internet to WSN communication
80(1)
WSN tunneling
81(1)
Conclusion
81(2)
PART II COMMUNICATION PROTOCOLS
83(354)
Physical layer
85(26)
Introduction
85(1)
Wireless channel and communication fundamentals
86(17)
Frequency allocation
86(2)
Modulation and demodulation
88(2)
Wave propagation effects and noise
90(6)
Channel models
96(2)
Spread-spectrum communications
98(2)
Packet transmission and synchronization
100(2)
Quality of wireless channels and measures for improvement
102(1)
Physical layer and transceiver design considerations in WSNs
103(6)
Energy usage profile
103(1)
Choice of modulation scheme
104(4)
Dynamic modulation scaling
108(1)
Antenna considerations
108(1)
Further reading
109(2)
MAC protocols
111(38)
Fundamentals of (wireless) MAC protocols
112(8)
Requirements and design constraints for wireless MAC protocols
112(2)
Important classes of MAC protocols
114(5)
MAC protocols for wireless sensor networks
119(1)
Low duty cycle protocols and wakeup concepts
120(9)
Sparse topology and energy management (STEM)
121(2)
S-MAC
123(3)
The mediation device protocol
126(1)
Wakeup radio concepts
127(1)
Further reading
128(1)
Contention-based protocols
129(4)
CSMA protocols
129(2)
PAMAS
131(1)
Further solutions
132(1)
Schedule-based protocols
133(6)
LEACH
133(2)
SMACS
135(2)
Traffic-adaptive medium access protocol (TRAMA)
137(2)
Further solutions
139(1)
The IEEE 802.15.4 MAC protocol
139(6)
Network architecture and types/roles of nodes
140(1)
Superframe structure
141(1)
GTS management
141(1)
Data transfer procedures
142(1)
Slotted CSMA-CA protocol
142(2)
Nonbeaconed mode
144(1)
Further reading
145(1)
How about IEEE 802.11 and bluetooth?
145(1)
Further reading
146(2)
Conclusion
148(1)
Link-layer protocols
149(32)
Fundamentals: tasks and requirements
150(1)
Error control
151(16)
Causes and characteristics of transmission errors
151(1)
ARQ techniques
152(6)
FEC techniques
158(5)
Hybrid schemes
163(2)
Power control
165(1)
Further mechanisms to combat errors
166(1)
Error control: summary
167(1)
Framing
167(7)
Adaptive schemes
170(2)
Intermediate checksum schemes
172(1)
Combining packet-size optimization and FEC
173(1)
Treatment of frame headers
174(1)
Framing: summary
174(1)
Link management
174(5)
Link-quality characteristics
175(2)
Link-quality estimation
177(2)
Summary
179(2)
Naming and addressing
181(20)
Fundamentals
182(4)
Use of addresses and names in (sensor) networks
182(1)
Address management tasks
183(1)
Uniqueness of addresses
184(1)
Address allocation and assignment
184(1)
Addressing overhead
185(1)
Address and name management in wireless sensor networks
186(1)
Assignment of MAC addresses
186(3)
Distributed assignment of networkwide addresses
187(2)
Distributed assignment of locally unique addresses
189(5)
Address assignment algorithm
189(2)
Address selection and representation
191(3)
Further schemes
194(1)
Content-based and geographic addressing
194(4)
Content-based addressing
194(4)
Geographic addressing
198(1)
Summary
198(3)
Time synchronization
201(30)
Introduction to the time synchronization problem
201(6)
The need for time synchronization in wireless sensor networks
202(1)
Node clocks and the problem of accuracy
203(1)
Properties and structure of time synchronization algorithms
204(2)
Time synchronization in wireless sensor networks
206(1)
Protocols based on sender/receiver synchronization
207(10)
Lightweight time synchronization protocol (LTS)
207(5)
How to increase accuracy and estimate drift
212(2)
Timing-sync protocol for sensor networks (TPSN)
214(3)
Protocols based on receiver/receiver synchronization
217(9)
Reference broadcast synchronization (RBS)
217(6)
Hierarchy referencing time synchronization (HRTS)
223(3)
Further reading
226(5)
Localization and positioning
231(20)
Properties of localization and positioning procedures
232(1)
Possible approaches
233(4)
Proximity
233(1)
Trilateration and triangulation
234(3)
Scene analysis
237(1)
Mathematical basics for the lateration problem
237(3)
Solution with three anchors and correct distance values
238(1)
Solving with distance errors
238(2)
Single-hop localization
240(3)
Active Badge
240(1)
Active office
240(1)
RADAR
240(1)
Cricket
241(1)
Overlapping connectivity
241(1)
Approximate point in triangle
242(1)
Using angle of arrival information
243(1)
Positioning in multihop environments
243(4)
Connectivity in a multihop network
244(1)
Multihop range estimation
244(1)
Iterative and collaborative multilateration
245(2)
Probabilistic positioning description and propagation
247(1)
Impact of anchor placement
247(1)
Further reading
248(1)
Conclusion
249(2)
Topology control
251(38)
Motivation and basic ideas
251(5)
Options for topology control
252(2)
Aspects of topology-control algorithms
254(2)
Controlling topology in flat networks -- Power control
256(10)
Some complexity results
256(1)
Are there magic numbers? -- bounds on critical parameters
257(2)
Some example constructions and protocols
259(6)
Further reading on flat topology control
265(1)
Hierarchical networks by dominating sets
266(8)
Motivation and definition
266(1)
A hardness result
266(1)
Some ideas from centralized algorithms
267(3)
Some distributed approximations
270(3)
Further reading
273(1)
Hierarchical networks by clustering
274(11)
Definition of clusters
274(3)
A basic idea to construct independent sets
277(1)
A generalization and some performance insights
278(1)
Connecting clusters
278(1)
Rotating clusterheads
279(1)
Some more algorithm examples
280(1)
Multihop clusters
281(2)
Multiple layers of clustering
283(1)
Passive clustering
284(1)
Further reading
284(1)
Combining hierarchical topologies and power control
285(1)
Pilot-based power control
285(1)
Ad hoc Network Design Algorithm (ANDA)
285(1)
Clusterpow
286(1)
Adaptive node activity
286(2)
Geographic Adaptive Fidelity (GAF)
286(1)
Adaptive Self-Configuring sEnsor Networks' Topologies (ASCENT)
287(1)
Turning off nodes on the basis of sensing coverage
288(1)
Conclusions
288(1)
Routing protocols
289(42)
The many faces of forwarding and routing
289(3)
Gossiping and agent-based unicast forwarding
292(3)
Basic idea
292(1)
Randomized forwarding
292(1)
Random walks
293(1)
Further reading
294(1)
Energy-efficient unicast
295(10)
Overview
295(2)
Some example unicast protocols
297(4)
Further reading
301(1)
Multipath unicast routing
301(3)
Further reading
304(1)
Broadcast and multicast
305(11)
Overview
305(3)
Source-based tree protocols
308(6)
Shared, core-based tree protocols
314(1)
Mesh-based protocols
314(1)
Further reading on broadcast and multicast
315(1)
Geographic routing
316(12)
Basics of position-based routing
316(7)
Geocasting
323(3)
Further reading on geographic routing
326(2)
Mobile nodes
328(1)
Mobile sinks
328(1)
Mobile data collectors
328(1)
Mobile regions
329(1)
Conclusions
329(2)
Data-centric and content-based networking
331(28)
Introduction
331(4)
The publish/subscribe interaction paradigm
331(1)
Addressing data
332(1)
Implementation options
333(1)
Distribution versus gathering of data - In-network processing
334(1)
Data-centric routing
335(6)
One-shot interactions
335(2)
Repeated interactions
337(3)
Further reading
340(1)
Data aggregation
341(14)
Overview
341(1)
A database interface to describe aggregation operations
342(1)
Categories of aggregation operations
343(2)
Placement of aggregation points
345(1)
When to stop waiting for more data
345(2)
Aggregation as an optimization problem
347(1)
Broadcasting an aggregated value
347(3)
Information-directed routing and aggregation
350(2)
Some further examples
352(3)
Further reading on data aggregation
355(1)
Data-centric storage
355(2)
Conclusions
357(2)
Transport layer and quality of service
359(54)
The transport layer and QoS in wireless sensor networks
359(3)
Quality of service/reliability
360(1)
Transport protocols
361(1)
Coverage and deployment
362(14)
Sensing models
362(2)
Coverage measures
364(1)
Uniform random deployments: Poisson point processes
365(1)
Coverage of random deployments: Boolean sensing model
366(2)
Coverage of random deployments: general sensing model
368(1)
Coverage determination
369(5)
Coverage of grid deployments
374(1)
Further reading
375(1)
Reliable data transport
376(2)
Reliability requirements in sensor networks
377(1)
Single packet delivery
378(11)
Using a single path
379(5)
Using multiple paths
384(4)
Multiple receivers
388(1)
Summary
389(1)
Block delivery
389(11)
PSFQ: block delivery in the sink-to-sensors case
389(6)
RMST: block delivery in the sensors-to-sink case
395(2)
What about TCP?
397(2)
Further reading
399(1)
Congestion control and rate control
400(13)
Congestion situations in sensor networks
400(2)
Mechanisms for congestion detection and handling
402(1)
Protocols with rate control
403(5)
The CODA congestion-control framework
408(3)
Further reading
411(2)
Advanced application support
413(24)
Advanced in-network processing
413(9)
Going beyond mere aggregation of data
413(1)
Distributed signal processing
414(2)
Distributed source coding
416(4)
Network coding
420(1)
Further issues
421(1)
Security
422(3)
Fundamentals
422(1)
Security considerations in wireless sensor networks
423(1)
Denial-of-service attacks
423(2)
Further reading
425(1)
Application-specific support
425(12)
Target detection and tracking
426(3)
Contourledge detection
429(3)
Field sampling
432(5)
Bibliography 437(44)
Index 481


Holger Karl is currently assistant professor in the Networking Group (Prof. Adam Wolisz) at the Technical University of Berlin.  His research interests focus on wireless and mobile networks, with a certain emphasis on ad-hoc networks. He has published numerous papers and research articles in international journals (e.g. IEEE, IEE, CPE). Andreas Willig is currently assistant professor at the University of Potsdam. His areas of interest comprise communication networks (wireless LANs, real-time systems and ad-hoc and sensor networks) and performance evaluation.