Computer Science – Information Theory
Scientific paper
2011-05-02
Computer Science
Information Theory
A shorter version accepted for publication at IEEE Information Theory Workshop 2011. This version has all the proofs omitted i
Scientific paper
In this work we examine the operation of a node relaying packets from a number of users to a destination node. We assume multi-packet reception capabilities for the relay and the destination node. The relay node can transmit and receive at the same time, so the problem of self interference arises. The relay does not have packets of its own and the traffic at the source nodes is considered saturated. The relay node stores a source packet that it receives successfully in its queue when the transmission to the destination node has failed. We obtain analytical expressions for the characteristics of the relay's queue (such as arrival and service rate of the relay's queue), the stability condition and the average length of the queue as functions of the probabilities of transmissions, the self interference coefficient and the outage probabilities of the links. We study the impact of the relay node and the self interference coefficient on the throughput per user-source as well as the aggregate throughput.
Ephremides Anthony
Pappas Nikolaos
Traganitis Apostolos
No associations
LandOfFree
Relay-Assisted Multiple Access with Multi-Packet Reception Capability and Simultaneous Transmission and Reception does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Relay-Assisted Multiple Access with Multi-Packet Reception Capability and Simultaneous Transmission and Reception, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Relay-Assisted Multiple Access with Multi-Packet Reception Capability and Simultaneous Transmission and Reception will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-692146