Reliability Bounds for Delay-Constrained Multi-hop Networks - Computer Science > Information TheoryReport as inadecuate




Reliability Bounds for Delay-Constrained Multi-hop Networks - Computer Science > Information Theory - Download this document for free, or read online. Document in PDF available to download.

Abstract: We consider a linear multi-hop network composed of multi-state discrete-timememoryless channels over each hop, with orthogonal time-sharing across hopsunder a half-duplex relaying protocol. We analyze the probability of error andassociated reliability function \cite{Gallager68} over the multi-hop network;with emphasis on random coding and sphere packing bounds, under the assumptionof point-to-point coding over each hop. In particular, we define the systemreliability function for the multi-hop network and derive lower and upperbounds on this function to specify the reliability-optimal operating conditionsof the network under an end-to-end constraint on the total number of channeluses. Moreover, we apply the reliability analysis to bound the expectedend-to-end latency of multi-hop communication under the support of an automaticrepeat request ARQ protocol. Considering an additive white Gaussian noiseAWGN channel model over each hop, we evaluate and compare these bounds todraw insights on the role of multi-hopping toward enhancing the end-to-endrate-reliability-delay tradeoff.



Author: Ozgur Oyman

Source: https://arxiv.org/







Related documents