On Flow-Aware CSMA. in Multi-Channel Wireless Networks. Mathieu Feuillet. Joint work with Thomas Bonald CISS 2011
|
|
- Neal O’Brien’
- 6 years ago
- Views:
Transcription
1 On Flow-Aware CSMA in Multi-Channel Wireless Networks Mathieu Feuillet Joint work with Thomas Bonald CISS 2011
2 Outline Model Background Standard CSMA Flow-aware CSMA Conclusion
3 Outline Model Background Standard CSMA Flow-aware CSMA Conclusion
4 Conflict graphs The network is represented by a set of conflict graphs, one per channel. Channel 1 Channel 2
5 Conflict graphs The network is represented by a set of conflict graphs, one per channel. Channel 1 Channel 2 Conflict graphs on different channels can be different.
6 Conflict graphs Channel 1 Channel 2 Schedules:, {(1, 1)}, {(2, 1)}, {(3, 1)},{(1, 1), (3, 1)}.
7 Conflict graphs Channel 1 Channel 2 Schedules:, {(1, 1)}, {(2, 1)}, {(3, 1)},{(1, 1), (3, 1)}.
8 Conflict graphs Channel 1 Channel Schedules:, {(1, 1)}, {(2, 1)}, {(3, 1)},{(1, 1), (3, 1)}.
9 Conflict graphs Channel 1 Channel Schedules:, {(1, 1)}, {(2, 1)}, {(3, 1)},{(1, 1), (3, 1)}.
10 Conflict graphs Channel 1 Channel 2 Schedules:, {(1, 1)}, {(2, 1)}, {(3, 1)},{(1, 1), (3, 1)}.
11 Conflict graphs Channel 1 Channel 2 Schedules:, {(1, 1)}, {(2, 1)}, {(3, 1)},{(1, 1), (3, 1)}.
12 Conflict graphs Channel 1 Channel 2 Schedules:, {(1, 1)}, {(2, 1)}, {(3, 1)},{(1, 1), (3, 1)}. {(1, 2)}, {(2, 2)}, {(3, 2)},{(1, 2), (3, 2)}.
13 Conflict graphs Channel 1 Channel 2 Schedules:, {(1, 1)}, {(2, 1)}, {(3, 1)},{(1, 1), (3, 1)}. {(1, 2)}, {(2, 2)}, {(3, 2)},{(1, 2), (3, 2)}. {(1, 1), (2, 2)}, {(1, 2), (2, 1), (3, 1)},...
14 Conflict graphs Channel Channel Schedules:, {(1, 1)}, {(2, 1)}, {(3, 1)},{(1, 1), (3, 1)}. {(1, 2)}, {(2, 2)}, {(3, 2)},{(1, 2), (3, 2)}. {(1, 1), (2, 2)}, {(1, 2), (2, 1), (3, 1)},...
15 Conflict graphs Channel Channel 2 Schedules:, {(1, 1)}, {(2, 1)}, {(3, 1)},{(1, 1), (3, 1)}. {(1, 2)}, {(2, 2)}, {(3, 2)},{(1, 2), (3, 2)}. {(1, 1), (2, 2)}, {(1, 2), (2, 1), (3, 1)},...
16 Time-scale separation We assume time-scale separation between flow-level and packet-level dynamics. At the packet level, the number of flows is fixed. At the flow level, the packet-level dynamics are at equilibrium: the throughput of each node is the fraction of time it is active.
17 Time-scale separation We assume time-scale separation between flow-level and packet-level dynamics. At the packet level, the number of flows is fixed. At the flow level, the packet-level dynamics are at equilibrium: the throughput of each node is the fraction of time it is active. Example: ϕ 1 = p {1} + p {1,3}, ϕ 2 = p {2}, ϕ 3 = p {3} + p {1,3}.
18 Capacity Region Defined as the set of all feasible link throughputs ϕ k = i:k S i p i Throughput of node k Schedule i Probability of schedule i
19 Capacity Region Defined as the set of all feasible link throughputs ϕ k = i:k S i p i Throughput of node k Schedule i Probability of schedule i Example: Schedules:, {1}, {2}, {3}, {1, 3}. Capacity region: {ϕ 1 + ϕ 2 1, ϕ 2 + ϕ 3 1}.
20 Stability region Defined as the set of traffic intensities such that the network is stable. ρ k = λ k σ k Example: ρ 1 ρ 2 ρ 3 The stability region depends on the algorithm.
21 Stability region Defined as the set of traffic intensities such that the network is stable. ρ k = λ k σ k Flows arrival rate
22 Stability region Defined as the set of traffic intensities such that the network is stable. ρ k = λ k σ k Flows arrival rate Mean flow size
23 Stability region Defined as the set of traffic intensities such that the network is stable. ρ k = λ k σ k Traffic intensity Flows arrival rate Mean flow size
24 Optimal stability region The stability region of any algorithm is included in the capacity region. The interior of the capacity region is called the optimal stability region.
25 Optimal stability region The stability region of any algorithm is included in the capacity region. The interior of the capacity region is called the optimal stability region. Example: Optimal stability region: {ρ 1 + ρ 2 < 1, ρ 2 + ρ 3 < 1}.
26 Outline Model Background Standard CSMA Flow-aware CSMA Conclusion
27 Maximal Weight scheduling Tassiulas & Ephremides 92 max w i (x) = k S i x k
28 Maximal Weight scheduling Tassiulas & Ephremides 92 max w i (x) = k S i x k Example: x 1 + x 3 > x 2 schedule {1, 3} x 1 + x 3 < x 2 schedule {2}
29 Suboptimal algorithms Maximal queue scheduling Mc Keown 95 Dimakis & Walrand 06 Efficiency 8 max x k
30 Suboptimal algorithms Maximal queue scheduling Mc Keown 95 Dimakis & Walrand 06 Efficiency 8 max x k Maximal size scheduling Charporkar, Kar & Sarkar 95 max S i Bonald & Massoulié 01 Efficiency 0.76
31 Optimal Algorithms Adaptative rate-based CSMA Jiang & Walrand 08 Measure the packet input and output rates and adapt the back-off accordingly. Learning algorithm.
32 Optimal Algorithms Adaptative rate-based CSMA Jiang & Walrand 08 Measure the packet input and output rates and adapt the back-off accordingly. Learning algorithm. Adaptative queue based CSMA Rajagopolan, Shah & Shin 09 Adapt the back-off according to the log log of the queue length. Some technical assumptions.
33 Outline Model Background Standard CSMA Flow-aware CSMA Conclusion
34 Standard CSMA Probe a channel at random, after some random backoff time α/2 α/2 Back-off exp(α) Transmission exp(1) Back-off exp(α) ϕ 1 (x) = α 1 + α
35 Standard CSMA Probe a channel at random, after some random backoff time α/2 α/2 Back-off exp(α) Transmission exp(1) Back-off exp(α) Stability region: ϕ 1 (x) = α 1 + α ρ 1 < α 1+α α {ρ 1 < 1}
36 Standard CSMA w i (x) = (k,j) S i α k,j 1 {xk >0} Weight of schedule i Ratio of transmission time to virtual backoff time at link k on channel j Example: Assume α k,j = α for k = 1, 2, 3 and j = 1, 2. α 1 α 1 α 1 α 1 α 1 α 1
37 Standard CSMA w i (x) = (k,j) S i α k,j 1 {xk >0} Weight of schedule i Ratio of transmission time to virtual backoff time at link k on channel j Example: Assume α k,j = α for k = 1, 2, 3 and j = 1, 2. α 1 α 1 α 1 α 1 α 1 α 1 : w i (x) = 1
38 Standard CSMA w i (x) = (k,j) S i α k,j 1 {xk >0} Weight of schedule i Ratio of transmission time to virtual backoff time at link k on channel j Example: Assume α k,j = α for k = 1, 2, 3 and j = 1, α 1 α 1 α 1 α 1 α 1 α 1 {(1, 1)} : w i (x) = α
39 Standard CSMA w i (x) = (k,j) S i α k,j 1 {xk >0} Weight of schedule i Ratio of transmission time to virtual backoff time at link k on channel j Example: Assume α k,j = α for k = 1, 2, 3 and j = 1, α 1 α 1 α 1 α 1 α 1 α {(1, 1), (2, 2)} : w i (x) = α 2
40 Standard CSMA w i (x) = (k,j) S i α k,j 1 {xk >0} Weight of schedule i Ratio of transmission time to virtual backoff time at link k on channel j Example: Assume α k,j = α for k = 1, 2, 3 and j = 1, α 1 α 1 α 1 α 1 α 1 α {(1, 1), (2, 2), (3, 1)} : w i (x) = α 3
41 Standard CSMA w i (x) = (k,j) S i α k,j 1 {xk >0} Weight of schedule i Ratio of transmission time to virtual backoff time at link k on channel j Example: Assume α k,j = α for k = 1, 2, 3 and j = 1, 2. α 1 α 1 α 1 α 1 α 1 α 1 w i (x) = α n for n active links
42 Standard CSMA ϕ k (x) = i:k S i p i (x) Throughput of link k Probability of schedule i Example: Assume α k,j = α for k = 1, 2, 3 and j = 1, 2. α 1 α 1 α 1 α 1 α 1 α 1 ϕ 1 (x) = ϕ 3 (x) = 2α + 6α2 + 2α α + 8α 2 + 2α 3, ϕ 2(x) = 2α + 4α2 + 2α α + 8α 2 + 2α 3
43 Suboptimality of standard CSMA 1 channel α 1 Optimal Actual ρ Homogeneous case ρ 1 = ρ 2 = ρ Efficiency ρ 1 = ρ 3
44 Suboptimality of standard CSMA 2 channels ρ α 1 Optimal Actual Homogeneous case ρ 1 =... = ρ ρ 1 =... = ρ 4 Efficiency 0.85
45 Outline Model Background Standard CSMA Flow-aware CSMA Conclusion
46 Flow-aware CSMA Proposed modification of CSMA: Exponential backoff time for each flow αx 1 /2 αx 1 /2 Back-off exp(αx 1 ) Transmission exp(1) Back-off exp(αx 1 ) ϕ 1 (x) = αx αx 1
47 Flow-aware CSMA Proposed modification of CSMA: Exponential backoff time for each flow αx 1 /2 αx 1 /2 Back-off exp(αx 1 ) Transmission exp(1) Back-off exp(αx 1 ) ϕ 1 (x) = αx αx 1 Stability region: {ρ 1 < 1}
48 Flow-aware CSMA w i (x) = k S i α k,j x k Weight of schedule i Ratio of transmission time to virtual backoff time at link k on channel j Example: Assume α k,j = α for k = 1, 2, 3 and j = 1, 2. αx 1 1 αx 2 1 αx 3 1 αx 1 1 αx 2 1 αx 3 1
49 Flow-aware CSMA w i (x) = k S i α k,j x k Weight of schedule i Ratio of transmission time to virtual backoff time at link k on channel j Example: Assume α k,j = α for k = 1, 2, 3 and j = 1, 2. αx 1 1 αx 2 1 αx 3 1 αx 1 1 αx 2 1 αx 3 1 : w i (x) = 1
50 Flow-aware CSMA w i (x) = k S i α k,j x k Weight of schedule i Ratio of transmission time to virtual backoff time at link k on channel j Example: Assume α k,j = α for k = 1, 2, 3 and j = 1, αx 1 1 αx 2 1 αx 3 1 αx 1 1 αx 2 1 αx 3 1 {(1, 1)} : w i (x) = αx 1
51 Flow-aware CSMA w i (x) = k S i α k,j x k Weight of schedule i Ratio of transmission time to virtual backoff time at link k on channel j Example: Assume α k,j = α for k = 1, 2, 3 and j = 1, αx 1 1 αx 2 1 αx 3 1 αx 1 1 αx 2 1 αx {(1, 1), (2, 2)} : w i (x) = α 2 x 1 x 2
52 Flow-aware CSMA w i (x) = k S i α k,j x k Weight of schedule i Ratio of transmission time to virtual backoff time at link k on channel j Example: Assume α k,j = α for k = 1, 2, 3 and j = 1, αx 1 1 αx 2 1 αx 3 1 αx 1 1 αx 2 1 αx {(1, 1), (2, 2), (3, 1)} : w i (x) = α 3 x 1 x 2 x 3
53 Flow-aware CSMA ϕ k (x) = i:k S i p i (x) Throughput of link k Probability of schedule i Example: Assume α k,j = α for k = 1, 2, 3 and j = 1, 2. αx 1 1 αx 2 1 αx 3 1 αx 1 1 αx 2 1 αx 3 1 ϕ 2 (x) 2α 3 x 1 x 2 x 3 + 2α 2 x 2 (x 1 + x 3 ) + 2αx 2
54 Optimality of flow-aware CSMA Theorem The flow-aware CSMA algorithm is optimal: for any number of channels and any sets of conflicts graphs, it stabilizes the network for all traffic intensities inside the capacity region. Sketch of proof: When the number of flows is high, the algorithm behaves as max-weight: the algorithm selects schedules of high weight with high probability. Proof based on Foster s criterion.
55 Throughput performance Homogeneous load α = 1 Standard CSMA Flow-aware CSMA 1 channel 1 channel Flow throughput channels 3 channels Flow throughput channels 3 channels Load Load
56 Time-scale separation α = 1 1 packet per flow Center link Edge link With With Flow throughput Without Flow throughput Without Load Load
57 Outline Model Background Standard CSMA Flow-aware CSMA Conclusion
58 Conclusion A simple, distributed, asynchronous access scheme that is provably optimal. A theoretical issue: Time-scale separation Extensions of the model: Collisions Throughput performance
A Backlog-Based CSMA Mechanism to Achieve Fairness and Throughput-Optimality in Multihop Wireless Networks
A Backlog-Based CSMA Mechanism to Achieve Fairness and Throughput-Optimality in Multihop Wireless Networks Peter Marbach, and Atilla Eryilmaz Dept. of Computer Science, University of Toronto Email: marbach@cs.toronto.edu
More informationA Fluid-Flow Model for Backlog-Based CSMA Policies
A Fluid-Flow Model for Backlog-Based CSMA Policies Atilla Eryilmaz Dept. of Electrical and Computer Engineering Ohio State University Columbus, OH eryilmaz@ece.osu.edu Peter Marbach Dept. of Computer Science
More informationResource Allocation Challenges in Future Wireless Networks
Resource Allocation Challenges in Future Wireless Networks Mohamad Assaad Dept of Telecommunications, Supelec - France Mar. 2014 Outline 1 General Introduction 2 Fully Decentralized Allocation 3 Future
More informationFairness and Delay in Heterogeneous Half- and Full-Duplex Wireless Networks
Fairness and Delay in Heterogeneous Half- and Full-Duplex Wireless Networks Tingjun Chen *, Jelena Diakonikolas, Javad Ghaderi *, and Gil Zussman * * Electrical Engineering, Columbia University Simons
More informationEfficient and Low-Overhead Uplink Scheduling for Large-Scale Wireless Internet-of-Things
Efficient and Low-Overhead Uplink Scheduling for Large-Scale Wireless Internet-of-Things Bin Li 1,BoJi 2, and Jia Liu 3 1 Department of Electrical, Computer and Biomedical Engineering, University of Rhode
More informationDistributed Learning for Utility Maximization over CSMA-based Wireless Multihop Networks
Distributed Learning for Utility Maximization over CSMA-based Wireless Multihop Networks Hyeryung Jang, Se-Young Yun, Jinwoo Shin, and Yung Yi Abstract Game-theoretic modeling and equilibrium analysis
More informationOptimal Distributed Scheduling of Real-Time Traffic with Hard Deadlines
Optimal Distributed Scheduling of Real-Time Traffic with Hard Deadlines Ning Lu, Bin Li, R. Srikant, and Lei Ying Abstract In this paper, we consider optimal distributed scheduling of real-time traffic
More informationOptimal Distributed Scheduling of Real-Time Traffic with Hard Deadlines
2016 IEEE 55th Conference on Decision and Control CDC ARIA Resort & Casino December 12-14, 2016, Las Vegas, USA Optimal Distributed Scheduling of Real-Time Traffic with Hard Deadlines Ning Lu, Bin Li,
More informationTransport Capacity and Spectral Efficiency of Large Wireless CDMA Ad Hoc Networks
Transport Capacity and Spectral Efficiency of Large Wireless CDMA Ad Hoc Networks Yi Sun Department of Electrical Engineering The City College of City University of New York Acknowledgement: supported
More informationColor of Interference and Joint Encoding and Medium Access in Large Wireless Networks
Color of Interference and Joint Encoding and Medium Access in Large Wireless Networks Nithin Sugavanam, C. Emre Koksal, Atilla Eryilmaz Department of Electrical and Computer Engineering The Ohio State
More informationOptimal Distributed Scheduling under Time-varying Conditions: A Fast-CSMA Algorithm with Applications
1 Optimal Distributed Scheduling under Time-varying Conditions: A Fast-CSMA Algorithm with Applications Bin Li and Atilla Eryilmaz Abstract Recently, low-complexity and distributed Carrier Sense Multiple
More informationECE 333: Introduction to Communication Networks Fall Lecture 15: Medium Access Control III
ECE 333: Introduction to Communication Networks Fall 200 Lecture 5: Medium Access Control III CSMA CSMA/CD Carrier Sense Multiple Access (CSMA) In studying Aloha, we assumed that a node simply transmitted
More information3644 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 6, JUNE 2011
3644 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 6, JUNE 2011 Asynchronous CSMA Policies in Multihop Wireless Networks With Primary Interference Constraints Peter Marbach, Member, IEEE, Atilla
More informationSimple, Optimal, Fast, and Robust Wireless Random Medium Access Control
Simple, Optimal, Fast, and Robust Wireless Random Medium Access Control Jianwei Huang Department of Information Engineering The Chinese University of Hong Kong KAIST-CUHK Workshop July 2009 J. Huang (CUHK)
More informationCSMA-Based Distributed Scheduling in Multi-hop MIMO Networks under SINR Model
CSMA-Based Distributed Scheduling in Multi-hop MIMO Networks under SINR Model Dajun Qian, Dong Zheng, Junshan Zhang and Ness Shroff Department of Electrical Engineering, Arizona State University, Tempe,
More informationLongest-queue-first scheduling under SINR interference model
Longest-queue-first scheduling under SINR interference model The MIT Faculty has made this article openly available Please share how this access benefits you Your story matters Citation Long Bao Le, Eytan
More informationDistributed Game Theoretic Optimization Of Frequency Selective Interference Channels: A Cross Layer Approach
2010 IEEE 26-th Convention of Electrical and Electronics Engineers in Israel Distributed Game Theoretic Optimization Of Frequency Selective Interference Channels: A Cross Layer Approach Amir Leshem and
More informationEstimating the Transmission Probability in Wireless Networks with Configuration Models
Estimating the Transmission Probability in Wireless Networks with Configuration Models Paola Bermolen niversidad de la República - ruguay Joint work with: Matthieu Jonckheere (BA), Federico Larroca (delar)
More information6.1 Multiple Access Communications
Chap 6 Medium Access Control Protocols and Local Area Networks Broadcast Networks: a single transmission medium is shared by many users. ( Multiple access networks) User transmissions interfering or colliding
More informationFairness and Delay in Heterogeneous Half- and Full-Duplex Wireless Networks
Fairness and Delay in Heterogeneous Half- and Full-Duplex Wireless Networks Tingjun Chen, Jelena Diakonikolas, Javad Ghaderi, Gil Zussman Department of Electrical Engineering, Columbia University, New
More informationJoint Scheduling and Fast Cell Selection in OFDMA Wireless Networks
1 Joint Scheduling and Fast Cell Selection in OFDMA Wireless Networks Reuven Cohen Guy Grebla Department of Computer Science Technion Israel Institute of Technology Haifa 32000, Israel Abstract In modern
More informationPerformance of ALOHA and CSMA in Spatially Distributed Wireless Networks
Performance of ALOHA and CSMA in Spatially Distributed Wireless Networks Mariam Kaynia and Nihar Jindal Dept. of Electrical and Computer Engineering, University of Minnesota Dept. of Electronics and Telecommunications,
More informationIEEE/ACM TRANSACTIONS ON NETWORKING, VOL. XX, NO. X, AUGUST 20XX 1
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. XX, NO. X, AUGUST 0XX 1 Greenput: a Power-saving Algorithm That Achieves Maximum Throughput in Wireless Networks Cheng-Shang Chang, Fellow, IEEE, Duan-Shin Lee,
More informationEasyChair Preprint. A User-Centric Cluster Resource Allocation Scheme for Ultra-Dense Network
EasyChair Preprint 78 A User-Centric Cluster Resource Allocation Scheme for Ultra-Dense Network Yuzhou Liu and Wuwen Lai EasyChair preprints are intended for rapid dissemination of research results and
More informationMultiple MAC Protocols Selection Strategies. Presented by Chen-Hsiang Feng
Multiple MAC Protocols Selection Strategies Presented by Chen-Hsiang Feng Outline Motivation and Goal Simulation Environment MAC Selection Strategies Conclusions Motivation Today's devices have multiple
More informationUtilization-Aware Adaptive Back-Pressure Traffic Signal Control
Utilization-Aware Adaptive Back-Pressure Traffic Signal Control Wanli Chang, Samarjit Chakraborty and Anuradha Annaswamy Abstract Back-pressure control of traffic signal, which computes the control phase
More informationOptimizing Client Association in 60 GHz Wireless Access Networks
Optimizing Client Association in 60 GHz Wireless Access Networks G Athanasiou, C Weeraddana, C Fischione, and L Tassiulas KTH Royal Institute of Technology, Stockholm, Sweden University of Thessaly, Volos,
More informationModeling load balancing in carrier aggregation mobile networks
Modeling load balancing in carrier aggregation mobile networks R-M. Indre Joint work with F. Bénézit, S. E. El Ayoubi, A. Simonian IDEFIX Plenary Meeting, May 23 rd 2014, Avignon What is carrier aggregation?
More informationLocal Area Networks NETW 901
Local Area Networks NETW 901 Lecture 2 Medium Access Control (MAC) Schemes Course Instructor: Dr. Ing. Maggie Mashaly maggie.ezzat@guc.edu.eg C3.220 1 Contents Why Multiple Access Random Access Aloha Slotted
More informationMathematical Problems in Networked Embedded Systems
Mathematical Problems in Networked Embedded Systems Miklós Maróti Institute for Software Integrated Systems Vanderbilt University Outline Acoustic ranging TDMA in globally asynchronous locally synchronous
More informationThroughput-optimal number of relays in delaybounded multi-hop ALOHA networks
Page 1 of 10 Throughput-optimal number of relays in delaybounded multi-hop ALOHA networks. Nekoui and H. Pishro-Nik This letter addresses the throughput of an ALOHA-based Poisson-distributed multihop wireless
More informationMedium Access Control via Nearest-Neighbor Interactions for Regular Wireless Networks
Medium Access Control via Nearest-Neighbor Interactions for Regular Wireless Networks Ka Hung Hui, Dongning Guo and Randall A. Berry Department of Electrical Engineering and Computer Science Northwestern
More informationConcurrent Channel Probing and Data Transmission in Full-duplex MIMO Systems
1 Concurrent Channel Probing and Data Transmission in Full-duplex MIMO Systems Zhenzhi Qian, Fei Wu, Zizhan Zheng, Kannan Srinivasan, and Ness B. Shroff arxiv:1705.08000v2 [cs.ni] 30 May 2017 Abstract
More informationLTE in Unlicensed Spectrum
LTE in Unlicensed Spectrum Prof. Geoffrey Ye Li School of ECE, Georgia Tech. Email: liye@ece.gatech.edu Website: http://users.ece.gatech.edu/liye/ Contributors: Q.-M. Chen, G.-D. Yu, and A. Maaref Outline
More informationScaling Laws for Cognitive Radio Network with Heterogeneous Mobile Secondary Users
Scaling Laws for Cognitive Radio Network with Heterogeneous Mobile Secondary Users Y.Li, X.Wang, X.Tian and X.Liu Shanghai Jiaotong University Scaling Laws for Cognitive Radio Network with Heterogeneous
More informationp-percent Coverage in Wireless Sensor Networks
p-percent Coverage in Wireless Sensor Networks Yiwei Wu, Chunyu Ai, Shan Gao and Yingshu Li Department of Computer Science Georgia State University October 28, 2008 1 Introduction 2 p-percent Coverage
More informationarxiv: v1 [cs.it] 21 Feb 2015
1 Opportunistic Cooperative Channel Access in Distributed Wireless Networks with Decode-and-Forward Relays Zhou Zhang, Shuai Zhou, and Hai Jiang arxiv:1502.06085v1 [cs.it] 21 Feb 2015 Dept. of Electrical
More informationOpportunistic Scheduling: Generalizations to. Include Multiple Constraints, Multiple Interfaces,
Opportunistic Scheduling: Generalizations to Include Multiple Constraints, Multiple Interfaces, and Short Term Fairness Sunil Suresh Kulkarni, Catherine Rosenberg School of Electrical and Computer Engineering
More informationTransmission Scheduling in Capture-Based Wireless Networks
ransmission Scheduling in Capture-Based Wireless Networks Gam D. Nguyen and Sastry Kompella Information echnology Division, Naval Research Laboratory, Washington DC 375 Jeffrey E. Wieselthier Wieselthier
More informationHedonic Coalition Formation for Distributed Task Allocation among Wireless Agents
Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents Walid Saad, Zhu Han, Tamer Basar, Me rouane Debbah, and Are Hjørungnes. IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 10,
More informationOnline Channel Assignment, Transmission Scheduling, and Transmission Mode Selection in Multi-channel Full-duplex Wireless LANs
Online Channel Assignment, ransmission Scheduling, and ransmission Mode Selection in Multi-channel Full-duplex Wireless LANs Zhefeng Jiang and Shiwen Mao Department of Electrical and Computer Engineering
More informationDOPPLER SHIFT. Thus, the frequency of the received signal is
DOPPLER SHIFT Radio Propagation Doppler Effect: When a wave source and a receiver are moving towards each other, the frequency of the received signal will not be the same as the source. When they are moving
More informationStability Analysis for Network Coded Multicast Cell with Opportunistic Relay
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 00 proceedings Stability Analysis for Network Coded Multicast
More informationMultiuser Scheduling and Power Sharing for CDMA Packet Data Systems
Multiuser Scheduling and Power Sharing for CDMA Packet Data Systems Sandeep Vangipuram NVIDIA Graphics Pvt. Ltd. No. 10, M.G. Road, Bangalore 560001. sandeep84@gmail.com Srikrishna Bhashyam Department
More informationPower Controlled Random Access
1 Power Controlled Random Access Aditya Dua Department of Electrical Engineering Stanford University Stanford, CA 94305 dua@stanford.edu Abstract The lack of an established infrastructure, and the vagaries
More informationOptimal Scheduling Policy Determination for High Speed Downlink Packet Access
Optimal Scheduling Policy Determination for High Speed Downlink Packet Access Hussein Al-Zubaidy, Jerome Talim, Ioannis Lambadaris SCE-Carleton University 2 Colonel By Drive, Ottawa, ON, KS B6 Canada Email:
More informationMaximizing Broadcast Throughput Under Ultra-Low-Power Constraints
Maximizing Broadcast Throughput Under Ultra-Low-Power Constraints Tingjun Chen, Javad Ghaderi, Dan Rubenstein, and Gil Zussman arxiv:60.04203v2 [cs.ni] 26 Apr 207 Abstract Wireless object tracking applications
More informationTSIN01 Information Networks Lecture 9
TSIN01 Information Networks Lecture 9 Danyo Danev Division of Communication Systems Department of Electrical Engineering Linköping University, Sweden September 26 th, 2017 Danyo Danev TSIN01 Information
More informationOptimal Utility-Based Resource Allocation for OFDM Networks with Multiple Types of Traffic
Optimal Utility-Based Resource Allocation for OFDM Networks with Multiple Types of Traffic Mohammad Katoozian, Keivan Navaie Electrical and Computer Engineering Department Tarbiat Modares University, Tehran,
More informationCompetitive Distributed Spectrum Access in QoS-Constrained Cognitive Radio Networks
Competitive Distributed Spectrum Access in QoS-Constrained Cognitive Radio Networks Ziqiang Feng, Ian Wassell Computer Laboratory University of Cambridge, UK Email: {zf232, ijw24}@cam.ac.uk Abstract Dynamic
More informationWireless communications: from simple stochastic geometry models to practice III Capacity
Wireless communications: from simple stochastic geometry models to practice III Capacity B. Błaszczyszyn Inria/ENS Workshop on Probabilistic Methods in Telecommunication WIAS Berlin, November 14 16, 2016
More informationMaximizing Networking Capacity in Multi-Channel Multi-Radio Wireless Networks
Wan P, Wan ZG. Maximizing networking capacity in multi-channel multi-radio wireless networks. JOURNAL OF COM- PUTER SCIENCE AND TECHNOLOGY 29(5): 901 909 Sept. 2014. DOI 10.1007/s11390-014-1477-y Maximizing
More informationMaximizing Throughput in Wireless Multi-Access Channel Networks
Maximizing Throughput in Wireless Multi-Access Channel Networks J. Crichigno,,M.Y.Wu, S. K. Jayaweera,W.Shu Department of Engineering, Northern New Mexico C., Espanola - NM, USA Electrical & Computer Engineering
More informationA Unified View on the Interplay of Scheduling and MIMO Technologies in Wireless Systems
A Unified View on the Interplay of Scheduling and MIMO Technologies in Wireless Systems Li-Chun Wang and Chiung-Jang Chen National Chiao Tung University, Taiwan 03/08/2004 1 Outline MIMO antenna systems
More informationThroughput-optimal Scheduling in Multichannel Access Point. Networks under Infrequent Channel Measurements
Throughput-optimal Scheduling in Multichannel Access Point Networks under Infrequent Channel Measurements 1 Koushik Kar, Xiang Luo and Saswati Sarkar Abstract We consider the problem of uplink/downlink
More informationPerformance Limits of Fair-Access in Sensor Networks with Linear and Selected Grid Topologies John Gibson * Geoffrey G.
In proceedings of GLOBECOM Ad Hoc and Sensor Networking Symposium, Washington DC, November 7 Performance Limits of Fair-Access in Sensor Networks with Linear and Selected Grid Topologies John Gibson *
More informationMulticasting over Multiple-Access Networks
ing oding apacity onclusions ing Department of Electrical Engineering and omputer Sciences University of alifornia, Berkeley May 9, 2006 EE 228A Outline ing oding apacity onclusions 1 2 3 4 oding 5 apacity
More informationITLinQ: A New Approach for Spectrum Sharing in Device-to-Device Networks
ITLinQ: A New Approach for Spectrum Sharing in Device-to-Device Networks Salman Avestimehr In collaboration with Navid Naderializadeh ITA 2/10/14 D2D Communication Device-to-Device (D2D) communication
More informationAn Antithetic Coupling Approach to Multi-Chain based CSMA Scheduling Algorithms
An Antithetic Coupling Approach to Multi-Chain based CSMA Scheduling Algorithms Jaewook Kwak Do Young Eun Abstract In recent years, a suite of Glauber dynamics-based CSMA algorithms have attracted great
More informationSaturation Throughput Analysis for a Wireless Network with Multiple Channels
Saturation Throughput Analysis for a Wireless Network with Multiple Channels Wiktor Pronobis T-Labs Berlin TU-Berlin A thesis submitted for the degree of Bachelor of Science (B.Sc.) 05.03.2011 ii Contents
More informationInterference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks
Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks Yu Wang Weizhao Wang Xiang-Yang Li Wen-Zhan Song Abstract We study efficient interference-aware joint routing and
More informationInterference-Aware Receivers for LTE SU-MIMO in OAI
Interference-Aware Receivers for LTE SU-MIMO in OAI Elena Lukashova, Florian Kaltenberger, Raymond Knopp Communication Systems Dep., EURECOM April, 2017 1 / 26 MIMO in OAI OAI has been used intensively
More informationStability Regions of Two-Way Relaying with Network Coding
Stability Regions of Two-Way Relaying with Network Coding (Invited Paper) Ertugrul Necdet Ciftcioglu Department of Electrical Engineering The Pennsylvania State University University Park, PA 680 enc8@psu.edu
More informationFramework for Performance Analysis of Channel-aware Wireless Schedulers
Framework for Performance Analysis of Channel-aware Wireless Schedulers Raphael Rom and Hwee Pink Tan Department of Electrical Engineering Technion, Israel Institute of Technology Technion City, Haifa
More informationEnergy Conservation of Mobile Terminals in Multi-cell TDMA Networks
20 Energy Conservation of Mobile Terminals in Multi-cell TDMA Networks Liqun Fu The Chinese University of Hong Kong, Hong Kong,China Hongseok Kim Sogang University, Seoul, Korea Jianwei Huang The Chinese
More informationChapter 12. Cross-Layer Optimization for Multi- Hop Cognitive Radio Networks
Chapter 12 Cross-Layer Optimization for Multi- Hop Cognitive Radio Networks 1 Outline CR network (CRN) properties Mathematical models at multiple layers Case study 2 Traditional Radio vs CR Traditional
More informationDistributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks
The Institute for Systems Research ISR Technical Report 2009-2 Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks Bo Han, V.S. Anil Kumar, Madhav Marathe, Srinivasan
More informationInter-Cell Interference Coordination in Wireless Networks
Inter-Cell Interference Coordination in Wireless Networks PhD Defense, IRISA, Rennes, 2015 Mohamad Yassin University of Rennes 1, IRISA, France Saint Joseph University of Beirut, ESIB, Lebanon Institut
More informationCOMP Online Algorithms. Paging and k-server Problem. Shahin Kamali. Lecture 11 - Oct. 11, 2018 University of Manitoba
COMP 7720 - Online Algorithms Paging and k-server Problem Shahin Kamali Lecture 11 - Oct. 11, 2018 University of Manitoba COMP 7720 - Online Algorithms Paging and k-server Problem 1 / 19 Review & Plan
More informationOptimal Transmission Scheduling with Base Station Antenna Array in Cellular Networks
Optimal Transmission Scheduling with Base Station Antenna Array in Cellular Networks Tianmin Ren, Richard J La and Leandros Tassiulas Department of Electrical & Computer Engineering and Institute for Systems
More informationExploiting Peer-to-Peer State Exchange for Distributed Medium Access Control
Exploiting Peer-to-Peer State Exchange for Distributed Medium Access Control Ka Hung Hui, Tianyi Li, Dongning Guo and Randall A. Berry Department of Electrical Engineering and Computer Science Northwestern
More informationEfficient LTE/WiFi coexistence in unlicensed spectrum using virtual network entity: Optimization and performance analysis
Loughborough University Institutional Repository Efficient LTE/WiFi coexistence in unlicensed spectrum using virtual network entity: Optimization and performance analysis This item was submitted to Loughborough
More informationConvergence in competitive games
Convergence in competitive games Vahab S. Mirrokni Computer Science and AI Lab. (CSAIL) and Math. Dept., MIT. This talk is based on joint works with A. Vetta and with A. Sidiropoulos, A. Vetta DIMACS Bounded
More informationJoint Scheduling and Power Control for Wireless Ad-hoc Networks
Joint Scheduling and Power Control for Wireless Ad-hoc Networks Tamer ElBatt Network Analysis and Systems Dept. HRL Laboratories, LLC Malibu, CA 90265, USA telbatt@wins.hrl.com Anthony Ephremides Electrical
More informationDownlink Scheduler Optimization in High-Speed Downlink Packet Access Networks
Downlink Scheduler Optimization in High-Speed Downlink Packet Access Networks Hussein Al-Zubaidy SCE-Carleton University 1125 Colonel By Drive, Ottawa, ON, Canada Email: hussein@sce.carleton.ca 21 August
More informationCoding for Super Dense Networks 1. JAIST SAST 2015 Nomi, November 2015
Coding for Super Dense Networks 1 Mohammad Nur Hasan and Khoirul Anwar School of Information Science, Japan Advanced Institute of Science and Technology (JAIST) Email : {hasan-mn, anwar-k}@jaist.ac.jp
More informationTRANSMISSION STRATEGIES FOR SINGLE-DESTINATION WIRELESS NETWORKS
The 20 Military Communications Conference - Track - Waveforms and Signal Processing TRANSMISSION STRATEGIES FOR SINGLE-DESTINATION WIRELESS NETWORKS Gam D. Nguyen, Jeffrey E. Wieselthier 2, Sastry Kompella,
More informationCooperative Broadcast for Maximum Network Lifetime. Ivana Maric and Roy Yates
Cooperative Broadcast for Maximum Network Lifetime Ivana Maric and Roy Yates Wireless Multihop Network Broadcast N nodes Source transmits at rate R Messages are to be delivered to all the nodes Nodes can
More informationOptimal Clock Synchronization in Networks. Christoph Lenzen Philipp Sommer Roger Wattenhofer
Optimal Clock Synchronization in Networks Christoph Lenzen Philipp Sommer Roger Wattenhofer Time in Sensor Networks Synchronized clocks are essential for many applications: Sensing TDMA Localization Duty-
More informationAnomalies in Optimal Rate-control and Scheduling Protocols for Cognitive Radio Networks
Anomalies in Optimal Rate-control and Scheduling Protocols for Cognitive Radio Networks Vinay Kolar 1 V. Munishwar 2 N. Abu-Ghazaleh 1,2 1 Department of Computer Science Carnegie Mellon University, Qatar
More informationCognitive Relaying and Opportunistic Spectrum Sensing in Unlicensed Multiple Access Channels
Cognitive Relaying and Opportunistic Spectrum Sensing in Unlicensed Multiple Access Channels Jonathan Gambini 1, Osvaldo Simeone 2 and Umberto Spagnolini 1 1 DEI, Politecnico di Milano, Milan, I-20133
More informationPrioritized Wireless Transmissions Using Random Linear Codes
Prioritized Wireless Transmissions Using Random Linear Codes Tuan Tran and Thinh Nguyen School of EECS, Oregon State University Corvallis, OR 97331, USA trantu, thinhq}@eecs.oregonstate.edu Abstract We
More informationHow user throughput depends on the traffic demand in large cellular networks
How user throughput depends on the traffic demand in large cellular networks B. Błaszczyszyn Inria/ENS based on a joint work with M. Jovanovic and M. K. Karray (Orange Labs, Paris) 1st Symposium on Spatial
More informationWireless Multicasting with Channel Uncertainty
Wireless Multicasting with Channel Uncertainty Jie Luo ECE Dept., Colorado State Univ. Fort Collins, Colorado 80523 e-mail: rockey@eng.colostate.edu Anthony Ephremides ECE Dept., Univ. of Maryland College
More informationSergio Verdu. Yingda Chen. April 12, 2005
and Regime and Recent Results on the Capacity of Wideband Channels in the Low-Power Regime Sergio Verdu April 12, 2005 1 2 3 4 5 6 Outline Conventional information-theoretic study of wideband communication
More informationLecture on Sensor Networks
Lecture on Sensor Networks Copyright (c) 2008 Dr. Thomas Haenselmann (University of Mannheim, Germany). Permission is granted to copy, distribute and/or modify this document under the terms of the GNU
More informationCognitive Wireless Network : Computer Networking. Overview. Cognitive Wireless Networks
Cognitive Wireless Network 15-744: Computer Networking L-19 Cognitive Wireless Networks Optimize wireless networks based context information Assigned reading White spaces Online Estimation of Interference
More informationTHE problem of multiple access to a shared communication
IEEE TANSACTIONS ON WIELESS COMMUNICATIONS, VOL. 7, NO. 3, MACH 28 95 Cross Layer Design for Multiaccess Communication Over ayleigh Fading Channels Vidyut Naware, Student Member, IEEE, and Lang Tong, Fellow,
More informationOutline. EEC-484/584 Computer Networks. Homework #1. Homework #1. Lecture 8. Wenbing Zhao Homework #1 Review
EEC-484/584 Computer Networks Lecture 8 wenbing@ieee.org (Lecture nodes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline Homework #1 Review Protocol verification Example
More informationJamming Games for Power Controlled Medium Access with Dynamic Traffic
Jamming Games for Power Controlled Medium Access with Dynamic Traffic Yalin Evren Sagduyu Intelligent Automation Inc. Rockville, MD 855, USA, and Institute for Systems Research University of Maryland College
More informationJinbao Li, Desheng Zhang, Longjiang Guo, Shouling Ji, Yingshu Li. Heilongjiang University Georgia State University
Jinbao Li, Desheng Zhang, Longjiang Guo, Shouling Ji, Yingshu Li Heilongjiang University Georgia State University Outline Introduction Protocols Design Theoretical Analysis Performance Evaluation Conclusions
More informationThe Optimal Packet Duration of ALOHA and CSMA in Ad Hoc Wireless Networks
The Optimal Packet Duration of ALOHA and CSMA in Ad Hoc Wireless Networks Jon Even Corneliussen Master of Science in Electronics Submission date: June 2009 Supervisor: Geir Egil Øien, IET Co-supervisor:
More informationSecondary Transmission Profile for a Single-band Cognitive Interference Channel
Secondary Transmission rofile for a Single-band Cognitive Interference Channel Debashis Dash and Ashutosh Sabharwal Department of Electrical and Computer Engineering, Rice University Email:{ddash,ashu}@rice.edu
More informationFPGA-BASED DESIGN AND IMPLEMENTATION OF THREE-PRIORITY PERSISTENT CSMA PROTOCOL
U.P.B. Sci. Bull., Series C, Vol. 79, Iss. 4, 2017 ISSN 2286-3540 FPGA-BASED DESIGN AND IMPLEMENTATION OF THREE-PRIORITY PERSISTENT CSMA PROTOCOL Xu ZHI 1, Ding HONGWEI 2, Liu LONGJUN 3, Bao LIYONG 4,
More informationLattice Throughput Optimal Scheduling: Learning Contention Patterns and Adapting to Load/Topology
Lattice Throughput Optimal Scheduling: Learning Contention Patterns and Adapting to Load/Topology Yung Yi, Gustavo de Veciana, and Sanjay Shakkottai Abstract Aggregate traffic loads and topology in multi-hop
More informationHow (Information Theoretically) Optimal Are Distributed Decisions?
How (Information Theoretically) Optimal Are Distributed Decisions? Vaneet Aggarwal Department of Electrical Engineering, Princeton University, Princeton, NJ 08544. vaggarwa@princeton.edu Salman Avestimehr
More informationT. Yoo, E. Setton, X. Zhu, Pr. Goldsmith and Pr. Girod Department of Electrical Engineering Stanford University
Cross-layer design for video streaming over wireless ad hoc networks T. Yoo, E. Setton, X. Zhu, Pr. Goldsmith and Pr. Girod Department of Electrical Engineering Stanford University Outline Cross-layer
More informationMESSAGE BROADCASTING IN WIRELESS VEHICULAR AD HOC NETWORKS
MESSAGE BROADCASTING IN WIRELESS VEHICULAR AD HOC NETWORKS CARLA F. CHIASSERINI, ROSSANO GAETA, MICHELE GARETTO, MARCO GRIBAUDO, AND MATTEO SERENO Abstract. Message broadcasting is one of the fundamental
More informationBase Station Association Game in Multi-cell Wireless Networks
Base Station Association Game in Multi-cell Wireless Networs Libin Jiang, Shyam Pareh, Jean Walrand Dept. Electrical Engineering & Computer Science, University of California, Bereley Bell Laboratories,
More informationGeometric Analysis of Distributed Power Control and Möbius MAC Design
WIRELESS COMMUNICATIONS AND MOBILE COMPUTING Wirel. Commun. Mob. Comput. 21; :1 29 RESEARCH ARTICLE Geometric Analysis of Distributed Power Control and Möbius MAC Design Zhen Tong 1 and Martin Haenggi
More information