IEICE TRANSACTIONS on Communications
A More Efficient COPE Architecture for Network Coding in Multihop Wireless Networks
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E92-B No.3 pp.766-775
- Publication Date
- 2009/03/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E92.B.766
- Type of Manuscript
- Special Section PAPER (Special Section on Ad Hoc and Mesh Networking for Next Generation Access Systems)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
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
Copy
@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},}
Copy
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 -
English
