Networking standards and protocols Books

Book SynopsisLearn 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.Trade Review"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 Universitat Berlin, January 2006)Table of ContentsPreface xiii List of abbreviations xv A guide to the book xxiii 1 Introduction 1 1.1 The vision of Ambient Intelligence 1 1.2 Application examples 3 1.3 Types of applications 6 1.4 Challenges for WSNs 7 1.4.1 Characteristic requirements 7 1.4.2 Required mechanisms 9 1.5 Why are sensor networks different? 10 1.5.1 Mobile ad hoc networks and wireless sensor networks 10 1.5.2 Fieldbuses and wireless sensor networks 12 1.6 Enabling technologies for wireless sensor networks 13 Part I Architectures 15 2 Single-node architecture 17 2.1 Hardware components 18 2.1.1 Sensor node hardware overview 18 2.1.2 Controller 19 2.1.3 Memory 21 2.1.4 Communication device 21 2.1.5 Sensors and actuators 31 2.1.6 Power supply of sensor nodes 32 2.2 Energy consumption of sensor nodes 36 2.2.1 Operation states with different power consumption 36 2.2.2 Microcontroller energy consumption 38 2.2.3 Memory 39 2.2.4 Radio transceivers 40 2.2.5 Relationship between computation and communication 44 2.2.6 Power consumption of sensor and actuators 44 2.3 Operating systems and execution environments 45 2.3.1 Embedded operating systems 45 2.3.2 Programming paradigms and application programming interfaces 45 2.3.3 Structure of operating system and protocol stack 47 2.3.4 Dynamic energy and power management 48 2.3.5 Case Study: TinyOS and nesC 50 2.3.6 Other examples 53 2.4 Some examples of sensor nodes 54 2.4.1 The “Mica Mote” family 54 2.4.2 EYES nodes 54 2.4.3 BTnodes 54 2.4.4 Scatterweb 54 2.4.5 Commercial solutions 55 2.5 Conclusion 56 3 Network architecture 59 3.1 Sensor network scenarios 60 3.1.1 Types of sources and sinks 60 3.1.2 Single-hop versus multihop networks 60 3.1.3 Multiple sinks and sources 62 3.1.4 Three types of mobility 62 3.2 Optimization goals and figures of merit 63 3.2.1 Quality of service 64 3.2.2 Energy efficiency 65 3.2.3 Scalability 66 3.2.4 Robustness 67 3.3 Design principles for WSNs 67 3.3.1 Distributed organization 67 3.3.2 In-network processing 67 3.3.3 Adaptive fidelity and accuracy 70 3.3.4 Data centricity 70 3.3.5 Exploit location information 73 3.3.6 Exploit activity patterns 73 3.3.7 Exploit heterogeneity 73 3.3.8 Component-based protocol stacks and cross-layer optimization 74 3.4 Service interfaces of WSNs 74 3.4.1 Structuring application/protocol stack interfaces 74 3.4.2 Expressibility requirements for WSN service interfaces 76 3.4.3 Discussion 77 3.5 Gateway concepts 78 3.5.1 The need for gateways 78 3.5.2 WSN to Internet communication 79 3.5.3 Internet to WSN communication 80 3.5.4 WSN tunneling 81 3.6 Conclusion 81 Part II Communication Protocols 83 4 Physical layer 85 4.1 Introduction 85 4.2 Wireless channel and communication fundamentals 86 4.2.1 Frequency allocation 86 4.2.2 Modulation and demodulation 88 4.2.3 Wave propagation effects and noise 90 4.2.4 Channel models 96 4.2.5 Spread-spectrum communications 98 4.2.6 Packet transmission and synchronization 100 4.2.7 Quality of wireless channels and measures for improvement 102 4.3 Physical layer and transceiver design considerations in WSNs 103 4.3.1 Energy usage profile 103 4.3.2 Choice of modulation scheme 104 4.3.3 Dynamic modulation scaling 108 4.3.4 Antenna considerations 108 4.4 Further reading 109 5 MAC protocols 111 5.1 Fundamentals of (wireless) MAC protocols 112 5.1.1 Requirements and design constraints for wireless MAC protocols 112 5.1.2 Important classes of MAC protocols 114 5.1.3 MAC protocols for wireless sensor networks 119 5.2 Low duty cycle protocols and wakeup concepts 120 5.2.1 Sparse topology and energy management (STEM) 121 5.2.2 S-mac 123 5.2.3 The mediation device protocol 126 5.2.4 Wakeup radio concepts 127 5.2.5 Further reading 128 5.3 Contention-based protocols 129 5.3.1 CSMA protocols 129 5.3.2 Pamas 131 5.3.3 Further solutions 132 5.4 Schedule-based protocols 133 5.4.1 Leach 133 5.4.2 Smacs 135 5.4.3 Traffic-adaptive medium access protocol (TRAMA) 137 5.4.4 Further solutions 139 5.5 The IEEE 802.15.4 MAC protocol 139 5.5.1 Network architecture and types/roles of nodes 140 5.5.2 Superframe structure 141 5.5.3 GTS management 141 5.5.4 Data transfer procedures 142 5.5.5 Slotted CSMA-CA protocol 142 5.5.6 Nonbeaconed mode 144 5.5.7 Further reading 145 5.6 How about IEEE 802.11 and bluetooth? 145 5.7 Further reading 146 5.8 Conclusion 148 6 Link-layer protocols 149 6.1 Fundamentals: tasks and requirements 150 6.2 Error control 151 6.2.1 Causes and characteristics of transmission errors 151 6.2.2 ARQ techniques 152 6.2.3 FEC techniques 158 6.2.4 Hybrid schemes 163 6.2.5 Power control 165 6.2.6 Further mechanisms to combat errors 166 6.2.7 Error control: summary 167 6.3 Framing 167 6.3.1 Adaptive schemes 170 6.3.2 Intermediate checksum schemes 172 6.3.3 Combining packet-size optimization and FEC 173 6.3.4 Treatment of frame headers 174 6.3.5 Framing: summary 174 6.4 Link management 174 6.4.1 Link-quality characteristics 175 6.4.2 Link-quality estimation 177 6.5 Summary 179 7 Naming and addressing 181 7.1 Fundamentals 182 7.1.1 Use of addresses and names in (sensor) networks 182 7.1.2 Address management tasks 183 7.1.3 Uniqueness of addresses 184 7.1.4 Address allocation and assignment 184 7.1.5 Addressing overhead 185 7.2 Address and name management in wireless sensor networks 186 7.3 Assignment of MAC addresses 186 7.3.1 Distributed assignment of networkwide addresses 187 7.4 Distributed assignment of locally unique addresses 189 7.4.1 Address assignment algorithm 189 7.4.2 Address selection and representation 191 7.4.3 Further schemes 194 7.5 Content-based and geographic addressing 194 7.5.1 Content-based addressing 194 7.5.2 Geographic addressing 198 7.6 Summary 198 8 Time synchronization 201 8.1 Introduction to the time synchronization problem 201 8.1.1 The need for time synchronization in wireless sensor networks 202 8.1.2 Node clocks and the problem of accuracy 203 8.1.3 Properties and structure of time synchronization algorithms 204 8.1.4 Time synchronization in wireless sensor networks 206 8.2 Protocols based on sender/receiver synchronization 207 8.2.1 Lightweight time synchronization protocol (LTS) 207 8.2.2 How to increase accuracy and estimate drift 212 8.2.3 Timing-sync protocol for sensor networks (TPSN) 214 8.3 Protocols based on receiver/receiver synchronization 217 8.3.1 Reference broadcast synchronization (RBS) 217 8.3.2 Hierarchy referencing time synchronization (HRTS) 223 8.4 Further reading 226 9 Localization and positioning 231 9.1 Properties of localization and positioning procedures 232 9.2 Possible approaches 233 9.2.1 Proximity 233 9.2.2 Trilateration and triangulation 234 9.2.3 Scene analysis 237 9.3 Mathematical basics for the lateration problem 237 9.3.1 Solution with three anchors and correct distance values 238 9.3.2 Solving with distance errors 238 9.4 Single-hop localization 240 9.4.1 Active Badge 240 9.4.2 Active office 240 9.4.3 Radar 240 9.4.4 Cricket 241 9.4.5 Overlapping connectivity 241 9.4.6 Approximate point in triangle 242 9.4.7 Using angle of arrival information 243 9.5 Positioning in multihop environments 243 9.5.1 Connectivity in a multihop network 244 9.5.2 Multihop range estimation 244 9.5.3 Iterative and collaborative multilateration 245 9.5.4 Probabilistic positioning description and propagation 247 9.6 Impact of anchor placement 247 9.7 Further reading 248 9.8 Conclusion 249 10 Topology control 251 10.1 Motivation and basic ideas 251 10.1.1 Options for topology control 252 10.1.2 Aspects of topology-control algorithms 254 10.2 Controlling topology in flat networks – Power control 256 10.2.1 Some complexity results 256 10.2.2 Are there magic numbers? – bounds on critical parameters 257 10.2.3 Some example constructions and protocols 259 10.2.4 Further reading on flat topology control 265 10.3 Hierarchical networks by dominating sets 266 10.3.1 Motivation and definition 266 10.3.2 A hardness result 266 10.3.3 Some ideas from centralized algorithms 267 10.3.4 Some distributed approximations 270 10.3.5 Further reading 273 10.4 Hierarchical networks by clustering 274 10.4.1 Definition of clusters 274 10.4.2 A basic idea to construct independent sets 277 10.4.3 A generalization and some performance insights 278 10.4.4 Connecting clusters 278 10.4.5 Rotating clusterheads 279 10.4.6 Some more algorithm examples 280 10.4.7 Multihop clusters 281 10.4.8 Multiple layers of clustering 283 10.4.9 Passive clustering 284 10.4.10 Further reading 284 10.5 Combining hierarchical topologies and power control 285 10.5.1 Pilot-based power control 285 10.5.2 Ad hoc Network Design Algorithm (ANDA) 285 10.5.3 Clusterpow 286 10.6 Adaptive node activity 286 10.6.1 Geographic Adaptive Fidelity (GAF) 286 10.6.2 Adaptive Self-Configuring sEnsor Networks’ Topologies (ASCENT) 287 10.6.3 Turning off nodes on the basis of sensing coverage 288 10.7 Conclusions 288 11 Routing protocols 289 11.1 The many faces of forwarding and routing 289 11.2 Gossiping and agent-based unicast forwarding 292 11.2.1 Basic idea 292 11.2.2 Randomized forwarding 292 11.2.3 Random walks 293 11.2.4 Further reading 294 11.3 Energy-efficient unicast 295 11.3.1 Overview 295 11.3.2 Some example unicast protocols 297 11.3.3 Further reading 301 11.3.4 Multipath unicast routing 301 11.3.5 Further reading 304 11.4 Broadcast and multicast 305 11.4.1 Overview 305 11.4.2 Source-based tree protocols 308 11.4.3 Shared, core-based tree protocols 314 11.4.4 Mesh-based protocols 314 11.4.5 Further reading on broadcast and multicast 315 11.5 Geographic routing 316 11.5.1 Basics of position-based routing 316 11.5.2 Geocasting 323 11.5.3 Further reading on geographic routing 326 11.6 Mobile nodes 328 11.6.1 Mobile sinks 328 11.6.2 Mobile data collectors 328 11.6.3 Mobile regions 329 11.7 Conclusions 329 12 Data-centric and content-based networking 331 12.1 Introduction 331 12.1.1 The publish/subscribe interaction paradigm 331 12.1.2 Addressing data 332 12.1.3 Implementation options 333 12.1.4 Distribution versus gathering of data – In-network processing 334 12.2 Data-centric routing 335 12.2.1 One-shot interactions 335 12.2.2 Repeated interactions 337 12.2.3 Further reading 340 12.3 Data aggregation 341 12.3.1 Overview 341 12.3.2 A database interface to describe aggregation operations 342 12.3.3 Categories of aggregation operations 343 12.3.4 Placement of aggregation points 345 12.3.5 When to stop waiting for more data 345 12.3.6 Aggregation as an optimization problem 347 12.3.7 Broadcasting an aggregated value 347 12.3.8 Information-directed routing and aggregation 350 12.3.9 Some further examples 352 12.3.10 Further reading on data aggregation 355 12.4 Data-centric storage 355 12.5 Conclusions 357 13 Transport layer and quality of service 359 13.1 The transport layer and QoS in wireless sensor networks 359 13.1.1 Quality of service/reliability 360 13.1.2 Transport protocols 361 13.2 Coverage and deployment 362 13.2.1 Sensing models 362 13.2.2 Coverage measures 364 13.2.3 Uniform random deployments: Poisson point processes 365 13.2.4 Coverage of random deployments: Boolean sensing model 366 13.2.5 Coverage of random deployments: general sensing model 368 13.2.6 Coverage determination 369 13.2.7 Coverage of grid deployments 374 13.2.8 Further reading 375 13.3 Reliable data transport 376 13.3.1 Reliability requirements in sensor networks 377 13.4 Single packet delivery 378 13.4.1 Using a single path 379 13.4.2 Using multiple paths 384 13.4.3 Multiple receivers 388 13.4.4 Summary 389 13.5 Block delivery 389 13.5.1 PSFQ: block delivery in the sink-to-sensors case 389 13.5.2 RMST: block delivery in the sensors-to-sink case 395 13.5.3 What about TCP? 397 13.5.4 Further reading 399 13.6 Congestion control and rate control 400 13.6.1 Congestion situations in sensor networks 400 13.6.2 Mechanisms for congestion detection and handling 402 13.6.3 Protocols with rate control 403 13.6.4 The CODA congestion-control framework 408 13.6.5 Further reading 411 14 Advanced application support 413 14.1 Advanced in-network processing 413 14.1.1 Going beyond mere aggregation of data 413 14.1.2 Distributed signal processing 414 14.1.3 Distributed source coding 416 14.1.4 Network coding 420 14.1.5 Further issues 421 14.2 Security 422 14.2.1 Fundamentals 422 14.2.2 Security considerations in wireless sensor networks 423 14.2.3 Denial-of-service attacks 423 14.2.4 Further reading 425 14.3 Application-specific support 425 14.3.1 Target detection and tracking 426 14.3.2 Contour/edge detection 429 14.3.3 Field sampling 432 Bibliography 437 Index 481

