Given a set of communication links sharing a channel, delay for delivery of a given amount of backlogged data can be traded off against average power consumption, for a fixed transmission link requirement. The main result of this work is the identification of general bounds for the average power needed to deliver a given backlog within a delay constraint and their application to compare orthogonal (TDMA) and concurrent (CDMA) multiple access. Numerical examples for a collection of links belonging to an ad-hoc network are discussed. It turns out that non-orthogonal CDMA can be the only viable choice for strict (yet feasible) delay constraints, the price to be paid being a larger energy consumption. Also, CDMA offers better power-delay trade-off for low interference as well as high path loss channel scenarios. (C) 2008 Elsevier B.V. All rights reserved.
Power-delay trade-off in a many-to-many wireless access / Baiocchi, Andrea; Todini, Alfredo. - In: COMPUTER COMMUNICATIONS. - ISSN 0140-3664. - 31:14(2008), pp. 3328-3336. [10.1016/j.comcom.2008.05.029]
Power-delay trade-off in a many-to-many wireless access
BAIOCCHI, Andrea;TODINI, Alfredo
2008
Abstract
Given a set of communication links sharing a channel, delay for delivery of a given amount of backlogged data can be traded off against average power consumption, for a fixed transmission link requirement. The main result of this work is the identification of general bounds for the average power needed to deliver a given backlog within a delay constraint and their application to compare orthogonal (TDMA) and concurrent (CDMA) multiple access. Numerical examples for a collection of links belonging to an ad-hoc network are discussed. It turns out that non-orthogonal CDMA can be the only viable choice for strict (yet feasible) delay constraints, the price to be paid being a larger energy consumption. Also, CDMA offers better power-delay trade-off for low interference as well as high path loss channel scenarios. (C) 2008 Elsevier B.V. All rights reserved.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.