The Experts below are selected from a list of 68409 Experts worldwide ranked by ideXlab platform
Shing Wong - One of the best experts on this subject based on the ideXlab platform.
-
A noncooperative power control game for multiRate CDMA data networks
IEEE Transactions on Wireless Communications, 2003Co-Authors: Chi Wan Sung, Shing WongAbstract:The authors consider a multiRate code-division multiple acess system, in which all users have the same chip Rate and vary their data Rate by adjusting the processing gain. The receivers are assumed to be implemented using conventional matched filters, whose performance is sensitive to the received power levels. The authors' goal is to maximize the total system throughput by means of power control. A game theoretic approach is adopted. It is shown that for a certain type of pricing function, a unique Nash equilibrium solution exists and it possesses nice global properties. For example, it can be shown that for the optimal solution a high-Rate Connection should maintain a higher energy per bit than low-Rate ones. The asymptotic spectral efficiency is also derived.
-
A Noncooperative Power Control Game for MultiRate
2003Co-Authors: Chi Wan Sung, Shing WongAbstract:The authors consider a multiRate code-division mul- tiple acess system, in which all users have the same chip Rate and vary their data Rate by adjusting the processing gain. The receivers are assumed to be implemented using conventional matched filters, whose performance is sensitive to the received power levels. The au- thors' goal is to maximize the total system throughput by means of power control. A game theoretic approach is adopted. It is shown that for a certain type of pricing function, a unique Nash equilib- rium solution exists and it possesses nice global properties. For ex- ample, it can be shown that for the optimal solution a high-Rate Connection should maintain a higher energy per bit than low-Rate ones. The asymptotic spectral efficiency is also derived.
Chi Wan Sung - One of the best experts on this subject based on the ideXlab platform.
-
A noncooperative power control game for multiRate CDMA data networks
IEEE Transactions on Wireless Communications, 2003Co-Authors: Chi Wan Sung, Shing WongAbstract:The authors consider a multiRate code-division multiple acess system, in which all users have the same chip Rate and vary their data Rate by adjusting the processing gain. The receivers are assumed to be implemented using conventional matched filters, whose performance is sensitive to the received power levels. The authors' goal is to maximize the total system throughput by means of power control. A game theoretic approach is adopted. It is shown that for a certain type of pricing function, a unique Nash equilibrium solution exists and it possesses nice global properties. For example, it can be shown that for the optimal solution a high-Rate Connection should maintain a higher energy per bit than low-Rate ones. The asymptotic spectral efficiency is also derived.
-
A Noncooperative Power Control Game for MultiRate
2003Co-Authors: Chi Wan Sung, Shing WongAbstract:The authors consider a multiRate code-division mul- tiple acess system, in which all users have the same chip Rate and vary their data Rate by adjusting the processing gain. The receivers are assumed to be implemented using conventional matched filters, whose performance is sensitive to the received power levels. The au- thors' goal is to maximize the total system throughput by means of power control. A game theoretic approach is adopted. It is shown that for a certain type of pricing function, a unique Nash equilib- rium solution exists and it possesses nice global properties. For ex- ample, it can be shown that for the optimal solution a high-Rate Connection should maintain a higher energy per bit than low-Rate ones. The asymptotic spectral efficiency is also derived.
Tan Guan-zheng - One of the best experts on this subject based on the ideXlab platform.
-
Moving swarm formations in unknown environment
Computer Engineering and Design, 2008Co-Authors: Xiong Ju-feng, Tan Guan-zhengAbstract:Swarm robotics is one of the important research directions of multi-robot systems,it's major feature is that the system includes many robots.How to control swarm formation in unknown environment is a challenging problem.The principle on grid distribution control of swarm robots is analyzed based on artificial physics,some performance judgment parameters (such as stabilization time,col- lision times,overlay Rate,Connection number,cluster number,distributing density and so on) is put forward.Meanwhile,the virtual force model to use curve-fitting method is extended.The experimental result shows that this method can accomplish the grid distributing control robustly and efficiently in an unknown environment.At last,the directions of further research are proposed.
-
Grid Distribution Simulation of Swarm Robots Based on Artificial Physics
Computer Simulation, 2008Co-Authors: Tan Guan-zhengAbstract:Swarm robotics is one of the important research directions of multi-robot systems, whose major feature is that the system includes many robots. How to control swarm-robot system is a challenging problem. Grid distribution means that a lot of robots distribute averagely in an area when they are demanded. The principle and method that were analyzed based on artificial physics, some performance judgment parameters (such as stabilization time, collision times, overlay Rate, Connection number, cluster number, distributing density and so on were put forward); Meanwhile, the virtual force model was extended to use curve-fitting method. The result of the experiment shows that this method can accomplish the grid distributing control robustly and efficiently in a complicated environment. At last, the directions of further research were proposed.
-
On Grid Distribution Control of Swarm Robots
2007 Chinese Control Conference, 2006Co-Authors: Xiong Ju-feng, Tan Guan-zhengAbstract:Swarm robotics is one of the important research directions of multi-robot systems, whose major feature is that the system includes many robots. How to control swarm-robot system is a challenging problem. Grid distribution means that a lot of robots distribute averagely in an area when they are demanded. We analyses a principle and method that based on artificial physics, we also put forward some performance judgment parameters (such as stabilization time, collision times, overlay Rate, Connection number, cluster number, distributing density and so on); Meanwhile, we extend the virtual force model to use curve-fitting method. The result of the experiment shows that this method can accomplish the grid distributing control robustly and efficiently in a complicated environment. At last, the directions of further research are proposed.
Žarko Markov - One of the best experts on this subject based on the ideXlab platform.
-
Calculating Limits of Base Station Emission Power in GSM
Automatika: Journal for Control Measurement Electronics Computing and Communications, 2016Co-Authors: Rade Svraka, Dragan Mitić, Aleksandar Lebl, Žarko MarkovAbstract:This paper compares the influence of various factors on the output power of each GSM channel and Connection, and on the output power of whole base transceiver station in GSM network. The considered factors are the influence of sending signal only when speech exists (DTX), implementation of power control in signal sending, influence of users' distribution in the range of coverage of base station, the power of one intra-cell Connection and the power of one half-Rate Connection. It is analyzed how emission power of base station can be reduced by implementing various methods in signal sending.
-
Traffic Simulation of GSM Cells with Half–Rate Connection Realization Possibility
Journal of Electrical Engineering-elektrotechnicky Casopis, 2016Co-Authors: Dragan Mitić, Aleksandar Lebl, Mladen Mileusnic, Branimir Trenkic, Žarko MarkovAbstract:AbstractThis paper presents simulation model for the analysis of characteristics of base station, which may establish half-Rate Connections. Accuracy of realized simulation model is analyzed comparing its results to a number of corresponding results, which are obtained by calculation or presented in referenced literature. These corresponding results are obtained, in the first case, analytically, solving the system of equations, which are modelling the system and, in the second case, from the literature, which deals with the similar systems. At the end, simulation model is implemented to analyze in detail several systems with different total number of traffic channels. The results of simulation pointed out how much probability of Connection loss decreases in the case of great traffic load, when half-Rate Connections realization is implemented.
Takis Konstantopoulos - One of the best experts on this subject based on the ideXlab platform.
-
Extremal shape-controlled traffic patterns in high-speed networks
IEEE Transactions on Communications, 2000Co-Authors: George Kesidis, Takis KonstantopoulosAbstract:We consider a variable bit-Rate Connection with a deterministically shaped random traffic process, as specified by communications networking standards. Regarding randomness, we assume no restricted model other than the natural requirement that the process be stationary and ergodic. Given only the shape parameters, we consider the open problem of determining the maximum service bandwidth required to achieve a given bound on the probability that the packet-transfer delay exceeds a certain threshold. The shape parameters together with a probabilistic bound on the packet-transfer delay define a variable bit-Rate "channel"; an equivalent problem is to determine the "capacity" of this channel. To this end, we consider a queue with a constant service Rate and a shaped arrival process and obtain tight bounds on queue occupancy and queueing delay. In particular, we describe that traffic pattern (among all stationary-ergodic and deterministically constrained arrival processes) which achieves the probabilistic bound.
-
Shape-controlled traffic patterns that maximize overflow probabilities in high-speed networks
Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171), 1998Co-Authors: George Kesidis, Takis KonstantopoulosAbstract:We consider the problem of allocation of network resources for a variable bit Rate Connection requiring a probabilistic bound on cell delay. We only make the standard assumption that the Connection has a deterministically controlled shape as specified by a (a, p) constraint, simultaneously with a (0, /spl pi/) (or peak-Rate) constraint. This paper settles one instance of this open problem raised by Doshi (1994), which is motivated by the need to obtain worst-case probabilistic bounds, and is particularly applicable to situations where no statistical descriptors of network traffic are available. In particular, we describe that traffic pattern which maximizes the "overflow probability" P(Q/sub 0/>b), for a given buffer level b, where {Q/sub t/} is the buffer occupancy process, in steady-state, when the service Rate is some constant c between /spl rho/ and /spl pi/. This result could be used for resource provisioning of Connections or for performance evaluation of network devices.
