Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Age-Optimal Channel Coding Blocklength for an M/G/1 Queue with HARQ
Date
2018-08-24
Author
Sac, Hakan
Bacinoglu, Tan
Uysal, Elif
Durisi, Giuseppe
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
142
views
0
downloads
Cite This
We consider a communication system in which a source transmits information updates to a destination node through a binary erasure channel (BEC). When a packet containing an information update, which consists of a fixed number of information bits, arrives at the transmitter, it gets queued in a buffer, to be encoded and sent over the channel. Before transmitting a packet, the transmitter selects a channel coding blocklength n and then uses an automatic repeat request (ARQ) protocol, whereby packets that are decoded incorrectly are repeated. The choice of the coding blocklength thus affects the end-to-end status age. However, this dependency is nontrivial since, on the one hand, the duration of a single transmission attempt is directly proportional to n, so the smaller n the better. On the other hand, a smaller value of the blocklength n yields a higher probability of decoding error, which increases the end-toend status age. Employing recent finite-blocklength information-theoretic bounds and approximations on the rate achievable on a BEC for a given blocklength and a given error probability, we study the age-optimal design of this system. We find that for any nontrivial BEC, there exists an optimal blocklength that minimizes the average age and average peak age of information.
Subject Keywords
Monitoring
,
Decoding
,
Delays
,
Encoding
,
Automatic repeat request
,
Protocols
,
Random variables
URI
https://hdl.handle.net/11511/32919
DOI
https://doi.org/10.1109/spawc.2018.8445909
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
Relay Selection for Efficient HARQ-IR Protocols in Relay-Assisted Multisource Multicast Networks
Quoc-Tuan Vien, Quoc-Tuan Vien; Nguyen, Huan X.; Shah, Purav; Ever, Enver; Duc To, Duc To (2014-05-21)
This paper investigates relay selection for reliable data transmission in relay-assisted multisource multicast networks (RMMNs) where multiple source nodes distribute information to a set of destination nodes with the assistance of multiple relay nodes. Hybrid automatic repeat request with incremental redundancy (HARQ-IR) is used and supported by either a physical-layer network coding (PNC) or an analog network coding (ANC) technique employed at the relays. By deriving efficiency metrics of the HARQ-IR prot...
Unfolded Hybrid Beamforming With GAN Compressed Ultra-Low Feedback Overhead
Balevi, Eren; Andrews, Jeffrey G. (2021-12-01)
Optimizing a hybrid beamforming transmitter is a non-convex problem and requires channel state information, leading in most cases to nontrivial feedback overhead. We propose a methodology relying on the principles of deep generative models and unfolding to achieve near-optimal hybrid beamforming with reduced feedback and computational complexity. We first represent the channel as a low-dimensional manifold via a generative adversarial network (GAN) and search the optimum digital and analog precoders in this...
Diversity in relaying protocols with amplify and forward
Yüksel Turgut, Ayşe Melda; Erkip, E (2003-01-01)
We examine a network consisting of one source, one destination and two amplifying and forwarding relays and consider a scenario in which destination and relays can have various processing limitations. For all possible diversity combining schemes at the relays and at the destination, we find diversity order results analytically and confirm our findings through numerical calculations of bit error rate (BER) versus signal-to-noise-ratio (SNR) curves. We compare our results with direct transmission, well known ...
Pilot-aided packet synchronization and single-tone parameter estimation on an FPGA platform FPGA platformunda pilot dizini ekleme yöntemiyle paket senkronizasyonu ve tek ton parametre kestirimi
Özel, Ömür; Vural, Mehmet; Yılmaz, Ali Özgür (2007-12-01)
In this paper, an FPGA implementation in which packet synchronization is performed by transmitting pilot sequences will be explained. In addition, in order to recover the frequency offset between the frequencies of oscillators at the transmitter and the receiver, a PLL like structure is proposed.
Distributed Connectivity Restoration in Underwater Acoustic Sensor Networks via Depth Adjustment
Uzun, Erkay; ŞENEL, FATİH; Akkaya, Kemal; Yazıcı, Adnan (2015-06-12)
In most applications of Underwater Acoustic Sensor Networks, network connectivity is required for data exchange, data aggregation and relaying the data to a surface station. However, such connectivity can be lost due to failure of some sensor nodes which creates disruptions to the network operations. In this paper, we present two algorithms, namely BMR and DURA, which can detect network partitioning due to such node failures and re-establish network connectivity through controlled depth adjustment of nodes ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
H. Sac, T. Bacinoglu, E. Uysal, and G. Durisi, “Age-Optimal Channel Coding Blocklength for an M/G/1 Queue with HARQ,” 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/32919.