Read more less

Book SynopsisLearn 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.Trade Review"…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)Table of ContentsPreface xiii List of abbreviations xv A guide to the book xxiii 1 Introduction 1 1.1 The vision of Ambient Intelligence 1 1.2 Application examples 3 1.3 Types of applications 6 1.4 Challenges for WSNs 7 1.4.1 Characteristic requirements 7 1.4.2 Required mechanisms 9 1.5 Why are sensor networks different? 10 1.5.1 Mobile ad hoc networks and wireless sensor networks 10 1.5.2 Fieldbuses and wireless sensor networks 12 1.6 Enabling technologies for wireless sensor networks 13 Part I Architectures 15 2 Single-node architecture 17 2.1 Hardware components 18 2.1.1 Sensor node hardware overview 18 2.1.2 Controller 19 2.1.3 Memory 21 2.1.4 Communication device 21 2.1.5 Sensors and actuators 31 2.1.6 Power supply of sensor nodes 32 2.2 Energy consumption of sensor nodes 36 2.2.1 Operation states with different power consumption 36 2.2.2 Microcontroller energy consumption 38 2.2.3 Memory 39 2.2.4 Radio transceivers 40 2.2.5 Relationship between computation and communication 44 2.2.6 Power consumption of sensor and actuators 44 2.3 Operating systems and execution environments 45 2.3.1 Embedded operating systems 45 2.3.2 Programming paradigms and application programming interfaces 45 2.3.3 Structure of operating system and protocol stack 47 2.3.4 Dynamic energy and power management 48 2.3.5 Case Study: TinyOS and nesC 50 2.3.6 Other examples 53 2.4 Some examples of sensor nodes 54 2.4.1 The “Mica Mote” family 54 2.4.2 EYES nodes 54 2.4.3 BTnodes 54 2.4.4 Scatterweb 54 2.4.5 Commercial solutions 55 2.5 Conclusion 56 3 Network architecture 59 3.1 Sensor network scenarios 60 3.1.1 Types of sources and sinks 60 3.1.2 Single-hop versus multihop networks 60 3.1.3 Multiple sinks and sources 62 3.1.4 Three types of mobility 62 3.2 Optimization goals and figures of merit 63 3.2.1 Quality of service 64 3.2.2 Energy efficiency 65 3.2.3 Scalability 66 3.2.4 Robustness 67 3.3 Design principles for WSNs 67 3.3.1 Distributed organization 67 3.3.2 In-network processing 67 3.3.3 Adaptive fidelity and accuracy 70 3.3.4 Data centricity 70 3.3.5 Exploit location information 73 3.3.6 Exploit activity patterns 73 3.3.7 Exploit heterogeneity 73 3.3.8 Component-based protocol stacks and cross-layer optimization 74 3.4 Service interfaces of WSNs 74 3.4.1 Structuring application/protocol stack interfaces 74 3.4.2 Expressibility requirements for WSN service interfaces 76 3.4.3 Discussion 77 3.5 Gateway concepts 78 3.5.1 The need for gateways 78 3.5.2 WSN to Internet communication 79 3.5.3 Internet to WSN communication 80 3.5.4 WSN tunneling 81 3.6 Conclusion 81 Part II Communication Protocols 83 4 Physical layer 85 4.1 Introduction 85 4.2 Wireless channel and communication fundamentals 86 4.2.1 Frequency allocation 86 4.2.2 Modulation and demodulation 88 4.2.3 Wave propagation effects and noise 90 4.2.4 Channel models 96 4.2.5 Spread-spectrum communications 98 4.2.6 Packet transmission and synchronization 100 4.2.7 Quality of wireless channels and measures for improvement 102 4.3 Physical layer and transceiver design considerations in WSNs 103 4.3.1 Energy usage profile 103 4.3.2 Choice of modulation scheme 104 4.3.3 Dynamic modulation scaling 108 4.3.4 Antenna considerations 108 4.4 Further reading 109 5 MAC protocols 111 5.1 Fundamentals of (wireless) MAC protocols 112 5.1.1 Requirements and design constraints for wireless MAC protocols 112 5.1.2 Important classes of MAC protocols 114 5.1.3 MAC protocols for wireless sensor networks 119 5.2 Low duty cycle protocols and wakeup concepts 120 5.2.1 Sparse topology and energy management (STEM) 121 5.2.2 S-mac 123 5.2.3 The mediation device protocol 126 5.2.4 Wakeup radio concepts 127 5.2.5 Further reading 128 5.3 Contention-based protocols 129 5.3.1 CSMA protocols 129 5.3.2 PAMAS 131 5.3.3 Further solutions 132 5.4 Schedule-based protocols 133 5.4.1 LEACH 133 5.4.2 SMACS 135 5.4.3 Traffic-adaptive medium access protocol (TRAMA) 137 5.4.4 Further solutions 139 5.5 The IEEE 802.15.4 MAC protocol 139 5.5.1 Network architecture and types/roles of nodes 140 5.5.2 Superframe structure 141 5.5.3 GTS management 141 5.5.4 Data transfer procedures 142 5.5.5 Slotted CSMA-CA protocol 142 5.5.6 Nonbeaconed mode 144 5.5.7 Further reading 145 5.6 How about IEEE 802.11 and bluetooth? 145 5.7 Further reading 146 5.8 Conclusion 148 6 Link-layer protocols 149 6.1 Fundamentals: tasks and requirements 150 6.2 Error control 151 6.2.1 Causes and characteristics of transmission errors 151 6.2.2 ARQ techniques 152 6.2.3 FEC techniques 158 6.2.4 Hybrid schemes 163 6.2.5 Power control 165 6.2.6 Further mechanisms to combat errors 166 6.2.7 Error control: summary 167 6.3 Framing 167 6.3.1 Adaptive schemes 170 6.3.2 Intermediate checksum schemes 172 6.3.3 Combining packet-size optimization and FEC 173 6.3.4 Treatment of frame headers 174 6.3.5 Framing: summary 174 6.4 Link management 174 6.4.1 Link-quality characteristics 175 6.4.2 Link-quality estimation 177 6.5 Summary 179 7 Naming and addressing 181 7.1 Fundamentals 182 7.1.1 Use of addresses and names in (sensor) networks 182 7.1.2 Address management tasks 183 7.1.3 Uniqueness of addresses 184 7.1.4 Address allocation and assignment 184 7.1.5 Addressing overhead 185 7.2 Address and name management in wireless sensor networks 186 7.3 Assignment of MAC addresses 186 7.3.1 Distributed assignment of networkwide addresses 187 7.4 Distributed assignment of locally unique addresses 189 7.4.1 Address assignment algorithm 189 7.4.2 Address selection and representation 191 7.4.3 Further schemes 194 7.5 Content-based and geographic addressing 194 7.5.1 Content-based addressing 194 7.5.2 Geographic addressing 198 7.6 Summary 198 8 Time synchronization 201 8.1 Introduction to the time synchronization problem 201 8.1.1 The need for time synchronization in wireless sensor networks 202 8.1.2 Node clocks and the problem of accuracy 203 8.1.3 Properties and structure of time synchronization algorithms 204 8.1.4 Time synchronization in wireless sensor networks 206 8.2 Protocols based on sender/receiver synchronization 207 8.2.1 Lightweight time synchronization protocol (LTS) 207 8.2.2 How to increase accuracy and estimate drift 212 8.2.3 Timing-sync protocol for sensor networks (TPSN) 214 8.3 Protocols based on receiver/receiver synchronization 217 8.3.1 Reference broadcast synchronization (RBS) 217 8.3.2 Hierarchy referencing time synchronization (HRTS) 223 8.4 Further reading 226 9 Localization and positioning 231 9.1 Properties of localization and positioning procedures 232 9.2 Possible approaches 233 9.2.1 Proximity 233 9.2.2 Trilateration and triangulation 234 9.2.3 Scene analysis 237 9.3 Mathematical basics for the lateration problem 237 9.3.1 Solution with three anchors and correct distance values 238 9.3.2 Solving with distance errors 238 9.4 Single-hop localization 240 9.4.1 Active Badge 240 9.4.2 Active office 240 9.4.3 Radar 240 9.4.4 Cricket 241 9.4.5 Overlapping connectivity 241 9.4.6 Approximate point in triangle 242 9.4.7 Using angle of arrival information 243 9.5 Positioning in multihop environments 243 9.5.1 Connectivity in a multihop network 244 9.5.2 Multihop range estimation 244 9.5.3 Iterative and collaborative multilateration 245 9.5.4 Probabilistic positioning description and propagation 247 9.6 Impact of anchor placement 247 9.7 Further reading 248 9.8 Conclusion 249 10 Topology control 251 10.1 Motivation and basic ideas 251 10.1.1 Options for topology control 252 10.1.2 Aspects of topology-control algorithms 254 10.2 Controlling topology in flat networks – Power control 256 10.2.1 Some complexity results 256 10.2.2 Are there magic numbers? – bounds on critical parameters 257 10.2.3 Some example constructions and protocols 259 10.2.4 Further reading on flat topology control 265 10.3 Hierarchical networks by dominating sets 266 10.3.1 Motivation and definition 266 10.3.2 A hardness result 266 10.3.3 Some ideas from centralized algorithms 267 10.3.4 Some distributed approximations 270 10.3.5 Further reading 273 10.4 Hierarchical networks by clustering 274 10.4.1 Definition of clusters 274 10.4.2 A basic idea to construct independent sets 277 10.4.3 A generalization and some performance insights 278 10.4.4 Connecting clusters 278 10.4.5 Rotating clusterheads 279 10.4.6 Some more algorithm examples 280 10.4.7 Multihop clusters 281 10.4.8 Multiple layers of clustering 283 10.4.9 Passive clustering 284 10.4.10 Further reading 284 10.5 Combining hierarchical topologies and power control 285 10.5.1 Pilot-based power control 285 10.5.2 Ad hoc Network Design Algorithm (ANDA) 285 10.5.3 Clusterpow 286 10.6 Adaptive node activity 286 10.6.1 Geographic Adaptive Fidelity (GAF) 286 10.6.2 Adaptive Self-Configuring sEnsor Networks’ Topologies (ASCENT) 287 10.6.3 Turning off nodes on the basis of sensing coverage 288 10.7 Conclusions 288 11 Routing protocols 289 11.1 The many faces of forwarding and routing 289 11.2 Gossiping and agent-based unicast forwarding 292 11.2.1 Basic idea 292 11.2.2 Randomized forwarding 292 11.2.3 Random walks 293 11.2.4 Further reading 294 11.3 Energy-efficient unicast 295 11.3.1 Overview 295 11.3.2 Some example unicast protocols 297 11.3.3 Further reading 301 11.3.4 Multipath unicast routing 301 11.3.5 Further reading 304 11.4 Broadcast and multicast 305 11.4.1 Overview 305 11.4.2 Source-based tree protocols 308 11.4.3 Shared, core-based tree protocols 314 11.4.4 Mesh-based protocols 314 11.4.5 Further reading on broadcast and multicast 315 11.5 Geographic routing 316 11.5.1 Basics of position-based routing 316 11.5.2 Geocasting 323 11.5.3 Further reading on geographic routing 326 11.6 Mobile nodes 328 11.6.1 Mobile sinks 328 11.6.2 Mobile data collectors 328 11.6.3 Mobile regions 329 11.7 Conclusions 329 12 Data-centric and content-based networking 331 12.1 Introduction 331 12.1.1 The publish/subscribe interaction paradigm 331 12.1.2 Addressing data 332 12.1.3 Implementation options 333 12.1.4 Distribution versus gathering of data – In-network processing 334 12.2 Data-centric routing 335 12.2.1 One-shot interactions 335 12.2.2 Repeated interactions 337 12.2.3 Further reading 340 12.3 Data aggregation 341 12.3.1 Overview 341 12.3.2 A database interface to describe aggregation operations 342 12.3.3 Categories of aggregation operations 343 12.3.4 Placement of aggregation points 345 12.3.5 When to stop waiting for more data 345 12.3.6 Aggregation as an optimization problem 347 12.3.7 Broadcasting an aggregated value 347 12.3.8 Information-directed routing and aggregation 350 12.3.9 Some further examples 352 12.3.10 Further reading on data aggregation 355 12.4 Data-centric storage 355 12.5 Conclusions 357 13 Transport layer and quality of service 359 13.1 The transport layer and QoS in wireless sensor networks 359 13.1.1 Quality of service/reliability 360 13.1.2 Transport protocols 361 13.2 Coverage and deployment 362 13.2.1 Sensing models 362 13.2.2 Coverage measures 364 13.2.3 Uniform random deployments: Poisson point processes 365 13.2.4 Coverage of random deployments: Boolean sensing model 366 13.2.5 Coverage of random deployments: general sensing model 368 13.2.6 Coverage determination 369 13.2.7 Coverage of grid deployments 374 13.2.8 Further reading 375 13.3 Reliable data transport 376 13.3.1 Reliability requirements in sensor networks 377 13.4 Single packet delivery 378 13.4.1 Using a single path 379 13.4.2 Using multiple paths 384 13.4.3 Multiple receivers 388 13.4.4 Summary 389 13.5 Block delivery 389 13.5.1 PSFQ: block delivery in the sink-to-sensors case 389 13.5.2 RMST: block delivery in the sensors-to-sink case 395 13.5.3 What about TCP? 397 13.5.4 Further reading 399 13.6 Congestion control and rate control 400 13.6.1 Congestion situations in sensor networks 400 13.6.2 Mechanisms for congestion detection and handling 402 13.6.3 Protocols with rate control 403 13.6.4 The CODA congestion-control framework 408 13.6.5 Further reading 411 14 Advanced application support 413 14.1 Advanced in-network processing 413 14.1.1 Going beyond mere aggregation of data 413 14.1.2 Distributed signal processing 414 14.1.3 Distributed source coding 416 14.1.4 Network coding 420 14.1.5 Further issues 421 14.2 Security 422 14.2.1 Fundamentals 422 14.2.2 Security considerations in wireless sensor networks 423 14.2.3 Denial-of-service attacks 423 14.2.4 Further reading 425 14.3 Application-specific support 425 14.3.1 Target detection and tracking 426 14.3.2 Contour/edge detection 429 14.3.3 Field sampling 432 Bibliography 437 Index 481

