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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper proposes efficient multiple-access schemes for large wirelessnetworks based on the transmitters' buffer state information and theirtransceivers' duplex transmission capability. First, we investigate the case ofhalf-duplex nodes where a node can either transmit or receive in a given timeinstant. The network is said to be naturally sparse if the number ofnonempty-queue transmitters in a given frame is much smaller than the number ofusers, which is the case when the arrival rates to the queues are very smalland the number of users is large. If the network is not naturally sparse, wedesign the user requests to be sparse such that only few requests are sent tothe destination. We refer to the detected nonempty-queue transmitters in agiven frame as frame owners. Our design goal is to minimize the nodes' totaltransmit power in a given frame. In the case of unslotted-time datatransmission, the optimization problem is shown to be a convex optimizationprogram. We propose an approximate formulation to simplify the problem andobtain a closed-form expression for the assigned time durations to the nodes.The solution of the approximate optimization problem demonstrates that the timeduration assigned to a node in the set of frame owners is the ratio of thesquare-root of the buffer occupancy of that node to the sum of the square-rootsof each occupancy of all the frame owners. We then investigate the slotted-timedata transmission scenario, where the time durations assigned for datatransmission are slotted. In addition, we show that the full-duplex capabilityof a node increases the data transmission portion of the frame and enables adistributed implementation of the proposed schemes.

Sparsity-Cognizant Multiple-Access Schemes for Large Wireless Networks With Node Buffers