O ptimal routingpower allocation full-duplex o ptimal routing and power allocation for wireless networks with imperfect full-duplex nodes David Ramírez.

Slides:

Advertisements

Similar presentations

Impact of Interference on Multi-hop Wireless Network Performance

Advertisements

Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 12 Cross-Layer.

Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.

Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.

1 EP2210 Fairness Lecture material: –Bertsekas, Gallager, Data networks, 6.5 –L. Massoulie, J. Roberts, "Bandwidth sharing: objectives and algorithms,“

QoS in ad hoc nets: distributed fair scheduling SCOPE: Self-coordinating Localized FQ H. Luo et al “A Self-Coordinating Approach to Distributed FairQueueing.

Min Song 1, Yanxiao Zhao 1, Jun Wang 1, E. K. Park 2 1 Old Dominion University, USA 2 University of Missouri at Kansas City, USA IEEE ICC 2009 A High Throughput.

Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.

Xiaohua Li and Jeong Kyun Lee Department of Electrical and Computer Engineering State University of New York at Binghamton

Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.

William Stallings Data and Computer Communications 7 th Edition Chapter 12 Routing.

Tradeoffs between performance guarantee and complexity for distributed scheduling in wireless networks Saswati Sarkar University of Pennsylvania Communication.

Center for Wireless COMMUNICATIONS 5/24/2015 Energy Efficient Networking Ramesh R. Rao University of California, San Diego - NeXtworking’03 - Chania, Crete,

1 ENERGY: THE ROOT OF ALL PERVASIVENESS Anthony Ephremides University of Maryland April 29, 2004.

Distributed Algorithms for Secure Multipath Routing

The Capacity of Wireless Ad Hoc Networks

1 Enhancing Cellular Multicast Performance Using Ad Hoc Networks Jun Cheol Park Sneha Kumar Kasera School of.

FUNDAMENTAL CROSS-LAYER APPROACH TO WIRELESS NETWORKS Prof. Edmund Yeh Jian Cao Yufang Xi Nov. 18, 2003.

Jerry Chou and Bill Lin University of California, San Diego

Introduction to Cognitive radios Part two HY 539 Presented by: George Fortetsanakis.

CS541 Advanced Networking 1 Cognitive Radio Networks Neil Tang 1/28/2009.

EE360: Lecture 7 Outline Adaptive CDMA Techniques Introduction CDMA with power control Adaptive techniques for interference reduction Rate and power adaptation.

Lecture 11. Matching A set of edges which do not share a vertex is a matching. Application: Wireless Networks may consist of nodes with single radios,

CS541 Advanced Networking 1 Routing and Shortest Path Algorithms Neil Tang 2/18/2009.

Submission doc.: IEEE /0838r0 July 2014 Woojin Ahn, Yonsei Univ. Slide 1 Discussion on dual-link STR in IEEE ax Date: Authors:

Mobility Increases The Capacity of Ad-hoc Wireless Networks By Grossglauser and Tse Gautam Pohare Heli Mehta Computer Science University of Southern California.

On Channel-Discontinuity-Constraint Routing in Multi-Channel Wireless Infrastructure Networks Abishek Gopalan, Swaminathan Sankararaman 1.

The Shortest Path Problem

High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks Dr. Baruch Awerbuch, David Holmer, and Herbert Rubens Johns Hopkins University Department.

UCSC 1 Aman ShaikhICNP 2003 An Efficient Algorithm for OSPF Subnet Aggregation ICNP 2003 Aman Shaikh Dongmei Wang, Guangzhi Li, Jennifer Yates, Charles.

Profile-Based Topology Control and Routing of Bandwidth-Guaranteed Flows in Wireless Optical Backbone Networks A. Kashyap, M.K. Khandani, K. Lee, M. Shayman.

EE 685 presentation Distributed Cross-layer Algorithms for the Optimal Control of Multi-hop Wireless Networks By Atilla Eryılmaz, Asuman Özdağlar, Devavrat.

1 11 Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks Gautam Kulkarni, Sachin Adlakha, Mani Srivastava UCLA IEEE Transactions.

1 Yue Qiao Computer Science and Engineering Sep AirExpress: Enabling Seamless In-band.

*P. C. Weeraddana **M. Codreanu, **M. Latva-Aho, ***A. Ephremides * KTH, Royal institute of Technology, Stockholm, Sweden ** CWC, University of Oulu, Finland.

June 21, 2007 Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta.

1 Power control under best response dynamics for interference mitigation in a two-tier femtocell network Vaggelis G. Douros Stavros.

