A Power Control Game with Smooth Reduction of SINR Objectives

Date

2009-10-02

Author

Ozel, Omur
Uysal, Elif

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

127
views

0
downloads

When rate expectations of users in a wireless network cannot all be satisfied, one choice is to discard some users from the system, in a mechanism called admission control. However, in a data network, users have a certain tolerance to occasional rate outages. In this paper we argue that it may be preferable for users to reduce their rate objectives smoothly, by considering an outage probability tolerance, rather than not be provided any service at all. We propose a distributed utility based algorithm for doing this. The smoothness of reactions is obtained by making transmit power reaction curves absolutely subhomogeneous functions of interference. This is done using an "objective reduction factor", in addition to a linear price. We first provide conditions for a unique Nash equilibrium. Assuming that distributed nodes use gradient based optimization, convergence and error sensitivity of gradient based iterative algorithms are analyzed. Lastly, the continuous-time counterpart of the problem is considered and a stability condition is established for the system.

Subject Keywords

Computer science, Theory & methods, Engineering, electrical & electronic, Telecommunication

URI

https://hdl.handle.net/11511/33061

DOI

https://doi.org/10.1109/allerton.2009.5394555

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

A Computational Dynamic Trust Model for User Authorization ZHONG, Yuhui; Bhargava, Bharat; LU, Yİ; Angın, Pelin (Institute of Electrical and Electronics Engineers (IEEE), 2015-01-01) Development of authorization mechanisms for secure information access by a large community of users in an open environment is an important problem in the ever-growing Internet world. In this paper we propose a computational dynamic trust model for user authorization, rooted in findings from social science. Unlike most existing computational trust models, this model distinguishes trusting belief in integrity from that in competence in different contexts and accounts for subjectivity in the evaluation of a pa...
A hybrid single-source shortest path algorithm Arslan, Hilal; Manguoğlu, Murat (The Scientific and Technological Research Council of Turkey, 2019-01-01) The single-source shortest path problem arises in many applications, such as roads, social applications, and computer networks. Finding the shortest path is challenging, especially for graphs that contain a large number of vertices and edges. In this work, we propose a novel hybrid method that first sparsifies a given graph by removing most edges that cannot form the shortest path tree and then applies a classical shortest path algorithm to the sparser graph. Removing all the edges that cannot form the shor...
A new approach for the scalable intrusion detection in high-speed networks Şahin, Ümit Burak; Schmidt, Şenan Ece; Department of Electrical and Electronics Engineering (2007) As the networks become faster and faster, the emerging requirement is to improve the performance of the Intrusion Detection and Prevention Systems (IDPS) to keep up with the increased network throughput. In high speed networks, it is very difficult for the IDPS to process all the packets. Since the throughput of IDPS is not improved as fast as the throughput of the switches and routers, it is necessary to develop new detection techniques other than traditional techniques. In this thesis we propose a rule-ba...
Analysis of the pantograph arcing and its effects on the railway vehicle Baysal, Dilek; Bazlamaçcı, Cüneyt Fehmi; Erdem, Oğuzhan; Department of Electrical and Electronics Engineering (2014) Virtual router is an essential solution to fulfill the increasing demands of network services. A virtual router, having a single hardware platform, serves several networks concurrently and hence provides cost saving. A virtual router maintains multiple forwarding tables that belong to separate internet service providers (ISPs) and performs IP lookup and forwarding functionality for each ISP in one common platform. IP lookup in a virtual router is performed by inspecting the incoming packets that also carry ...
Computation of Response Time Distributions for Messages on the Controller Area Network Batur, Ahmet; Schmidt, Şenan Ece; Schmidt, Klaus Verner (2018-08-23) The response time of messages is an important parameter for the design of in-vehicle networks based on the controller area network (CAN). The message transmission on CAN is affected by several non-deterministic factors such as stuff bits that are added to CAN frames depending on the message payload or changing phases among the asynchronous CAN nodes because of clock drifts. The resulting probabilistic nature of message response times on CAN is captured by the response time distribution (RTD) that quantifies...

Citation Formats

O. Ozel and E. Uysal, “A Power Control Game with Smooth Reduction of SINR Objectives,” 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/33061.