We consider an uplink power control problem where each mobile wishes to maximize its throughput (which depends on the transmission powers of all mobiles) but has a constraint on the average power consumption. A finite number of power levels are available to each mobile. The decision of a mobile to select a particular power level may depend on its channel state. We consider two frameworks concerning the state information of the channels of other mobiles: (i) the case of full state information and (ii) the case of local state information. In each of the two frameworks, we consider both cooperative as well as non-cooperative power control. We manage to characterize the structure of equilibria policies and, more generally, of bestresponse policies in the non-cooperative case. We present an algorithm to compute equilibria policies in the case of two noncooperative players. Finally, we study the case where a malicious mobile, which also has average power constraints, tries to jam the communication of the other mobile. Our results are illustrated and validated through various numerical examples.
We consider a zero-sum stochastic game with side constraints for both players with a special structure. There are two independent controlled Markov chains, one for each player. The transition probabilities of the chain associated with a player as well as the related side constraints depend only on the actions of the corresponding player; the side constraints also depend on the player's controlled chain. The global cost that player 1 wishes to minimize and that player 2 wishes to maximize, depend however on the actions and Markov chains of both players. We obtain a linear programming formulations that allows to compute the value and saddle point policies for this problem. We illustrate the theoretical results through a zero-sum stochastic game in wireless networks in which each player has power constraints.
Abstract-We consider an uplink power control problem where each mobile wishes to maximize its throughput (which depends on the transmission powers of all mobiles) but has a constraint on the average power consumption. A finite number of power levels are available to each mobile. The decision of a mobile to select a particular power level may depend on its channel state. We consider two frameworks concerning the state information of the channels of other mobiles: (i) the case of full state information and (ii) the case of local state information. In each of the two frameworks, we consider both cooperative as well as non-cooperative power control. We manage to characterize the structure of equilibria policies and, more generally, of best-response policies in the noncooperative case. We present an algorithm to compute equilibria policies in the case of two non-cooperative players. Finally, we study the case where a malicious mobile, which also has average power constraints, tries to jam the communication of another mobile. Our results are illustrated and validated through various numerical examples.
A nonlinear stochastic control problem related to flow control is considered. It is assumed that the state of a link is described by a controlled hidden Markov process with a finite state set, while the loss flow is described by a counting process with intensity depending on a current transmission rate and an unobserved link state. The control is the transmission rate, and it has to be chosen as a nonanticipating process depending on the observation of the loss process. The aim of the control is to achieve the maximum of some utility function that takes into account losses of the transmitted information. Originally, the problem belongs to the class of stochastic control problems with incomplete information; however, optimal filtering equations that provide estimation of the current link state based on observations of the loss process allow one to reduce the problem to a standard stochastic control problem with full observations. Then a necessary optimality condition is derived in the form of a stochastic maximum principle, which allows us to obtain explicit analytic expressions for the optimal control in some particular cases. Optimal and suboptimal controls are investigated and compared with the flow control schemes used in TCP/IP (Transmission Control Protocols/Internet Protocols) networks. In particular, the optimal control demonstrates a much smoother behavior than the TCP/IP congestion control currently used. 0032-9460/05/4102-0150 c 2005 Pleiades Publishing, Inc.
This article discusses various approaches to the control of autonomous underwater vehicles (AUVs) with the aid of different velocity-position estimation algorithms. Traditionally this field is considered as the area of the extended Kalman filter (EKF) application: It became a universal tool for nonlinear observation models and its use is ubiquitous. Meanwhile, the specific characteristics of underwater navigation, such as an incomplete sets of measurements, constraints on the range metering or even impossibility of range measurements, observations provided by rather specific acoustic beacons, sonar observations, and other features seriously narrow the applicability of common instruments due to a high level of uncertainty and nonlinearity. The AUV navigation system, not being able to rely on a single source of position estimation, has to take into account all available information. This leads to the necessity of various complex estimation and data fusion algorithms, which are the matter of the present article. Here we discuss some approaches to the AUV position estimation such as conditionally minimax nonlinear filtering (CMNF) and unbiased pseudo-measurement filters (UPMFs) in conjunction with velocity estimation based on the seabed profile acoustic sensing. The presented estimation algorithms serve as a basis for a locally optimal AUV motion control algorithm, which is also presented. environment, all electromagnetic (and therefore video tools) have a very restricted range of operation, and only acoustic waves permit sensing and communication for rather long distances. The problem is that acoustic measurements are notably barren in comparison with the electromagnetic ones: They do not have such features as color or contrast and just measure the direction of arrival (DOA) and/or the distance from the vehicle to the reflecting surface, such as obstacle, seabed, or ship. Therefore, even using multiple irradiating sensors like acoustic sonars, one can only obtain an image of distances to the seabed relief. An introduction of acoustical beacons with known positions can help to determine the own AUV position by using an angular observation filter, and this is the area of the (short and/or long) baseline methods application [2]. These methods are especially effective in the limited area of operation; moreover, they may be used in the case of a moving baseline established on a ship [3] and even in docking maneuvering [4]. Acoustic methods used in active mode give access to the distance measurements, which make the position estimation problem much easier, though in some areas of application such measurements are not acceptable or must be restricted due to the energetic or masking constraints [5].The possibility of the sonar employment in AUV navigation has already been mentioned by some authors either in application to the situation, when an accurate seabed map is available, or in the case of presence of significant seabed features [6]. Moreover, the active pinging can be used to determine one's speed over the seabed by ...
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.