Joint Rate Selection and Wireless Network Coding for Time Critical Applications
📝 Abstract
In this paper, we dynamically select the transmission rate and design wireless network coding to improve the quality of services such as delay for time critical applications. With low transmission rate, and hence longer transmission range, more packets may be encoded together, which increases the coding opportunity. However, low transmission rate may incur extra transmission delay, which is intolerable for time critical applications. We design a novel joint rate selection and wireless network coding (RSNC) scheme with delay constraint, so as to minimize the total number of packets that miss their deadlines at the destination nodes. We prove that the proposed problem is NPhard, and propose a novel graph model and transmission metric which consider both the heterogenous transmission rates and the packet deadline constraints during the graph construction. Using the graph model, we mathematically formulate the problem and design an efficient algorithm to determine the transmission rate and coding strategy for each transmission. Finally, simulation results demonstrate the superiority of the RSNC scheme.
💡 Analysis
In this paper, we dynamically select the transmission rate and design wireless network coding to improve the quality of services such as delay for time critical applications. With low transmission rate, and hence longer transmission range, more packets may be encoded together, which increases the coding opportunity. However, low transmission rate may incur extra transmission delay, which is intolerable for time critical applications. We design a novel joint rate selection and wireless network coding (RSNC) scheme with delay constraint, so as to minimize the total number of packets that miss their deadlines at the destination nodes. We prove that the proposed problem is NPhard, and propose a novel graph model and transmission metric which consider both the heterogenous transmission rates and the packet deadline constraints during the graph construction. Using the graph model, we mathematically formulate the problem and design an efficient algorithm to determine the transmission rate and coding strategy for each transmission. Finally, simulation results demonstrate the superiority of the RSNC scheme.
📄 Content
arXiv:1112.2842v1 [cs.NI] 13 Dec 2011 1 Joint Rate Selection and Wireless Network Coding for Time Critical Applications Xiumin Wang⋆, Chau Yuen⋆, Yinlong Xu† ⋆Singapore University of Technology and Design, Singapore † School of Computer Science, University of Science and Technology of China, China Email: wangxiumin@sutd.edu.sg, yuenchau@sutd.edu.sg, ylxu@ustc.edu.cn Abstract—In this paper, we dynamically select the transmission rate and design wireless network coding to improve the quality of services such as delay for time critical applications. With low transmission rate, and hence longer transmission range, more packets may be encoded together, which increases the coding opportunity. However, low transmission rate may incur extra transmission delay, which is intolerable for time critical applications. We design a novel joint rate selection and wireless network coding (RSNC) scheme with delay constraint, so as to minimize the total number of packets that miss their deadlines at the destination nodes. We prove that the proposed problem is NP- hard, and propose a novel graph model and transmission metric which consider both the heterogenous transmission rates and the packet deadline constraints during the graph construction. Using the graph model, we mathematically formulate the problem and design an efficient algorithm to determine the transmission rate and coding strategy for each transmission. Finally, simulation results demonstrate the superiority of the RSNC scheme. I. INTRODUCTION With the increase in both wireless channel bandwidth and the computational capability of wireless devices, wireless networks now can be used to support time critical applications such as video streaming or interactive gaming. Such time critical applications require the data content to reach the destination node(s) in a timely fashion, i.e., a delay deadline is imposed on packet reception, beyond which the reception becomes useless (or invalid) [1]. Recently, network coding becomes a promising approach to improve wireless network performance [2]–[4]. Specifically, the work in [4] proposed the first network coding based packet forwarding architecture, named COPE, to improve the throughput of wireless networks. With COPE, each node opportunistically overhears some of the packets transmitted by its neighbors, which are not intended to itself. The relay node can then intelligently XOR multiple packets and forward it to multiple next hops with only one transmission, which results in a significant throughput improvement. In most recent works for wireless network coding, network nodes always transmit packets at a fixed rate. However, most wireless systems are now capable of performing adaptive modulation to vary the link transmission rate in response to the signal to interference plus noise at the receivers. Transmission rate diversity exhibits a rate-range tradeoff: the higher the transmission rate, the shorter the transmission range for a given This research is supported by the International Design Center at Singapore University of Technology and Design, Singapore (Grant No. IDG31100102 & IDD11100101). transmission power [5]. To aid overhearing, one may use the lowest transmission rate, so as to successfully deliver packet to more receivers/overhearing nodes. Although this may increase the coding opportunity, it may not yield good performance, especially for time critical applications, as the arrival times of packets may be delayed. In the literature, only a few works studied the relationships between adapting the transmission rate and the network coding gain [5]–[8]. The work in [5] showed that compared with pure network coding scheme, joint rate adaptation and network coding is more effective in throughput performance. They also proposed a joint rate selection and coding scheme to minimize the sum of the uplink and the downlink costs in star network topology. The work in [6] mathematically formulated the optimal packet coding and rate selection problem as an integer programming problem, and proposed an efficient heuristic algorithm to jointly find a good combination of coding solution and the transmission rate. However, there are only a few works considered the delay guarantee of packet receptions, which is especially important for time critical applications. So far, only [9] considered the delay constraint of packet reception, and proposed a coding scheme to minimize the number of packets that miss their deadlines. However, they assume that the transmission rates on all the links are fixed and the same. In this paper, by considering the impact of both transmission rate and network coding on the packet reception delay, we de- sign a joint rate selection and network coding (RSNC) scheme for wireless time critical applications, so as to minimize the total number of packets that will miss their deadlines at the destination nodes. The main contributions of our paper can be concluded as follows. • We propose a novel graph model, which cons
This content is AI-processed based on ArXiv data.