On the scalability of ad hoc networks: a traffic analysis at the center of a network
We investigate the inherent scalability problem of ad hoc networks that originated from the nature of multi-hop networks. First, the expected packet traffic at the center of a network is analyzed. The result shows that the expected packet traffic at the center of a network is linearly related with t...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1033 Vol.2 |
|---|---|
| container_issue | |
| container_start_page | 1030 |
| container_title | |
| container_volume | 2 |
| creator | Byung-Jae Kwak Nah-Oak Song Miller, L.E. |
| description | We investigate the inherent scalability problem of ad hoc networks that originated from the nature of multi-hop networks. First, the expected packet traffic at the center of a network is analyzed. The result shows that the expected packet traffic at the center of a network is linearly related with the network size, that is, the expected packet traffic at the center of a network is O(k), where k is the radius of a network. From the result, the upper bound of the diameter of a network D = 2k, that guarantees the network is scalable, is obtained. The upper hound is given by C/r - 1, where C is the channel capacity available to each node and r is the packet arrival rate at each node. |
| doi_str_mv | 10.1109/WCNC.2004.1311329 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_6IE</sourceid><recordid>TN_cdi_pascalfrancis_primary_18162247</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1311329</ieee_id><sourcerecordid>18162247</sourcerecordid><originalsourceid>FETCH-LOGICAL-i118t-2b531cf8b7aae3ebd4d6dd318408565edfa038c0fce384383ec8370a6d9bff7e3</originalsourceid><addsrcrecordid>eNpFkM1Lw0AQxRc_wFr7B4iXvXhM3dmPZONNQv2AYi8Vj2WyO0tXY1qyAel_b9oqwsAc3u8N8x5j1yCmAKK8e69eq6kUQk9BAShZnrARGGMzmYM8ZZOysGIYZZXW5dlekyZTBuCCXab0IYQURusRWy5a3q-JJ4cN1rGJ_Y5vAkfP1xvHW-q_N91nuufI-w5DiI5ji80uxcSxPzgdtT11B9Mff8XOAzaJJr97zN4eZ8vqOZsvnl6qh3kWAWyfydoocMHWBSIpqr32ufcKrBbW5IZ8wCGAE8GRsnqIQs6qQmDuyzqEgtSY3R7vbnH_f-iwdTGttl38wm63Agu5lLoYuJsjF4noXz4Wp34As_VfYQ</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>On the scalability of ad hoc networks: a traffic analysis at the center of a network</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Byung-Jae Kwak ; Nah-Oak Song ; Miller, L.E.</creator><creatorcontrib>Byung-Jae Kwak ; Nah-Oak Song ; Miller, L.E.</creatorcontrib><description>We investigate the inherent scalability problem of ad hoc networks that originated from the nature of multi-hop networks. First, the expected packet traffic at the center of a network is analyzed. The result shows that the expected packet traffic at the center of a network is linearly related with the network size, that is, the expected packet traffic at the center of a network is O(k), where k is the radius of a network. From the result, the upper bound of the diameter of a network D = 2k, that guarantees the network is scalable, is obtained. The upper hound is given by C/r - 1, where C is the channel capacity available to each node and r is the packet arrival rate at each node.</description><identifier>ISSN: 1525-3511</identifier><identifier>ISBN: 9780780383449</identifier><identifier>ISBN: 0780383443</identifier><identifier>EISSN: 1558-2612</identifier><identifier>DOI: 10.1109/WCNC.2004.1311329</identifier><language>eng</language><publisher>Piscataway NJ: IEEE</publisher><subject>Ad hoc networks ; Applied sciences ; Exact sciences and technology ; Large-scale systems ; Mobile communication ; NIST ; Relays ; Routing protocols ; Scalability ; Spread spectrum communication ; Systems, networks and services of telecommunications ; Telecommunication traffic ; Telecommunications ; Telecommunications and information theory ; Teletraffic ; Transmission and modulation (techniques and equipments) ; Upper bound</subject><ispartof>2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733), 2004, Vol.2, p.1030-1033 Vol.2</ispartof><rights>2006 INIST-CNRS</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1311329$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1311329$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18162247$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Byung-Jae Kwak</creatorcontrib><creatorcontrib>Nah-Oak Song</creatorcontrib><creatorcontrib>Miller, L.E.</creatorcontrib><title>On the scalability of ad hoc networks: a traffic analysis at the center of a network</title><title>2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733)</title><addtitle>WCNC</addtitle><description>We investigate the inherent scalability problem of ad hoc networks that originated from the nature of multi-hop networks. First, the expected packet traffic at the center of a network is analyzed. The result shows that the expected packet traffic at the center of a network is linearly related with the network size, that is, the expected packet traffic at the center of a network is O(k), where k is the radius of a network. From the result, the upper bound of the diameter of a network D = 2k, that guarantees the network is scalable, is obtained. The upper hound is given by C/r - 1, where C is the channel capacity available to each node and r is the packet arrival rate at each node.</description><subject>Ad hoc networks</subject><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Large-scale systems</subject><subject>Mobile communication</subject><subject>NIST</subject><subject>Relays</subject><subject>Routing protocols</subject><subject>Scalability</subject><subject>Spread spectrum communication</subject><subject>Systems, networks and services of telecommunications</subject><subject>Telecommunication traffic</subject><subject>Telecommunications</subject><subject>Telecommunications and information theory</subject><subject>Teletraffic</subject><subject>Transmission and modulation (techniques and equipments)</subject><subject>Upper bound</subject><issn>1525-3511</issn><issn>1558-2612</issn><isbn>9780780383449</isbn><isbn>0780383443</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFkM1Lw0AQxRc_wFr7B4iXvXhM3dmPZONNQv2AYi8Vj2WyO0tXY1qyAel_b9oqwsAc3u8N8x5j1yCmAKK8e69eq6kUQk9BAShZnrARGGMzmYM8ZZOysGIYZZXW5dlekyZTBuCCXab0IYQURusRWy5a3q-JJ4cN1rGJ_Y5vAkfP1xvHW-q_N91nuufI-w5DiI5ji80uxcSxPzgdtT11B9Mff8XOAzaJJr97zN4eZ8vqOZsvnl6qh3kWAWyfydoocMHWBSIpqr32ufcKrBbW5IZ8wCGAE8GRsnqIQs6qQmDuyzqEgtSY3R7vbnH_f-iwdTGttl38wm63Agu5lLoYuJsjF4noXz4Wp34As_VfYQ</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Byung-Jae Kwak</creator><creator>Nah-Oak Song</creator><creator>Miller, L.E.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>On the scalability of ad hoc networks: a traffic analysis at the center of a network</title><author>Byung-Jae Kwak ; Nah-Oak Song ; Miller, L.E.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i118t-2b531cf8b7aae3ebd4d6dd318408565edfa038c0fce384383ec8370a6d9bff7e3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Ad hoc networks</topic><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Large-scale systems</topic><topic>Mobile communication</topic><topic>NIST</topic><topic>Relays</topic><topic>Routing protocols</topic><topic>Scalability</topic><topic>Spread spectrum communication</topic><topic>Systems, networks and services of telecommunications</topic><topic>Telecommunication traffic</topic><topic>Telecommunications</topic><topic>Telecommunications and information theory</topic><topic>Teletraffic</topic><topic>Transmission and modulation (techniques and equipments)</topic><topic>Upper bound</topic><toplevel>online_resources</toplevel><creatorcontrib>Byung-Jae Kwak</creatorcontrib><creatorcontrib>Nah-Oak Song</creatorcontrib><creatorcontrib>Miller, L.E.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Byung-Jae Kwak</au><au>Nah-Oak Song</au><au>Miller, L.E.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>On the scalability of ad hoc networks: a traffic analysis at the center of a network</atitle><btitle>2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733)</btitle><stitle>WCNC</stitle><date>2004</date><risdate>2004</risdate><volume>2</volume><spage>1030</spage><epage>1033 Vol.2</epage><pages>1030-1033 Vol.2</pages><issn>1525-3511</issn><eissn>1558-2612</eissn><isbn>9780780383449</isbn><isbn>0780383443</isbn><abstract>We investigate the inherent scalability problem of ad hoc networks that originated from the nature of multi-hop networks. First, the expected packet traffic at the center of a network is analyzed. The result shows that the expected packet traffic at the center of a network is linearly related with the network size, that is, the expected packet traffic at the center of a network is O(k), where k is the radius of a network. From the result, the upper bound of the diameter of a network D = 2k, that guarantees the network is scalable, is obtained. The upper hound is given by C/r - 1, where C is the channel capacity available to each node and r is the packet arrival rate at each node.</abstract><cop>Piscataway NJ</cop><pub>IEEE</pub><doi>10.1109/WCNC.2004.1311329</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1525-3511 |
| ispartof | 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733), 2004, Vol.2, p.1030-1033 Vol.2 |
| issn | 1525-3511 1558-2612 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_18162247 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Ad hoc networks Applied sciences Exact sciences and technology Large-scale systems Mobile communication NIST Relays Routing protocols Scalability Spread spectrum communication Systems, networks and services of telecommunications Telecommunication traffic Telecommunications Telecommunications and information theory Teletraffic Transmission and modulation (techniques and equipments) Upper bound |
| title | On the scalability of ad hoc networks: a traffic analysis at the center of a network |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T10%3A17%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=On%20the%20scalability%20of%20ad%20hoc%20networks:%20a%20traffic%20analysis%20at%20the%20center%20of%20a%20network&rft.btitle=2004%20IEEE%20Wireless%20Communications%20and%20Networking%20Conference%20(IEEE%20Cat.%20No.04TH8733)&rft.au=Byung-Jae%20Kwak&rft.date=2004&rft.volume=2&rft.spage=1030&rft.epage=1033%20Vol.2&rft.pages=1030-1033%20Vol.2&rft.issn=1525-3511&rft.eissn=1558-2612&rft.isbn=9780780383449&rft.isbn_list=0780383443&rft_id=info:doi/10.1109/WCNC.2004.1311329&rft_dat=%3Cpascalfrancis_6IE%3E18162247%3C/pascalfrancis_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1311329&rfr_iscdi=true |