Exchanging third-party information with minimum transmission cost

IEEE Trans. Veh. Technol.

2014

Self Cite

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 low transmission rate and hence longer transmission range, more packets may be encoded, 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 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 the 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. I. INTRODUCTIONWith the increase in both wireless channel bandwidth and computational capability of wireless devices, wireless networks 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]- [5]. These constraints can be imposed either by applications or the users. For example, many financial users are interested in the up-to-minute stock quotes so as to react to dynamic and rapid market. As another example, in wireless location-based services, the queried information (e.g., the traffic jam) is valid within a local area, as when the mobile user (e.g., vehicle user) leaves the area, the information becomes useless [6].Recently, network coding becomes a promising approach to improve wireless network performance [7]- [16]. Specifically, Xiumin Wang is currently with the USTC as an assistant professor, a lecturer, and an associate professor. Currently, he is leading a group of research students in doing some networking and high performance computing research. His research interests include network coding, wireless network, combinatorial optimization, design and analysis of parallel algorithm, parallel programming tools, etc. He received the Excellent Ph.D Advisor Award of Chinese Academy of Sciences in 2006.

Section: Rsnc Formulationmentioning

confidence: 99%

Coding-Based Data Broadcasting for Time-Critical Applications With Rate Adaptation

IEEE Trans. Veh. Technol.

2014

Self Cite

“…As in [1] [2], there is a lossless common/broadcast channel for clients to exchange information. Let y i be the number of packets that client c i should send.…”

Section: Problem Descriptionmentioning

confidence: 99%

“…link loss probability and CSI, on a link (i, j) is regarded as a local and common information between two connected nodes i and j, and it is unknown to a third-party node, e.g., the node k = i, j. Thus, the problem of letting third-party nodes to know the information that is local to the other nodes is an important problem for network design [1], [2].…”

Section: Introductionmentioning

confidence: 99%

“…In cooperative data exchange, the clients in a network exchange the packets via a lossless common/broadcast channel. Inspired by cooperative data exchange, the works in [1] [2] proposed a network coding based third-party information exchange where the clients exchange their local CSI through a lossless common/broadcast channel such that each client finally gets the complete CSI of the whole network. Specifically, the work in [1] aims to minimize the total number of transmissions, while the work in [2] tries to minimize the total transmission cost required to complete the information exchange.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Partial Third-Party Information Exchange with Network Coding

2013

IEEE Commun. Lett.

Self Cite

Abstract-In this paper, we consider the problem of exchanging channel state information in a wireless network such that a subset of the clients can obtain the complete channel state information of all the links in the network. We first derive the minimum number of required transmissions for such partial third-party information exchange problem. We then design an optimal transmission scheme by determining the number of packets that each client should send, and designing a deterministic encoding strategy such that the subset of clients can acquire complete channel state information of the network with minimal number of transmissions. Numerical results show that network coding can efficiently reduce the number of transmissions, even with only pairwise encoding.

“…2012HGBZ0640) in China. minimum cost cooperative data exchange was studied in [4], [5]. However, finding the exact optimal solution to minimize the cost or the number of transmissions is non-trivial for coded cooperative data exchange.…”

Section: Introductionmentioning

confidence: 99%

Delay Minimization for Network Coded Cooperative Data Exchange with Rate Adaptation

2013 IEEE 78th Vehicular Technology Conference (VTC Fall)

Dau

2013

Self Cite

In this paper, we dynamically select the transmission rates to reduce the transmission delay required for network coded cooperative data exchange. With low transmission rate, more clients can receive the packet due to longer transmission range. However, low transmission rate may incur extra transmission delay. We consider a delay minimization with rate selection and network coding (DMRSNC) for cooperative data exchange problem under two cases: with and without packet splitting. We construct a network information flow graph to model such a problem, and design transmission strategy with the aim of minimizing transmission delay. With packet splitting, the DMRSNC problem can be formulated as a linear programming based on the graph model, which can be solved in polynomial time. When the packet splitting is not allowed, we derive an upper bound for the minimum total transmission delay required for DMRSNC problem. In addition, we derive that the upper bound is at most three times of the optimal solution in a special case. Finally, the simulation results demonstrate the superiority of the proposed scheme in reducing the total transmission delay.