Read more less

Book SynopsisWritten by international experts in the field, this book covers the standards, architecture and deployment issues related to IP-based emergency services This book brings together contributions from experts on technical and operational aspects within the international standardisation and regulatory processes relating to routing and handling of IP-based emergency calls. Readers will learn how these standards work, how various standardization organizations contributed to them and about pilot projects, early deployment and current regulatory situation. Key Features: Provides an overview of how the standards related to IP-based emergency services work, and how various organizations contributed to them Focuses on SIP and IMS-based communication systems for the Internet Covers standards, architecture and deployment issues International focus, with coverage of the major national efforts in this area Written Trade Review“In addition, practitioners, product architects, and developers will find interesting and useful ideas. Many parts of the book can be recommended to experts working on standards and regulations.” (IEEE Communications Magazine, 1 February 2015) Table of ContentsList of Figures xiii List of Tables xvii List of Contributors xix Preface xxi Acknowledgments xxv Acronyms xxvii 1 Introduction 1 1.1 History 1 1.2 Overview 5 1.3 Building Blocks 8 1.3.1 Recognizing Emergency Calls 8 1.3.2 Obtaining and Conveying Location Information 9 1.3.3 Routing Emergency Calls 9 2 Location: Formats, Encoding and Protocols 11 2.1 Applying the PIDF-LO civicAddress Type to US Addresses 14 2.1.1 Introduction: The Context and Purpose of PIDF-LO and CLDXF 15 2.1.2 CLDXF Elements 17 2.1.3 Conclusion 30 2.2 DHCP as a Location Configuration Protocol (LCP) 31 2.2.1 What’s New in RFC 6225? 32 2.2.2 DHCPv4 and DHCPv6 Option Formats 32 2.2.3 Option Support 35 2.2.4 Latitude and Longitude Fields 36 2.2.5 Altitude 36 2.2.6 Datum 37 2.3 Geography Markup Language (GML) 37 2.3.1 Introduction 37 2.3.2 Overview of the OGC 38 2.3.3 The OGC Geography Markup Language (GML) 38 2.3.4 Conclusion 47 2.4 A Taxonomy of the IETF HELD Protocol 47 2.4.1 The LIS and HELD 48 2.4.2 LIS Discovery 48 2.4.3 Basic HELD 53 2.4.4 HELD Target Identities and Third-Party Requests 59 2.4.5 HELD Measurements 62 2.4.6 HELD as a Dereference Protocol 64 2.4.7 HELD Policy URIs 66 2.4.8 HELD Device Capabilities 69 2.5 OMA Enablers and Emergency Services 72 2.5.1 SUPL 73 2.5.2 MLS 84 2.5.3 MLP 85 2.5.4 LOCSIP 89 2.6 3GPP Location Protocols 92 2.6.1 Introduction 92 2.6.2 Location Technology in 3GPP Networks 93 2.6.3 Emergency Location Information in 3GPP CS Domain, Control Plane 100 2.6.4 Emergency Location Information in the IMS 100 3 Architectures 103 3.1 NENA i2 104 3.1.1 Background 104 3.1.2 The i2 Architecture 105 3.1.3 Regulatory Situation and Deployment Status 117 3.2 NENA i3 119 3.2.1 History 119 3.2.2 Emergency Services IP Networks 120 3.2.3 Signaling and Routing IP-Originated Calls 121 3.2.4 Legacy Wireline and Wireless Origination 122 3.2.5 Emergency Events 123 3.2.6 Routing Calls Within the ESInet 123 3.2.7 Provisioning the ECRF 124 3.2.8 PSAPs 125 3.2.9 Other i3 Features 126 3.3 IETF Emergency Services for Internet Multimedia 126 3.3.1 Introduction 126 3.3.2 Recognizing Emergency Calls 128 3.3.3 Obtaining and Conveying Location Information 128 3.3.4 Routing Emergency Calls 129 3.3.5 Obligations 130 3.3.6 LoST Mapping Architecture 132 3.3.7 Steps Toward an IETF Emergency Services Architecture 135 3.3.8 Summary 138 3.4 Emergency Services Support in WiFi Networks 139 3.4.1 Introduction 139 3.4.2 Location Configuration 140 3.4.3 Support for Emergency Services 141 3.4.4 Support for Emergency Alert Systems 142 3.5 WiMAX 142 3.5.1 The WiMAX Network Architecture 143 3.5.2 Network Architecture for Emergency Services Support 148 3.5.3 The Fundamental Building Blocks 150 3.5.4 Roaming Considerations and Network Entry 152 3.5.5 Limited Access 154 3.5.6 Location Support in WiMAX 157 3.5.7 Conclusion 163 3.6 3GPP 163 3.6.1 Introduction 163 3.6.2 Requirements 164 3.6.3 Emergency Calls in the CS Domain 169 3.6.4 Emergency Calls in PS Domain 176 3.6.5 Identified Overload Problems 189 4 Deployment Examples 193 4.1 Emergency Calling in Sweden 195 4.1.1 Introduction 195 4.1.2 Overview 196 4.1.3 Protocols for PSAP Interconnection 198 4.1.4 Protocol Standards 200 4.1.5 Media 201 4.1.6 Emergency Call Routing 201 4.1.7 Testing 201 4.1.8 Examples 201 4.2 UK Specification for Locating VoIP Callers 209 4.2.1 Introduction 209 4.2.2 The Regulatory Environment 209 4.2.3 Standards Development 210 4.2.4 The Current UK Emergency Services Structure 210 4.2.5 Principles Driving the Specification 211 4.2.6 Putting It All Together 213 4.2.7 Implications for Access Network Providers 215 4.3 Implementation of VoIP 9-1-1 Services in Canada 216 4.3.1 Regulatory Framework (About the CRTC) 217 4.3.2 Canada’s Telecom Profile 217 4.3.3 Interim Solution for Nomadic and Fixed/Non-Native VoIP 220 4.3.4 The (Defunct) Canadian i2 Proposal 222 4.3.5 VoIP Regulatory Processes, Decisions and Milestones 227 4.3.6 Lessons Learned 229 4.3.7 Conclusion 230 4.4 US/Indiana Wireless Direct Network Project 230 4.4.1 Background and History of the IWDN 231 4.4.2 The IWDN Crossroads Project 231 4.4.3 The IN911 IP Network 232 4.4.4 Conclusion 235 5 Security for IP-Based Emergency Services 237 5.1 Introduction 237 5.2 Communication Model 238 5.3 Adversary Models and Security Threats 240 5.4 Security Threats 241 5.4.1 Denial-of-Service Attacks 242 5.4.2 Attacks Involving the Emergency Identifier 242 5.4.3 Attacks Against the Mapping System 243 5.4.4 Attacks Against the Location Information Server 244 5.4.5 Swatting 245 5.4.6 Attacks to Prevent a Specific Individual From Receiving Aid 246 5.4.7 Attacks to Gain Information About an Emergency 246 5.4.8 Interfering With the LIS and LoST Server Discovery Procedure 246 5.4.9 Call Identity Spoofing 247 5.5 Countermeasures 248 5.5.1 Discovery 248 5.5.2 Secure Session Setup and Caller Identity 250 5.5.3 Media Exchange 251 5.5.4 Mapping Database Security 251 6 Emergency Services for Persons With Disabilities 253 6.1 What Is Specific with Communication for People with Disabilities? 253 6.1.1 Important Characteristics of Regular Voice Telephony 253 6.1.2 Important Characteristics of Accessible Conversational Services Suitable for People with Disabilities 254 6.2 Reality Today 255 6.3 Interpretation of the Term “Equivalent Service” 255 6.4 Sad History 256 6.5 Policy and Regulation Support 256 6.5.1 UN Convention on the Rights of Persons with Disabilities 256 6.5.2 The European Union Universal Service Directive 257 6.5.3 The Telecom Act and Public Procurement Act in the United States 257 6.5.4 Americans With Disability Act 257 6.5.5 Relay Service Regulation in the United States 258 6.6 Good Opportunities in IP-Based Services 258 6.7 Implementation Experience 260 7 Regulatory Situation 261 7.1 Regulatory Aspects of Emergency Services in the United States 262 7.1.1 Introduction 262 7.1.2 Background 262 7.1.3 E9-1-1 Requirements 263 7.2 Regulatory Aspects of Emergency Services in the European Union 266 7.2.1 Introduction 266 7.2.2 Regulatory Development of Emergency Services Under EU Law 267 7.2.3 Current Legal Framework 267 7.2.4 New Legal Framework 274 7.2.5 Emergency Regulation Outside of the EU Telecom Regulatory Framework 276 7.2.6 Conclusion 276 8 Research Projects and Pilots 279 8.1 REACH112: Responding to All Citizens Needing Help 280 8.1.1 Outline 280 8.1.2 Emergency Service Access 282 8.1.3 The Obstacles 284 8.1.4 Conclusion 288 8.2 PEACE: IP-Based Emergency Applications and Services for Next-Generation Networks 288 8.2.1 Introduction 288 8.2.2 Project Scope 289 8.2.3 Development Status 291 8.3 US Department of Transportation’s NG 9-1-1 Pilot Project 298 8.3.1 Overview 298 8.3.2 Proof-of-Concept Description 300 8.3.3 Testing 313 8.3.4 Conclusion 317 9 Organizations 321 9.1 ETSI EMTEL 322 9.1.1 Purpose of ETSI Special Committee EMTEL (Emergency Communications) 322 9.1.2 Main Features of EMTEL 322 9.1.3 Scope of ETSI SC EMTEL Work 323 9.1.4 Operation and Activities of SC EMTEL 324 9.1.5 EMTEL Evolution and Strategy 324 9.1.6 Vision for Future Emergency Services 325 9.2 NENA 326 9.3 EENA 327 9.3.1 What Is EENA? 327 9.3.2 What EENA Does? 327 9.3.3 What Are the EENA Memberships? 328 9.4 Ecma International 330 9.4.1 Ecma International 330 9.4.2 Ecma Technical Committee TC32 331 9.4.3 ECMA TR/101, Next Generation Corporate Networks (NGCN) – Emergency Calls 331 9.5 ATIS 332 9.5.1 Emergency Services Interconnection Forum (ESIF) 332 9.5.2 Next-Generation Emergency Services (NGES) Subcommittee 333 9.5.3 Example ESIF Issues 334 9.5.4 Summary 336 9.6 The NG9-1-1 Caucus and the NG9-1-1 Institute 336 9.7 COCOM EGEA 338 10 Conclusion and Outlook 341 10.1 Location 341 10.2 Architectures 342 10.3 Deployments 343 10.4 Security and Privacy 344 10.5 Emergency Services for Persons with Disabilities 344 10.6 Regulation 345 10.7 Research Projects and Pilots 345 10.8 Funding 346 References 349 Index 363

