• 제목/요약/키워드: multipacket reception (MPR)

검색결과 2건 처리시간 0.014초

On the (n, m, k)-Cast Capacity of Wireless Ad Hoc Networks

  • Kim, Hyun-Chul;Sadjadpour, Hamid R.;Garcia-Luna-Aceves, Jose Joaquin
    • Journal of Communications and Networks
    • /
    • 제13권5호
    • /
    • pp.511-517
    • /
    • 2011
  • The capacity of wireless ad-hoc networks is analyzed for all kinds of information dissemination based on single and multiple packet reception schemes under the physical model. To represent the general information dissemination scheme, we use (n, m, k)-cast model [1] where n, m, and k (k ${\leq}$ m) are the number of nodes, destinations and closest destinations that actually receive packets from the source in each (n, m, k)-cast group, respectively. We first consider point-to-point communication, which implies single packet reception between transmitter-receiver pairs and compute the (n, m, k)-cast communications. Next, the achievable throughput capacity is computed when receiver nodes are endowed with multipacket reception (MPR) capability. We adopt maximum likelihood decoding (MLD) and successive interference cancellation as optimal and suboptimal decoding schemes for MPR. We also demonstrate that physical and protocol models for MPR render the same capacity when we utilize MLD for decoding.

Cross-Layer Resource Allocation Scheme for WLANs with Multipacket Reception

  • Xu, Lei;Xu, Dazhuan;Zhang, Xiaofei;Xu, Shufang
    • ETRI Journal
    • /
    • 제33권2호
    • /
    • pp.184-193
    • /
    • 2011
  • Tailored for wireless local area networks, the present paper proposes a cross-layer resource allocation scheme for multiple-input multiple-output orthogonal frequency-division multiplexing systems. Our cross-layer resource allocation scheme consists of three stages. Firstly, the condition of sharing the subchannel by more than one user is studied. Secondly, the subchannel allocation policy which depends on the data packets' lengths and the admissible combination of users per subchannel is proposed. Finally, the bits and corresponding power are allocated to users based on a greedy algorithm and the data packets' lengths. The analysis and simulation results demonstrate that our proposed scheme not only achieves significant improvement in system throughput and average packet delay compared with conventional schemes but also has low computational complexity.