Maximum flow and network capacity of network coding for ad-hoc networks
Network coding is an effective way to achieve the maximum flow of multicast networks. In this letter, we focus on the statistical properties of the maximum flow or the capacity of network coding for ad-hoc networks based on random graph models. Theoretical analysis shows that the maximum flow can be...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on wireless communications 2007-12, Vol.6 (12), p.4193-4198 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 4198 |
---|---|
container_issue | 12 |
container_start_page | 4193 |
container_title | IEEE transactions on wireless communications |
container_volume | 6 |
creator | Hongzheng Wang Pingyi Fan Ben Letaief, K. |
description | Network coding is an effective way to achieve the maximum flow of multicast networks. In this letter, we focus on the statistical properties of the maximum flow or the capacity of network coding for ad-hoc networks based on random graph models. Theoretical analysis shows that the maximum flow can be modelled as extreme order statistics of Gaussian distribution for both wired and wireless ad-hoc networks as the node number is relatively large under a certain condition. We also investigate the effects of the nodes' covering capabilities on the capacity of network coding. |
doi_str_mv | 10.1109/TWC.2007.05499 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_4400781</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4400781</ieee_id><sourcerecordid>2336196211</sourcerecordid><originalsourceid>FETCH-LOGICAL-c477t-f79e5ca88da1782d58bb67b383b19b09d5811cb1ddaf07e54c336dea7550efb63</originalsourceid><addsrcrecordid>eNqFkb1PwzAQxSMEEqWwsrBESMCUYMffI6qgIBWxFDFajmNDShIXO1Hpf09CC0gMMN3p3u-e7vSi6BiCFEIgLudPkzQDgKWAYCF2ohEkhCdZhvnu0COawIzR_egghAUAkFFCRtH0Xr2XdVfHtnKrWDVF3Jh25fxrrNVS6bJdx87-zFxRNs-xdT5WRfLi9JcSDqM9q6pgjrZ1HD3eXM8nt8nsYXo3uZolGjPWJpYJQ7TivFCQ8awgPM8pyxFHORQ5EP0AQp3DolAWMEOwRogWRjFCgLE5RePoYuO79O6tM6GVdRm0qSrVGNcFKQCiGIqM_UtyDijDCJGePP-TRBhnnGPYg6e_wIXrfNP_KznFhGMEUA-lG0h7F4I3Vi59WSu_lhDIISjZByWHoORnUP3C2dZVBa0q61Wjy_CzJbhAiA1nnmy40hjzLWPcO3GIPgDQ2Zpy</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>864584303</pqid></control><display><type>article</type><title>Maximum flow and network capacity of network coding for ad-hoc networks</title><source>IEEE Electronic Library (IEL)</source><creator>Hongzheng Wang ; Pingyi Fan ; Ben Letaief, K.</creator><creatorcontrib>Hongzheng Wang ; Pingyi Fan ; Ben Letaief, K.</creatorcontrib><description>Network coding is an effective way to achieve the maximum flow of multicast networks. In this letter, we focus on the statistical properties of the maximum flow or the capacity of network coding for ad-hoc networks based on random graph models. Theoretical analysis shows that the maximum flow can be modelled as extreme order statistics of Gaussian distribution for both wired and wireless ad-hoc networks as the node number is relatively large under a certain condition. We also investigate the effects of the nodes' covering capabilities on the capacity of network coding.</description><identifier>ISSN: 1536-1276</identifier><identifier>EISSN: 1558-2248</identifier><identifier>DOI: 10.1109/TWC.2007.05499</identifier><identifier>CODEN: ITWCAX</identifier><language>eng</language><publisher>Piscataway, NJ: IEEE</publisher><subject>Ad hoc networks ; Applied sciences ; Coding ; Exact sciences and technology ; Extreme values ; Gaussian distribution ; Graphs ; Multicast ; Network coding ; Networks ; Normal distribution ; Probability ; Solid modeling ; Statistical analysis ; Statistical distributions ; Statistics ; Systems, networks and services of telecommunications ; Telecommunications ; Telecommunications and information theory ; Transmission and modulation (techniques and equipments) ; Unicast ; Wireless communication ; Wireless networks</subject><ispartof>IEEE transactions on wireless communications, 2007-12, Vol.6 (12), p.4193-4198</ispartof><rights>2008 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2007</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c477t-f79e5ca88da1782d58bb67b383b19b09d5811cb1ddaf07e54c336dea7550efb63</citedby><cites>FETCH-LOGICAL-c477t-f79e5ca88da1782d58bb67b383b19b09d5811cb1ddaf07e54c336dea7550efb63</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4400781$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,777,781,793,27905,27906,54739</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4400781$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19893375$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Hongzheng Wang</creatorcontrib><creatorcontrib>Pingyi Fan</creatorcontrib><creatorcontrib>Ben Letaief, K.</creatorcontrib><title>Maximum flow and network capacity of network coding for ad-hoc networks</title><title>IEEE transactions on wireless communications</title><addtitle>TWC</addtitle><description>Network coding is an effective way to achieve the maximum flow of multicast networks. In this letter, we focus on the statistical properties of the maximum flow or the capacity of network coding for ad-hoc networks based on random graph models. Theoretical analysis shows that the maximum flow can be modelled as extreme order statistics of Gaussian distribution for both wired and wireless ad-hoc networks as the node number is relatively large under a certain condition. We also investigate the effects of the nodes' covering capabilities on the capacity of network coding.</description><subject>Ad hoc networks</subject><subject>Applied sciences</subject><subject>Coding</subject><subject>Exact sciences and technology</subject><subject>Extreme values</subject><subject>Gaussian distribution</subject><subject>Graphs</subject><subject>Multicast</subject><subject>Network coding</subject><subject>Networks</subject><subject>Normal distribution</subject><subject>Probability</subject><subject>Solid modeling</subject><subject>Statistical analysis</subject><subject>Statistical distributions</subject><subject>Statistics</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Transmission and modulation (techniques and equipments)</subject><subject>Unicast</subject><subject>Wireless communication</subject><subject>Wireless networks</subject><issn>1536-1276</issn><issn>1558-2248</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqFkb1PwzAQxSMEEqWwsrBESMCUYMffI6qgIBWxFDFajmNDShIXO1Hpf09CC0gMMN3p3u-e7vSi6BiCFEIgLudPkzQDgKWAYCF2ohEkhCdZhvnu0COawIzR_egghAUAkFFCRtH0Xr2XdVfHtnKrWDVF3Jh25fxrrNVS6bJdx87-zFxRNs-xdT5WRfLi9JcSDqM9q6pgjrZ1HD3eXM8nt8nsYXo3uZolGjPWJpYJQ7TivFCQ8awgPM8pyxFHORQ5EP0AQp3DolAWMEOwRogWRjFCgLE5RePoYuO79O6tM6GVdRm0qSrVGNcFKQCiGIqM_UtyDijDCJGePP-TRBhnnGPYg6e_wIXrfNP_KznFhGMEUA-lG0h7F4I3Vi59WSu_lhDIISjZByWHoORnUP3C2dZVBa0q61Wjy_CzJbhAiA1nnmy40hjzLWPcO3GIPgDQ2Zpy</recordid><startdate>20071201</startdate><enddate>20071201</enddate><creator>Hongzheng Wang</creator><creator>Pingyi Fan</creator><creator>Ben Letaief, K.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20071201</creationdate><title>Maximum flow and network capacity of network coding for ad-hoc networks</title><author>Hongzheng Wang ; Pingyi Fan ; Ben Letaief, K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c477t-f79e5ca88da1782d58bb67b383b19b09d5811cb1ddaf07e54c336dea7550efb63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Ad hoc networks</topic><topic>Applied sciences</topic><topic>Coding</topic><topic>Exact sciences and technology</topic><topic>Extreme values</topic><topic>Gaussian distribution</topic><topic>Graphs</topic><topic>Multicast</topic><topic>Network coding</topic><topic>Networks</topic><topic>Normal distribution</topic><topic>Probability</topic><topic>Solid modeling</topic><topic>Statistical analysis</topic><topic>Statistical distributions</topic><topic>Statistics</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Transmission and modulation (techniques and equipments)</topic><topic>Unicast</topic><topic>Wireless communication</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hongzheng Wang</creatorcontrib><creatorcontrib>Pingyi Fan</creatorcontrib><creatorcontrib>Ben Letaief, K.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on wireless communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hongzheng Wang</au><au>Pingyi Fan</au><au>Ben Letaief, K.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Maximum flow and network capacity of network coding for ad-hoc networks</atitle><jtitle>IEEE transactions on wireless communications</jtitle><stitle>TWC</stitle><date>2007-12-01</date><risdate>2007</risdate><volume>6</volume><issue>12</issue><spage>4193</spage><epage>4198</epage><pages>4193-4198</pages><issn>1536-1276</issn><eissn>1558-2248</eissn><coden>ITWCAX</coden><abstract>Network coding is an effective way to achieve the maximum flow of multicast networks. In this letter, we focus on the statistical properties of the maximum flow or the capacity of network coding for ad-hoc networks based on random graph models. Theoretical analysis shows that the maximum flow can be modelled as extreme order statistics of Gaussian distribution for both wired and wireless ad-hoc networks as the node number is relatively large under a certain condition. We also investigate the effects of the nodes' covering capabilities on the capacity of network coding.</abstract><cop>Piscataway, NJ</cop><pub>IEEE</pub><doi>10.1109/TWC.2007.05499</doi><tpages>6</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1536-1276 |
ispartof | IEEE transactions on wireless communications, 2007-12, Vol.6 (12), p.4193-4198 |
issn | 1536-1276 1558-2248 |
language | eng |
recordid | cdi_ieee_primary_4400781 |
source | IEEE Electronic Library (IEL) |
subjects | Ad hoc networks Applied sciences Coding Exact sciences and technology Extreme values Gaussian distribution Graphs Multicast Network coding Networks Normal distribution Probability Solid modeling Statistical analysis Statistical distributions Statistics Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) Unicast Wireless communication Wireless networks |
title | Maximum flow and network capacity of network coding for ad-hoc networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T02%3A34%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Maximum%20flow%20and%20network%20capacity%20of%20network%20coding%20for%20ad-hoc%20networks&rft.jtitle=IEEE%20transactions%20on%20wireless%20communications&rft.au=Hongzheng%20Wang&rft.date=2007-12-01&rft.volume=6&rft.issue=12&rft.spage=4193&rft.epage=4198&rft.pages=4193-4198&rft.issn=1536-1276&rft.eissn=1558-2248&rft.coden=ITWCAX&rft_id=info:doi/10.1109/TWC.2007.05499&rft_dat=%3Cproquest_RIE%3E2336196211%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=864584303&rft_id=info:pmid/&rft_ieee_id=4400781&rfr_iscdi=true |