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

Slides:



Advertisements
Similar presentations
February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
Advertisements

The Capacity of Wireless Networks Danss Course, Sunday, 23/11/03.
Impact of Interference on Multi-hop Wireless Network Performance Kamal Jain, Jitu Padhye, Venkat Padmanabhan and Lili Qiu Microsoft Research Redmond.
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
Minimum Clique Partition Problem with Constrained Weight for Interval Graphs Jianping Li Department of Mathematics Yunnan University Jointed by M.X. Chen.
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
TDMA Scheduling in Wireless Sensor Networks
Minimum Energy Mobile Wireless Networks IEEE JSAC 2001/10/18.
Topology Control for Effective Interference Cancellation in Multi-User MIMO Networks E. Gelal, K. Pelechrinis, T.S. Kim, I. Broustis Srikanth V. Krishnamurthy,
Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment Paper By : Ram Ramanathan, Regina Resales-Hain Instructor : Dr Yingshu Li.
1 Crosslayer Design for Distributed MAC and Network Coding in Wireless Ad Hoc Networks Yalin E. Sagduyu Anthony Ephremides University of Maryland at College.
1 Minimum-energy broadcasting in multi-hop wireless networks using a single broadcast tree Department of Computer Science and Information Engineering National.
NCKU CSIE CIAL1 How Optimal are Wireless Scheduling Protocols? Authors: Thomas Moscibroda, Yvonne Anne Oswald and Roger Wattenhofer Publisher: IEEE INFOCOM.
Beneficial Caching in Mobile Ad Hoc Networks Bin Tang, Samir Das, Himanshu Gupta Computer Science Department Stony Brook University.
CS541 Advanced Networking 1 Spectrum Sharing in Cognitive Radio Networks Neil Tang 3/23/2009.
1 On the Performance of Slotted Aloha with Capture Effect in Wireless Networks Arash Behzad and Julan Hsu Professor Mario Gerla CS218 Project UCLA December.
WiOpt’04: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks March 24-26, 2004, University of Cambridge, UK Session 2 : Energy Management.
Job Scheduling Lecture 19: March 19. Job Scheduling: Unrelated Multiple Machines There are n jobs, each job has: a processing time p(i,j) (the time to.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Distributed Combinatorial Optimization
CS Dept, City Univ.1 The Complexity of Connectivity in Wireless Networks Presented by LUO Hongbo.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
A Fair Scheduling for Wireless Mesh Networks Naouel Ben Salem and Jean-Pierre Hubaux Laboratory of Computer Communications and Applications (LCA) EPFL.
1 Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment Infocom /12/20.
Special Topics on Algorithmic Aspects of Wireless Networking Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central.
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
MAXIMIZING SPECTRUM UTILIZATION OF COGNITIVE RADIO NETWORKS USING CHANNEL ALLOCATION AND POWER CONTROL Anh Tuan Hoang and Ying-Chang Liang Vehicular Technology.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
1 Power Control for Distributed MAC Protocols in Wireless Ad Hoc Networks Wei Wang, Vikram Srinivasan, and Kee-Chaing Chua National University of Singapore.
Outline Motivation Objective Optimal Scheduling and Power Control
Efficient Gathering of Correlated Data in Sensor Networks
EE 685 presentation Distributed Cross-layer Algorithms for the Optimal Control of Multi-hop Wireless Networks By Atilla Eryılmaz, Asuman Özdağlar, Devavrat.
POWER CONTROL IN COGNITIVE RADIO SYSTEMS BASED ON SPECTRUM SENSING SIDE INFORMATION Karama Hamdi, Wei Zhang, and Khaled Ben Letaief The Hong Kong University.
Selecting Transmit Powers and Carrier Sense Thresholds in CSMA Jason Fuemmeler, Nitin Vaidya, Venugopal Veeravalli ECE Department & Coordinated Science.
1 11 Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks Gautam Kulkarni, Sachin Adlakha, Mani Srivastava UCLA IEEE Transactions.
Approximating Minimum Bounded Degree Spanning Tree (MBDST) Mohit Singh and Lap Chi Lau “Approximating Minimum Bounded DegreeApproximating Minimum Bounded.
College of Engineering WiFi and WCDMA Network Design Robert Akl, D.Sc. Department of Computer Science and Engineering Robert Akl, D.Sc. Department of Computer.
June 21, 2007 Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta.
Rensselaer Polytechnic Institute Rajagopal Iyengar Combinatorial Approaches to QoS Scheduling in Multichannel Wireless Systems Rajagopal Iyengar Rensselaer.
The Case for Addressing the Limiting Impact of Interference on Wireless Scheduling Xin Che, Xi Ju, Hongwei Zhang {chexin, xiju,
A Game Approach for Multi-Channel Allocation in Multi-Hop Wireless Networks Lin Gao, Xinbing Wang Dept. of Electronic Engineering Shanghai Jiao Tong University.
User Cooperation via Rateless Coding Mahyar Shirvanimoghaddam, Yonghui Li, and Branka Vucetic The University of Sydney, Australia IEEE GLOBECOM 2012 &
AUTONOMOUS DISTRIBUTED POWER CONTROL FOR COGNITIVE RADIO NETWORKS Sooyeol Im; Jeon, H.; Hyuckjae Lee; IEEE Vehicular Technology Conference, VTC 2008-Fall.
TRANSMISSION POWER CONTROL FOR AD HOC WIRELESS NETWORKS: THROUGHPUT, ENERGY AND FAIRNESS Lujun Jia; Xin Liu; Noubir, G.; Rajaraman, R.; Wireless Communications.
EE 685 presentation Utility-Optimal Random-Access Control By Jang-Won Lee, Mung Chiang and A. Robert Calderbank.
Optimization of Wavelength Assignment for QoS Multicast in WDM Networks Xiao-Hua Jia, Ding-Zhu Du, Xiao-Dong Hu, Man-Kei Lee, and Jun Gu, IEEE TRANSACTIONS.
Joint Scheduling and Power Control for Wireless Ad Hoc Networks Advisor: 王瑞騰 Student: 黃軍翰.
111 Downlink Channel Assignment and Power Control for Cognitive Radio Networks Anh Tuan Hoang, Member, IEEE Ying-Chang Liang, Senior Member, IEEE Institute.
1 11 Channel Assignment for Maximum Throughput in Multi-Channel Access Point Networks Xiang Luo, Raj Iyengar and Koushik Kar Rensselaer Polytechnic Institute.
Doc.: IEEE r0 Amin Jafarian, Newracom 1 CCA Revisit May 2015 NameAffiliationsAddressPhone Amin
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
The Scaling Law of SNR-Monitoring in Dynamic Wireless Networks Soung Chang Liew Hongyi YaoXiaohang Li.
Efficient Computing k-Coverage Paths in Multihop Wireless Sensor Networks XuFei Mao, ShaoJie Tang, and Xiang-Yang Li Dept. of Computer Science, Illinois.
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
Fair and Efficient multihop Scheduling Algorithm for IEEE BWA Systems Daehyon Kim and Aura Ganz International Conference on Broadband Networks 2005.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
1 Low Latency Multimedia Broadcast in Multi-Rate Wireless Meshes Chun Tung Chou, Archan Misra Proc. 1st IEEE Workshop on Wireless Mesh Networks (WIMESH),
1 Spectrum Co-existence of IEEE b and a Networks using the CSCC Etiquette Protocol Xiangpeng Jing and Dipankar Raychaudhuri, WINLAB Rutgers.
1 Chapter 6 Reformulation-Linearization Technique and Applications.
1 Chapter 5 Branch-and-bound Framework and Its Applications.
Joint Routing and Scheduling Optimization in Wireless Mesh Networks with Directional Antennas A. Capone, I. Filippini, F. Martignon IEEE international.
Presented by Tae-Seok Kim
Abdul Kader Kabbani (Stanford University)
Throughput-Optimal Broadcast in Dynamic Wireless Networks
Chrysostomos Koutsimanis and G´abor Fodor
Presentation transcript:

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

Outline  Introduction  System Model  Linear Programming Formulation for the ILSP Problem  ILSP: integrated link scheduling and power control problem  Generalized Power-Based Interference Graph  Integrated Scheduling and Power Control Algorithm  Numerical Analysis  Conclusion and Comments 2

Introduction  In multi-hop wireless network,  An important issue is to therefore design multiple access mechanisms to efficiently control channel utilization.  This has motivated the need for channel spatial reuse, i.e., having users sufficiently apart use the same time slot, frequency band, or code.  A prevalent medium access scheme for channel spatial reuse in multi-hop wireless networks is “spatial time division multiple access” (STDMA)  where time is divided into fixed-length slots that are organized cyclically 3

Introduction (cont’d) 4  The STDMA schemes (without power control) proposed in the literature can be classified into two focal categories, namely 1) link scheduling and 2) node scheduling.  In each cycle, or time frame, every time slot is allocated  to different designated communication links (under link scheduling)  or to different designated user nodes (under node scheduling)  such that all transmissions are received “successfully” at their intended receivers.

