Suchen und Finden
Contents
6
UNDERSTANDING THE INTERACTIONS BETWEEN UNICAST AND GROUP COMMUNICATIONS SESSIONS IN AD HOC NETWORKS
9
1. Introduction
9
2. Background
10
3. Issues that may arise when unicast and group communications protocols coexist
13
3.1 Degradations in Packet Delivery Performance
13
3.2 Increased Latency Effects
14
3.3 Increased Control Overhead
14
4. Simulation Study
15
4.1 Simulation results
15
4.2 The effects of unicast protocol on the performance of group communication protocols
16
4.3 The effects of group communications protocols on the performance of the unicast protocol
17
5. Conclusions
19
References
20
CROSS- LAYER SIMULATION AND OPTIMIZATION FOR MOBILE AD- HOC NETWORKS
21
Introduction
21
1. Related Work
22
2. IEEE 802.11 MAC Layer Approach
23
3. Network Layer Approach
26
4. Expected Result
27
5. Future Works
28
6. Simulation Issues
28
7. Conclusion
29
References
29
IMPROVING TCP PERFORMANCE OVER WIRELESS NETWORKS USING LOSS DIFFERENTIATION ALGORITHMS
31
1. Introduction
31
2. TCP NewReno Enhanced with Vegas Loss Predictor
32
3. Simulation Network Model
33
4. Accuracy Evaluation
34
5. TCP Performance over Wireless Links
36
6. Conclusions
41
References
41
TCP PERFORMANCES IN A HYBRID BROADCAST/ TELECOMMUNICATION SYSTEM
43
1. Introduction
43
2. Issues raised by the GPRS return channel
44
2.1 GPRS Bidirectional mode
45
2.2 GPRS Unidirectional mode
45
2.3 GPRS uplink critical throughput
46
3. Simulation studies of the hybrid network performances
46
3.1 Simulation model of the hybrid network
46
3.2 Asymmetries
47
3.3 Hybrid routing
50
4. Experimentations
50
5. Conclusion
52
References
53
HANDOFF NOTIFICATION IN WIRELESS HYBRID NETWORKS
54
1. Introduction
54
2. Wireless Hybrid Network
55
3. Comparing the Route Update strategies
56
3.1 Acknowledged broadcast
57
3.2 Simulation Results
58
4. Optimization of the mobility notification
59
4.1 Differential Route updates
60
4.2 Nack route
60
4.3 Nack only
61
4.4 Simulation Results
61
5. Conclusion
64
References
65
SELECTIVE ACTIVE SCANNING FOR FAST HANDOFF IN WLAN USING SENSOR NETWORKS
66
1. Introduction
66
2. Layer 2 Handoff Process and Related Works
67
3. Architecture Design
70
3.1 Architecture overview
70
3.2 Selective Active Scanning for Fast Handoff
70
3.3 Benefit of the overlay sensor network
74
4. Evaluation
74
5. Conclusion
76
References
77
AN ANALYSIS OF MOBILE IPv6 SIGNALING LOAD IN NEXT GENERATION MOBILE NETWORKS
78
1. INTRODUCTION
78
2. BINDING UPDATE PROCEDURE
80
3. BASELINE MOBILE IPv6 SIGNALING LOAD
83
4. ANALYSIS OF INBAND SIGNALING
86
5. CONCLUSION
88
ACKNOWLEDGEMENTS
89
REFERENCES
89
PEER-TO-PEER BASED ARCHITECTURE FOR MOBILITY MANAGEMENT IN WIRELESS NETWORKS
90
1. INTRODUCTION
90
2. RELATED WORK
91
3. PEER-TO-PEER BASED ARCHITECTURE
92
3.1 System Overview
92
3.2 DNS Structure
94
3.3 P2P Structure
95
3.4 Region Structure
96
3.5 System Operations
97
4. PERFORMANCE EVALUATION
99
5. CONCLUSION
100
ACKNOWLEDGMENTS
100
REFERENCES
101
SUPPORTING GROUPWARE IN MOBILE NETWORKS
102
1. Introduction
102
2. Related Work
103
3. Model and Architecture
104
3.1 Network model
104
3.2 Design goals
105
3.3 Architecture
105
4. MGM Protocols
106
4.1 Exploiting Mobile IP
106
4.2 DNS based solutions
107
4.3 MGMFlood
107
4.4 MGMLeader
108
4.5 Dynamic MGMs
110
5. MGM Protocol Evaluation
110
5.1 Packet delay evaluation
110
5.2 Control plane evaluation
111
6. Transport Issues
112
7. Conclusions
113
References
113
RSM-WISP: ROAMING AND SERVICE MANAGEMENT IN HOTSPOT NETWORKS THROUGH A POLICY BASED MANAGEMENT ARCHITECTURE
114
1. INTRODUCTION
114
2. HOTSPOT ACCESS NETWORK MANAGEMENT
115
2.1 Management Objectives
115
2.2 Management Challenges
116
3. RSM-WISP
117
3.1 Architecture
118
3.2 Policy Specification
119
3.3 Architecture Implementation
122
4. CONCLUSION
124
5. REFERENCES
125
INTEGRATED RECONFIGURATION MANAGEMENT FOR THE SUPPORT OF END TO END RECONFIGURATION
126
1. INTRODUCTION
126
1.1 Towards reconfigurability
126
1.2 Related work
127
2. RECONFIGURATION MANAGEMENT ASPECTS
128
3. RECONFIGURATION MANAGEMENT PLANE ARCHITECTURE
130
3.1 General architecture
130
3.2 Architectural components
131
3.3 Communication between RMP and external entities
132
3.4 Case studies
133
4. CONCLUSIONS
135
ACKNOWLEDGEMENTS
136
REFERENCES
136
REPLICA ALLOCATION CONSIDERING DATA UPDATE INTERVALS IN AD HOC NETWORKS
137
1. Introduction
137
2. Related Works
138
3. Assumptions and Approach
139
4. Replica Allocation Methods
140
4.1 Replica allocation
140
4.2 Cache invalidation
143
5. Simulation Experiments
144
5.1 Simulation model
144
5.2 Effects of value
144
5.3 Effects of average update period
146
6. Conclusions
147
Acknowledgments
148
References
148
ANOVA-INFORMED DECISION TREES FOR VOICE APPLICATIONS OVER MANETS*
149
1. Introduction
149
2. Simulation Analysis of Audio Packet Delays
150
3. Designed Experiments and ANOVA Analysis
153
4. Learning Theory and Decision Trees
154
5. DoE and Learning Methodologies DoE and ANOVA Methodologies
155
6. DoE and Learning Theory Results and Discussion DoE Results and Discussion
157
7. Conclusions and Future Work
159
References
159
ROUTE STABILITY TECHNIQUES FOR ENHANCED VIDEO DELIVERY ON MANETS
161
1. Introduction
161
2. Related work
162
3. Route discovery extensions to DSR
163
4. Effects of route stability on real-time video streams
164
5. Multipath routing
167
6. Overall evaluation
170
7. Summary
171
References
172
A NEW SMOOTHING JITTER ALGORITHM FOR VOICE OVER AD HOC NETWORKS
173
ON THE COMPLEXITY OF RADIO RESOURCES ALLOCATION IN WCDMA SYSTEMS
185
1 INTRODUCTION AND SYSTEM MODEL
185
2 DOWNLINK
187
3 UPLINK
191
4 CONCLUDING REMARKS
195
REFERENCES
196
OPTIMIZATION OF PILOT POWER FOR SERVICE COVERAGE AND SMOOTH HANDOVER IN WCDMA NETWORKS
197
1. Introduction
197
2. System Model
198
2.1 Preliminaries
198
2.2 Service Constraints
199
3. Problem Definition
201
4. Two Ad Hoc Solutions
201
5. Mathematical Formulations
202
5.1 A Cell- bin Formulation
202
5.2 A Refined Formulation
202
6. A Lagrangean Heuristic
203
7. Numerical Study
204
8. Conclusions
206
Acknowledgments
207
References
208
AN ALTERNATIVE METRIC FOR CHANNEL ESTIMATION WITH APPLICATIONS IN BLUETOOTH SCHEDULING
209
1. INTRODUCTION
209
2. RELATED WORK ON PICONET SCHEDULING
211
3. ESTIMATORS FOR THE NAKAGAMI FADING PARAMETER
212
4. PROPOSED SCHEDULING ALGORITHM
214
5. SIMULATION RESULTS
215
6. CONCLUDING REMARKS
218
7. REFERENCES
218
DISTRIBUTED PAIRWISE KEY GENERATION USING SHARED POLYNOMIALS FOR WIRELESS AD HOC NETWORKS
220
1. INTRODUCTION
220
2. BACKGROUND
222
2.1 Bivariate polynomial- based key pre- distribution
222
2.2 Threshold secret sharing
223
3. PROPOSED DISTRIBUTED KEY GENERATION SCHEME
223
4. PERFORMANCE EVALUATION
226
5. CONCLUSION
230
ACKNOWLEDGEMENTS
230
COLLABORATION ENFORCEMENT AND ADAPTIVE DATA REDIRECTION IN MOBILE AD HOC NETWORKS USING ONLY FIRSTHAND EXPERIENCE
232
1. INTRODUCTION
233
2. RELATED WORK
234
3. THE EXPERIENCE-BASED APPROACH
235
3.1 Node Configurations
235
3.2 Selfish and Malicious Behaviors Considered
236
3.3 Detection and Punishment of Selfishness and Malice in Data Forwarding
236
3.4 Dynamic Redirection
238
4. EXPERIMENTAL STUDY
240
5. CONCLUDING REMARKS
242
A SIMPLE PRIVACY EXTENSION FOR MOBILE IPV6
244
1. Introduction
244
2. Problem Statement
245
3. Some possible solutions
247
4. Our Proposal
248
4.1 Temporary Mobile Identifier ( TMI)
248
4.2 Protocol description
250
5. Privacy with Hierarchical Mobile IPv6
252
6. Conclusions
253
References
254
A TRUST- BASED ROUTING PROTOCOL FOR AD HOC NETWORKS
255
1. Introduction
255
2. Related work
256
3. TRP protocol
257
4. Performance evaluation
263
5. Residual vulnerability
265
6. Conclusion and future work
265
References
266
SHORT- TERM FAIRNESS OF 802.11 NETWORKS WITH SEVERAL HOSTS
267
1. Introduction
267
2. Related work
268
3. Fairness
269
3.1 Number of inter- transmissions
270
3.2 Sliding window method with the Jain fairness index
272
4. Experimental results
272
4.1 Number of inter- transmissions
273
4.2 Sliding window method with Jain fairness index
275
4.3 Delay
276
5. Conclusion
277
References
278
RAAR: A RELAY-BASED ADAPTIVE AUTO RATE PROTOCOL FOR MULTI- RATE AND MULTI-RANGE INFRASTRUCTURE WIRELESS LANS*
279
1. Introduction
279
2. Relay-Based Adaptive Auto Rate Control protocol (RAAR)
281
3. Throughputs of IEEE 802.11 MAC, RAAR and D-RAAR
284
4. Conclusion
289
References
289
A NON-TOKEN-BASED-DISTRIBUTED MUTUAL EXCLUSION ALGORITHM FOR SINGLE-HOP MOBILE AD HOC NETWORKS
291
1. Introduction
291
1.1 Related Works
292
1.2 Our contribution
292
2. Basic definitions
293
3. A single-hop mutual exclusion algorithm
294
3.1 Processing an example
294
3.2 The Algorithm
296
3.3 The use of a counter in each station
297
3.4 Evaluation of the number of broadcast rounds necessary for n stations to enter the same CS
298
4. Experimental results
300
5. Concluding remarks
301
References
301
THE RECEIVER’S DILEMMA
303
1. Introduction
303
2. A Fundamental MANET Problem
304
3. Some Strategies to Deal with Fading
308
4. Simulation Analysis
311
5. Summary and Conclusions
312
Notes
314
References
314
THEORETICAL CAPACITY OF MULTI-HOP WIRELESS AD HOC NETWORKS
315
1. Introduction
315
2. Analysis of Network Saturation Capacity
317
2.1 Boundary Conditions
317
2.2 Discussion
320
3. Analysis of Maximum Instantaneous Capacity
320
3.1 Maximum Number of Simultaneously Active Links
320
3.2 The Bottleneck Aggregate Link Set
323
3.3 Discussion
324
4. Conclusions
326
HOW TO DISCOVER OPTIMAL ROUTES IN WIRELESS MULTIHOP NETWORKS
327
1. Introduction
327
2. Shortest Path Algorithms & Routing Metrics
328
3. Existing Distributed Algorithms for Optimal Routing Ad Hoc Networks
329
4. A Distributed Version of Dijkstra’s Shortest Path Algorithm
330
4.1 Key Concepts & Basic Algorithm
331
4.2 Mapping Metric Values to
332
5. Implementational Aspects
333
5.1 Differential Delay Mapping
334
5.2 Local Delay Mapping
335
6. Conclusions & Further Work
337
References
338
ASYMPTOTIC PHEROMONE BEHAVIOR IN SWARM INTELLIGENT MANETS
339
1. Introduction
339
1.1 Previous Work
340
1.2 Structure of Paper
340
2. Termite Routing for MANETs
341
2.1 A Short Introduction to Ad-Hoc Networks
341
2.2 Termite
341
3. The Model
343
4. Pheromone Update Analysis
343
4.1 Single Link Pheromone
344
4.2 Two Link Pheromone
345
5. Analysis
348
6. Conclusion
349
References
350
RANDOMIZED ROUTING ALGORITHMS
351
Introduction
351
1.1 Definitions of Routing Algorithms
353
1.2 Empirical results
356
1.2.1 Simulation Environment
356
1.2.2 Discussion of Results
357
1.3 Summary
359
Acknowledgments
360
References
360
RBR: REFINEMENT- BASED ROUTE MAINTENANCE PROTOCOL IN WIRELESS AD HOC NETWORKS
362
1. Introduction
362
2. Passive Probe Route Redirection
364
3. Active Probe Route Redirection
368
4. Performance Evaluations
369
5. Conclusion
372
References
372
ENABLING ENERGY DEMANDRESPONSE WITH VEHICULAR MESH NETWORKS
374
1. INTRODUCTION
374
2. VMESH DESIGN RATIONALE FOR DEMAND RESPONSE
376
3. VMESH ARCHITECTURE
377
4. ROUTING IN VMESH
380
5. PRELIMINARY RESULTS
382
6. CONCLUSION AND FUTURE WORK
384
References
385
CONTEXT-AWARE INTER-NETWORKING FOR WIRELESS NETWORKS
386
1. Introduction
386
2. Network model: the cell approach
388
3. Heterogeneous merging: a smooth approach
389
3.1 The case of heterogeneous cell interoperability
390
3.2 Addressing heterogeneous cell interoperability
390
4. Design and mechanisms
391
4.1 The NRPDP Protocol
391
4.2 The Routing Translator Daemon
392
5. Application: AODV ( DSR, OLSR)
393
5.1 AODV DSR
394
5.2 AODV OLSR
395
6. Conclusion
396
References
397
PERFORMANCE IMPACT OF MOBILITY IN AN EMULATED IP- BASED MULTIHOP RADIO ACCESS NETWORK
398
1. Introduction
398
2. Description of the Testbed
399
3. Mobility Models
400
3.1 Random Waypoint Model
401
3.2 Random Direction Model
402
4. Performance Evaluation
402
4.1 Setup
402
4.2 Movement Parameters
403
4.3 Results and Interpretation
405
5. Related Work
407
6. Conclusions and Further Work
407
Notes
408
References
408
Broadcast Services and Topology Control in Ad-Hoc Networks
410
1 Introduction
410
2 MAC Design and Broadcast services for Ad Hoc Networks
411
3 Topology Control in Ad Hoc Networks
413
4 The ADHOC-MAC protocol
413
4.1 RR-ALOHA
413
4.2 Multi-Hop Broadcast
415
4.3 Topology Control in ADHOC MAC
415
5 Performance Evaluation
416
5.1 Single Hop Broadcast Efficiency
417
5.2 Multi-Hop Broadcast efficiency
418
5.3 Topology Control Algorithm Efficiency
418
6 Conclusions
420
References
420
SPACE AND TIME CURVATURE IN INFORMATION PROPAGATION IN MASSIVELY DENSE AD HOC NETWORKS
422
1. Introduction
422
2. Quantitative results on time slotted networks Quantification of the problem
424
3. Massively dense networks
427
4. Introduction of time component
429
5. Conclusion and perspectives
433
References
434
CLUSTER-BASED LOCATION-SERVICES FOR SCALABLE AD HOC NETWORK ROUTING
435
1. INTRODUCTION
435
2. RELATED WORK AND OUR MOTIVATION
437
2.1 Basic Principles of Location-Based Routing
438
2.2 Related Work on Location-service
438
2.3 Related Work on Clustering
439
2.4 Our Motivation
440
3. HOME-ZONE BASED HIERARCHICAL LOCATION MANAGEMENT
440
3.1 Associativity-based Stable Clustering
440
3.2 Homezone-based Hierarchical Location-Service
443
4. EVALUATION THROUGH SIMULATION
446
5. CONCLUSIONS AND FUTURE WORK
449
ACKNOWLEDGEMENT
449
REFERENCES
449
ON SELECTING NODES TO IMPROVE ESTIMATED POSITIONS
451
1. Introduction
451
2. Assumptions and definitions
453
3. Anchors selection
454
3.1 Simple convex hull
455
3.2 Advanced hull
455
4. Simulation Results
456
4.1 Evaluation of the hull selection
456
5. Conclusion
461
References
461
ENERGY-EFFICIENT MULTIMEDIA COMMUNICATIONS IN LOSSY MULTI- HOP WIRELESS NETWORKS
463
1. Introduction
463
2. Energy Management in Multi-Hop Wireless Networks
464
2.1 Energy-Aware Communication
464
2.2 Supporting End-to-End Communication with Hop-by-Hop Mechanisms
465
3. Protocol Effectiveness and Energy Efficiency
466
4. Application-Aware Link Layer Protocol
466
4.1 Transport Protocol Support
467
4.2 Intelligent Dropping Mechanism
467
4.3 The Retransmission Mechanism
468
5. Evaluation
469
5.1 Effects of Error Rate on Performance
470
5.2 Effects of Mobility on Performance
471
6. Conclusions
472
References
473
ANALYZING THE ENERGY CONSUMPTION OF IEEE 802.11 AD HOC NETWORKS
475
1. Introduction
475
2. Energy Consumption of the Nodes
476
3. Power Saving Techniques
479
4. Conclusions
485
References
486
ENERGY-EFFICIENT RELIABLE PATHS FOR ON-DEMAND ROUTING PROTOCOLS
487
1. Introduction
487
2. Related Work
487
3. Minimum Energy Reliable Paths
488
3.1 Hop-by-Hop Retransmissions (HHR):
488
3.2 End-to-End Retransmissions (EER):
489
4. Estimating Link Error Rate
489
4.1 BER using Radio Signal-to-Noise Ratio
489
4.2 BER using Link Layer Probes
490
4.3 BER Estimation for Variable Power Case
490
5. AODV and its Proposed Modifications
491
5.1 AODV Messages and Structures
491
5.2 Route Discovery
491
6. Simulation Experiments and Performance Evaluation
493
6.1 Network Topology and Link Error Modeling
493
6.2 Metrics
495
6.3 Static Grid Topologies
495
6.4 Static Random Topologies
497
6.5 Mobile Topologies
497
7. Conclusions
497
MINIMUM POWER SYMMETRIC CONNECTIVITY PROBLEM IN WIRELESS NETWORKS: A NEW APPROACH
499
1. Introduction
499
2. Problem description
501
3. An integer programming formulation
502
3.1 Valid inequalities
503
4. Preprocessing procedure
505
5. The iterative exact algorithm
506
6. Computational results
506
6.1 Preprocessing procedure
507
6.2 IEX algorithm
507
7. Conclusion
508
Acknowledgments
508
References
509
Alle Preise verstehen sich inklusive der gesetzlichen MwSt.