book

Fundamentals of Mobile and Pervasive Computing

by Frank Adelstein, Sandeep Gupta, Golden Richard III, Loren Schwiebert

January 2005

Intermediate to advanced

404 pages

12h 29m

English

McGraw-Hill

Read now

Unlock full access

1.1 What Is Mobile Computing?1.2 Adaptability-The Key to Mobile Computing1.2.1 Transparency1.2.2 Constraints of mobile computing environments1.2.3 Application-aware adaptation1.3 Mechanisms for Adaptation1.3.1 Adapting functionality1.3.2 Adapting data1.4 How to Develop or Incorporate Adaptations in Applications1.4.1 Where can adaptations be performed?1.5 Support for Building Adaptive Mobile Applications1.5.1 Odyssey1.5.2 Rover1.6 Summary
2.1 Mobility Management2.2 Location Management Principles and Techniques2.2.1 Registration area-based location management2.3 Location Management Case Studies2.3.1 PCS location management scheme2.3.2 Mobile IP2.4 Summary
3.1 Challenges3.2 Data Dissemination3.2.1 Bandwidth allocation for publishing3.2.2 Broadcast disk scheduling3.3 Mobile Data Caching3.3.1 Caching in traditional distributed systems3.3.2 Cache consistency maintenance3.3.3 Performance and architectural issues3.4 Mobile Cache Maintenance Schemes3.4.1 A taxonomy of cache maintenance schemes3.4.2 Cache maintenance for push-based information dissemination3.4.3 Broadcasting invalidation reports3.4.4 Disconnected operation3.4.5 Asynchronous stateful (AS) scheme3.4.6 To cache or not to cache?3.5 Mobile Web Caching3.5.1 Handling disconnections3.5.2 Achieving energy and bandwidth efficiency3.6 Summary

