Medium Access Control and Network Coding for Wireless Information Flows
Free download B.Tech, M.Tech, MCA, M.Sc Computers Projects Based on NETWORKING
This dissertation addresses the intertwined problems of medium access control (MAC) and network coding in ad hoc wireless networks. The emerging wireless network applications introduce new challenges that go beyond the classical understanding of wireline networks based on layered architecture and cooperation. Wireless networks involve strong interactions between MAC and network layers that need to be jointly specified in a cross-layer design framework with cooperative and non-cooperative users. For multi-hop wireless networks, we first rediscover the value of scheduled access at MAC layer through a detailed foray into the questions of throughput and energy consumption….
Contents
1 Introduction
2 Medium Access Control (MAC) in Multi-Hop Wireless Networks: A New Look at Multiple Access and Time Division
2.1 Introduction
2.2 Group TDMA in Two-Destination Networks
2.2.1 Group TDMA Algorithm
2.2.2 Throughput E?ciency of Group TDMA Algorithm
2.3 Group TDMA under Protocol Model
2.4 Group TDMA in General Multi-Destination Systems
2.4.1 Throughput-Optimal Time Allocation
2.4.2 Group TDMA for Finite Node Population
2.5 Receiver Activation in Wireless Networks
2.6 Time Allocation for Receiver Activation
2.6.1 Throughput-E?cient Time Allocation
2.6.2 Energy-E?cient Time Allocation
2.7 Distributed Operation of Receiver Activation and Group TDMA
2.8 Performance Evaluation
2.9 Summary and Conclusions
3 A Game-Theoretic Look at MAC in Wireless Networks: Non-Cooperative Random Access for Sel?sh and Malicious Users
3.1 Introduction
3.2 System Model, Rewards and Costs
3.3 Two Sel?sh Transmitters with Saturated Packet Queues
3.3.1 Non-Cooperative Equilibrium
3.3.2 Comparison with Cooperative Equilibrium
3.3.3 Improvement of Non-cooperative Equilibrium through Pricing
3.4 Extensions to Stable Operation with Two Sel?sh Transmitters
3.5 E?ects of Malicious Operation on Non-Cooperative Equilibrium
3.6 Adaptive Update Mechanisms for Distributed Operation
3.7 Arbitrary Number of Transmitters
3.7.1 Arbitrary Number of Sel?sh Transmitters
3.7.2 Comparison with Scheduled Access
3.7.3 Arbitrary Sets of Sel?sh and Malicious Transmitters
3.8 Extensions to Multiple Receivers in Broadcast Communication
3.9 Repeated Random Access Games for Backlogged Transmission
3.9.1 Non-Cooperative Equilibrium Strategies
3.9.2 Comparison of Sel?sh and Cooperative Strategies
3.10 Randomized Power and Rate Control Game
3.11 Summary and Conclusions
4 Power-Controlled MAC Games for Non-Cooperative Wireless Access
4.1 Introduction
4.2 System Model, Rewards and Costs
4.3 Utility Function Type 1
4.3.1 Two Sel?sh Transmitters
4.3.2 One Sel?sh and One Malicious Transmitter
4.4 Utility Function Type 2
4.4.1 Two Sel?sh Transmitters
4.4.2 One Sel?sh and One Malicious Transmitter
4.5 Best Response Update Mechanisms for Distributed Operation
4.6 Comments on Social Equilibrium
4.7 Arbitrary Number of Sel?sh and Malicious Transmitters
4.7.1 Utility Function Type 1
4.7.2 Utility Function Type 2
4.7.3 Numerical Results
4.8 Alternative Measures for Transmission Rates
4.9 Summary and Conclusions
5 A Game-Theoretic Analysis of Joint MAC and Routing in Non-Cooperative Wireless Networks
5.1 Introduction
5.2 Network Model for the Simple Relay Channel
5.2.1 Cooperation Stimulation Mechanism for Relaying
5.3 A Framework for Two-User Stochastic Games
5.4 Communication over Relay Channel as a Stochastic Game
5.4.1 State De?nition
5.4.2 Action Space and Mixed Stationary Strategies
5.4.3 State Transition Matrix and Utility Functions
5.5 Performance Evaluation of Relay Channel Communication
5.6 Distributed Adaptive Algorithm with Limited Information
5.7 Improvement of the Game Model: A New Relaying Rule
5.7.1 Modi?ed State De?nition and Mixed Stationary Strategies
5.7.2 Modi?ed State Transition Matrix and Utility Functions
5.7.3 Numerical Analysis of the Performance Improvement
5.7.4 An Analytical Look at the Equilibrium Strategies
5.7.5 Improvement by Immediate Transmissions of New Packets
5.8 Summary and Conclusions
6 Cross-Layer Design of MAC and Network Coding in Wireless Networks
6.1 Introduction
6.2 Cross-Layer Design of Network Coding and MAC
6.2.1 An Example of Wireless Network Coding
6.2.2 Joint Design of Network Coding and Con?ict-free Scheduling
6.2.2.1 Network Flow Optimization
6.2.2.2 Step 1 (Construction of Con?ict-Free Network Real-izations)
6.2.2.3 Step 2 (Time Allocation for MAC Schedules)
6.2.2.4 Example for Cross-Layer Design
6.3 Construction of Wireless Network Codes
6.3.1 Wireless Network Flows with Omnidirectional Transmissions
6.3.2 Basic Method for Constructing Wireless Network Codes
6.3.3 Example for Constructing Wireless Network Codes
6.3.4 Properties of Linear Wireless Network Codes and Interactions with MAC Schedules
6.3.5 Network Coding with Arbitrary MAC through Group TDMA
6.4 Improved Joint MAC and Network Coding Methods
6.4.1 Subtree Decomposition Method
6.4.2 Common Network Coding Method by Subtree Decomposition
6.4.3 Scheduling by Subtree Decomposition: Method A
6.4.4 Scheduling by Subtree Graph Coloring: Method B
6.4.5 Scheduling by Exhaustive Search: Method C
6.4.6 Properties of Scheduling Methods A, B and C
6.4.7 Distributed Implementation Issues
6.5 Performance Comparison of Network Coding and Plain Routing
6.6 Summary and Conclusions
7 Joint Optimization of MAC and Network Coding in Wireless Queueing Net-works with Multiple Sources
7.1 Introduction
7.2 MAC and Network Layer Model
7.3 Cross-Layer Throughput Optimization Problem
7.4 Achievable Throughput Region for Saturated Queues
7.5 Stability Region for Possibly Emptying (Non-Saturated) Queues
7.6 Throughput Optimization Trade-o?s
7.6.1 Upper Bounds on Multicast Communication
7.6.2 Broadcast Communication
7.6.3 Unicast Communication
7.6.4 Joint Optimization of Throughput Rates ?S and ?min
7.7 Energy Properties and Trade-o?s with Throughput Objectives
7.7.1 Transmission and Processing Energy Costs for Saturated Queues
7.7.2 Transmission and Processing Energy Costs in Stable Operation
7.8 Extension to Random Access
7.8.1 Methods for Source Packet Transmissions in Random Access
7.8.2 Achievable Throughput Region in Random Access
7.8.3 Throughput Optimization in Random Access
7.9 Non-Cooperative Network Coding Operation
7.9.1 Reward-Based Cooperation Stimulation
7.9.2 Non-Cooperative Random Access
7.10 Summary and Conclusions
8 E?ects of Network Coding on Queueing Stability in Wireless Access
8.1 Introduction
8.2 Single-Source Broadcast System Model
8.3 Suboptimal Retransmission Policies
8.4 Random Network Coding Policy
8.4.1 Stable Throughput Properties
8.4.2 Transmission and Processing Energy Costs
8.4.3 Extensions to Compound Random Access of Two Source Nodes
8.5 Optimal Coded Retransmission Policy for the Single Source Case
8.5.1 Feedback, Packet Overhead and Complexity Issues
8.6 Optimal Coded Retransmission Policy for Two Source Nodes
8.7 Extensions to Unicast Communication
8.8 Summary and Conclusions
9 Conclusions
Bibliography
http://studentyogi.com/?attachment_id=2778
