Vehicular communications have stringent latency requirements on safety-critical information transmission. However, lack of instantaneous channel state information due to high mobility poses a great challenge to meet these requirements and the situation gets more complicated when packet retransmission is considered. Based on only the obtainable large-scale fading channel information, this paper performs spectrum and power allocation to maximize the ergodic capacity of vehicular-to-infrastructure (V2I) links while guaranteeing the latency requirements of vehicular-to-vehicular (V2V) links. First, for each possible spectrum reusing pair of a V2I link and a V2V link, we obtain the closed-form expression of the packets' average sojourn time (the queueing time plus the service time) for the V2V link. Then, an optimal power allocation is derived for each possible spectrum reusing pair. Afterwards, we optimize the spectrum reusing pattern by addressing a polynomial time solvable bipartite matching problem. Numerical results show that the proposed queueing analysis is accurate in terms of the average packet sojourn time. Moreover, the developed resource allocation always guarantees the V2V links' requirements on latency.
In this paper, a network comprising wireless devices equipped with buffers transmitting deadline-constrained data packets over a slotted-ALOHA random-access channel is studied. Although communication protocols facilitating retransmissions increase reliability, packet transmission from the queue experiences delays and thus, packets with time constraints might be dropped before being successfully transmitted, while at the same time causing the queue size of the buffer to increase. Towards understanding the trade-off between reliability and delays that might lead to packet drops due to the deadli…
Recently, network coding technique has emerged as a promising approach that supports reliable transmission over wireless loss channels. In existing protocols where users have no interest in considering the encoded packets they had in coding or decoding operations, this rule is expensive and inef-ficient. This paper studies the impact of encoded packets in the reliable unicast network coding via some theoretical analysis. Using our approach, receivers do not only store the encoded packets they overheard, but also report these information to their neighbors, such that users enable to take accoun…
We focus on a slotted ALOHA system without feedback, in which nodes transmit time-stamped updates to a common gateway. Departing from the classical generate-at-will model, we assume that each transmitter may not always have fresh information to deliver, and tackle the fundamental question of whether sending stale packets can be beneficial from an age-of-information (AoI) standpoint. Leaning on a signal-flow-graph analysis of Markov processes the study reveals that, when packets can be lost due to channel impairments, retransmissions can indeed lower AoI for low generation rates of new informat…
This paper analyzes wireless network control for remote estimation of linear time-invariant dynamical systems under various Hybrid Automatic Repeat Request (HARQ) packet retransmission schemes. In conventional HARQ, packet reliability increases gradually with additional packets; however, each retransmission maximally increases the Age of Information and causes severe degradation in estimation mean squared error (MSE) performance. We optimize standard HARQ schemes by allowing partial retransmissions to increase the packet reliability gradually and limit the AoI growth. In incremental redundancy…
In this paper, we present bandwidth efficient retransmission method employong selective retransmission approach at modulation layer under orthogonal frequency division multiplexing (OFDM) signaling. Our proposed cross-layer design embeds a selective retransmission sublayer in physical layer (PHY) that targets retransmission of information symbols transmitted over poor quality OFDM sub-carriers. Most of the times, few errors in decoded bit stream result in packet failure at medium access control (MAC) layer. The unnecessary retransmission of good quality information symbols of a failed packet h…
In Release 14, 3GPP introduced a novel paradigm known as cellular vehicle--to--everything (C-V2X) \emph{mode-4} to specifically support vehicular communications in scenarios without network coverage. Such a scheme has been devised to operate distributedly harnessing a sensing mechanism whereby vehicles can monitor the received power across subchannels. Based on the measured power intensities, vehicles autonomously select a suitable subchannel over which safety messages are broadcasted. The selected subchannel is utilized by the vehicle for a short period of time before releasing it to select a…
The future wireless networks envision ultra-reliable communication with efficient use of the limited wireless channel resources. Closed-loop repetition protocols where retransmission of a packet is enabled using a feedback channel has been adopted since early days of wireless telecommunication. Protocols such as automatic repeat request (ARQ) are used in today's wireless technologies as a mean to provide the link with reduced rate of packet outage and increased average throughput. The performance of such protocols is strongly dependent to the feedback channel reliability. This paper studies th…
Interference in wireless networks is one of the key-capacity limiting factor. The multicast capacity of an ad- hoc wireless network decreases with an increasing number of transmitting and/or receiving nodes within a fixed area. Digital Network Coding (DNC) has been shown to improve the multicast capacity of non-interfering wireless network. However recently proposed Physical-layer Network Coding (PNC) and Analog Network Coding (ANC) has shown that it is possible to decode an unknown packet from the collision of two packet, when one of the colliding packet is known a priori. Taking advantage of…
Dedicated short range communication (DSRC) relies on secure distribution to vehicles of a certificate revocation list (CRL) for enabling security protocols. CRL distribution utilizing vehicle-to-vehicle (V2V) communications is preferred to an infrastructure-only approach. One approach to V2V CRL distribution, using rateless coding at the source and forwarding at vehicle relays is vulnerable to a pollution attack in which a few malicious vehicles forward incorrect packets which then spread through the network leading to denial-of-service. This paper develops a new scheme called Precode-and-Hash…
We propose an uncoordinated all-to-all broadcast protocol for periodic messages in vehicular networks based on coded slotted ALOHA (CSA). Unlike classical CSA, each user acts as both transmitter and receiver in a half-duplex mode. As in CSA, each user transmits its packet several times. The half-duplex mode gives rise to an interesting design trade-off: the more the user repeats its packet, the higher the probability that this packet is decoded by other users, but the lower the probability for this user to decode packets from others. We compare the proposed protocol with carrier sense multiple…
In many practical wireless systems, the Signal-to-Interference-and-Noise Ratio (SINR) that is applicable to a certain transmission, referred to as Channel State Information (CSI), can only be learned after the transmission has taken place and is thereby outdated (delayed). For example, this occurs under intermittent interference. We devise the backward retransmission (BRQ) scheme, which uses the delayed CSIT to send the optimal amount of incremental redundancy (IR). BRQ uses fixed-length packets, fixed-rate R transmission codebook, and operates as Markov block coding, where the correlation bet…
Novel bitwise retransmission schemes are devised which retransmit only the bits received with small reliability. The retransmissions are used to accumulate the reliabilities of individual bits. Unlike the conventional automatic repeat request (ARQ) schemes, the proposed scheme does not require a checksum for the error detection. The bits to be retransmitted are reported as a combination number, or two synchronized random number generators (RNGs) at the transmitter and receiver are used to greatly compress the feedback message. The bitwise retransmission decisions and/or combining can be perfor…
Among the new types of connectivity unleashed by the emerging 5G wireless systems, Ultra-Reliable Low Latency Communication (URLLC) is perhaps the most innovative, yet challenging one. Ultra-reliability requires high levels of diversity, however, the reactive approach based on packet retransmission in HARQ protocols should be applied carefully to conform to the stringent latency constraints. The main premise of this paper is that the NOMA principle can be used to achieve highly efficient retransmissions by allowing concurrent use of wireless resources in the uplink. We introduce a comprehensiv…
Coded computation is a framework which provides redundancy in distributed computing systems to speed up largescale tasks. Although most existing works assume an error-free scenarios in a master-worker setup, the link failures are common in current wired/wireless networks. In this paper, we consider the straggler problem in coded distributed computing with link failures, by modeling the links between the master node and worker nodes as packet erasure channels. When the master fails to detect the received signal, retransmission is required for each worker which increases the overall run-time to …
Consider a transmission scheme with a single transmitter and multiple receivers over a faulty broadcast channel. For each receiver, the transmitter has a unique infinite stream of packets, and its goal is to deliver them at the highest throughput possible. While such multiple-unicast models are unsolved in general, several network coding based schemes were suggested. In such schemes, the transmitter can either send an uncoded packet, or a coded packet which is a function of a few packets. The packets sent can be received by the designated receiver (with some probability) or heard and stored by…
We consider content distribution in vehicular ad hoc networks. We assume that a file is encoded using fountain code, and the encoded message is cached at infostations. Vehicles are allowed to download data packets from infostations, which are placed along a highway. In addition, two vehicles can exchange packets with each other when they are in proximity. As long as a vehicle has received enough packets from infostations or from other vehicles, the original file can be recovered. In this work, we show that system throughput increases linearly with number of users, meaning that the system exhib…
In this paper, novel cooperative automatic repeat request (ARQ) methods with network coding are proposed for two way relaying network. Upon a failed transmission of a packet, the network enters cooperation phase, where the retransmission of the packets is aided by the relay node. The proposed approach integrates network coding into cooperative ARQ, aiming to improve the network throughput by reducing the number of retransmissions. For successive retransmission, three different methods for choosing the retransmitting node are considered. The throughput of the methods are analyzed and compared. …
In this paper, we investigate the effectiveness of the hybrid automatic repeat request (HARQ) technique in providing high-reliability and low-latency in the finite blocklength (FBL) regime in a single user uplink scenario. We characterize the packet error rate (PER), throughput, and delay performance of chase combining HARQ (CC-HARQ) and incremental redundancy HARQ (IR-HARQ) in AWGN and Rayleigh fading channel with $m$ retransmissions. Furthermore, we consider a quasi-static fading channel model, which is more accurate than the over-simplified i.i.d. block fading or same channel assumption ove…
High-fidelity, real-time interactive applications are envisioned with the emergence of the Internet of Things (IoT) and tactile Internet by means of ultra-reliable low-latency communications (URLLC). Exploiting time diversity for fulfilling the URLLC requirements in an energy efficient manner is a challenging task due to the nontrivial interplay among packet size, retransmission rounds and delay, and transmit power. In this paper, we study the fundamental energy-latency tradeoff in URLLC systems employing incremental redundancy (IR) hybrid automatic repeat request (HARQ). We cast the average e…
Recent work by Polyanskiy et al. and Chen et al. has excited new interest in using feedback to approach capacity with low latency. Polyanskiy showed that feedback identifying the first symbol at which decoding is successful allows capacity to be approached with surprisingly low latency. This paper uses Chen's rate-compatible sphere-packing (RCSP) analysis to study what happens when symbols must be transmitted in packets, as with a traditional hybrid ARQ system, and limited to relatively few (six or fewer) incremental transmissions. Numerical optimizations find the series of progressively growi…
Recent studies have shown that retransmissions can cause heavy-tailed transmission delays even when packet sizes are light-tailed. Moreover, the impact of heavy-tailed delays persists even when packets size are upper bounded. The key question we study in this paper is how the use of coding techniques to transmit information, together with different system configurations, would affect the distribution of delay. To investigate this problem, we model the underlying channel as a Markov modulated binary erasure channel, where transmitted bits are either received successfully or erased. Erasure code…
Consider an energy harvesting node where generation of a status update message takes non-negligible time due to sensing, computing and analytics operations performed before making update transmissions. The node has to harmonize its (re)transmission strategy with the sensing/computing. We call this general set of problems intermittent status updating. In this paper, we consider intermittent status updating through non-preemptive sensing/computing (S/C) and transmission (Tx) operations, each costing a single energy recharge of the node, through an erasure channel with (a) perfect channel feedbac…
In this work, we develop low complexity, optimal power allocation algorithms that would allow ultra reliable operation at any outage probability target with minimum power consumption in the finite blocklength regime by utilizing Karush-Kuhn-Tucker (KKT) conditions. In our setup, we assume that the transmitter does not know the channel state information (CSI). First, we show that achieving a very low packet outage probability by using an open loop setup requires extremely high power consumption. Thus, we resort to retransmission schemes as a solution, namely Automatic Repeat Request (ARQ), Chas…
This paper investigates the design of access policies in spectrum sharing networks by exploiting the retransmission protocol of legacy primary users (PUs) to improve the spectral efficiency via opportunistic retransmissions at secondary users (SUs) and chain decoding. The optimal policy maximizing the SU throughput under an interference constraint to the PU and its performance are found in closed form. It is shown that the optimal policy randomizes among three modes: Idle, the SU remains idle over the retransmission window of the PU, to avoid causing interference; Interference cancellation, th…
For a low-mobile Poisson bipolar network and under line-of-sight/non-line-of-sight (LOS/NLOS) path-loss model, we study repetitive retransmissions (RR) and blocked incremental redundancy (B-IR). We consider spatially-coded multiple-input multiple-output (MIMO) zero-forcing beamforming (ZFBF) multiplexing system, whereby the packet success reception is determined based on the aggregate data rate across spatial dimensions of the MIMO system. Characterization of retransmission performance in this low-mobile configuration is practically important, but inherently complex due to a substantial rate c…
As opposed to hybrid automatic repeat request with incremental redundancy (HARQ-IR) that all the resources are occupied to resend the redundant information, cross-packet HARQ (XP-HARQ) allows the introduction of new information into retransmissions to substantially exploit the remaining resources. This letter provides a profound investigation into the outage performance of XP-HARQ. In particular, the exact outage expression of XP-HARQ is derived if the maximum number of transmissions is two, and tight outage bounds are obtained for more than two transmissions. Moreover, the asymptotic outage a…
We introduce a method for securely delivering a set of messages to a group of clients over a broadcast erasure channel where each client is interested in a distinct message. Each client is able to obtain its own message but not the others'. In the proposed method the messages are combined together using a special variant of random linear network coding. Each client is provided with a private set of decoding coefficients to decode its own message. Our method provides security for the transmission sessions against computational brute-force attacks and also weakly security in information theoreti…
In this paper, efficient turbo packet combining for single carrier (SC) broadband multiple-input--multiple-output (MIMO) hybrid--automatic repeat request (ARQ) transmission with unknown co-channel interference (CCI) is studied. We propose a new frequency domain soft minimum mean square error (MMSE)-based signal level combining technique where received signals and channel frequency responses (CFR)s corresponding to all retransmissions are used to decode the data packet. We provide a recursive implementation algorithm for the introduced scheme, and show that both its computational complexity and…
In this paper the throughput and energy efficiency of an unlicensed machine type communications network is studied. If an outage event happens in the network, there is a possibility for packet retransmissions in order to obtain a lower error probability. The model consist of a network with two types of users, Licensed and unlicensed users. The licensed users allocated uplink channel is also used by the unlicensed users. However, it is done in a way that no harm is done to the licensed users' transmission from sharing the same channel with the unlicensed users. However, licensed users' transmis…
Vehicular wireless channels are highly time-varying and the pilot pattern in the 802.11p orthogonal frequency-division multiplexing frame has been shown to be ill suited for long data packets. The high frame error rate in off-the-shelf chipsets with noniterative receiver configurations is mostly due to the use of outdated channel estimates for equalization. This paper deals with improving the channel estimation in 802.11p systems using a cross layered approach, where known data bits are inserted in the higher layers and a modified receiver makes use of these bits as training data for improved …
Provenance embedding algorithms are well known for tracking the footprints of information flow in wireless networks. Recently, low-latency provenance embedding algorithms have received traction in vehicular networks owing to strict deadlines on the delivery of packets. While existing low-latency provenance embedding methods focus on reducing the packet delay, they assume a complete graph on the underlying topology due to the mobility of the participating nodes. We identify that the complete graph assumption leads to sub-optimal performance in provenance recovery, especially when the vehicular …
The vision of connecting billions of battery operated devices to be used for diverse emerging applications calls for a wireless communication system that can support stringent reliability and latency requirements. Both reliability and energy efficiency are critical for many of these applications that involve communication with short packets which undermine the coding gain achievable from large packets. In this paper, we study a cross-layer approach to optimize the performance of low-power wireless links. At first, we derive a simple and accurate packet error rate (PER) expression for uncoded s…
We consider the problem of broadcasting data streams over a wireless network for multiple receivers with reliability and timely delivery guarantees. In our framework, we consider packets that need to be delivered within a given time interval, after which the packet is no longer useful at the application layer. We set the notion of critical packet and, based on periodic feedback from the receivers, we propose a retransmission scheme that will guarantee timely delivery of such packets, as well as packets that are innovative for other receivers. Our solution provides a trade-off between packet de…
In this paper, we investigate the performance of LTE Multicast-Broadcast Single-Frequency Networks (MBSFN). LTE-MBSFN is viewed as one of the most promising candidates for vehicular communications which can enhance reliability of vehicular application traffic. This is achieved due to the possibility to efficiently support message exchange in-between vehicles by multicasting information to several vehicles in parallel (point-to-multipoint transmission) employing an Multimedia Broadcast/Multicast Service (MBMS). We investigate two metrics to gauge the performance of MBMS/MBSFN transmissions in c…
This paper proposes a cooperation protocol between a secondary user (SU) and a primary user (PU) which dedicates a free frequency subband for the SU if cooperation results in energy saving. Time is slotted and users are equipped with buffers. Under the proposed protocol, the PU releases portion of its bandwidth for secondary transmission. Moreover, it assigns a portion of the time slot duration for the SU to relay primary packets and achieve a higher successful packet reception probability at the primary receiver. We assume that the PU has three states: idle, forward, and retransmission states…
In this paper, we consider a point-to-point wireless communication system. The source monitors a physical process and generates status update packets according to a Poisson process. The packets are transmitted to the destination by using finite blocklength coding to update the status (e.g., temperature, speed, position) of the monitored process. In some applications, such as real-time monitoring and tracking, the timeliness of the status updates is critical since the users are interested in the latest condition of the process. The timeliness of the status updates can be reflected by a recently…
We consider the problem of minimizing the time average cost of sampling and transmitting status updates by users over a wireless channel subject to average Age of Information constraints (AoI). Errors in the transmission may occur and the scheduling algorithm has to decide if the users sample a new packet or attempt for retransmission of the packet sampled previously. The cost consists of both sampling and transmission costs. The sampling of a new packet after a failure imposes an additional cost in the system. We formulate a stochastic optimization problem with time average cost in the object…
Shanghai Institute for Advanced Communication and Data Science（上海先进通信与数据科学研究院）；Shanghai University（上海大学）
Ultra-Reliable and Low-Latency Communications (URLLC) services in vehicular networks on millimeter-wave bands present a significant challenge, considering the necessity of constantly adjusting the beam directions. Conventional methods are mostly based on classical control theory, e.g., Kalman filter and its variations, which mainly deal with stationary scenarios. Therefore, severe application limitations exist, especially with complicated, dynamic Vehicle-to-Everything (V2X) channels. This paper gives a thorough study of this subject, by first modifying the classical approaches, e.g., Extended…
