Conflict-Free Scheduling for Partially Connected D2D Networks With Network Coding
| Autor: | Cheng Zhan, Kailun Gao |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Optimization problem
Computer science business.industry Network packet Distributed computing 020206 networking & telecommunications 020302 automobile design & engineering 02 engineering and technology Scheduling (computing) 0203 mechanical engineering Control and Systems Engineering Independent set Linear network coding 0202 electrical engineering electronic engineering information engineering Wireless Electrical and Electronic Engineering business Decoding methods Computer network Coding (social sciences) |
| Zdroj: | IEEE Wireless Communications Letters. 5:456-459 |
| ISSN: | 2162-2345 2162-2337 |
| Popis: | In this letter, we study the problem of distributing data to a group of partially connected cooperative D2D networks using network coding. In such a scenario, the transmission conflicts occur from simultaneous transmissions of multiple devices, where the scheduling decision should be made not only on the encoded packets but also on the set of transmitting devices. We formulate the joint optimization problem over the set of transmitting devices and the packet combinations with a conflict-free graph model, which contains both coding conflict and transmission conflict. We also propose a heuristic solution for this setup by finding the maximum independent set in the conflict-free graph. Simulation results show that our coding scheme significantly reduces the number of transmission slots. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|