Read more less

Book SynopsisThis book is a general introduction to the statistical analysis of networks, and can serve both as a research monograph and as a textbook. Numerous fundamental tools and concepts needed for the analysis of networks are presented, such as network modeling, community detection, graph-based semi-supervised learning and sampling in networks. The description of these concepts is self-contained, with both theoretical justifications and applications provided for the presented algorithms.Researchers, including postgraduate students, working in the area of network science, complex network analysis, or social network analysis, will find up-to-date statistical methods relevant to their research tasks. This book can also serve as textbook material for courses related to thestatistical approach to the analysis of complex networks.In general, the chapters are fairly independent and self-supporting, and the book could be used for course composition “à la carte”. Nevertheless, Chapter 2 is needed to a certain degree for all parts of the book. It is also recommended to read Chapter 4 before reading Chapters 5 and 6, but this is not absolutely necessary. Reading Chapter 3 can also be helpful before reading Chapters 5 and 7. As prerequisites for reading this book, a basic knowledge in probability, linear algebra and elementary notions of graph theory is advised. Appendices describing required notions from the above mentioned disciplines have been added to help readers gain further understanding.Trade ReviewThis is an interesting book. Models are introduced in the first chapter, and then centralities in the second. Community detection is certainly a popular topic, especially among those working in complex network analysis. And the author is certainly correct that community detection in dynamic networks has received comparatively less exposure. There are models for dynamic networks and extensions of characterizations (like centrality and otherwise) for dynamic networks. Finally, the chapter on sampling is of interest, and not something that is usually covered in network texts. In my opinion the book should have good market appeal. Eric D. Kolaczyk, Boston University, USA -- Eric D. KolaczykThe book proposed is a worthwhile one. Network analysis is an active area with a huge amount of work being produced in recent years. The subject of network analysis spans mathematics, probability, statistics, physics and computer science, amongst others. The book focusses on the topics of community detection, dynamic graphs and sampling on graphs. These are all topics of interest to researchers in network analysis and people who analyse network data. Community detection is hugely relevant in applications of network analysis. The book would be useful in providing a formal treatment of many topics of interest to people who use network analysis. The book also focusses on centrality measures which are important, are a full chapter in the book, but downplayed in the description; they should also be emphasised. Brendan Murphy, University College Dublin, Ireland -- Brendan MurphyTable of Contents 1. Introduction 2. Random Graph Models 3. Network Centrality Indices 4. Community Detection in Networks 5. Graph-based Semi-Supervised Learning 6. Community Detection in Temporal Networks 7. Sampling in Networks 8. Appendices