Introduction (cont’d) 5  Link scheduling with power control scheme  The problem of finding an optimal link scheduling and power control policy that minimizes the total average transmission power in a multi-hop wireless network, subject to the given SINR constraints regarding the minimum average data rate per link, is addressed in [13].  The schedule length is the most pertinent criterion of the performance of the scheduling algorithm and has been used widely in the literature [13] R. L. Cruz and A. V. Santhanam, “Optimal routing, link scheduling and power control in multi-hop wireless networks,” in Proc. IEEE INFOCOM, 2003, pp. 702–711.

Introduction (cont’d) 6  In this paper, we develop a new mathematical programming formulation  for minimizing the schedule length in multi-hop wireless networks based on 1. the optimal joint scheduling of transmissions across multi- access communication links 2. the allocation of transmit power levels while meeting the requirements on the SINR at intended receivers.

Introduction (cont’d) 7  The problem can be represented as  a mixed-integer linear programming (MILP) and show that the latter yields a solution that consists of transmit power levels that are “strongly Pareto optimal.”

System Model 8  Consider a multi-hop wireless network  with a set of nodes N, N={1, 2, …,N}  Assume the network node to be immobile and the transmitting power level range to be [0, P max ] Fig. 1. Simultaneous Infeasible transmission under difference constraints

