Delay and Energy Constrained Random Access Transport Capacity

作者：Byun Ilmu^*; Ko Byung Hoon; Jeon Ki Jun; Kim Kwang Soon

来源：IEEE Transactions on Wireless Communications, 2014, 13(8): 4495-4506.

DOI：10.1109/TWC.2014.2320253

• Ad hoc networks
• random access transport capacity
• capacity scaling
• delay constraint
• energy constraint

In this paper, we consider a delay and energy constrained wireless ad hoc network with node density of lambda(n), where a packet should be delivered to the destination within D(lambda(n)) seconds using at most E(lambda(n)) energy in joules while satisfying the target outage probability. The performance metric for analyzing the network is the delay and energy constrained random access transport capacity (DE-RATC), i.e., C-epsilon(D(lambda(n)), E(lambda(n))), which quantifies the maximum end-to-end distance weighted rate per unit area of a delay and energy constrained network using a random access protocol. It is shown that a slotted ALOHA protocol is order-optimal under any delay and energy constraints if equipped with additional features such as power control, multi-hop control, interference control, and rate control, and the delay and energy constraints can be divided into three regions according to the relation between the physical quantities due to the constraints and those due to the node density and network size. The three regions are the non-constrained (NC) region, where the DE-RATC is given by Theta(root lambda(n)/log lambda(n)); the delay-constrained (DC) region, where the DE-RATC depends only on the delay constraint as Theta(D(lambda(n))); and the non-achievable (NA) region where a packet delivery under the given constraints is impossible. Also, it is shown that an arbitrary tradeoff between the rate of each source node and the number of source nodes can be achieved while keeping the optimal capacity scaling as long as lambda(s)= Omega(min(root lambda(n)/log lambda(n), D(lambda(n)))).

• 出版日期2014-8