Log In
Or create an account ->
Imperial Library
Home
About
News
Upload
Forum
Help
Login/SignUp
Index
Half-title page
Title page
Copyright page
Dedication
Contents
Preface
Part I: Introduction
1. Basics of D2D communications
1.1 Overview of D2D communications
1.2 Key technologies for D2D communications
1.2.1 Configuration of D2D communications
1.2.2 Device synchronization and discovery
1.2.3 Mode selection
1.2.4 Spectrum sharing and resource management
1.2.5 Power control
1.2.6 Uplink and downlink transmission with MIMO
1.3 Device-to-device local area networks
1.4 D2D direct: a simulation scenario
1.5 Issues and challenges in D2D communications
1.6 Chapter summary
Part II: Techniques for modeling and analysis of D2D communications
2. Optimization
2.1 Constrained optimization
2.1.1 Basic definition
2.1.2 The Lagrangian method
2.1.3 Optimality
2.1.4 The primal–dual algorithm
2.2 Linear programming and the simplex algorithm
2.3 Convex programming
2.3.1 Quadratic, geometric, and semidefinite programming
2.3.2 The gradient method, the Newton method, and their variations
2.3.3 The alternating-direction method-of-multipliers algorithm
2.4 Nonlinear programming
2.4.1 The barrier/interior-point method
2.4.2 The Monte Carlo method
2.4.3 Simulated annealing
2.4.4 Genetic algorithms
2.4.5 Swarm intelligence
2.5 Integer programming
2.5.1 General formulation
2.5.2 The knapsack problem
2.5.3 Relaxation and decomposition
2.5.4 An enumerative technique: the branch-and-bound approach
2.5.5 Cutting planes
2.5.6 Benders’ decomposition
2.6 Dynamic programming and Markov decision processes
2.6.1 A general definition of dynamic programming
2.6.2 Markov decision processes
2.7 Stochastic programming
2.7.1 Problem definition
2.7.2 Chance constraint, sampling method, and variation
2.7.3 Recourse
2.8 Sparse optimization
2.8.1 Sparse-optimization models
2.8.2 A list of sparse-optimization algorithms
3. Game theory
3.1 Basics of game theory
3.2 The noncooperative static game
3.2.1 The normal form of a static game
3.2.2 Nash equilibrium, Pareto optimality, and mixed strategy
3.2.3 Social optimum: price of anarchy and referee
3.3 The dynamic game
3.3.1 Sequential games, and games in extensive form
3.3.2 Repeated games
3.3.3 Stochastic games
3.3.4 Differential control/games
3.4 Cooperative game theory – bargaining games
3.4.1 Bargaining solutions
3.4.2 Applications of bargaining games
3.5 Cooperative game theory – coalitional games
3.5.1 Characteristic function and core
3.5.2 Fairness
3.5.3 The merge/split algorithm
3.6 Matching theory
3.6.1 One-to-one matching
3.6.2 Many-to-one matching
3.6.3 Many-to-many matching
3.7 Auction theory
3.7.1 Auction basics
3.7.2 Mechanism design
3.7.3 VCG auctions
3.7.4 Share auctions
3.7.5 Double auctions
3.8 Contract theory
3.8.1 Information and incentives
3.8.2 Bilateral contracting
3.9 Bayesian games with imperfect information
3.9.1 Bayesian games in normal form
3.9.2 Bayesian games in extensive games
3.10 Other special types of games
3.10.1 Zero-sum games
3.10.2 Potential games
3.10.3 Super-modular games
3.10.4 Correlated equilibrium
3.10.5 Satisfaction equilibrium
Part III: Resource management, cross-layer design, and security for D2D communications
4. Mode selection and resource allocation for D2D communications underlaying cellular networks
4.1 Introduction
4.2 LTE-A networks and D2D communications
4.2.1 An overview of LTE-A networks
4.2.2 D2D communications in LTE-A networks
4.3 Research issues and challenges for D2D communications underlaying LTE-A networks
4.3.1 Mode selection
4.3.2 Transmission scheduling
4.3.3 Power control and power efficiency
4.3.4 Distributed resource allocation
4.3.5 Coexistence with heterogeneous networks
4.3.6 Cooperative communications
4.3.7 Network coding
4.3.8 Interference cancellation and advanced receivers
4.3.9 Multiple-antenna technology and multiple-input and multiple-output (MIMO) schemes
4.3.10 Mobility management and handoff
4.3.11 Robust resource allocation
4.4 The state of the art of D2D communications underlaying LTE/LTE-A networks
4.4.1 Mode selection
4.4.2 Power control
4.4.3 Distributed resource allocation
4.4.4 Interference cancellation
4.4.5 MIMO-based D2D communications
4.5 Mode selection based on a coalitional game model
4.5.1 The system model and assumptions
4.5.2 The coalitional game model
4.5.3 Strategies of the D2D links
4.5.4 Coalition formation
4.5.5 Numerical results
4.6 Joint mode selection and resource allocation for D2D communications
4.6.1 The network model
4.6.2 Feasible access patterns
4.6.3 Constraints of feasible access patterns
4.6.4 Column generation for joint mode selection and resource allocation
4.7 Numerical results
4.8 Chapter summary
5. Interference coordination for D2D communications
5.1 Interference analysis
5.2 Interference avoidance
5.3 Power control
5.3.1 Network-controlled power control
5.3.2 Power control using MIMO
5.4 Chapter summary
6. Subchannel allocation and time-domain scheduling for D2D communications
6.1 Subchannel allocation
6.1.1 Centralized (operator-managed) subchannel allocation
6.2 Time-domain scheduling
6.2.1 Stackelberg game-based scheduling in the time domain
6.2.2 Joint frequency–time-domain scheduling
6.3 Capacity offloading through D2D local area networks
6.4 Chapter summary
7. Cross-layer design for device-to-device communication
7.1 An overview of cross-layer design
7.1.1 Definitions and approaches
7.1.2 The cross-layer coordination model
7.1.3 Cross-layer implementation
7.1.4 Cross-layer design considerations and challenges
7.2 Cross-layer optimization
7.2.1 Opportunistic scheduling
7.2.2 OFDMA wireless networks
7.2.3 Cross-layer congestion control and scheduling
7.3 Cross-layer design for vehicular ad-hoc networks
7.3.1 Physical and MAC layers
7.3.2 Physical and network layers
7.3.3 Network and MAC layers
7.3.4 Transport, network, and MAC layers
7.4 Cross-layer design in D2D communication
7.4.1 Information correlation routing
7.4.2 Cross-layer routing in wireless sensor networks
7.4.3 Cross-layer distributed scheduling for peer-to-peer video streaming
7.5 Chapter summary
8. Security for D2D communications
8.1 Location security
8.1.1 Problem overview
8.1.2 Literature
8.2 Data-transmission security
8.2.1 The system model and problem formulation
8.2.2 Graph-based resource allocation
8.2.3 Simulation results
8.3 Chapter summary
Part IV: Applications of D2D communications
9. Vehicular ad-hoc networks
9.1 Introduction
9.2 Vehicular networks
9.2.1 ITS applications
9.2.2 Vehicular network architecture and IEEE 802.11p
9.2.3 VANETs
9.3 D2D communications in vehicular networks
9.3.1 An intracluster device-to-device retransmission algorithm
9.3.2 BitTorrent-based wireless access in vehicular networks
9.3.3 Problem formulation
9.3.4 Data transfer from roadside units
9.3.5 Optimal channel access in vehicular networks
9.4 Chapter summary
10. Mobile social networks
10.1 Introduction
10.2 An overview of mobile social networks
10.2.1 Types and components of mobile social networks
10.2.2 Social-network analysis
10.3 Community detection
10.3.1 Dynamic community detection
10.3.2 Mobility-based distributed community detection
10.3.3 Influence-based community detection
10.4 Social-aware data routing and dissemination
10.4.1 A routing protocol based on betweenness and similarity
10.4.2 A routing protocol based on community and degree centrality
10.4.3 Friendship-based routing
10.4.4 Geocommunity-based routing
10.5 Cooperative content delivery in mobile social networks
10.5.1 Mobile social networks with content providers and a network operator
10.5.2 The Markov chain model of content forwarding among mobile nodes
10.5.3 Performance measures
10.5.4 Controlled coalitional-game formulation
10.5.5 Performance evaluation
10.6 Chapter summary
11. Machine-to-machine (M2M) communications
11.1 Introduction
11.2 Machine-to-machine (M2M) communications
11.2.1 Machine-type communications in LTE-A networks
11.2.2 An overview of the random-access procedure
11.3 RACH overload control mechanisms
11.3.1 Grouping of MTC devices
11.3.2 An access-class-barring-based scheme
11.3.3 Separation of random-access preambles
11.3.4 Dynamic allocation of random-access resources
11.3.5 A qualitative comparison of random-access overload control approaches
11.4 Performance modeling of the random-access channel (RACH)
11.4.1 The network model
11.4.2 MTC user equipment and its packet transmission
11.4.3 Coexistence of MTC and H2H user equipments
11.4.4 A queueing model
11.4.5 The state space and transition matrix for queueing at each MTC UE
11.4.6 Queueing performance measures at an MTC user equipment
11.4.7 An iterative algorithm
11.4.8 Numerical results
11.5 Chapter summary
Part V: Standardization of D2D communications
12. Network-controlled D2D over LTE/LTE-A
12.1 D2D communications in LTE-A networks
12.2 Requirements and working assumptions
12.2.1 Operational requirements
12.2.2 Charging requirements
12.2.3 Security requirements
12.3 Key working scenarios
12.4 LTE-A architecture enhancements to support proximity-based services (ProSe)
12.5 Performance evaluation
12.6 Application in proximity services
12.6.1 Proximity discovery over E-UTRA
12.6.2 Proximity communications over E-UTRA
12.6.3 Public-safety services
12.7 Chapter summary
References
Index
← Prev
Back
Next →
← Prev
Back
Next →