The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Recentemente, uma promissora arquitetura de encaminhamento de pacotes COPE foi proposta para melhorar essencialmente o rendimento de redes sem fio multihop, onde cada nó da rede pode codificar de forma inteligente vários pacotes juntos e encaminhá-los em uma única transmissão. Contudo, o COPE ainda está na sua infância e tem as seguintes limitações: (1) O COPE adopta a programação de pacotes FIFO e, portanto, não fornece prioridades diferentes para diferentes tipos de pacotes. (2) O COPE simplesmente classifica todos os pacotes destinados ao mesmo próximo salto em filas virtuais de tamanho pequeno ou grande e examina apenas o pacote principal de cada fila virtual para encontrar soluções de codificação. Tal estrutura de filas perderá algumas oportunidades potenciais de codificação, porque entre os pacotes destinados ao mesmo próximo salto, no máximo dois pacotes (os pacotes principais das filas de tamanho pequeno e grande) serão examinados no processo de codificação, independentemente do número de filas. fluxos. (3) O algoritmo de codificação adotado no COPE é rápido, mas nem sempre consegue encontrar boas soluções. A fim de abordar as limitações acima, neste artigo apresentamos primeiro uma nova estrutura de filas para COPE, que pode fornecer mais oportunidades potenciais de codificação, e então propomos um novo algoritmo de escalonamento de pacotes para esta estrutura de filas para atribuir diferentes prioridades a diferentes tipos de pacotes. . Finalmente, propomos um algoritmo de codificação eficiente para encontrar pacotes apropriados para codificação. Os resultados da simulação demonstram que esta nova arquitetura COPE pode melhorar ainda mais a eficiência de transmissão do nó.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Kaikai CHI, Xiaohong JIANG, Susumu HORIGUCHI, "A More Efficient COPE Architecture for Network Coding in Multihop Wireless Networks" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 3, pp. 766-775, March 2009, doi: 10.1587/transcom.E92.B.766.
Abstract: Recently, a promising packet forwarding architecture COPE was proposed to essentially improve the throughput of multihop wireless networks, where each network node can intelligently encode multiple packets together and forward them in a single transmission. However, COPE is still in its infancy and has the following limitations: (1) COPE adopts the FIFO packet scheduling and thus does not provide different priorities for different types of packets. (2) COPE simply classifies all packets destined to the same nexthop into small-size or large-size virtual queues and examines only the head packet of each virtual queue to find coding solutions. Such a queueing structure will lose some potential coding opportunities, because among packets destined to the same nexthop at most two packets (the head packets of small-size and large-size queues) will be examined in the coding process, regardless of the number of flows. (3) The coding algorithm adopted in COPE is fast but cannot always find good solutions. In order to address the above limitations, in this paper we first present a new queueing structure for COPE, which can provide more potential coding opportunities, and then propose a new packet scheduling algorithm for this queueing structure to assign different priorities to different types of packets. Finally, we propose an efficient coding algorithm to find appropriate packets for coding. Simulation results demonstrate that this new COPE architecture can further greatly improve the node transmission efficiency.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.766/_p
Copiar
@ARTICLE{e92-b_3_766,
author={Kaikai CHI, Xiaohong JIANG, Susumu HORIGUCHI, },
journal={IEICE TRANSACTIONS on Communications},
title={A More Efficient COPE Architecture for Network Coding in Multihop Wireless Networks},
year={2009},
volume={E92-B},
number={3},
pages={766-775},
abstract={Recently, a promising packet forwarding architecture COPE was proposed to essentially improve the throughput of multihop wireless networks, where each network node can intelligently encode multiple packets together and forward them in a single transmission. However, COPE is still in its infancy and has the following limitations: (1) COPE adopts the FIFO packet scheduling and thus does not provide different priorities for different types of packets. (2) COPE simply classifies all packets destined to the same nexthop into small-size or large-size virtual queues and examines only the head packet of each virtual queue to find coding solutions. Such a queueing structure will lose some potential coding opportunities, because among packets destined to the same nexthop at most two packets (the head packets of small-size and large-size queues) will be examined in the coding process, regardless of the number of flows. (3) The coding algorithm adopted in COPE is fast but cannot always find good solutions. In order to address the above limitations, in this paper we first present a new queueing structure for COPE, which can provide more potential coding opportunities, and then propose a new packet scheduling algorithm for this queueing structure to assign different priorities to different types of packets. Finally, we propose an efficient coding algorithm to find appropriate packets for coding. Simulation results demonstrate that this new COPE architecture can further greatly improve the node transmission efficiency.},
keywords={},
doi={10.1587/transcom.E92.B.766},
ISSN={1745-1345},
month={March},}
Copiar
TY - JOUR
TI - A More Efficient COPE Architecture for Network Coding in Multihop Wireless Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 766
EP - 775
AU - Kaikai CHI
AU - Xiaohong JIANG
AU - Susumu HORIGUCHI
PY - 2009
DO - 10.1587/transcom.E92.B.766
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2009
AB - Recently, a promising packet forwarding architecture COPE was proposed to essentially improve the throughput of multihop wireless networks, where each network node can intelligently encode multiple packets together and forward them in a single transmission. However, COPE is still in its infancy and has the following limitations: (1) COPE adopts the FIFO packet scheduling and thus does not provide different priorities for different types of packets. (2) COPE simply classifies all packets destined to the same nexthop into small-size or large-size virtual queues and examines only the head packet of each virtual queue to find coding solutions. Such a queueing structure will lose some potential coding opportunities, because among packets destined to the same nexthop at most two packets (the head packets of small-size and large-size queues) will be examined in the coding process, regardless of the number of flows. (3) The coding algorithm adopted in COPE is fast but cannot always find good solutions. In order to address the above limitations, in this paper we first present a new queueing structure for COPE, which can provide more potential coding opportunities, and then propose a new packet scheduling algorithm for this queueing structure to assign different priorities to different types of packets. Finally, we propose an efficient coding algorithm to find appropriate packets for coding. Simulation results demonstrate that this new COPE architecture can further greatly improve the node transmission efficiency.
ER -