Resource Allocation in Hospital Networks Based on Green Cognitive Radios 王冉茵 2015.12.09.

Slides:



Advertisements
Similar presentations
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.
Advertisements

Mission-based Joint Optimal Resource Allocation in Wireless Multicast Sensor Networks Yun Hou Prof Kin K. Leung Archan Misra.
QoS-based Management of Multiple Shared Resources in Dynamic Real-Time Systems Klaus Ecker, Frank Drews School of EECS, Ohio University, Athens, OH {ecker,
Lect.3 Modeling in The Time Domain Basil Hamed
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
1 Modeling and Optimization of VLSI Interconnect Lecture 9: Multi-net optimization Avinoam Kolodny Konstantin Moiseev.
Separating Hyperplanes
Inexact SQP Methods for Equality Constrained Optimization Frank Edward Curtis Department of IE/MS, Northwestern University with Richard Byrd and Jorge.
Visual Recognition Tutorial
1 Logic-Based Methods for Global Optimization J. N. Hooker Carnegie Mellon University, USA November 2003.
Kuang-Hao Liu et al Presented by Xin Che 11/18/09.
Placement of Integration Points in Multi-hop Community Networks Ranveer Chandra (Cornell University) Lili Qiu, Kamal Jain and Mohammad Mahdian (Microsoft.
Energy-Efficient Target Coverage in Wireless Sensor Networks Mihaela Cardei, My T. Thai, YingshuLi, WeiliWu Annual Joint Conference of the IEEE Computer.
*Sponsored in part by the DARPA IT-MANET Program, NSF OCE Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks Rahul.
Approximation Algorithms
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
Introduction to Cognitive radios Part two HY 539 Presented by: George Fortetsanakis.
EE360: Lecture 7 Outline Adaptive CDMA Techniques Introduction CDMA with power control Adaptive techniques for interference reduction Rate and power adaptation.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley Asynchronous Distributed Algorithm Proof.
Distributed Combinatorial Optimization
Review of Reservoir Problem OR753 October 29, 2014 Remote Sensing and GISc, IST.
Linear Programming Applications
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
1 A Distributed Algorithm for Joint Sensing and Routing in Wireless Networks with Non-Steerable Directional Antennas Chun Zhang *, Jim Kurose +, Yong Liu.
Seyed Mohamad Alavi, Chi Zhou, Yu Cheng Department of Electrical and Computer Engineering Illinois Institute of Technology, Chicago, IL, USA ICC 2009.
MAXIMIZING SPECTRUM UTILIZATION OF COGNITIVE RADIO NETWORKS USING CHANNEL ALLOCATION AND POWER CONTROL Anh Tuan Hoang and Ying-Chang Liang Vehicular Technology.
1 IEEE Trans. on Smart Grid, 3(1), pp , Optimal Power Allocation Under Communication Network Externalities --M.G. Kallitsis, G. Michailidis.
07/21/2005 Senmetrics1 Xin Liu Computer Science Department University of California, Davis Joint work with P. Mohapatra On the Deployment of Wireless Sensor.
1 Optimal Power Allocation and AP Deployment in Green Wireless Cooperative Communications Xiaoxia Zhang Department of Electrical.
1 Performance Analysis of Coexisting Secondary Users in Heterogeneous Cognitive Radio Network Xiaohua Li Dept. of Electrical & Computer Engineering State.
*P. C. Weeraddana **M. Codreanu, **M. Latva-Aho, ***A. Ephremides * KTH, Royal institute of Technology, Stockholm, Sweden ** CWC, University of Oulu, Finland.
Quasi-static Channel Assignment Algorithms for Wireless Communications Networks Frank Yeong-Sung Lin Department of Information Management National Taiwan.
1 A Distributed Algorithm for Joint Sensing and Routing in Wireless Networks with Non-Steerable Directional Antennas Chun Zhang *, Jim Kurose +, Yong Liu.
Disclosure risk when responding to queries with deterministic guarantees Krish Muralidhar University of Kentucky Rathindra Sarathy Oklahoma State University.
Maximum Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges Cardei, M.; Jie Wu; Mingming Lu; Pervaiz, M.O.; Wireless And Mobile.
AUTONOMOUS DISTRIBUTED POWER CONTROL FOR COGNITIVE RADIO NETWORKS Sooyeol Im; Jeon, H.; Hyuckjae Lee; IEEE Vehicular Technology Conference, VTC 2008-Fall.
Optimization Flow Control—I: Basic Algorithm and Convergence Present : Li-der.
Advanced Spectrum Management in Multicell OFDMA Networks enabling Cognitive Radio Usage F. Bernardo, J. Pérez-Romero, O. Sallent, R. Agustí Radio Communications.
Professor: Chu, Ta Chung Student: Nguyen Quang Tung Student’s ID: M977Z235 Fuzzy multiobjective linear model for supplier selection in a supply chain.
Approximate Dynamic Programming Methods for Resource Constrained Sensor Management John W. Fisher III, Jason L. Williams and Alan S. Willsky MIT CSAIL.
Exact and heuristics algorithms
1 11 Channel Assignment for Maximum Throughput in Multi-Channel Access Point Networks Xiang Luo, Raj Iyengar and Koushik Kar Rensselaer Polytechnic Institute.
Capacity Enhancement with Relay Station Placement in Wireless Cooperative Networks Bin Lin1, Mehri Mehrjoo, Pin-Han Ho, Liang-Liang Xie and Xuemin (Sherman)
Numerical Methods.
Simultaneous routing and resource allocation via dual decomposition AUTHOR: Lin Xiao, Student Member, IEEE, Mikael Johansson, Member, IEEE, and Stephen.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley.
4 Introduction Broadcasting Tree and Coloring System Model and Problem Definition Broadcast Scheduling Simulation 6 Conclusion and Future Work.
1  The Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
Introduction to Optimization
Optimization in Engineering Design 1 Introduction to Non-Linear Optimization.
CHANNEL ALLOCATION FOR SMOOTH VIDEO DELIVERY OVER COGNITIVE RADIO NETWORKS Globecom 2010, FL, USA 1 Sanying Li, Tom H. Luan, Xuemin (Sherman) Shen Department.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Multi-Objective Optimization for Topology Control in Hybrid FSO/RF Networks Jaime Llorca December 8, 2004.
Approximation Algorithms based on linear programming.
1 Chapter 6 Reformulation-Linearization Technique and Applications.
Overcoming the Sensing-Throughput Tradeoff in Cognitive Radio Networks ICC 2010.
1 Chapter 5 Branch-and-bound Framework and Its Applications.
Water resources planning and management by use of generalized Benders decomposition method to solve large-scale MINLP problems By Prof. André A. Keller.
1 A Proportional Fair Spectrum Allocation for Wireless Heterogeneous Networks Sangwook Han, Irfanud Din, Woon Bong Young and Hoon Kim ISCE 2014.
Signal processing and Networking for Big Data Applications: Lecture 9 Mix Integer Programming: Benders decomposition And Branch & Bound NOTE: To change.
Computing and Compressive Sensing in Wireless Sensor Networks
5.3 Mixed-Integer Nonlinear Programming (MINLP) Models
Chapter 6. Large Scale Optimization
IEEE transactions on information technology in biomedicine 2010
Integer Programming (정수계획법)
Chapter 6. Large Scale Optimization
Chrysostomos Koutsimanis and G´abor Fodor
Presentation transcript:

Resource Allocation in Hospital Networks Based on Green Cognitive Radios 王冉茵

Abstract This paper presents an approach to solve the joint call admission control and power allocation problem in a hospital environment based on green cognitive radio.

e-Healthcare e-Healthcare is the integration of digital data processing, computing and communication technology into the traditional healthcare services.

Introduction 1.Pervasive health monitoring. 2.Traditional health systems. 3.e-Health systems design and deployment. 4.Related work in the area earlier.

Contribution The earlier work is focused on the single objective function namely, capacity maximization, guaranteed data rate, guaranteed access minimum delay, minimum energy consumption and minimum deployment and maintenance cost. Improvement Formulating the resource allocation problem in e-Health networks as a multi-objective non-convex mixed integer non- linear programming (MINLP) problem.

Main Work In this paper, they invoke outer approximation approach(OAA) based linearization technique to solve the formulated joint admission control, mode selection and power allocation problem. The proposed method gives guaranteed ε convergence to the optimal solution results with reasonable computational complexity.

Organization of the Paper Sect.1, the paper first depicts an introduction, motivation and evolving scenarios of the e-Health environment and the earlier related work. Sect.4, conclusion is drawn and future work is highlighted. Sect.3 presents the numerical results and analytical observations related to the simulation results. Sect.2, problem formulation has been discussed by considering a system model showing a peculiar uplink scenario where different users try to communicate with the CPP.

System Model and Formulation : Communication Network in an e-Health Center Figure 1 shows an e-Health center consisting of three areas and two hallways making a department within a hospital. There are patients, doctors, nurses, specialists and supporting staff working in the center.

Three types of users in the e-Health center: 1. Protected users are passive medical devices, they don’t transmit any data, but they are very sensitive with EMI. 2. Primary users are active devices, which can transmit wireless signals, intended for therapeutic use. 3. Secondary users are another kind of active medical devices,that can transmit data opportunistically.

Weighted Resource Maximization Problem A multi-objective optimization problem. A min-max formulation. transform Weighted sum method.

The first objective The first objective is to maximize the number of selected users, that is Minimization of the defined objective function can be expressed as under: Define a binary variable

Also define another vector. Then,the total number of selected users can be written as: Thus, the formulation for the first objective is:

The second objective The second objective is to minimization the CO ₂ emissions.

The third objective The third objective is to maximize the data rate of each user while ensuring the minimum data rate requirement of each secondary user. The above maximization objective can be expressed as:

Use weighted sum method for this to combine the multiple objectives in the optimization problem with w1; w2; w3 weights. Overall resource allocation problem is expressed as follows: (1)

The above formulation is a multi-objective convex mixed integer non-linear programming (MINLP) problem which is generally NP-Hard.

Proposed Approach to a Solution The optimization problem in (1) has a very special structure. With known discrete variables, the objective function of (1) is a concave function in power, and all the constraints are either linear or convex. By exploiting this special structure, in this section we will present a OAA to solve (1).

Algorithm Description It is easily to prove that (1) satisfies the following propositions:

The OAA uses sequence of non-increasing upper and non- decreasing lower bounds for mixed integer problems that satisfy the propositions 1–4. The OAA converges in a finite number of iterations with ε -convergence capability. The primal problem is obtained by fixing θ variables. At the jth iteration of OAA, let the values of integer variable be. We can write the primal problem as: (2)

The algorithm will terminate when the difference between the two bounds is less than ε. The master problem is derived in two steps: In the first step, we need projection of (1) onto the integer space- θ. We can rewrite the problem (1) as: We can also write (3) as Where (3) (4)

The problem (4) is the projection of (1) on θ space. Since a constraint qualification holds at the solution of every primal problem (2) for every, the projection problem has the same solution as the problem below:

By introducing a new variable η, we can rewrite an equivalent minimization problem as:

A pseudo code for OAA is given in Algorithm 1.

Discussion on Algorithm Optimality and Convergence If the problem holds all four prepositions and the discrete variables ( θ ) are finite, then the Algorithm 1 terminates in a finite number of steps at an ε -optimal solution. The algorithm is finitely converging.

Numerical Results Appropriate values are assigned to all notations as shown in Table 2.

The simulation is performed with equal weights in (1) for three different parts of the objective function with The simulation was repeated for different values and combination of K, M and L as shown in Table 3.

The similar response is observed when the maximum transmit power is varied with fixed as shown in Fig. 4.

Requirement of transmit power versus number of secondary users has been shown in Fig. 6 for different values of.

Figures 7 and 8 show throughput of all secondary users.

Conclusions This paper presented an approach to solve the joint admission control and power allocation problem in a hospital environment based on cognitive radio.

Conclusions Specifically, a MINLP problem for wireless access in a hospital environment has been formulated to maximize the number of admitted secondary users and minimize transmit power and carbon dioxide emission.

Conclusions The approach also satisfies the throughput of all secondary users and the interference constraints for the protected and primary users.

Conclusions To solve this MINLP problem, they proposed an enhanced standard branch and bound algorithm OAA to find the optimal solution.

Thank you for watching!