ContentsSECTION I INTRODUCTION AND APPLICATIONS
OF MOBILE COMPUTING
Chapter 1
Wearable Computing
Asim Smailagic and Daniel P. Siewiorek
Abstract
1.1 Introduction
1.2 Issues in Wearable Computing
1.3 Example Systems
1.3.1 Procedures with Static Prestored Text/Graphics
1.3.2 Master/Apprentice (Live Expert) Help Desk
1.3.3 Team Collaboration
1.3.4 Context-Aware Collaboration — Proactive Synthetic
Assistant
1.4 Evaluation
1.4.1 Prestored Procedures
1.4.2 Master/Apprentice Help Desk
1.4.3 Team Collaboration
1.4.4 Context-Aware Collaboration — Proactive Synthetic
Assistant
1.5 Summary and Future Challenges
Acknowledgments
References
Chapter 2
Developing Mobile Applications: A Lime Primer
Gian Pietro Picco, Amy L. Murphy, and Gruia-Catalin Roman
Abstract
2.1 Introduction
2.2 Linda in a Nutshell
2.3 Lime: Linda in a Mobile Environment
2.3.1 Model Setting and Overview
2.3.2 Creating a Lime Tuple Space
2.3.3 Enabling Transient Sharing
2.3.4 Reconciling Different Forms of Mobility
2.3.5 Restricting the Scope of Operations
2.3.6 Reacting to Changes
2.3.7 Accessing the System Configuration 2.3.8 Implementation Details
2.4 Application Example
2.4.1 Requirements
2.4.2 Design and Implementation
2.4.2.1 Tuple Spaces and Tuples
2.4.2.2 User Actions
2.4.2.3 Display Update
2.4.3 Beyond the Puzzle
2.5 Building Middleware Functionality on Top of Lime
2.5.1 Transiently Shared Code Bases
2.5.2 Service Provision
2.6 Related Work
2.7 Conclusions
2.7.1 Availability
Acknowledgments
Notes
References
Chapter 3
Pervasive Application Development: Approaches and Pitfalls
Guruduth Banavar, Norman Cohen, and Danny Soroker
Abstract
3.1 What Are Pervasive Applications?
3.1.1 Basic Concepts and Terms
3.2 Why Is It Difficult to Develop Pervasive Applications?
3.2.1 Heterogeneity of Device Platforms
3.2.1.1 User Interface
3.2.1.2 Interaction Modalities
3.2.1.3 Platform Capabilities
3.2.1.4 Connectivity
3.2.1.5 Development and Maintenance Complexity
3.2.2 Dynamics of Application Environments
3.3 Approaches for Developing Pervasive Applications
3.3.1 Developing Mobile Applications
3.3.2 Presentation Transcoding
3.3.3 Device-Independent View Component
3.3.3.1 Runtime Adaptation
3.3.3.2 Design-Time Adaptation
3.3.3.3 Visual Tools for Constructing
Device-Independent Views
3.3.4 Platform-Independent Controller Component
3.3.5 Host-Independent Model Component
3.3.6 Developing Context-Aware Applications
3.3.7 Source-Independent Context Data
3.4 Conclusions
Acknowledgments
References
Chapter 4
ISAM, Joining Context-Awareness and Mobility
to Building Pervasive Applications
Iara Augustin, Adenauer Corrêa Yamin, Jorge Luis Victória Barbosa,
Luciano Cavalheiro da Silva, Rodrigo Araújo Real, Gustavo Frainer,
Gerson Geraldo Homrich Cavalheiro, and Cláudio Fernando Resin Geyer
Abstract
4.1 Introduction
4.2 The ISAM Application Model
4.3 The ISAM Architecture
4.4 ISAMadapt Overview
4.4.1 Context
4.4.2 Adapters
4.4.3 Adaptation Commands
4.4.4 Adaptation Policies
4.5 EXEHDA Overview
4.6 The WalkEd Application
4.6.1 The GUI Being: Alternative Behaviors
4.6.2 The Spell Being
4.6.3 The Print Being
4.6.4 The ISAMadapt IDE
4.6.5 Execution Aspects
4.7 Conclusions
Acknowledgments
References
Chapter 5
Integrating Mobile Wireless Devices into the Computational Grid
Thomas Phan, Lloyd Huang, Noel Ruiz, and Rajive Bagrodia
5.1 Introduction
5.2 Background
5.3 Motivation: Mobile Devices and the Grid
5.4 The LEECH Architecture
5.4.1 Key Challenges
5.4.2 Overview of Architecture
5.4.3 Grid/Cluster and LEECH
5.4.4 Application Major Component and Minor Component
5.4.5 Interlocutor
5.4.6 Minion
5.4.7 Availability Adaptation and Job Management
5.5 The LEECH Programming Model
5.6 Experiments and Analysis
5.6.1 Synthetic Application for Measuring Communication
Overhead
5.6.2 RSA Decryption
5.7 Looking to the Future
References
Chapter 6
Multimedia Messaging Service
Syed A. Ahson
6.1 Introduction
6.2 MMS Architecture
6.2.1 MMS Interfaces
6.2.2 Addressing in MMS
6.2.3 Technical Specifications
6.2.4 Supported Formats
6.2.5 MMS Messages
6.3 Message Submission
6.4 Message Transfer
6.5 Delivery Report
6.6 Read-Reply Reports
6.7 Message Notification
6.8 Message Retrieval
6.9 Message Forwarding
6.10 Future Directions
References
SECTION II LOCATION MANAGEMENT
Chapter 7
A Scheme for Nomadic Hosts Location Management Using DNS
Ramandeep Singh Khurana, Hesham El-Rewini, and Imad Mahgoub
Abstract
7.1 Introduction
7.2 Using the DNS for Location Management of Nomadic Hosts
7.2.1 DNS Server
7.2.2 Server Process: Web Server
7.2.3 Client Process: Web Browser
7.2.4 Security
7.3 Experiments
7.3.1 Cache Time versus Time-to-Live
7.3.2 Scalability Analysis
7.4 Concluding Remarks
References
Chapter 8
Location Management Techniques for Mobile Computing
Environments
Riky Subrata and Albert Y. Zomaya
8.1 Introduction
8.2 Location Management
8.2.1 Location Update
8.2.2 Location Inquiry
8.2.2.1 Delay Constraint
8.3 Location Management Cost
8.4 Network Topology
8.5 Mobility Pattern
8.5.1 Memoryless (Random Walk) Movement Model
8.5.2 Markovian Model
8.5.2.1 Cell History
8.5.2.2 Directional History
8.5.3 Shortest Distance Model
8.5.4 Gauss-Markov Model
8.5.5 Activity-Based Model
8.5.6 Mobility Trace
8.5.7 Fluid-Flow Model
8.5.8 Gravity Model
8.6 Call Arrival Pattern
8.6.1 Poisson Model
8.6.2 Call Arrival Trace
8.7 Location Update Strategies
8.7.1 Always-Update Strategy
8.7.2 Never-Update Strategy
8.7.3 Time-Based Strategy
8.7.4 Movement-Based Strategy
8.7.5 Distance-Based Strategy
8.7.6 Location Area
8.7.6.1 Static Case
8.7.6.2 Dynamic Case
8.7.7 Reporting Center
8.7.7.1 Static Case
8.7.7.2 Dynamic Case
8.7.8 Adaptive Threshold Scheme
8.7.9 Profile-Based
8.7.10 Compression-Based
8.7.11 Hybrid Strategies
8.8 Location Inquiry Strategies
8.8.1 Simultaneous Networkwide Search
8.8.2 Paging Area
8.8.3 Expanding Ring Paging
8.8.4 Intelligent Paging
8.9 Summary
References
Chapter 9
Locating Mobile Objects
Evaggelia Pitoura, George Samaras, and Georgia Kastidou
9.1 Introduction
9.2 Location Management
9.3 Architectures of Location Directories
9.3.1 Two-Tier Scheme
9.3.2 Hierarchical Scheme
9.4 Optimizations of the Architectures
9.4.1 Call to Mobility Ratio
9.4.2 Partitions
9.4.3 Caching
9.4.4 Replication
9.4.5 Forwarding Pointers
9.5 Taxonomy and Location Management Techniques
9.6 Case Studies
9.6.1 Mobile IP
9.6.2 Globe
9.6.3 Mobile Agents Systems
9.6.3.1 Ajanta
9.6.3.2 Voyager
9.7 Summary
References
Chapter 10
Dependable Message Delivery to Mobile Units
Amy L. Murphy, Gruia-Catalin Roman, and George Varghese
Abstract
10.1 Introduction
10.1.1 Distributed versus Mobile Computing
10.1.2 Algorithm Development
10.2 Message Delivery
10.2.1 Related Work
10.2.2 Mobile Environment
10.2.3 Model and Problem Definitions
10.3 Broadcast Search
10.3.1 Motivation
10.3.2 From Distributed Snapshot Algorithms
to Announcement Delivery
10.3.3 Snapshot Delivery Algorithm
10.3.4 Properties
10.3.5 Extensions
10.3.5.1 Multiple Announcement Deliveries
10.3.5.2 Rapidly Moving Mobile Units
10.3.5.3 Route Discovery
10.3.5.4 Multicast
10.3.5.5 Mobile Agents
10.4 Tracking for Delivery
10.4.1 From Diffusing Computations to Mobile Unit Tracking
10.4.2 Extension: Backbone-Based Message Delivery
10.5 Reality Check
10.5.1 FIFO Channels
10.5.2 Multiple RBSs per MSC
10.5.3 Base Station Connectivity
10.5.4 Reliable Delivery on Links
10.5.5 Involvement Level of MSCs
10.5.6 Storage Requirements
10.6 Conclusions
Acknowledgments
References
SECTION III LOCATION-BASED SERVICES
Chapter 11
Location-Dependent Query Processing in Mobile Computing
Ays¸e Yasemin Seydim, Margaret H. Dunham
11.1 Introduction
11.2 Related Work
11.2.1 Location-Dependent Data and Queries
11.2.2 Moving Object Databases Research
11.2.3 Spatial Database Management
11.3 Location Relatedness and the Query Model
11.3.1 Query Model
11.3.2 Location-Aware Queries
11.3.3 Location-Dependent Queries
11.3.4 Moving Object Database Queries
11.3.5 Query Classification
11.4 Query Translation Steps in LDQ Processing
Acknowledgments
Note
References
Chapter 12
Simulation Models and Tool for Mobile Location-Dependent
Information Access
Uwe Kubach, Christian Becker, Illya Stepanov, and Jing Tian
Abstract
12.1 Introduction
12.2 Spatial Model
12.2.1 Location Models
12.2.2 Spatial Information Models
12.3 Mobility
12.3.1 Existing Mobility Models
12.3.1.1 Random Mobility Models
12.3.1.2 Advanced Models
12.3.2 Generic Mobility Model
12.4 Information Access Model
12.4.1 Zipf Distribution
12.4.2 Location-Dependent Access
12.5 A Tool for User Mobility Modeling
12.5.1 Objectives
12.5.2 Software Architecture
12.5.3 Usage
12.6 Conclusion
References
Chapter 13
Context-Aware Mobile Computing
Rittwik Jana and Yih-Farn Chen
Abstract
13.1 Introduction and Motivation
13.2 What Is Context?
13.3 Context Acquisition
13.3.1 Acquisition of Sensor Data
13.3.2 Location Sensing Techniques
13.4 What Is Context-Awareness?
13.4.1 Technology Independent Framework and Application
Programming Interfaces
13.4.1.1 Parlay: Integration of Telecom and Internet
Services
13.4.1.2 IETF OPES Group
13.4.1.3 iMobile: a Mobile Service Platform
13.5 Gluing Contextware and Middleware
13.5.1 Integrating Location Determination with the Service
Platform
13.5.2 Managing Location Information in iMobile
13.5.3 Location-Based Services with iMobile
13.5.4 Preserving Privacy in Environments with
Location-Based Services
13.6 Context-Related Research Initiatives and Projects
13.7 The Future of Context
13.8 Conclusions
Notes
References
Chapter 14
Mobile Agent Middlewares for Context-Aware Applications
Paolo Bellavista, Dario Bottazzi, Antonio Corradi, Rebecca Montanari, and
Silvia Vecchi
Abstract
14.1 Mobile Computing and Context Awareness
14.2 Mobile Agents and Mobile Computing
14.3 An Overview of MA-Based Supports for Mobile Computing
14.4 MA-Based Middlewares with Context Awareness:
State-of-the-Art and Emerging Research Directions
14.5 Lessons Learned and Open Issues
Acknowledgments
References
SECTION IV CACHING STRATEGIES
Chapter 15
Cache Management in Wireless and Mobile Computing
Environments
Yu Du and Sandeep K.S. Gupta
15.1 Introduction
15.2 State of the Art
15.3 Cache Consistency Strategies
15.3.1 A Taxonomy of Cache Consistency Strategies
15.4 Cache Consistency Strategies in Architecture-Based
Wireless Networks
15.4.1 Invalidation-Based Consistency Strategy
15.4.1.1 Stateful Approaches
15.4.1.2 Stateless Approach
15.4.2 TTL-Based Cache Consistency Strategy
15.4.2.1 Handling Disconnections
15.4.2.2 Achieving Energy and Bandwidth Efficiency
15.5 Open Problems
15.5.1 Cache Consistency Strategy in the Ad Hoc
Network Environment
15.5.2 Cooperate Caching in Ad Hoc Network Environment
15.6 Summary
References
Chapter 16
Cache Invalidation Schemes in Mobile Environments
Edward Chan, Joe C.H. Yuen, and Kam-Yiu Lam
16.1 Introduction
16.2 Summary of Existing Cache Invalidation Schemes
16.3 Temporal Data Model for Mobile Computing Systems
16.4 Cache Invalidation Using AVI
16.4.1 Validity Period of Data in Client Cache
16.4.2 The IAVI Cache Invalidation Scheme
16.4.3 Server Algorithm
16.4.3.1 Invalidation Report Generation
16.4.3.2 AVI Adjustment
16.4.4 Client Algorithm
16.4.4.1 Implicit Invalidation
16.4.4.2 Explicit Invalidation
16.5 Performance Study
16.5.1 System Model
16.5.2 Performance Metrics
16.5.3 Performance Evaluation
16.5.3.1 Impact of Database Size
16.5.4.2 Impact of Update Rate
16.6 Conclusion
References
Chapter 17
Hoarding in Mobile Computing Environments
Yücel Saygin
17.1 Introduction
17.2 Coda: The Pioneering System for Hoarding
17.3 Hoarding Based on Data Mining Techniques
17.3.1 SEER Hoarding System
17.3.2 Association Rule-Based Techniques
17.3.3 Partitioning the History into Sessions
17.3.4 Utilization of Association Rules for Hoarding
17.3.5 Construction of the Candidate Sets and the Hoard Set
17.4 Hoarding Techniques Based on Program Trees
17.5 Hoarding in a Distributed Environment
17.6 A Brief Comparison of the Various Hoarding Techniques
17.7 Future Directions for Hoarding Techniques
References
Chapter 18
Power-Aware Cache Management in Mobile Environments
Guohong Cao
Abstract
18.1 Introduction
18.2 Cache Invalidation Techniques
18.2.1 Cache Consistency Model
18.2.2 The IR-Based Cache Invalidation Model
18.2.2.1 The Broadcasting Time Stamp Scheme
18.2.2.2 The Bit Sequences Scheme
18.2.3 The UIR-Based Cache Invalidation Model
18.2.4 Using Prefetch to Improve Cache Hit Ratio and
Bandwidth Use
18.2.4.1 Remarks
18.3 Techniques to Optimize Performance and Power
18.3.1 The Basic Scheme
18.3.1.1 The Basic Adaptive Prefetch Approach
18.3.2 The Value-Based Prefetch Scheme
18.3.3 The Adaptive Value-Based Prefetch Scheme
18.3.3.1 The Value of N p
18.3.3.2 AVP_T: Adapting N p to Reach a Target
Battery Life
18.3.3.3 AVP_P: Adapting N p Based on the
Power Level
18.4 Conclusions and Future Work
Note
References
Chapter 19
Energy Efficient Selective Cache Invalidation
Kian-Lee Tan
19.1 Introduction
19.2 Preliminaries
19.3 A Taxonomy of Cache Invalidation Strategies
19.3.1 Content of the Invalidation Report
19.3.2 Invalidation Mechanisms
19.3.3 Update Log Structure
19.3.4 Cache Invalidation Schemes
19.4 Selective Cache Invalidation Schemes
19.4.1 Selective Dual-Report Cache Invalidation
19.4.2 Bit-Sequences with Bit-Count
19.4.3 Discussion
19.5 Conclusion
References
SECTION V MOBILE AND AD HOC WIRELESS
NETWORKS I
Chapter 20
Self-Policing Mobile Ad Hoc Networks
Sonja Buchegger and Jean-Yves Le Boudec
Abstract
20.1 Introduction and Overview
20.2 Node Misbehavior in Mobile Ad Hoc Networks
20.2.1 Reasons and Enablers for Misbehavior
20.2.2 Attacks
20.2.2.1 Traffic Diversion
20.2.3 The Effect of Misbehavior
20.3 Overview: Main Solution Tracks
20.3.1 Payment Systems
20.3.2 Secure Routing with Cryptography
20.3.2.1 Secure Routing Protocol
20.3.2.2 Ariadne
20.3.2.3 Secure Efficient Distance
20.3.2.4 Security-Aware Ad Hoc Routing
20.3.3 Detection, Reputation, and Response Systems
20.3.3.1 Watchdog and Path Rater
20.3.3.2 CONFIDANT
20.3.3.3 CORE
20.3.3.4 Context-Aware Inference
20.3.3.5 OCEAN
20.3.4 Discussion
20.4 Self-Policing for Mobile Ad Hoc Networks
20.4.1 Enhanced CONFIDANT — a Robust Reputation
System Approach
20.4.2 Issues in Reputation Systems for Mobile
Ad Hoc Networks
20.4.2.1 Spurious Ratings
20.4.2.2 Information Dissemination
20.4.2.3 Type of Information
20.4.2.4 Response
20.4.2.5 Redemption, Weighting of Time
20.4.2.6 Weighting of Second-Hand Information
20.4.2.7 Detection
20.4.2.8 Identity
20.5 Conclusions
References
Chapter 21
Securing Mobile Ad Hoc Networks
Panagiotis Papadimitratos and Zygmunt J. Haas
Abstract
21.1 Introduction
21.2 Security Goals
21.3 Threats and Challenges
21.4 Trust Management
21.5 Secure Routing
21.5.1 The Secure Routing Protocol
21.5.1.1 The Neighbor Lookup Protocol
21.5.1.2 The Basic Secure Route Discovery
Procedure
21.5.1.3 Priority-Based Query Handling
21.5.1.4 The Route Maintenance Procedure
21.5.1.4 The SRP Extension
21.6 Secure Data Forwarding
21.6.1 Secure Message Transmission Protocol
21.7 Discussion
References
Chapter 22
Ad Hoc Network Security
Hao Yang, Haiyun Luo, Jiejun Kong, Fan Ye, Petros Zerfos, Songwu Lu, and
Lixia Zhang
Abstract
22.1 Overview
22.2 Link-Layer Security
22.2.1 802.11 MAC Vulnerabilities
22.2.2 802.11 WEP Vulnerabilities
22.3 Network Layer Security
22.3.1 Message Authentication Primitives
22.3.2 Proactive Approach to Secure Ad Hoc Routing
22.3.2.1 Source Routing
22.3.2.2 Distance Vector Routing
22.3.2.3 Link State Routing
22.3.2.4 Other Routing Protocols
22.3.3 Reactive Approach to Protecting Packet Forwarding
22.3.3.1 Detection
22.3.3.2 Reaction
22.3.4 Sophisticated Intrusion Detection System
22.4 Supporting Element: Trust and Key Management
22.4.1 Trusted Third Party
22.4.2 Web-of-Trust
22.4.3 Localized Trust
22.5 Future Directions
22.5.1 Security in Depth
22.5.2 Evaluation
22.5.3 Solutions Anticipating Unknown Attacks
Note
Bibliography
Chapter 23
Modeling Distributed Applications for Mobile Ad Hoc
Networks Using Attributed Task Graphs
Prithwish Basu, Wang Ke, and Thomas D.C. Little
Abstract
23.1 Introduction
23.2 Modeling Distributed Tasks with Task Graphs
23.2.1 A Modeling Framework for Task Execution
23.2.1.1 Preliminaries
23.2.1.2 Tasks and Task Graphs
23.2.1.3 A Taxonomy of Tasks
23.2.1.4 A Data Flow Tuple Representation Model
for Distributed Tasks
23.2.2 Embedding Task Graphs onto Networks
23.2.3 Metrics for Performance Evaluation
23.3 Algorithms and Protocols for Task Graph Instantiation
23.3.1 Optimization Problem Formulation
23.3.2 An Optimal Polynomial-Time Embedding Algorithm
for Tree Task Graphs with Distinct Labels
23.3.3 A Greedy Algorithm for Task Graph Embedding
23.3.4 A Distributed Algorithm for Task Graph Instantiation
23.3.4.1 Handling Device Mobility
23.3.4.1 Impact of Disconnections on Application
Layer
23.4 Performance Evaluation
23.4.1 Dilation
23.4.2 Embedding Time
23.4.3 Effective Throughput
23.4.4 Number and Time of Reinstantiation
23.4.5 Cumulative ADU Delay Distributions
23.5 Related Work
23.6 Conclusion
Acknowledgment
Notes
References
Chapter 24
Medium Access Control Mechanisms in Mobile Ad Hoc Networks
Chansu Yu, Ben Lee, Sridhar Kalubandi, and Myungchul Kim
Abstract
24.1 Introduction
24.2 MAC Protocols
24.2.1 Random Access MAC
24.2.2 DCF of IEEE 802.11 MAC
24.2.2.1 ACK for Collision Detection
24.2.2.2 RTS/CTS and NAV for Solving Hidden
Terminal Problem
24.2.2.3 IFS for Prioritized Access to the Channel
24.2.2.4 Backoff Algorithm with CW to Provide
Fair Access with Congestion Control
24.2.2.5 EIFS to Protect ACK from Collisions
24.2.2.6 Performance Limit of DCF
24.3 Enhancing Temporal Channel Utilization
24.3.1 RTS/CTS Mechanism
24.3.1.1 Optimal Setting of RTSThreshold to
Tradeoff between Control and Collision
Overhead
24.3.2 Exponential Backoff Algorithm
24.3.2.1 Conservative CW Restoration to Reduce
Collisions
24.3.2.2 Different Treatment of New and Lost Nodes
for Fairness
24.3.2.3 Dynamic Tuning of CW to Minimize the
Collision Probability
24.4 Enhancing Spatial Channel Utilization
24.4.1 Busy Tone to Solve the Exposed Terminal Problem
24.4.2 Transmission Power Control to Reduce Interference
Range Radially
24.4.3 Directional Antenna to Reduce Interference Range
Angularly
24.4.3.1 oRTS/oCTS-Based DMAC
24.4.3.2 DRTS/oCTS-Based DMAC
24.4.3.3 DRTS/DCTS-Based DMAC
24.4.3.4 Other DMAC Protocols
24.5 Conclusions
Note
References
xxvi
Contents
SECTION VI MOBILE AND AD HOC WIRELESS
NETWORKS II
Chapter 25
Quality of Service Routing in Mobile Ad Hoc Networks:
Past and Future
Jamal N. Al-Karaki, Ahmed E. Kamal
Abstract
25.1 Introduction
25.2 Quality of Service in MANETs: The Basics
25.2.1 QoS Metrics
25.2.2 Challenges of QoS Routing Support in MANETs
25.3 QoS Routing Protocols in MANETs: Current Trends
25.3.1 QoS Routing in Flat Networks
25.3.1.1 Proactive QoS Routing Protocols
25.3.1.2 Reactive QoS Routing Protocols
25.3.1.3 Predictive QoS Routing Protocols
25.3.1.4 Ticket-Based Probing Routing
25.3.1.5 Bandwidth Calculation Based Routing
25.3.2 Hierarchical QoS Routing Protocols
25.3.3 Position-Based QoS Routing Protocol
25.3.4 Power-Aware QoS Routing in MANETs
25.4 QoS Routing in MANETs: Future Research Directions
25.5 Conclusion
Note
References
Chapter 26
Issues in Scalable Clustered Network Architecture for Mobile
Ad Hoc Networks
Ben Lee, Chansu Yu, and Sangman Moh
Abstract
26.1 Introduction
26.2 Classification of Cluster Architecture-Based Routing
Protocols
26.2.1 Flat Routing Protocols and Their Scalability
26.2.2 Cluster Architectures
26.2.3 Cluster Architecture-Based Routing Protocols
26.3 LCA for Routing Backbone
26.3.1 Clustering Algorithms
26.3.1.1 Master Selection Algorithms for LSG
26.3.1.2 Cluster Maintenance Algorithms for LSG
26.3.1.3 Master Selection Algorithms for LNG
AU1971_C000.fm Page xxvi Wednesday, November 17, 2004 1:38 PM
Copyright © 2005 by CRC Pressxxvii
Contents
26.3.2 LSG-Based Routing Protocols
26.3.2.1 CGSR and HSR: Proactive Protocol with
Conventional Master-to-Gateway Routing
26.3.2.2 DSCR and LANMAR: Proactive Protocols
with Flat Routing toward M D
26.3.2.3 CBRP and ARC: On-Demand Protocols
with Conventional Master-to-Gateway Routing
(Allowing No, Single, or Joint Gateways)
26.3.3 LNG-Based Routing Protocols (On-Demand Protocols
with Master-to-Master Routing)
26.4 Cluster Architecture for Information Infrastructures
26.4.1 Clustering Algorithms
26.4.2 LLog-Based Routing Protocols
26.4.2.1 CEDAR Protocol
26.4.2.2 Zone Routing Protocol
26.4.3 LGeo-Based Routing Protocols
26.4.3.1 ZHLS Routing Protocol
26.4.3.2 GLS Protocol
26.5 Summary and Conclusion
Note
References
Chapter 27
Routing and Mobility Management in Wireless Ad Hoc Networks
Ravi Sankar
27.1 Introduction
27.2 Ad Hoc Network: Definition, Characteristics, and
Applications
27.3 Desired Characteristics of Routing Protocols for MANETs
27.4 Conventional Routing Protocols
27.4.1 Problems with Conventional Routing
27.5 Review of Ad Hoc Routing Protocols
27.5.1 Table-Driven Routing Protocols
27.5.1.1 Destination-Sequenced Distance Vector
27.5.1.2 Wireless Routing Protocol
27.5.1.3 Link State Routing Protocols
27.5.1.4 Clusterhead Gateway Switch Routing
27.5.1.5 Hierarchical Routing Protocols
27.5.1.6 Summary of Table-Driven Protocols
27.5.2 On-Demand Routing Protocols
27.5.2.1 Dynamic Source Routing
27.5.2.2 Ad Hoc On-Demand Distance Vector
Routing
AU1971_C000.fm Page xxvii Wednesday, November 17, 2004 1:38 PM
Copyright © 2005 by CRC Pressxxviii
Contents
27.5.2.3 Associativity Based Routing
27.5.2.4 Summary of On-Demand Protocols
27.5.3 Hybrid Routing Protocols
27.5.3.1 Zone Routing Protocol
27.5.3.2 Temporally Ordered Routing Algorithm
27.5.4 Comparison of the Routing Protocols
27.5.5 Other Protocols
27.5.5.1 Power-Aware and QoS-Aware Routing
27.5.5.2 Location-Based Routing
27.5.5.3 Flooding and Multicasting
27.5.5.4 Multipath Routing
27.6 Performance Issues and Challenges
27.7 Mobility Management in Ad Hoc Networks
27.8 Conclusion
Note
References
Chapter 28
Localized Broadcasting in Mobile Ad Hoc Networks Using
Neighbor Designation
Wei Lou and Jie Wu
28.1 Introduction
28.2 Classification
28.2.1 Probabilistic Algorithms
28.2.1.1 Counter-Based Scheme
28.2.1.2 Distance-Based Scheme
28.2.1.3 Location-Based Scheme
28.2.2 Deterministic Algorithms
28.2.2.1 Global
28.2.2.2 Quasi-Global
28.2.2.3 Quasi-Local
28.2.2.4 Local
28.2.3 Local Algorithms
28.3 Neighbor-Designating Broadcast Algorithms
28.3.1 Forward Node Selection Process
28.3.2 Multi-Point Relays
28.3.3 Dominant Pruning
28.3.4 Total Dominant Pruning and Partial Dominant
Pruning
28.3.5 CDS-Based Broadcast Algorithm
28.4 Other Extensions
28.4.1 Cluster-Based Broadcast Algorithm
28.4.2 K-hop Zone-Based Algorithm
28.4.3 Reliable Broadcast Algorithm
AU1971_C000.fm Page xxviii Wednesday, November 17, 2004 1:38 PM
Copyright © 2005 by CRC Pressxxix
Contents
28.5 Summary
Acknowledgment
References
Chapter 29
Energy-Efficient Wireless Networks
Ionut Cardei and Ding-Zhu Du
Abstract
29.1 Introduction
29.2 Power-Aware Link Layer Adaptation
29.3 Energy Harvesting
29.4 Scheduling Node and Radio Activity
29.4.1 Power-Aware Medium Access Control
29.4.2 Energy-Efficient MAC Protocols for WSN
29.4.3 Node Activity Scheduling
29.5 Energy Conservation in Ad Hoc Routing
29.5.1 Energy-Efficient Routing Protocols
29.5.2 Power-Aware Broadcast and Multicast Tree
Construction
29.6 Energy-Aware Connected Network Topology
29.7 Conclusion
References
SECTION VII POWER MANAGEMENT
Chapter 30
Power Management for Mobile Computers
Thomas L. Martin, Daniel P. Siewiorek, Asim Smailagic, and Jolin Warren
Abstract
30.1 The Relationship between Power and Energy
30.2 Batteries
30.3 Power Supplies
30.4 Hardware Power Management States
30.5 Software
30.6 Case Study
30.6.1 Memory Bottleneck and Dynamic CPU Speed-Setting
30.6.2 Dependence of Battery Capacity on Load Power
30.7 General Guidelines
30.7.1 An “Amdahl’s Law” for Power Management
30.7.2 Evaluating Power Management Options
30.8 Conclusions
References
AU1971_C000.fm Page xxix Wednesday, November 17, 2004 1:38 PM
Copyright © 2005 by CRC Pressxxx
Contents
Chapter 31
Power Awareness and Management Techniques
Ahmed Abukmail and Abdelsalam (Sumi) Helal
31.1 Introduction
31.1.1 Motivation
31.1.2 Taxonomy of Research and Industry Solutions
31.2 Hardware and Architecture Techniques
31.2.1 Smart Batteries
31.2.1.1 Battery Basics
31.2.1.2 Intelligent Power Drainage
31.2.2 Energy-Aware Processors
31.2.3 Reducing Power through CMOS Circuitry
Components
31.2.3.1 The Power Consumption Equation
31.2.3.2 Voltage and Frequency Scaling
31.2.3.3 Capacitance Load Reduction
31.2.4 Power Reduction through Architectural Design
31.3 Operating Systems and Communication Techniques
31.3.1 Energy Management Solutions
31.3.2 Memory and I/O Management
31.3.3 Communication Techniques
31.3.4 Scheduling
31.4 Software Application Techniques
31.4.1 Compilation Techniques
31.4.1.1 Reordering Instructions
31.4.1.2 Reduction of Memory Operands
31.4.1.3 Code Generation through Pattern Matching
31.4.1.4 Remote Task Execution
31.4.2 Application-Level Techniques
31.5 Tools and Packages for Low-Power Design and Measurement
31.5.1 PowerScope
31.5.2 Derivatives of SimpleScalar
31.5.2.1 The Power Analyzer
31.5.2.2 The Wattch Project
31.5.3 Other Power Estimation Techniques
31.6 Conclusion
References
Chapter 32
Adaptive Algorithmic Power Optimization for Multimedia
Workload in Mobile Environments
Luca Benini and Andrea Acquaviva
32.1 Introduction
32.2 Scalability and Energy Optimization
32.2.1 Scalability in Modern Multimedia Applications
AU1971_C000.fm Page xxx Wednesday, November 17, 2004 1:38 PM
Copyright © 2005 by CRC Pressxxxi
Contents
32.2.1.1 Scalable Source Coding with Wavelets
32.2.1.2 Scalable Source Coding in MPEG-4
32.2.2 Energy Scalability
32.3 Adaptive Algorithmic Power Optimization
32.3.1 Stand-Alone Power Management
32.3.1.1 Adaptive Encoding Algorithms
32.3.1.2 Adaptive Decoding Algorithms
32.3.2 Collaborative Power Management
32.3.2.1 Operating System Collaborative Techniques
32.3.2.2 Server-Assisted Collaborative Techniques
32.4 Conclusion
References
Chapter 33
Energy-Aware Web Caching over Hybrid Networks
Françoise Sailhan and Valérie Issarny
Abstract
33.1 Introduction
33.2 Power-Aware Communication
33.2.1 Energy Saving at the MAC Layer
33.2.1.1 Minimizing Collisions
33.2.1.2 Minimizing Channel Listening
33.2.2 Energy Saving at the Routing Layer
33.2.2.1 Ad Hoc Routing Protocols
33.2.2.2 Energy-Aware Ad Hoc Routing
33.2.3 Energy Saving at the Transport Layer
33.3 Web Caching in Ad Hoc Networks
33.3.1 Ad Hoc Communication for Cooperative Web Caching
33.3.2 Ad Hoc Cooperative Caching
33.4 Local Caching
33.4.1 Cache Management
33.4.2 Prefetching
33.5 Evaluation
33.5.1 Energy Consumption of Ad Hoc Networking
33.5.2 Energy Consumption of Ad Hoc Cooperative Caching
33.6 Conclusion
Notes
References
Chapter 34
Transmitter Power Control in Wireless Computing
Savvas Gitzenis and Nicholas Bambos
34.1 Introduction
34.1.1 Power Control Issues in Wireless Packet
Communication
AU1971_C000.fm Page xxxi Wednesday, November 17, 2004 1:38 PM
Copyright © 2005 by CRC Pressxxxii
Contents
34.2 Packet Forwarding over Single-Mode Wireless Links
34.2.1 Optimally Emptying the Transmitter Buffer
34.2.1.1 The Simple Case of Independent Channel
Interference — Power Phases
34.2.2 Incorporating Packet Arrivals and Buffer Overflows
34.2.3 Design of PCMA Algorithms — Responsive Channel
34.2.4 The Multi-Transmitter/Multi-Receiver Case
34.3 Packet Forwarding over Multimode Transmission Links
34.3.1 Optimally Emptying the Transmitter Buffer
34.3.2 Structural Properties — The Independent Channel
Stress Case
34.3.3 Design of Multimode PCMA Algorithms for
Responsive Channels
34.4 Data Prefetching over Single-Mode Transmission Links
34.4.1 System Model
34.4.1 The Dynamic Programming Formulation
34.4.2 The Structural Properties of the Power Decision p
34.4.3 Online Look-Ahead Heuristics for Efficient Buffer
Control
34.4.3.1 No Prefetching — Efficient Data Downloading
34.4.3.2 Neighbor Prefetching — Depth-1 Look-Ahead
34.4.3.3 Deep Prefetching
Notes
References
SECTION VIII PERFORMANCE AND MODELING
Chapter 35
A Survey on Mobile Transaction Models
Abdelsalam (Sumi) Helal, Santosh Balakrishnan, Margaret H. Dunham, and
Youzhong Liu
Abstract
35.1 Introduction
35.2 Reference Model
35.3 Mobile Transactions: Definition, Characteristics, and Issues
35.3.1 Characteristics
35.3.2 Definition
35.3.3 Issues
35.4 Applicable Transaction Models
35.4.1 Open Nested Transactions
35.4.1.1 Properties of Open Nested Transactions
35.4.2 Split Transactions
35.4.2.1 Split Transaction Semantics
35.4.2.2 Properties of Split Transactions
AU1971_C000.fm Page xxxii Wednesday, November 17, 2004 1:38 PM
Copyright © 2005 by CRC Pressxxxiii
Contents
35.4.3 Sagas
35.4.3.1 Properties of Sagas
35.4.3.2 Limitations of Sagas
35.4.3.3 Extensions of Saga Model
35.4.3.4 Noncompensating Transactions
35.5 Approaches to Mobile Transaction Models
35.5.1 Reporting and Cotransactions
35.5.1.1 Properties of Reporting Transactions
35.5.1.2 Properties of Cotransactions
35.5.2 The Clustering Model
35.5.2.1 Clusters
35.5.2.2 Weak and Strict Transactions
35.5.2.3 Transaction Migration and Proxying
35.5.3 The Multi-Database Transaction Processing Manager
35.5.3.1 Architecture
35.5.3.2 Transaction Model
35.5.4 Pro-Motion
35.5.5 Prewrite
35.5.6 Semantic Transaction Processing
35.5.6.1 Exploiting Semantics for Concurrency and
Caching
35.5.6.2 Fragmentable and Reorderable Objects
35.5.7 The Kangaroo Transaction Model
35.5.7.1 Reference Model
35.5.7.2 Transaction Model
35.5.7.3 Properties
35.5.8 Time-Based Consistency Model
35.5.9 Two-Tier Replication
35.5.10 Isolation-Only Transactions
35.5.10.1 The Approach Taken
35.5.10.2 The Coda File System
35.5.10.3 What Is an IOT?
35.5.10.4 IOT Execution Model
35.5.10.5 Why Isolation Only?
35.5.10.6 IOT Consistency Guarantees
35.5.11 Bayou
35.5.11.1 Two-Tier Replication and Weak Consistency
35.5.11.2 Antientropy
35.5.11.3 Session Guarantees
35.5.12 A New Transaction Management Scheme
35.6 Comparative Analysis of Transaction Models
35.6.1 Consistency and Concurrency
35.6.2 Additional Infrastructure Requirements and
Compatibility with Commercial Databases
35.6.3 Communication Cost and Scalability
AU1971_C000.fm Page xxxiii Wednesday, November 17, 2004 1:38 PM
Copyright © 2005 by CRC Pressxxxiv
Contents
35.7 Open Issues in Mobile Transactions
35.8 Summary
References
Chapter 36
Analytic Mobility Models of PCS Networks
Chien-Hsing Wu
Abstract
36.1 System Models
36.1.2 Cellular Systems
36.1.2 Markov Walk Models
36.2 Analysis for Location Update
36.2.1 Location Tracking and Updates
36.2.2 Two Renewal Processes and α k
36.2.3 Recursive Markov Analysis
36.2.4 Distributions µ (u) and φ (c)
36.3 Paging and Cost
36.4 Performance Evaluation
References
Chapter 37
Battery Power Management in Portable Devices
Vinod Sharma and A. Chockalingam
Abstract
37.1 Introduction
37.1.1 Relaxation Phenomenon in Batteries
37.2 System Model
37.2.1 Battery Discharge/Recharge Model
37.3 Analysis
37.3.1 Extensions and Generalizations
37.3.1.1 Exhaustive Service with Vacations
37.3.1.2 Nonexhaustive System with Vacations
37.3.1.3 Multi-Battery System
37.4 Performance Results and Discussion
37.4.1 Lithium Ion Battery Simulation Results
37.5 An Optimal Scheduling Problem
Notes
References
SECTION IX SECURITY AND PRIVACY ASPECTS
Chapter 38
Challenges in Wireless Security: A Case Study of 802.11
Nikita Borisov
AU1971_C000.fm Page xxxiv Wednesday, November 17, 2004 1:38 PM
Copyright © 2005 by CRC Pressxxxv
Contents
38.1 Introduction
38.1.1 Overview of 802.11
38.1.2 History
38.2 Wireless Security Threats
38.3 Encryption
38.3.1 Keystream Reuse
38.3.2 RC4 Weaknesses
38.3.3 New Standards
38.4 Integrity Protection
38.4.1 Integrity-Based Attacks
38.4.2 Replay Attacks
38.4.3 New Protocols
38.5 Authentication and Access Control
38.5.1 Authentication Extensions
38.5.2 Mutual Authentication
38.5.3 New Protocols
38.6 Key Management
38.6.1 New Protocols
38.7 Conclusion
References
Chapter 39
Security for Mobile Agents: Issues and Challenges
Paolo Bellavista, Antonio Corradi, Corrado Federici, Rebecca Montanari, and
Daniela Tibaldi
Abstract
39.1 Security: a Missing Link for MAs’ Acceptance
39.2 Security Requirements
39.3 Security Countermeasures
39.3.1 User–Agent Trust
39.3.2 Protecting Agent Platforms
39.3.2.1 Secure Agent Code
39.3.2.2 Agent Authentication
39.3.2.3 Agent Authorization
39.3.3 Protecting Agents
39.4 Overview of Security Solutions in MA-Based Systems
39.5 Open Issues and Directions of Work in Secure MA Systems
39.5.1 Agents and Trust
39.5.2 Dynamic Configuration of Access Control
39.6 Conclusions
Acknowledgments
References
AU1971_C000.fm Page xxxv Wednesday, November 17, 2004 1:38 PM
Copyright © 2005 by CRC PressContents
Chapter 40
Security, Trust, and Privacy in Mobile Computing Environments
Lalana Kagal, Jim Parker, Harry Chen, Anupam Joshi, and Tim Finin
40.1 Introduction
40.2 Policies and Their Role in Security in Pervasive Computing
Systems
40.2.1 Introduction
40.2.2 Related Work
40.2.3 Approach
40.2.4 Discussion
40.3 Toward Privacy Protection in Pervasive Computing
Environments
40.3.1 Introduction
40.3.2 Previous Work
40.3.3 Design Principles for Building Privacy Systems
40.3.3.1 Notice and Consent
40.3.3.2 Proximity and Locality
40.3.3.3 Anonymity and Pseudonymity
40.3.4 Implementations of the Privacy Systems
40.3.4.1 Notice and Consent
40.3.4.2 Proximity and Locality
40.3.4.3 Anonymity and Pseudonymity
40.3.5 Context Broker Architecture
40.3.6 Privacy Policy Language
40.3.7 Meta-Reasoning with Policies
40.3.8 Discussion
40.4 Intrusion Detection in Mobile Ad Hoc Networks
40.4.1 Introduction
40.4.2 Environments and Devices
40.4.3 Intrusion Detection
40.4.4 Ad Hoc Network ID
40.4.5 Research
40.4.6 Multiple Malicious Nodes
40.4.7 Directional Antennas and Power Control
40.4.8 Discussion
40.5 Conclusion
References
No comments:
Post a Comment