System Model (cont’d) 9  A directed communication link (or simply a link) l ij can be established from node i (or equivalently transmitter i) to node j (or equivalently receiver j)  if there exists a power P, P ∈ [0, Pmax], under which the “signal-to-noise ratio” at node j is not less than a threshold γ, i.e.,  where G ij is the propagation gain, and η j is the thermal noise at receiver j

System Model (cont’d) 10  Let i → j and P(t) ij denote a direct transmission over the link l ij and the corresponding transmit power level in time slot t, respectively,  i.e., P(t) ij ∈ [0, P max ].  A “transmission scenario” S(t) = {i 1 → j 1, i 2 → j 2,..., i M → j M } defined as a candidate set of transmissions that is considered to all take place at time slot t, where all transmitting and receiving nodes are distinct [28].

System Model (cont’d) 11  For such a transmission scenario S(t), under power vector  P(t) = (P (t) i1j1, P (t) i2j2,..., P (t) iMjM ), 0 ≤ P (t) ikjk ≤ P max, k = 1, 2,...,M,  we say that the transmission from i k is “successful”  If the SINR at j k is not less than the threshold γ, i.e.,

System Model (cont’d) 12  Definition 1  We define a transmission scenario S(t) = {i 1 → j 1, i 2 → j 2,..., i M → j M } to be feasible under power vector  P(t) = (P (t) i1j1, P (t) i2j2,..., P (t) iMjM ), 0 ≤ P (t) ikjk ≤ P max, k = 1, 2,...,M,  if all the transmissions of S(t) are successful under P(t).  Also, we define transmission scenario S(t) to be feasible if there exists at least one power vector P(t) = (P (t) i1j1, P (t) i2j2,..., P (t) iMjM ), 0 ≤ P (t) ikjk ≤ P max, k = 1, 2,...,M, under which all the transmissions of S(t) are successful.

System Model (cont’d) 13  Definition 2  We define the power vector P(t) = (P (t) i1j1, P (t) i2j2,..., P (t) iMjM ), 0 ≤ P (t) ikjk ≤ P max, k = 1, 2,...,M, to be strongly Pareto optimal with respect to transmission scenario S(t) = {i 1 → j 1, i 2 → j 2,..., i M → j M } if 1. S(t) is a feasible transmission scenario under P(t); 2. any other power vector P’(t) = (P’ (t) i1j1, P’ (t) i2j2,..., P’ (t) iMjM ), 0 ≤ P’ (t) ikjk ≤ P max, k = 1, 2,...,M, satisfying condition (1) would require at least as much power from every transmitter, i.e., P’(t) ≥ P(t) component-wise.

System Model (cont’d) 14  Our objective in this paper is to design a time frame with the minimum schedule length that satisfies the following conditions:  1) The time frame includes at least K ij time slots that are used for K ij (successful) transmissions across designated link l ij for every link l ij ∈ L.  2) The power vector allocated to transmissions at every time slot is strongly Pareto optimal with respect to the underlying transmission scenario.

LINEAR PROGRAMMING FORMULATION FOR THE ILSP PROBLEM 15  Develop and investigate an MILP formulation for the ILSP  Clearly, the optimum length of the time frame will not be larger than T max, where T max =   The decision variables in this our mathematical modeling are X (t) ij and P (t) ij.

LINEAR PROGRAMMING FORMULATION FOR THE ILSP PROBLEM (cont’d) 16 Binary variable constraint Maximum power constraint SINR Threshold constraint Simultaneous Infeasible transmission constraint Traffic load constraint

LINEAR PROGRAMMING FORMULATION FOR THE ILSP PROBLEM (cont’d) 17  The objective function  where ε is a sufficiently small positive number, and c t are positive constants defined as The use of relation (7) to define the objective function is performed for pure mathematical convenience. The role of the coefficients c t used in defining the objective function is to ensure that the length of the time frame corresponding to the optimal solution of the MILP formulation is minimum