4.1 Ubiquitous or Pervasive Computing4.2 What Is a Context? Various Definitions and Types of Contexts4.2.1 Enumeration-based4.2.2 Role-based4.3 Context-Aware Computing and Applications4.3.1 Core capabilities for context awareness4.3.2 Types of context-aware applications4.3.3 Developing context-aware applications4.4 Middleware Support4.4.1 Contextual services4.4.2 Actuator service4.4.3 An example: context toolkit4.4.4 Providing location context4.5 Summary
5.1 What Is Mobile Middleware?5.2 Adaptation5.3 Agents5.4 Service Discovery
6.1 Adaptation6.1.1 The spectrum of adaptation6.1.2 Resource monitoring6.1.3 Characterizing adaptation strategies6.1.4 An application-aware adaptation architecture: Odyssey6.1.5 A sample Odyssey application6.1.6 More adaptation middleware6.2 Mobile Agents6.2.1 Why mobile agents? And why not?6.2.2 Agent architectures6.2.3 Migration strategies6.2.4 Communication strategies6.3 Summary
7.1 Common Ground7.2 Services7.2.1 Universally unique identifiers7.2.2 Standardization7.2.3 Textual descriptions7.2.4 Using interfaces for standardization7.3 More on Discovery and Advertisement Protocols7.3.1 Unicast discovery7.3.2 Multicast discovery and advertisement7.3.3 Service catalogs7.4 Garbage Collection7.4.1 Leasing7.4.2 Advertised expirations7.5 Eventing7.6 Security7.6.1 Jini7.6.2 Service location protocol7.6.3 Ninja7.7 Interoperability7.7.1 Interoperability success stories7.8 Summary
8.1 Overview8.1.1 Outline of chapter8.2 Properties of an Ad Hoc Network8.2.1 No preexisting infrastructure8.2.2 Limited access to a base station8.2.3 Power-limited devices8.2.4 No centralized mechanisms8.3 Unique Features of Sensor Networks8.3.1 Direct interaction with the physical world8.3.2 Usually special-purpose devices8.3.3 Very limited resources8.3.4 Operate without a human interface8.3.5 Specialized routing patterns8.4 Proposed Applications8.4.1 Military applications8.4.2 Medical applications8.4.3 Industrial applications8.4.4 Environmental applications8.4.5 Other application domains
9.1 Constrained Resources9.1.1 No centralized authority9.1.2 Limited power9.1.3 Wireless communication9.1.4 Limited computation and storage9.1.5 Storage constraints9.1.6 Limited input and output options9.2 Security9.2.1 Small keys9.2.2 Limited computation9.2.3 Changing network membership9.2.4 Arbitrary topology9.3 Mobility9.3.1 Mobility requirements9.3.2 Loss of connectivity9.3.3 Data loss9.3.4 Group communication9.3.5 Maintaining consistent views9.4 Summary
10.1 Autoconfiguration10.1.1 Neighborhood discovery10.1.2 Topology discovery10.1.3 Medium access control schedule construction10.1.4 Security protocol configuration10.2 Energy-Efficient Communication10.2.1 Multihop routing10.2.2 Communication scheduling10.2.3 Duplicate message suppression10.2.4 Message aggregation10.2.5 Dual-radio scheduling10.2.6 Sleep-mode scheduling10.2.7 Clustering10.3 Mobility Requirements10.3.1 Movement detection10.3.2 Patterns of movement10.3.3 Changing group dynamics10.3.4 Resynchronization10.4 Summary
11.1 Deployment and Configuration11.1.1 Random deployment11.1.2 Scalability11.1.3 Self-organization11.1.4 Security protocol configuration11.1.5 Reconfiguration/redeployment11.1.6 Location determination11.2 Routing11.2.1 Event-driven routing11.2.2 Periodic sensor readings11.2.3 Diffusion routing11.2.4 Directional routing11.2.5 Group communication11.2.6 Synchronization11.3 Fault Tolerance and Reliability11.3.1 FEC and ARQ11.3.2 Agreement among sensor nodes (Reliability of measurements)11.3.3 Dealing with dead or faulty nodes11.4 Energy Efficiency11.4.1 Uniform power dissipation11.4.2 Sensor component power management11.4.3 MAC layer protocols11.4.4 Tradeoffs between performance and energy efficiency11.5 Summary
12.1 Traditional Security Issues12.1.1 Integrity12.1.2 Confidentiality12.1.3 Nonrepudiation12.1.4 Availability12.2 Mobile and Wireless Security Issues12.2.1 Detectability12.2.2 Resource depletion/exhaustion12.2.3 Physical intercept problems12.2.4 Theft of service12.2.5 War driving/walking/chalking12.3 Mobility12.4 Problems in Ad Hoc Networks12.4.1 Routing12.4.2 Prekeying12.4.3 Reconfiguring12.4.4 Hostile environment12.5 Additional Issues: Commerce12.5.1 Liability12.5.2 Fear, uncertainty, and doubt12.5.3 Fraud12.5.4 Big bucks at stake12.6 Additional Types of Attacks12.6.1 "Man in the middle" attacks12.6.2 Traffic analysis12.6.3 Replay attacks12.6.4 Buffer-overflow attacks12.7 Summary
13.1 Limit the Signal13.1.1 Wire integrity and tapping13.1.2 Physical limitation13.2 Encryption13.2.1 Public and private key encryption13.2.2 Computational and data overhead13.3 Integrity Codes13.3.1 Checksum versus cryptographic hash13.3.2 Message authentication code (MAC)13.3.3 Payload versus header13.3.4 Traffic analysis13.4 IPSec13.4.1 Authentication header (AH)13.4.2 Encapsulating security payload (ESP)13.5 Other Security-Related Mechanisms13.5.1 Authentication protocols13.5.2 AAA13.5.3 Special hardware13.6 Summary
14.1 Basic Idea14.1.1 Bluetooth specifications14.1.2 Bluetooth network terms14.1.3 Bluetooth security mechanisms14.2 Bluetooth Security Modes14.3 Basic Security Mechanisms14.3.1 Initialization key14.3.2 Unit key14.3.3 Combination key14.3.4 Master key14.4 Encryption14.5 Authentication14.6 Limitations and Problems14.7 Summary
15.1 Basic Idea15.2 Wireless Alphabet Soup15.3 Wired-Equivalent Privacy (WEP)15.3.1 WEP goals15.3.2 WEP data frame15.3.3 WEP encryption15.3.4 WEP decryption15.3.5 WEP authentication15.3.6 WEP flaws15.3.7 WEP fixes15.4 WPA15.5 802.11i15.5.1 Encryption protocols15.5.2 Access control via 802.1x15.6 Fixes and "Best Practices"15.6.1 Anything is better than nothing15.6.2 Know thine enemy15.6.3 Use whatever wireless security mechanisms are present15.6.4 End-to-end VPN15.6.5 Firewall protection15.6.6 Use whatever else is available15.7 Summary
16.1 Broadband Wireless Access16.2 IEEE 802.1616.3 802.16 Security16.3.1 Key management16.3.2 Security associations16.3.3 Keying material lifetime16.3.4 Subscriber station (SS) authorization16.3.5 Encryption16.4 Problems and Limitations16.5 Summary
17.1 Basic Idea17.2 CDMA17.3 GSM17.3.1 GSM authentication17.3.2 GSM encryption17.4 Problems with GSM Security17.4.1 Session life17.4.2 Weak encryption algorithm17.4.3 Encryption between mobile host and base station only17.4.4 Limits to the secret key17.4.5 Other problems17.5 The Four Generations of Wireless: 1G-4G17.6 3G17.7 Limitations17.8 Summary
pg201

Content preview from Fundamentals of Mobile and Pervasive Computing

About the Authors

FRANK ADELSTEIN has been working with computers for over 20 years. His research interests are broad, and include mobile computing, wireless communication, real-time networking, and computer security. Dr. Adelstein holds a B.S. degree in computer engineering from the University of Michigan, and an M.S. and Ph.D. in computer science from The Ohio State University. He held a postdoctoral research position with the Cornell University Computer Science Department working with the Xerox Design Research Institute. Since 1999 he has been a senior principal scientist with ATC-NY (formerly Odyssey Research Associates). His work there has ...