Joint scheduling and instantaneously decodable network coding
We consider a wireless multi-hop network and design an algorithm for jointly optimal scheduling of packet transmissions and network coding. We consider network coding across different users, however with the restriction that packets have to be decoded after one hop. We compute the stability region of this scheme and propose an online algorithm that stabilizes every arrival rate vector within the stability region. The online algorithm requires computation of stable sets in an appropriately...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of IEEE Global Communications Conference, Exhibition & Industry Forum (GLOBECOM 2009)|
|01_Traskov_Joint_scheduling_and_2009.pdf||425.71 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.