Read more less

Book SynopsisSoftware defined networking (SDN) is one of the most promising recent developing in the networking. Together with network function virtualization (NFV) it has the potential to automate the networking tasks in a seamless manner.This book introduces the reader to this burgeoning field and explains the basic concepts within a historical context. It should be useful to senior undergraduates, beginning graduate students, and also to anyone curious about this topic.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

a huge range and FREE tracked UK delivery on ALL orders.

Read more less

Book SynopsisThe current diversity of transport services, as well as the complexity resulting from the deployment of specific transport protocols or mechanisms over the different services provided by heterogeneous networks, demand a novel design of the transport layer. Moreover, current and future applications will only be able to take advantage of the most adapted and available transport services if they are able to interact (i.e. discover, compose, deploy and adapt) efficiently with this advanced transport layer.The work presented in this book proposes a model-driven methodology and a service-oriented approach aimed at designing the mechanisms, functions, protocols and services of the next generation transport layer.The first part of this book presents the state of the art of transport protocols and introduces a model-driven methodology and an ontology semantic model implementation aimed at designing next generation transport protocols.The second part presents the UML-based design of a component-based transport protocol. An extension to this protocol based on service-component and service-oriented architectures is also presented.The third part presents various model-driven adaptive strategies aimed at managing the behavioral and structural adaptation of next generation autonomic transport protocols.The fourth and final part presents the design of a transport layer based on component-oriented and service-oriented approaches and integrating the autonomic computing paradigm guided by the semantic dimension provided by ontologies.Table of ContentsPreface xi Chapter 1. Introduction 1 1.1. Evolution of application and network layers 1 1.2. Summary of contributions 3 1.3. Book structure 5 Chapter 2. Transport Protocols State of the Art 7 2.1. Introduction7 2.2. Transport layer reference models 9 2.2.1. OSI model 9 2.2.2. TCP/IP model 9 2.2.3. Transport layer 9 2.2.4. Transport services 10 2.3. Transport functions and mechanisms 11 2.3.1. Error control 11 2.3.2. Congestion control 14 2.3.3. Summary 19 2.4. IETF transport protocols 20 2.4.1. TCP 20 2.4.2. UDP21 2.4.3. SCTP 21 2.4.4. DCCP 22 2.4.5. MPTCP 23 2.5. Summary 23 Chapter 3. Semantic Modeling of Transport Protocols and Services 25 3.1. Introduction 25 3.2. Model and semantic-driven architecture 26 3.2.1. Model-driven architecture 26 3.2.2. Ontology-driven architecture 27 3.3. Design of a QoS ontology framework 28 3.3.1. Quality of Service definition 28 3.3.2. ITU-T X.641 framework 29 3.3.3. Service 29 3.3.4. Service user . 29 3.3.5. Service provider30 3.3.6. QoS characteristic 30 3.3.7. QoS requirement . 30 3.3.8. QoS parameter 30 3.3.9. QoS function. 31 3.3.10. QoS mechanism . 31 3.4. Design of a QoS transport ontology for the next generation transport layer . 31 3.4.1. Ontology representation 31 3.4.2. X.641 QoS ontology . 32 3.4.3. QoS transport requirements 33 3.4.4. QoS transport mechanisms, functions and protocols . 33 3.5. QoS transport ontology specification. 34 3.5.1. TCP semantic description . 34 3.5.2. UDP semantic description. 36 3.5.3. SCTP semantic description 36 3.5.4. DCCP semantic description 38 3.5.5. MPTCP semantic description . 40 3.6. Usage of the QoS transport ontology specification 41 3.6.1. QoS transport services characterization 42 3.6.2. Transport components and transport composite characterization 45 3.7. Summary 46 Chapter 4. Model-Driven Design Methodology of Transport Mechanisms and Functions 49 4.1. Introduction49 4.2. Software engineering process 50 4.2.1. Unified Modeling Language 51 4.2.2. UML 2.4.1-based methodology 52 4.2.3. UML diagrams 55 4.2.4. Summary and additional resources 66 4.3. Applying the UML-based software engineering methodology for transport services 68 4.3.1. Contextual model of transport functions and mechanisms 68 4.3.2. Analysis of requirements guiding transport functions 69 4.3.4. Design of transport functions and mechanisms 71 4.4. Summary 77 Chapter 5. Model-Driven Specification and Validation of Error Control Transport Mechanisms and Functions 79 5.1. Introduction 79 5.2. Design of an error control function 80 5.2.1. Behavior specification of the sending side protocol entity 81 5.2.2. Behavior specification of the receiving side protocol entity 83 5.3. Functional validation of the error control function 84 5.3.1. Functional validation using a perfect medium 86 5.3.2. Functional validation using an imperfect medium 88 5.4. A new design of the error control function 93 5.4.1. Functional validation using an imperfect medium 96 5.4.2. More open questions 97 5.5. A model-driven simulation environment 98 5.5.1. Model-driven simulation framework 99 5.5.2. Model-driven network simulator package 100 5.5.3. Lossy medium simulator 101 5.5.4. Delayed medium simulator 102 5.5.5. Bandwidth-limited medium simulator 104 5.6. Chapter summary 106 5.7. Appendix 107 Chapter 6. Model-Driven Specification and Validation of Congestion Control Transport Mechanisms and Functions 109 6.1. Introduction 109 6.2. Design of a congestion control function 110 6.2.1. Behavior specification of the sending and receiving side protocol entities 111 6.2.2. The TCP-friendly rate control (TFRC) specification 114 6.2.3. Detailed TFRC design 117 6.3. Functional validation of the congestion control function 119 6.3.1. Case study 1: continuous stream of messages (no time constraints) 121 6.3.2. Case study 2: GSM audio stream 123 6.3.3. Case study 3: MJPEG video stream 123 6.4. Summary 126 6.5. Appendix 127 Chapter 7. Specification and Validation of QoS-Oriented Transport Mechanisms and Functions 129 7.1. Introduction 129 7.2. Contextual model of a QoS-oriented transport functions 130 7.3. Contextual model of a QoS-oriented error control functions 131 7.3.1. Partially ordered/partially reliable transport services 133 7.4. Contextual model of a QoS-oriented congestion control functions 138 7.4.1. QoS-aware TFRC congestion control 139 7.5. Design of the QoS-oriented error control functions 142 7.5.1. Basis of a fully reliable SACK-based function143 7.5.2. Design of a partially reliable SACK-based function 144 7.5.3. Design of a partially reliable function 146 7.5.4. Design of a differentiated and partially reliable function 147 7.5.5. Design of a time-constrained, differentiated and partially reliable function 148 7.6. Design of the QoS-oriented congestion control function 148 7.6.1. Basis of a TCP-friendly rate control function 149 7.6.2. Design of a time-constrained and differentiated congestion control function 151 7.7. Summary 153 Chapter 8. Architectural Frameworks for a QoS-Oriented Transport Protocol 157 8.1. Introduction 157 8.2. Communication architecture requirements 159 8.3. Architectural frameworks for communication protocols 160 8.3.1. QoS-oriented architecture 160 8.3.2. Architectural frameworks for communication protocols 161 8.4. Design of a composite and QoS-oriented transport protocol 164 8.4.1. Design of the fully programmable transport protocol 164 8.5. Evaluation of the FPTP transport protocol 180 8.5.1. FPTP TD-TFRC mechanism 180 8.5.2. FPTP D-PR and TD-PR mechanisms 181 8.5.3. FPTP TD-TFRC mechanisms 182 8.5.4. Analysis of results 183 8.6. Summary 184 8.7. Appendix 184 Chapter 9. Service-Oriented and Component-Based Transport Protocol 187 9.1. Introduction187 9.2. State-of-the-art on modern software architectural frameworks 188 9.2.1. Service-oriented architecture 188 9.2.2. Component-based design 190 9.2.3. Summary 192 9.3. Design guidelines of a component-based and service-oriented architecture for the next generation transport layer 193 9.3.1. Service-oriented architecture transport layer (SOATL) 193 9.3.2. Service-component architecture for transport protocols (SCATP) 193 9.3.3. Semantic model guiding the selection and composition of transport services 194 9.4. FPTP semantic description 194 9.4.1. FPTP individual 195 9.4.2. Service characterization inferences based on components axioms 196 9.5. Summary 198 9.6. Appendix 199 Chapter 10. Adaptive Transport Protocol 201 10.1. Introduction 201 10.2. The enhanced transport protocol 202 10.2.1. Adaptive composite communication architecture 203 10.2.2. Behavioral adaptation 205 10.2.3. Structural adaptation 209 10.3. Summary 212 Chapter 11. Autonomic Transport Protocol 213 11.1. Introduction 213 11.2. Autonomic computing 214 11.3. Self-managing functions 215 11.4. Architecture 215 11.4.1. Autonomic elements 216 11.4.2. Autonomic orchestrators 218 11.4.3. Policies 219 11.4.4. Knowledge base 220 11.4.5. Summary 220 11.5. Design guidelines of an autonomic computing architecture for the next-generation transport layer 221 11.5.1. Self-managing functionalities 221 11.5.2. Architecture 222 11.5.3. Autonomic orchestrators 224 11.5.4. Policy framework 228 11.5.5. Knowledge base 228 11.6. Summary 228 11.7. Appendix 229 Conclusions 231 Perspectives 235 Appendix 239 Bibliography 269 Index 279

Read more less