Research on multiflow in wireless networks based on network coding
In a multihop wireless network,wireless interference is crucial to the multi-commodity flow problem,which studies the maximum throughput between multiple pairs of sources and sinks.Based on the observation that network coding (NC) could help to decrease the impacts of wireless interference,a framewo...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2013-08-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.08.017/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539821348061184 |
|---|---|
| author | Jin-yi ZHOU Shu-tao XIA Yong JIANG Hai-tao ZHENG |
| author_facet | Jin-yi ZHOU Shu-tao XIA Yong JIANG Hai-tao ZHENG |
| author_sort | Jin-yi ZHOU |
| collection | DOAJ |
| description | In a multihop wireless network,wireless interference is crucial to the multi-commodity flow problem,which studies the maximum throughput between multiple pairs of sources and sinks.Based on the observation that network coding (NC) could help to decrease the impacts of wireless interference,a framework was proposed to solve the problem for multihop wireless networks with NC.By introducing hyperarcs to model all possible (uncoded or encoded) transmissions and using the conflict graph of hyperarcs to describe the new conflict relations modified by NC (e.g.,in the protocol interference model),the problem was formulated to compute the maximum throughput of multiple unicast flows supported by the multihop wireless network with given NC settings,in which the constraints were rebuilt from the conflict graph of hyperarcs.Furthermore,a practical algorithm was proposed to collect maximal independent sets,instead of collecting all maximal independent sets in the conflict graph of hyperarcs (which is NP-hard),and some numerical results were illustrated. |
| format | Article |
| id | doaj-art-8dee045aea5c4416984825cd3b8ca07f |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2013-08-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-8dee045aea5c4416984825cd3b8ca07f2025-01-14T06:41:06ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2013-08-013413113959674358Research on multiflow in wireless networks based on network codingJin-yi ZHOUShu-tao XIAYong JIANGHai-tao ZHENGIn a multihop wireless network,wireless interference is crucial to the multi-commodity flow problem,which studies the maximum throughput between multiple pairs of sources and sinks.Based on the observation that network coding (NC) could help to decrease the impacts of wireless interference,a framework was proposed to solve the problem for multihop wireless networks with NC.By introducing hyperarcs to model all possible (uncoded or encoded) transmissions and using the conflict graph of hyperarcs to describe the new conflict relations modified by NC (e.g.,in the protocol interference model),the problem was formulated to compute the maximum throughput of multiple unicast flows supported by the multihop wireless network with given NC settings,in which the constraints were rebuilt from the conflict graph of hyperarcs.Furthermore,a practical algorithm was proposed to collect maximal independent sets,instead of collecting all maximal independent sets in the conflict graph of hyperarcs (which is NP-hard),and some numerical results were illustrated.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.08.017/multihop wireless networkmulti-commodity flow problemmaximum throughputnetwork coding |
| spellingShingle | Jin-yi ZHOU Shu-tao XIA Yong JIANG Hai-tao ZHENG Research on multiflow in wireless networks based on network coding Tongxin xuebao multihop wireless network multi-commodity flow problem maximum throughput network coding |
| title | Research on multiflow in wireless networks based on network coding |
| title_full | Research on multiflow in wireless networks based on network coding |
| title_fullStr | Research on multiflow in wireless networks based on network coding |
| title_full_unstemmed | Research on multiflow in wireless networks based on network coding |
| title_short | Research on multiflow in wireless networks based on network coding |
| title_sort | research on multiflow in wireless networks based on network coding |
| topic | multihop wireless network multi-commodity flow problem maximum throughput network coding |
| url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.08.017/ |
| work_keys_str_mv | AT jinyizhou researchonmultiflowinwirelessnetworksbasedonnetworkcoding AT shutaoxia researchonmultiflowinwirelessnetworksbasedonnetworkcoding AT yongjiang researchonmultiflowinwirelessnetworksbasedonnetworkcoding AT haitaozheng researchonmultiflowinwirelessnetworksbasedonnetworkcoding |