文件名称：Wireless Ad Hoc and Sensor Networks Theory and Applications
文件大小：5.64MB
文件格式：PDF
更新时间：2012-01-11 18:37:39
Wireless Sensor
Part I Introduction 1 1 History of Wireless Networks 3 1.1 Introduction 3 1.2 Different Wireless Networks 4 1.3 Conclusion 14 2 Wireless Transmission Fundamentals 17 2.1 Wireless Channels 17 2.2 The Wireless Communication Graph 21 2.3 Power Assignment and Topology Control 23 2.4 The Wireless Interference Graph 28 2.5 Related Graph Problems and Geometry Concepts 32 2.6 Energy-Consumption Models 35 2.7 Mobility Models 38 2.8 Conclusion 41 Part II Wireless MACs 45 3 Wireless Medium-Access Control Protocols 47 3.1 Introduction 47 3.2 IEEE 802.11 Architecture and Protocols 49 3.3 WiMAX 60 3.4 Bluetooth 61 3.5 MAC Protocols for Wireless Sensor Networks 63 3.6 Conclusion 69 4 TDMA Channel Assignment 71 4.1 Introduction 71 4.2 System Model and Assumptions 73 4.3 Centralized Scheduling 75 4.4 Distributed Algorithms 85 4.5 Weighted Coloring and Schedulable Flows 90 4.6 Further Reading 94 4.7 Conclusion and Remarks 96 5 Spectrum Channel Assignment 99 5.1 Introduction 99 5.2 Network System Model 101 5.3 List-Coloring for Access Networks 102 5.4 List-Coloring for Ad Hoc Networks 112 5.5 Transition Phenomena on Channel Availability 114 5.6 Further Reading 116 5.7 Conclusion and Remarks 118 6 CDMA Code Channel Assignment 120 6.1 Introduction 120 6.2 System Model and Assumptions 123 6.3 Throughput and Bottleneck of General Graphs 126 6.4 Approximation Algorithms for Interference Graphs 129 6.5 Maximum Weighted Independent Set for a General Wireless Network Model 136 6.6 Further Reading 148 6.7 Conclusion and Remarks 150 Part III Topology Control and Clustering 153 7 Clustering and Network Backbone 155 7.1 Introduction 155 7.2 Network Models and Problem Formulation 155 7.3 Centralized Algorithms for a Connected Dominating Set 157 7.4 Message Lower Bound for Distributed-Backbone Construction 161 7.5 Some Backbone-Formation Heuristics 163 7.6 Efficient Distributed-Nontrivial-Backbone-Formation Method 166 7.7 Efficient Distributed-Backbone-Formation Method 170 7.8 Linear-Programming-Based Approaches 179 7.9 Geometry-Position-Based Approaches 184 7.10 Further Reading 186 7.11 Conclusion and Remarks 187 8 Weighted Network Backbone 190 8.1 Introduction 190 8.2 Study of Typical Methods 191 8.3 Centralized Low-Cost Backbone-Formation Algorithms 193 8.4 Efficient Distributed Low-Cost Backbone-Formation Algorithms 194 8.5 Performance Guarantee 197 8.6 Discussion 205 8.7 Further Reading 209 8.8 Conclusion and Remarks 211 9 Topology Control with Flat Structures 213 9.1 Introduction 213 9.2 Current State of Knowledge 219 9.3 Planar Structures 224 9.4 Bounded-Degree Spanner and Yao’s Family 228 9.5 Bounded-Degree Planar Spanner 231 9.6 Low-Weighted Structures 233 9.7 A Unified Structure: Energy Efficiency for Unicast and Broadcast 238 9.8 Spanners for Heterogeneous Networks 250 9.9 Fault-Tolerant Structures 259 9.10 Other Spanners 266 9.11 Conclusion and Remarks 267 10 Power Assignment 270 10.1 Introduction 270 10.2 Power Assignment for Connectivity 273 10.3 Power Assignment for Routing 280 10.4 Further Reading 284 10.5 Conclusion and Remarks 285 11 Critical Transmission Ranges for Connectivity 289 11.1 Introduction 289 11.2 Preliminaries 292 11.3 Critical Range for Connectivity 293 11.4 Critical Range for k-Connectivity 296 11.5 Connectivity with Bernoulli Nodes 301 11.6 Practical Performances 304 11.7 Further Reading 307 11.8 Conclusion and Remarks 310 12 Other Transition Phenomena 313 12.1 Introduction 313 12.2 Critical Node Degree for Connectivity 313 12.3 Critical Range for Connectivity in Sparse Networks 315 12.4 Critical Range for Connectivity for Mobile Networks 316 12.5 Critical Sensing Range for Coverage 320 12.6 Critical Range for Successful Routing 322 12.7 Further Reading 330 12.8 Conclusion and Remarks 331 Part IV Wireless Network Routing Protocols 333 13 Energy-Efficient Unicast Routing 335 13.1 Introduction 335 13.2 Proactive Approaches 336 13.3 Reactive Approaches 340 13.4 Geographic Approaches 347 13.5 Clustering and Hierarchical Routing 361 13.6 Further Reading 364 13.7 Conclusion and Remarks 365 14 Energy-Efficient Broadcast/Multicast Routing 369 14.1 Introduction 369 14.2 Centralized Methods 374 14.3 Efficient Distributed or Localized Methods 380 14.4 Scheduling Active and Sleep Periods 392 14.5 Energy-Efficient Multicast 394 14.6 Further Reading 398 14.7 Conclusion and Remarks 399 15 Routing with Selfish Terminals 402 15.1 Introduction 402 15.2 Preliminaries and Network Model 403 15.3 Truthful Payment Schemes for Multicast 408 15.4 Sharing Multicast Costs or Payments Among Receivers 416 15.5 Existence of Truthful Payment Scheme 431 15.6 Further Reading 433 15.7 Conclusion and Remarks 436 16 Joint Routing, Channel Assignment, and Link Scheduling 440 16.1 Introduction 440 16.2 System Model and Assumptions 441 16.3 Problem Formulation for Cross-Layer Optimization 444 16.4 Efficient Link, Channel Scheduling 449 16.5 Further Reading 455 16.6 Conclusion 458 Part V Other Issues 461 17 Localization and Location Tracking 463 17.1 Introduction 463 17.2 Available Information 465 17.3 Computational Complexity of Sensor Network Localization 470 17.4 Progressive Localization Methods 476 17.5 Network-Wide Localization Methods 482 17.6 Target Tracking and Classification 485 17.7 Experimental Location and Tracking Systems 498 17.8 Conclusion and Remarks 500 18 Performance Limitations of Random Wireless Ad Hoc Networks 503 18.1 Introduction 503 18.2 Capacity of Unicast for an Arbitrary Network 506 18.3 Capacity of Unicast for Randomly Deployed Networks 508 18.4 Capacity of Broadcast for an Arbitrary Network 510 18.5 Capacity of Broadcast for Randomly Deployed Networks 512 18.6 Further Reading 517 18.7 Conclusion and Remarks 518 19 Security of Wireless Ad Hoc Networks 521 19.1 Introduction 521 19.2 Cryptography Fundamentals 522 19.3 Key-Predistribution Protocols 536 19.4 Secure Routing Protocols 538 19.5 Further Reading 542 19.6 Conclusion and Remarks 543 Bibliography 547 Index 579