English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In this paper we develop scheduling policies that maximize the stabilityregion of a wireless network under the assumption that mutual informationaccumulation is implemented at the physical layer. When the link qualitybetween nodes is not sufficiently high that a packet can be decoded within asingle slot, the system can accumulate information across multiple slots,eventually decoding the packet. The result is an expanded stability region. Theaccumulation process over weak links is temporally coupled and therefore doesnot satisfy the independent and identically distributed (i.i.d) assumption thatunderlies many previous analysis in this area. Therefore the problem settingalso poses new analytic challenges. We propose two dynamic schedulingalgorithms to cope with the non-i.i.d nature of the decoding. The firstperforms scheduling every $T$ slots, and approaches the boundary of thestability region as $T$ gets large, but at the cost of increased average delay.The second introduces virtual queues for each link and constructs a virtualsystem wherein two virtual nodes are introduced for each link. The constructedvirtual system is shown to have the same stability region as the originalsystem. Through controlling the virtual queues in the constructed system, weavoid the non-i.i.d analysis difficulty and attain the full stability region.We derive performance bounds for both algorithms and compare them throughsimulation results.

Optimal Backpressure Scheduling in Wireless Networks using Mutual Information Accumulation