The Case for Addressing the Limiting Impact of Interference on Wireless Scheduling Xin Che, Xi Ju, Hongwei Zhang {chexin, xiju,

Mazumdar Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN N ETWORKING 1 Non-convex.

1 Network Coding and its Applications in Communication Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.

Joint Scheduling and Power Control for Wireless Ad Hoc Networks Advisor: 王瑞騰 Student: 黃軍翰.

OPTIMUM INTEGRATED LINK SCHEDULING AND POWER CONTROL FOR MULTI-HOP WIRELESS NETWORKS Arash Behzad, and Izhak Rubin, IEEE Transactions on Vehicular Technology,

SIMPLE: Stable Increased Throughput Multi-hop Link Efficient Protocol For WBANs Qaisar Nadeem Department of Electrical Engineering Comsats Institute of.

Providing End-to-End Delay Guarantees for Multi-hop Wireless Sensor Networks I-Hong Hou.

A Power Assignment Method for Multi-Sink WSN with Outage Probability Constraints Marcelo E. Pellenz*, Edgard Jamhour*, Manoel C. Penna*, Richard D. Souza.

Multiuser Receiver Aware Multicast in CDMA-based Multihop Wireless Ad-hoc Networks Parmesh Ramanathan Department of ECE University of Wisconsin-Madison.

MAIN RESULT: Depending on path loss and the scaling of area relative to number of nodes, a novel hybrid scheme is required to achieve capacity, where multihop.

CS223 Advanced Data Structures and Algorithms 1 Maximum Flow Neil Tang 3/30/2010.

Mayank Jain, Jung Il Choi Tae Min Kim, Dinesh Bharadia, Siddharth Seth, Kannan Srinivasan, Philip Levis, Sachin Katti, Prasn Sinha MobiCom 2011.

Fast and Reliable Route Discovery Protocol Considering Mobility in Multihop Cellular Networks Hyun-Ho Choi and Dong-Ho Cho Wireless Pervasive Computing,

1 Post Lunch Session Cooperative Strategies and Optimal Scheduling for Tree Networks Alexandre de Baynast †, Omer Gurewitz ‡, Edward W. Knightly ‡ † RWTH.

1 Chapter 6 Reformulation-Linearization Technique and Applications.

1 Chapter 5 Branch-and-bound Framework and Its Applications.

Designing Multi-hop Wireless Backhaul Networks with Delay Guarantees Girija Narlikar, Gordon Wilfong, and Lisa Zhang Bell Lab. Infocom 2006.

-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.

Impact of Interference on Multi-hop Wireless Network Performance

Abdul Kader Kabbani (Stanford University)

Roots and Zeros 5.7.

Managing the performance of multiple radio Multihop ESS Mesh Networks.

Mod. 3 Day 4 Graphs of Functions.

Full Duplex Benefits and Challenges

The Fundamental Theorem of Algebra

Dejun Yang (Arizona State University)

Distributed Channel Assignment in Multi-Radio Mesh Networks

Totally Disjoint Multipath Routing in Multihop Wireless Networks Sonia Waharte and Raoef Boutaba Presented by: Anthony Calce.

Problem Solving 4.

Achieving Single Channel, Full Duplex Wireless Communication

Maximum Flow Neil Tang 4/8/2008

Full Duplex Benefits and Challenges

Power Efficient Communication ----Joint Routing, Scheduling and Power Control Design Presenter: Rui Cao.

Presentation transcript:

o ptimal routingpower allocation full-duplex o ptimal routing and power allocation for wireless networks with imperfect full-duplex nodes David Ramírez D. Behnaam Aazhang Rice University 12 June 2013 ICC / 12 June 2013

Resource Allocation Challenge Wireless full-duplex network Self-interference Single source-destination pair Inter-node interference To maximize the minimum rate, What power allocation? Which nodes should relay? ICC / 12 June 2013 S D X. Fang, D. Yang, and G. Xue, “Distributed algorithms for multipath routing in full-duplex wireless networks,“ C. Weeraddana, M. Codreanu, M. Latva-aho, and A. Ephremides, “Resource allocation for cross-layer utility maximization in multi-hop wireless networks in the presence of self interference"

Our Approach Simplified Interference Model Focus on full-duplex Solve power allocation for fixed route Modify Dijkstra’s Algorithm to find optimal solution ICC / 12 June 2013

Interference Model Achievable rate as function of SINR ▫ Simplified Interference Model ▫ focus on full-duplex Imperfect self-interference cancellation ▫ One hop interference ▫ hop defined by route ICC / 12 June D2 S1D2 S M. Duarte and A. Sabharwal, “Full-duplex wireless communications using off-the-shelf radios: Feasibility and first results“ M. Jain, J. I. Choi, et. Al., “Practical, real-time, full duplex wireless”

Optimal Solution to Power Allocation Equal rates for all nodes in route At least one node at maximum transmit power Optimal power at each node ▫ polynomial equation ▫ parameter is SINR ▫ degree equal to number of hops from D ICC / 12 June 2013 S1D2

Example Link to D ▫ No interference Link to 2 ▫ Self-interference Link to 1 ▫ Self-interference and one hop interference ICC / 12 June 2013 S1D2

Example ICC / 12 June minimum (maximum (real (root ) ) )

Optimal Route and Power Allocation Modify Dijkstra’s Algorithm for max min rate ▫ rates as edge weights Non decomposable objective function ▫ monotonic decreasing Trade off between hop length and SINR ICC / 12 June 2013 S c D f b e a

without interference ▫ previous decisions affected by current decision Effect of Interference with interference S 1 D 3 S 1 D 3 ICC / 12 June 2013

Results - Throughput ICC / 12 June 2013

Results – Optimal Route Length ICC / 12 June 2013

Results – Simplified vs. Full model ICC / 12 June 2013

Summary and Future Work Summary ▫ simplified interference model ▫ power allocation similar to polynomial root finding ▫ algorithm for routing and power allocation Future Work ▫ difference from optimal full interference solution ▫ multiple source-destination pairs ICC / 12 June 2013