Coding-Based Data Broadcasting for Time-Critical Applications With Rate Adaptation
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. In a network coded system, with a low transmission rate and, hence, a longer transmission range, more packets may be encoded...
Saved in:
| Published in | IEEE transactions on vehicular technology Vol. 63; no. 5; pp. 2429 - 2442 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
New York, NY
IEEE
01.06.2014
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0018-9545 1939-9359 |
| DOI | 10.1109/TVT.2013.2290701 |
Cover
| Summary: | 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. In a network coded system, with a low transmission rate and, hence, a longer transmission range, more packets may be encoded, which increases the coding opportunity. However, a 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 a delay constraint to maximize the total benefit (where we can define the benefit based on the priority or importance of a packet for example) of the packets that are successfully received at the destinations without missing their deadlines. We prove that the proposed problem is NP-hard and propose a novel graph model to mathematically formulate the problem. For the general case, we propose a transmission metric and design an efficient algorithm to determine the transmission rate and coding strategy for each transmission. For a special case when all delay constraints are the same, we study pairwise coding and present a polynomial-time pairwise coding algorithm that achieves an approximation ratio of 1 - (1/e) to the optimal pairwise coding solution, where e is the base of the natural logarithm. Finally, simulation results demonstrate the superiority of the proposed RSNC scheme. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ISSN: | 0018-9545 1939-9359 |
| DOI: | 10.1109/TVT.2013.2290701 |