Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
125 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Secure Broadcasting over Fading Channels with Statistical QoS Constraints (1004.0892v1)

Published 6 Apr 2010 in cs.IT and math.IT

Abstract: In this paper, the fading broadcast channel with confidential messages is studied in the presence of statistical quality of service (QoS) constraints in the form of limitations on the buffer length. We employ the effective capacity formulation to measure the throughput of the confidential and common messages. We assume that the channel side information (CSI) is available at both the transmitter and the receivers. Assuming average power constraints at the transmitter side, we first define the effective secure throughput region, and prove that the throughput region is convex. Then, we obtain the optimal power control policies that achieve the boundary points of the effective secure throughput region.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Deli Qiao (32 papers)
  2. Mustafa Cenk Gursoy (51 papers)
  3. Senem Velipasalar (61 papers)
Citations (6)

Summary

We haven't generated a summary for this paper yet.