http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Link-Level Performance of Cooperative Multi-Hop Relaying Networks with MDS Codes
Sakakibara, Katsumi,Ito, Daichi,Taketsugu, Jumpei The Korea Institute of Information and Commucation 2011 Journal of communications and networks Vol.13 No.4
We evaluate the link-level performance of cooperative multi-hop relaying networks with an maximum distance separable (MDS) code. The effect of the code on the link-level performance at the destination is investigated in terms of the outage probability and the spectral efficiency. Assuming a simple topology, we construct an absorbing Markov chain. Numerical results indicate that significant improvement can be achieved by incorporating an MDS code. MDS codes successfully facilitate recovery of the message block at a relaying node due to powerful error-correcting capability, so that it can reduce the outage probability. Furthermore, we evaluate the average number of hops where the message block can be delivered.
Sakakibara, Katsumi,Taketsugu, Jumpei The Korea Institute of Information and Commucation 2010 Journal of communications and networks Vol.12 No.1
IEEE 802.11 defines distributed coordination function (DCF), which is characterized by CSMA/CA and binary exponential backoff (BEB) algorithm. Most modifications on DCF so far have focused on updating of the contention window (CW) size depending on the outcome of own frame transmission without considering freezing periods experienced in the backoff interval. We propose two simple but novel schemes which effectively utilize the number of freezing periods sensed during the current backoff interval. The proposed schemes can be applied to DCF and its family, such as double increment double decrement (DIDD). Saturation throughput of the proposed schemes is analyzed by means of Bianchi's Markovian model. Computer simulation validates the accuracy of the analysis. Numerical results based on IEEE 802.11b show that up to about 20% improvement of saturation throughput can be achieved by combining the proposed scheme with conventional schemes when applied to the basic access procedure.
Katsumi Sakakibara,Jumpei Taketsugu 한국통신학회 2010 Journal of communications and networks Vol.12 No.1
IEEE 802.11 defines distributed coordination function (DCF), which is characterized by CSMA/CA and binary exponential backoff (BEB) algorithm. Most modifications on DCF so far have focused on updating of the contention window (CW) size depending on the outcome of own frame transmission without considering freezing periods experienced in the backoff interval. We propose two simple but novel schemes which effectively utilize the number of freezing periods sensed during the current backoff interval. The proposed schemes can be applied to DCF and its family,such as double increment double decrement (DIDD). Saturation throughput of the proposed schemes is analyzed by means of Bianchi’s Markovianmodel. Computer simulation validates the accuracy of the analysis. Numerical results based on IEEE 802.11b show that up to about 20% improvement of saturation throughput can be achieved by combining the proposed scheme with conventional schemes when applied to the basic access procedure.
Link-Level Performance of Cooperative Multi-Hop Relaying Networks with MDS Codes
Katsumi Sakakibara,Daichi Ito,Jumpei Taketsugu 한국통신학회 2011 Journal of communications and networks Vol.13 No.4
We evaluate the link-level performance of cooperative multi-hop relaying networks with an maximum distance separable (MDS) code. The effect of the code on the link-level performance at the destination is investigated in terms of the outage probability and the spectral efficiency. Assuming a simple topology, we con-struct an absorbing Markov chain. Numerical results indicate that significant improvement can be achieved by incorporating an MDS code. MDS codes successfully facilitate recovery of the message block at a relaying node due to powerful error-correcting capabil-ity, so that it can reduce the outage probability. Furthermore, we evaluate the average number of hops where the message block can be delivered.