Opportunistic network coding based on prediction
Since pure theory network coding had some drawbacks in practical network,however current opportunistic network coding fully depends on overheard information.Thus,in a radically different way from network coding optimization,a novel opportunistic network coding scheme was proposed which was based on...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2013-04-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.04.005/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539796494712832 |
|---|---|
| author | Wai-xi LIU Shun-zheng YU Ying GAO Xiao HU |
| author_facet | Wai-xi LIU Shun-zheng YU Ying GAO Xiao HU |
| author_sort | Wai-xi LIU |
| collection | DOAJ |
| description | Since pure theory network coding had some drawbacks in practical network,however current opportunistic network coding fully depends on overheard information.Thus,in a radically different way from network coding optimization,a novel opportunistic network coding scheme was proposed which was based on prediction (ONCP).The main idea of ONCP was firstly,arrival time of next packet in a node was predicted for the self-similarity of network traffic;:secondly,encoding time,waiting time for coding,transmission time and other factors were taken into account together to determine whether this packet was coded in this node.A theorem—maximum waiting time for was proved network coding in order to obtain throughput gain.Simulation results show that ONCP improves throughput by 15% compared to pure theory network coding and by 21% compared to traditional store-forward.ONCP can also effectively reduce energy consumption while improving throughput. |
| format | Article |
| id | doaj-art-36112ff549f34b0c8b028309629d11fa |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2013-04-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-36112ff549f34b0c8b028309629d11fa2025-01-14T06:34:58ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2013-04-0134364659671262Opportunistic network coding based on predictionWai-xi LIUShun-zheng YUYing GAOXiao HUSince pure theory network coding had some drawbacks in practical network,however current opportunistic network coding fully depends on overheard information.Thus,in a radically different way from network coding optimization,a novel opportunistic network coding scheme was proposed which was based on prediction (ONCP).The main idea of ONCP was firstly,arrival time of next packet in a node was predicted for the self-similarity of network traffic;:secondly,encoding time,waiting time for coding,transmission time and other factors were taken into account together to determine whether this packet was coded in this node.A theorem—maximum waiting time for was proved network coding in order to obtain throughput gain.Simulation results show that ONCP improves throughput by 15% compared to pure theory network coding and by 21% compared to traditional store-forward.ONCP can also effectively reduce energy consumption while improving throughput.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.04.005/opportunistic network codingpredictionthroughputmaximum waiting timeEMD |
| spellingShingle | Wai-xi LIU Shun-zheng YU Ying GAO Xiao HU Opportunistic network coding based on prediction Tongxin xuebao opportunistic network coding prediction throughput maximum waiting time EMD |
| title | Opportunistic network coding based on prediction |
| title_full | Opportunistic network coding based on prediction |
| title_fullStr | Opportunistic network coding based on prediction |
| title_full_unstemmed | Opportunistic network coding based on prediction |
| title_short | Opportunistic network coding based on prediction |
| title_sort | opportunistic network coding based on prediction |
| topic | opportunistic network coding prediction throughput maximum waiting time EMD |
| url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.04.005/ |
| work_keys_str_mv | AT waixiliu opportunisticnetworkcodingbasedonprediction AT shunzhengyu opportunisticnetworkcodingbasedonprediction AT yinggao opportunisticnetworkcodingbasedonprediction AT xiaohu opportunisticnetworkcodingbasedonprediction |