Heterogeneous Wireless Networks: An Analysis of Network and Service Level Diversity

Future wireless systems will be a collection of symbiotic and hierarchical networks that address different aspects of communication needs. This architectural heterogeneity constitutes a network level diversity, where wireless domains can benefit from each other’s spare resources in terms of bandwidth and energy. The dissertation investigates the network diversity through particularly interesting scenarios that involve capacity-limited multi-hop ad hoc networks and high-bandwidth wired or wireless infrastructures. Heterogeneity and infrastructures not only exist at the level of networking technologies and architectures, but also at the level of available services in each network domain…

Contents

Introduction
1.1 Wireless Hybrid Networks
1.1.1 Overlaid Wireless Systems
1.2 Service Discovery
1.2.1 Client-Server Paradigm
1.2.2 Directory Systems
1.3 Organization of the Thesis
2 Asymptotic Throughput Capacity of Large Hybrid Networks
2.1 Introduction
2.2 Overview
2.2.1 Capacity of Wireless Ad Hoc Networks
2.2.2 Capacity of Hybrid Networks
2.3 System Model
2.4 Capacity Improvement with Infrastructure Layer
2.4.1 Throughput Upper-bound under Strong Connectivity
2.4.2 Achievability of Θ[W/ log(N)]
2.5 Looser Connectivity Conditions and Achievability of Constant Capacity per Node
2.6 Achievability of the Capacity in the case of Weak Connectivity
2.7 Relaxing the Assumptions
2.7.1 Capacity Bound for the Constrained Infrastructure
2.7.2 Revisiting the Assumption K =Θ(N)
2.7.2.1 Strong Connectivity Results vs. Access Point Population
2.7.2.2 Weak Connectivity Results vs. Access Point Population
2.8 Summary
3 Hybrid Networks as Finite Arbitrary Graphs
3.1 Cross-layer Interaction
3.2 Related Works
3.3 System Model
3.3.1 Channel Model
3.3.2 SINR threshold and Feasibility of Concurrent Transmissions
3.3.3 Notion of Virtual Links
3.3.4 Hybrid Network Communication Scenarios
3.4 Joint Power Allocation, Schedule and Path Assignment Problem in two tier Hybrid Networks
3.4.1 Formal Problem Statement
3.4.2 Intractability of the Jointly Feasible Schedule and Power Allocation
3.4.3 Performance Bounds
3.5 Sub-Optimal Approximation Algorithms for P2
3.5.1 Pseudo-polynomial Approximation: Solving P1
3.5.1.1 Algorithm A
3.5.1.2 Algorithm B
3.5.2 Polynomial Approximation Algorithm for P2
3.6 Experimental Evaluation
3.6.1 Solving P1: Algorithm A versus Algorithm B
3.6.2 Solving P2: Pseudo-polynomial versus Polynomial Algorithms
3.7 Summary
4 Service Discovery in Wireless Hybrid and Ad Hoc Networks
4.1 Service Discovery for Multi-hop Wireless Networks
4.2 Network Model and Notation
4.2.1 Network Model
4.2.2 Notation and Definitions
4.3 A Directory Architecture Solution for Service Discovery
4.3.1 BackBone Management (BBM) Phase
4.3.1.1 Backbone Selection
4.3.1.2 Mesh Formation
4.3.1.3 Backbone Maintenance
4.3.2 Distributed Service Discovery (DSD) Phase
4.4 Simulation Environment
4.4.1 Performance Metrics
4.4.2 Simulation Model
4.4.3 Simulation Results
4.5 Integration of DSDP Solutions with Other Layers
4.5.1 Application of DSDP to Reliable Server Pooling
4.5.2 Integration with Routing Protocols: Case Study with OLSR
4.6 Summary
5 Conclusion
5.1 Suggestions for Further Study
A Proofs of Lemmas in Chapter 2
A.1 Proof of Lemma 3
A.2 Proof of Theorem 3
Bibliography

Author: Kozat, Ulas Can

Source: University of Maryland

Download URL 2: Visit Now