Generalized Power-Based Interference Graph 18  Lemma to construct the interference graph  Transmission scenario S(t) = {i 1 → j 1,i 2 → j 2 } is feasible if and only if  This approach is similar to the previous work [TMC2004] [TMC2004] Arash Behzad, and Izhak Rubin “Multiple Access Protocol for Power-Controlled Wireless Access Nets”; IEEE TRANSACTIONS ON MOBILE COMPUTING, 2004

Generalized Power-Based Interference Graph (cont’d) 19  The “generalized power-based interference graph”  Defined as an undirected graph G(V, E)  where V and E are the sets of vertices and edges of graph G, respectively.  Every vertex in V is represented by an ordered triplet (i, j, k). The set of vertices {(i, j, k)|k = 1,..., K ij } is in V if and only if the communications link l ij belongs to L and K ij time slots are required to be allocated to link l ij.

Generalized Power-Based Interference Graph (cont’d) 20  Vertices (i 1, j 1, k 1 ) and (i 2, j 2, k 2 ) are connected to each other by an edge in G if and only if one of the following conditions is satisfied.  1. Nodes i 1, j 1, i 2, and j 2 are not distinct  2. The transmission scenario S(t) = {i 1 → j 1, i 2 → j2 } does not satisfy relation (28) or relation (29) (i.e., the transmission scenario S(t) = {i 1 → j 1, i 2 → j 2 } is not feasible).

Integrated Scheduling and Power Control Algorithm 21  The heuristic algorithm  1. Initially generates the generalized power-based interference graph  2. Using the “minimal degree greedy algorithm” (MDGA) [23] ISPA finds a maximal independent set MIS = {(i 1, j 1, k 1 ), (i 2, j 2, k 2 ),..., (i M, j M, k M )} of the generalized power-based interference graph for possible allocation to slot 1.

Integrated Scheduling and Power Control Algorithm (cont’d) 22  3. ISPA utilizes transmission scenario S(1) as a suitable initial point for its search for a maximal feasible transmission scenario for allocation to time slot 1. This search consists of two consecutive stages (i.e., pruning stage and maximality stage).  After performing the latter search, the resulting feasible transmission scenario is allocated to the first time slot.  Subsequently, the nodes (and the incident edges) associated with the allocated transmissions are removed from the generalized power-based interference graph.

Integrated Scheduling and Power Control Algorithm (cont’d) 23  Pruning Stage Find a feasible transmission scenario S* of graph G Start from the maximal independent set of G “Stepwise maximum interference removal algorithm” At every step, a transmission is removed from the group of potential transmissions which on average causes most interference to other receivers or is most sensitive to interference from other transmissions This process until the resulting transmission scenario is feasible.

Integrated Scheduling and Power Control Algorithm (cont’d) 24  Maximality stage The purpose of the maximality stage is to ensure that the set of transmissions allocated to every time slot forms a maximal feasible transmission scenario. simply performed by considering the remaining transmissions for possible inclusion in the transmission scenario S*

Numerical Analysis 25  The parameters  Nodes in the network are immobile and distributed independently and uniformly in 2500 × 2500 m 2.  The thermal noise power ( η j ) is − 90 dBm  The length of every time slot is 550 μ s  The minimum required SINR level ( γ ) is 10 dB  The maximum transmit power level (P max ) is 300mW  Compare with Two-Phase Algorithm (TPA) in [14]  The optimal soultion is derived by solving the MILP formulation (in ILOG CPLEX 7.0 software)

Numerical Analysis (cont’d) 26  Illustrate the length of the schedules attained by applying the ISPA and TPA algorithms to the same random topologies as optimization.

Numerical Analysis (cont’d) 27 Observe that the frame length of schedules realized by the ISPA algorithm resides in the 25th percentile of those attained by the optimal mechanism for the randomly generated topologies significant difference between the performance level exhibited by the solution to ILSP and TPA as the number of communication links increases

Numerical Analysis (cont’d) 28  Illustrate the approximation factor Δ corresponding to the feasible solution provided by solving the MILP formulation.  The above factor is calculated for the underlying topologies by dividing the upper bound of the optimum frame length by the corresponding lower bound.  As expected, Δ is an increasing function of number of designated links. For randomly generated topologies with 100 designated links, we observe an approximation factor of 2.6 attained by solving the MILP formulation.

Conclusion 29  Develop a new mathematical programming formulation for minimizing the schedule length in multi-hop wireless network.  Demonstrate that the MILP formulation can be used to derive an optimal solution of the ILSP problem  Develop and investigate a heuristic algorithm of polynomial complexity for solving the problem in a timely and practical manner  Ongoing research issues  fairness considerations  low-complexity distributed version

Comments 30  Many theorems and lemmas to prove their derivation and optimization issues are correct.  Formally, constructing the mixed-integer linear programming to solve the problem  Consider the schedule length rather than the spectrum utilization (their previous work)