The Experts below are selected from a list of 318 Experts worldwide ranked by ideXlab platform
Wei Wang - One of the best experts on this subject based on the ideXlab platform.
-
a framework for Maximum Capacity in multi channel multi radio wireless networks
Consumer Communications and Networking Conference, 2006Co-Authors: Wei WangAbstract:Wireless networks with multi-channel multi-radio availability are attracting more and more attention from the research community because of its performance improvement and relatively low cost and complexity. Most work in the literature consider the performance of multi-channel multiradio wireless networks with predefined numbers of channels and radios, and develop algorithms for channel allocation and transmission scheduling. The Capacity limit on multi-channel multi-radio wireless networks was seldom addressed before. In this work, we study two problems: In a specific topology, 1) what is the Maximum Capacity we can get given the number of channels and radios? and 2) what is the impact of the number of radios on the system performance? To answer the above questions, we propose a general framework to find the Maximum Capacity given a multi-channel multi-radio wireless network. Its result also provides an indication of the “goodness” of a topology. We then use the framework to study the impact of radio constraints.
-
A Framework for Maximum Capacity in Multi-channel Multi-radio Wireless Networks (Invited Paper)
2006Co-Authors: Wei WangAbstract:Wireless networks with multi-channel multi-radio availability are attracting more and more attention from the research community because of its performance improvement and relatively low cost and complexity. Most work in the literature consider the performance of multi-channel multi- radio wireless networks with predefined numbers of channels and radios, and develop algorithms for channel allocation and transmission scheduling. The Capacity limit on multi-channel multi-radio wireless networks was seldom addressed before. In this work, we study two problems: In a specific topology, 1) what is the Maximum Capacity we can get given the number of channels and radios? and 2) what is the impact of the number of radios on the system performance? To answer the above questions, we propose a general framework to find the Maximum Capacity given a multi-channel multi-radio wireless network. Its result also provides an indication of the "goodness" of a topology. We then use the framework to study the impact of radio constraints.
Chao Yang - One of the best experts on this subject based on the ideXlab platform.
-
AN INVERSE Maximum Capacity PATH PROBLEM WITH LOWER BOUND CONSTRAINTS
Acta Mathematica Scientia, 2002Co-Authors: Chao Yang, Xueqi ChenAbstract:Abstract The computational complexity of inverse mimimum Capacity path problem with lower bound on Capacity of Maximum Capacity path is examined, and it is proved that solution of this problem is NP-complete. A strong polynomial algorithm for a local optimal solution is provided.
-
inverse Maximum Capacity problems
Or Spektrum, 1998Co-Authors: Chao Yang, Jianzhong ZhangAbstract:LetE be a finite set, ℱ be a family of subsets ofE and¯C be a Capacity vector for all elements ofE. For eachF∈ℱ, define theCapacity ofF as the minimum Capacity occurring inF. The problem which we discuss in this paper is how to change the vector¯C as little as possible so that a givenF0∈8o has the Maximum Capacity. This model contains inverse Maximum Capacity spanning tree problem, inverse Maximum Capacity path problem and etc. as its special cases. We transform the problem into the minimum weight cut set problem and show that this problem can be solved efficiently if an efficient algorithm for finding minimum weight cut set of ℱ is available.
Ruifeng Zhang - One of the best experts on this subject based on the ideXlab platform.
-
scheduling for Maximum Capacity in sdma tdma networks
International Conference on Acoustics Speech and Signal Processing, 2002Co-Authors: Ruifeng ZhangAbstract:This paper presents a general information-theoretic framework for the problem of spatial and temporal packet scheduling in SDMA/TDMA systems. The said problem is described as a partition of a given set of users and SDMA and TDMA are applied within each subset and among difference subsets, respectively. The Capacity of SDMA/TDMA systems is derived as a function of the partition scheme. Optimization of the packet scheduling can then be performed by maximizing the Capacity. The paper also presents a graph-theoretical model for the optimization problem. It shows that that the optimization is to find a proper independent dominating set in an associated graph.
-
VTC Spring - Scheduling for Maximum Capacity in S/TDMA systems
Vehicular Technology Conference. IEEE 55th Vehicular Technology Conference. VTC Spring 2002 (Cat. No.02CH37367), 2002Co-Authors: Ruifeng ZhangAbstract:Space-time division multiple access (S/TDMA) applies spatial multiplexing enabled by antenna arrays on top of time-division multiplexing. Packet scheduling in S/TDMA can be described as a partition of a given set of packets such that the packets in each subset can be properly separated in the space domain and thus be assigned to the same time slot in a TDMA frame. This paper presents a information-theoretic framework for packet scheduling in S/TDMA systems by deriving the S/TDMA channel Capacity as a function of the partition scheme. Optimization of the packet scheduling then can be performed by maximizing the channel Capacity. The paper also presents a graph theory model for the optimization problem. It shows that that the optimization is to find a proper dominating set in an associated graph.
-
ICASSP - Scheduling for Maximum Capacity in SDMA/TDMA networks
IEEE International Conference on Acoustics Speech and Signal Processing, 2002Co-Authors: Ruifeng ZhangAbstract:This paper presents a general information-theoretic framework for the problem of spatial and temporal packet scheduling in SDMA/TDMA systems. The said problem is described as a partition of a given set of users and SDMA and TDMA are applied within each subset and among difference subsets, respectively. The Capacity of SDMA/TDMA systems is derived as a function of the partition scheme. Optimization of the packet scheduling can then be performed by maximizing the Capacity. The paper also presents a graph-theoretical model for the optimization problem. It shows that that the optimization is to find a proper independent dominating set in an associated graph.
Michael E Kuhl - One of the best experts on this subject based on the ideXlab platform.
-
the use of simulation to determine Maximum Capacity in the surgical suite operating room
Winter Simulation Conference, 2006Co-Authors: Sarah M Ballard, Michael E KuhlAbstract:Utilizing ambulatory care units at optimal levels has become increasingly important to hospitals from both service and business perspectives. With the inherent variation in hospitals due to unique procedures and patients, performing Capacity analysis through analytical models is difficult without making simplifying assumptions. Many hospitals calculate efficiency by comparing total operating room minutes available to total operating minutes used. This metric both fails to account for the required non-value added tasks between surgeries and the delicate balance necessary between having patients ready for surgery when an operating room becomes available, which can result in increased waiting times, and maximizing patient satisfaction. We present a general methodology for determining the Maximum Capacity within a surgical suite through the use of a discrete-event simulation model. This research is based on an actual hospital concerned with doctor/resource acquisition decisions, patient satisfaction improvements, and increased productivity.
-
Winter Simulation Conference - The use of simulation to determine Maximum Capacity in the surgical suite operating room
Proceedings of the 2006 Winter Simulation Conference, 2006Co-Authors: Sarah M Ballard, Michael E KuhlAbstract:Utilizing ambulatory care units at optimal levels has become increasingly important to hospitals from both service and business perspectives. With the inherent variation in hospitals due to unique procedures and patients, performing Capacity analysis through analytical models is difficult without making simplifying assumptions. Many hospitals calculate efficiency by comparing total operating room minutes available to total operating minutes used. This metric both fails to account for the required non-value added tasks between surgeries and the delicate balance necessary between having patients ready for surgery when an operating room becomes available, which can result in increased waiting times, and maximizing patient satisfaction. We present a general methodology for determining the Maximum Capacity within a surgical suite through the use of a discrete-event simulation model. This research is based on an actual hospital concerned with doctor/resource acquisition decisions, patient satisfaction improvements, and increased productivity.
Jianzhong Zhang - One of the best experts on this subject based on the ideXlab platform.
-
inverse Maximum Capacity problems
Or Spektrum, 1998Co-Authors: Chao Yang, Jianzhong ZhangAbstract:LetE be a finite set, ℱ be a family of subsets ofE and¯C be a Capacity vector for all elements ofE. For eachF∈ℱ, define theCapacity ofF as the minimum Capacity occurring inF. The problem which we discuss in this paper is how to change the vector¯C as little as possible so that a givenF0∈8o has the Maximum Capacity. This model contains inverse Maximum Capacity spanning tree problem, inverse Maximum Capacity path problem and etc. as its special cases. We transform the problem into the minimum weight cut set problem and show that this problem can be solved efficiently if an efficient algorithm for finding minimum weight cut set of ℱ is available.