• 제목/요약/키워드: Multipacket reception

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

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.

Neighbor Discovery in a Wireless Sensor Network: Multipacket Reception Capability and Physical-Layer Signal Processing

  • Jeon, Jeongho;Ephremides, Anthony
    • Journal of Communications and Networks
    • /
    • 제14권5호
    • /
    • pp.566-577
    • /
    • 2012
  • In randomly deployed networks, such as sensor networks, an important problem for each node is to discover its neighbor nodes so that the connectivity amongst nodes can be established. In this paper, we consider this problem by incorporating the physical layer parameters in contrast to the most of the previous work which assumed a collision channel. Specifically, the pilot signals that nodes transmit are successfully decoded if the strength of the received signal relative to the interference is sufficiently high. Thus, each node must extract signal parameter information from the superposition of an unknown number of received signals. This problem falls naturally in the purview of random set theory (RST) which generalizes standard probability theory by assigning sets, rather than values, to random outcomes. The contributions in the paper are twofold: First, we introduce the realistic effect of physical layer considerations in the evaluation of the performance of logical discovery algorithms; such an introduction is necessary for the accurate assessment of how an algorithm performs. Secondly, given the double uncertainty of the environment (that is, the lack of knowledge of the number of neighbors along with the lack of knowledge of the individual signal parameters), we adopt the viewpoint of RST and demonstrate its advantage relative to classical matched filter detection method.

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.

Optimal Utilization of a Cognitive Shared Channel with a Rechargeable Primary Source Node

  • Pappas, Nikolaos;Jeon, Jeong-Ho;Ephremides, Anthony;Traganitis, Apostolos
    • Journal of Communications and Networks
    • /
    • 제14권2호
    • /
    • pp.162-168
    • /
    • 2012
  • This paper considers the scenario in which a set of nodes share a common channel. Some nodes have a rechargeable battery and the others are plugged to a reliable power supply and, thus, have no energy limitations. We consider two source-destination pairs and apply the concept of cognitive radio communication in sharing the common channel. Specifically, we give high-priority to the energy-constrained source-destination pair, i.e., primary pair, and low-priority to the pair which is free from such constraint, i.e., secondary pair. In contrast to the traditional notion of cognitive radio, in which the secondary transmitter is required to relinquish the channel as soon as the primary is detected, the secondary transmitter not only utilizes the idle slots of primary pair but also transmits along with the primary transmitter with probability p. This is possible because we consider the general multi-packet reception model. Given the requirement on the primary pair's throughput, the probability p is chosen to maximize the secondary pair's throughput. To this end, we obtain two-dimensional maximum stable throughput region which describes the theoretical limit on rates that we can push into the network while maintaining the queues in the network to be stable. The result is obtained for both cases in which the capacity of the battery at the primary node is infinite and also finite.