Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks
We study the fundamental lower bound for node buffer size in intermittently connected wireless networks. The intermittent connectivity is caused by the possibility of node inactivity due to some external constraints. We find even with infinite channel capacity and node processing speed, buffer occup...
Uložené v:
| Vydané v: | IEEE transactions on parallel and distributed systems Ročník 24; číslo 4; s. 754 - 766 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
IEEE
01.04.2013
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Predmet: | |
| ISSN: | 1045-9219, 1558-2183 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We study the fundamental lower bound for node buffer size in intermittently connected wireless networks. The intermittent connectivity is caused by the possibility of node inactivity due to some external constraints. We find even with infinite channel capacity and node processing speed, buffer occupation in each node does not approach zero in a static random network where each node keeps a constant message generation rate. Given the condition that each node has the same probability p of being inactive during each time slot, there exists a critical value p c (λ) for this probability from a percolation-based perspective. When p <; p c (λ), the network is in the supercritical case, and there is an achievable lower bound (In our paper, "achievable" means that node buffer size in networks can achieve the same order as the lower bound by applying some transmission scheme) for the occupied buffer size of each node, which is asymptotically independent of the size of the network. If p > p c (λ), the network is in the subcritical case, and there is a tight lower bound Θ(√n) for buffer occupation, where n is the number of nodes in the network. |
|---|---|
| AbstractList | We study the fundamental Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks. The intermittent connectivity is caused by the possibility of node inactivity due to some external constraints. We find even with infinite channel capacity and node processing speed, buffer occupation in each node does not approach zero in a static random network where each node keeps a constant message generation rate. Given the condition that each node has the same probability $(p)$ of being inactive during each time slot, there exists a critical value $(p_c(\lambda ))$ for this probability from a percolation-based perspective. When $(p [less-than] p_c(\lambda ))$, the network is in the supercritical case, and there is an achievable lower bound (In our paper, "achievable" means that node buffer size in networks can achieve the same order as the lower bound by applying some transmission scheme) for the occupied buffer size of each node, which is asymptotically independent of the size of the network. If $(p [greater-than] p_c(\lambda ))$, the network is in the subcritical case, and there is a tight lower bound $(\Theta (\sqrt{n}))$ for buffer occupation, where $(n)$ is the number of nodes in the network. We study the fundamental lower bound for node buffer size in intermittently connected wireless networks. The intermittent connectivity is caused by the possibility of node inactivity due to some external constraints. We find even with infinite channel capacity and node processing speed, buffer occupation in each node does not approach zero in a static random network where each node keeps a constant message generation rate. Given the condition that each node has the same probability p of being inactive during each time slot, there exists a critical value p c (λ) for this probability from a percolation-based perspective. When p <; p c (λ), the network is in the supercritical case, and there is an achievable lower bound (In our paper, "achievable" means that node buffer size in networks can achieve the same order as the lower bound by applying some transmission scheme) for the occupied buffer size of each node, which is asymptotically independent of the size of the network. If p > p c (λ), the network is in the subcritical case, and there is a tight lower bound Θ(√n) for buffer occupation, where n is the number of nodes in the network. We study the fundamental lower bound for node buffer size in intermittently connected wireless networks. The intermittent connectivity is caused by the possibility of node inactivity due to some external constraints. We find even with infinite channel capacity and node processing speed, buffer occupation in each node does not approach zero in a static random network where each node keeps a constant message generation rate. Given the condition that each node has the same probability $(p)$ of being inactive during each time slot, there exists a critical value $(p_c(\lambda ))$ for this probability from a percolation-based perspective. When $(pp_c(\lambda ))$, the network is in the subcritical case, and there is a tight lower bound $(\Theta (\sqrt{n}))$ for buffer occupation, where $(n)$ is the number of nodes in the network. |
| Author | Tuo Yu Xinbing Wang Yuanzhong Xu |
| Author_xml | – sequence: 1 givenname: Xinbing surname: Wang fullname: Wang, Xinbing – sequence: 2 givenname: Tuo surname: Yu fullname: Yu, Tuo – sequence: 3 givenname: Yuanzhong surname: Xu fullname: Xu, Yuanzhong |
| BookMark | eNp1kEtLxDAURoMo-Fy6chNw46Zjnm2zdMYnDKOg4rI06S1EO8mYpAzjr7dlxIXg6j443-VyDtGu8w4QOqVkQilRly9P188TRigbRrWDDqiUZcZoyXeHngiZKUbVPjqM8Z0QKiQRB2gx92sIeOp71-DWB7zwDeBp37bD9tl-AbYOP7gEYWlTApe6DZ5558AkaPCbDdBBjHgBae3DRzxGe23dRTj5qUfo9fbmZXafzR_vHmZX88xwWqZMicLkIhfSaEmMBMiZaqWgtSQFYVI1WgvQusmVNtqwss5bMJq0BTcaasb5EbrY3l0F_9lDTNXSRgNdVzvwfawoF0rIkssRPf-Dvvs-uOG7gcrl4EcUaqD4ljLBxxigrYxNdbLepVDbrqKkGh1Xo-NqdDyMYyr7k1oFu6zD5l_-bMtbAPhlc1qUTCj-DbN3iEE |
| CODEN | ITDSEO |
| CitedBy_id | crossref_primary_10_1016_j_jnca_2013_10_003 crossref_primary_10_1109_JSAC_2018_2872374 crossref_primary_10_1109_TWC_2016_2613077 crossref_primary_10_1016_j_adhoc_2015_08_029 |
| Cites_doi | 10.1214/aop/1176992811 10.1145/863955.863960 10.1109/INFCOM.2010.5462000 10.1145/1374618.1374638 10.1007/978-3-662-03981-6 10.1109/TNET.2007.897964 10.1017/CBO9780511895357 10.1109/TIT.2006.890791 10.1109/TNET.2009.2037497 10.1109/TNET.2007.897962 10.1109/INFCOM.2005.1498538 10.1145/1555349.1555364 10.1145/1530748.1530789 10.1145/1282427.1282422 10.1109/18.825799 10.1093/acprof:oso/9780198506263.001.0001 10.1109/MOBHOC.2006.278570 10.1145/989459.989474 10.1109/INFCOM.2011.5935312 10.1109/ICC.2010.5502218 10.1145/1614222.1614226 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Apr 2013 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Apr 2013 |
| DBID | 97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1109/TPDS.2012.119 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Technology Research Database Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISSN | 1558-2183 |
| EndPage | 766 |
| ExternalDocumentID | 2989220401 10_1109_TPDS_2012_119 6178249 |
| Genre | orig-research |
| GroupedDBID | --Z -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 ICLAB IEDLZ IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNI RNS RZB TN5 TWZ UHB VH1 AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| ID | FETCH-LOGICAL-c318t-947c64645cb50c5ee629f541a5070259dbb4ebbd69bcbc28a6fecb0f73cbea233 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000316223500014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1045-9219 |
| IngestDate | Sat Sep 27 18:42:17 EDT 2025 Sun Nov 30 03:49:53 EST 2025 Tue Nov 18 22:13:16 EST 2025 Sat Nov 29 08:05:25 EST 2025 Wed Aug 27 02:52:21 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c318t-947c64645cb50c5ee629f541a5070259dbb4ebbd69bcbc28a6fecb0f73cbea233 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 content type line 23 |
| PQID | 1365218479 |
| PQPubID | 85437 |
| PageCount | 13 |
| ParticipantIDs | crossref_citationtrail_10_1109_TPDS_2012_119 crossref_primary_10_1109_TPDS_2012_119 proquest_miscellaneous_1349458353 proquest_journals_1365218479 ieee_primary_6178249 |
| PublicationCentury | 2000 |
| PublicationDate | 2013-04-01 |
| PublicationDateYYYYMMDD | 2013-04-01 |
| PublicationDate_xml | – month: 04 year: 2013 text: 2013-04-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on parallel and distributed systems |
| PublicationTitleAbbrev | TPDS |
| PublicationYear | 2013 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref12 ref15 ref14 ref20 ref10 ref21 ref2 ref1 ref17 Grimmett (ref13) 1999 ref16 ref19 ref18 ref8 ref7 Herdtner (ref11) ref9 ref4 ref3 ref6 ref5 |
| References_xml | – ident: ref16 doi: 10.1214/aop/1176992811 – ident: ref2 doi: 10.1145/863955.863960 – ident: ref18 doi: 10.1109/INFCOM.2010.5462000 – ident: ref10 doi: 10.1145/1374618.1374638 – volume-title: Percolaiton year: 1999 ident: ref13 doi: 10.1007/978-3-662-03981-6 – ident: ref7 doi: 10.1109/TNET.2007.897964 – ident: ref14 doi: 10.1017/CBO9780511895357 – ident: ref17 doi: 10.1109/TIT.2006.890791 – ident: ref20 doi: 10.1109/TNET.2009.2037497 – ident: ref6 doi: 10.1109/TNET.2007.897962 – volume-title: IEEE INFOCOM ident: ref11 article-title: Throughput-Storage Tradeoff in Ad Hoc Networks doi: 10.1109/INFCOM.2005.1498538 – ident: ref12 doi: 10.1145/1555349.1555364 – ident: ref19 doi: 10.1145/1530748.1530789 – ident: ref3 doi: 10.1145/1282427.1282422 – ident: ref1 doi: 10.1109/18.825799 – ident: ref15 doi: 10.1093/acprof:oso/9780198506263.001.0001 – ident: ref5 doi: 10.1109/MOBHOC.2006.278570 – ident: ref8 doi: 10.1145/989459.989474 – ident: ref21 doi: 10.1109/INFCOM.2011.5935312 – ident: ref9 doi: 10.1109/ICC.2010.5502218 – ident: ref4 doi: 10.1145/1614222.1614226 |
| SSID | ssj0014504 |
| Score | 2.0629325 |
| Snippet | We study the fundamental lower bound for node buffer size in intermittently connected wireless networks. The intermittent connectivity is caused by the... We study the fundamental Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks. The intermittent connectivity is caused by the... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 754 |
| SubjectTerms | Algorithms Asymptotic properties Buffer size Buffers Channel capacity Computer networks Delay Heuristic Lower bounds Messages Networks Occupation Routing Studies Throughput Transmitters Wireless networks Wireless sensor networks |
| Title | Lower Bound for Node Buffer Size in Intermittently Connected Wireless Networks |
| URI | https://ieeexplore.ieee.org/document/6178249 https://www.proquest.com/docview/1365218479 https://www.proquest.com/docview/1349458353 |
| Volume | 24 |
| WOSCitedRecordID | wos000316223500014&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE/IET Electronic Library customDbUrl: eissn: 1558-2183 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014504 issn: 1045-9219 databaseCode: RIE dateStart: 19900101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fT9swED4B2gM8DFZAlMHkSRNPBNL8cvy4bkN7qCIkCuItii8XqVJJEU0nbX89d24ahoAHnpLIJyvy-ew73-f7AL6xfemB5clL7uimSGMvNRh6xi8rH7FKIkcHdDPSWZbe3prLNTjt7sIQkQOf0Zm8ulx-OcOFHJWdy3U2DhfWYV1rvbyr1WUMothRBXJ0EXuGzfCpnub5-PLnlYC4Av40z_YfR6jyYhV2W8vF9vt-agc-ti6k-r7U-SdYo7oH2yt6BtVaaw-2_qs1uAvZSPjQ1FBolBR7qiqblaSGC-FHUVeTf6QmtXLng3eThh3pZvpXORQMsk-qBCQ75UVRZUvY-HwPri9-jX_89loyBQ_ZbBvPRBoTSWOijX2MiZLAVHE0KNghZL_HlNZGZG2ZGIsWg7RIKkLrVzpES0UQhvuwUc9qOgA1SEhT6gdVwf2V5cBgYkoTYcRPEwdFH05XQ5xjW2lcCC-muYs4fJOLRnLRCH-aPpx04vfLEhtvCe7K8HdC7cj34Wilv7w1wHku6D2JXjU3f-2a2XQkH1LUNFuITGQkbRyHh6_3_Bk2A8d-IUCdI9hoHhZ0DB_wTzOZP3xx8-8R7zvZEg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fb9QwDLbGQAIeNthAOzYgSIindeuPpG0eN2Aa4qgm7UB7qxrXlU46etOuhwR_PXau14GAB57aKlZUxXFix1_8Abxm-8oix5OX_NFNlZsgt5gENqybELFJtacD-jLOiiK_urIXG3A43IUhIg8-oyN59bn8eo5LOSo7lutsHC7cgbtG6zha3dYacgbaeLJAji9MYNkQbytqHk8u3l0KjCvmT_vbDuQpVf5Yh_3mcrb9f7_1CLZ6J1KdrLT-GDao3YHtNUGD6u11Bx7-Um1wF4qxMKKpUyFSUuyrqmJekzpdCkOKupz-IDVtlT8h_Drt2JXuZt-Vx8Ege6VKYLIzXhZVsQKOL57A57P3k7fnQU-nECAbbhdYnWEqiUx0JkRDlMa2MTqq2CVkz8fWzmlyrk6tQ4dxXqUNoQubLEFHVZwkT2Gznbe0BypKKaM8jJuK-6vryGJqa6tR89OauBrB4XqIS-xrjQvlxaz0MUdoS9FIKRrhTzuCN4P49arIxr8Ed2X4B6F-5EdwsNZf2ZvgohT8nsSvGTe_GprZeCQjUrU0X4qMtpI4Nsmzv_f8Eu6fTz6Ny_GH4uM-PIg9F4bAdg5gs7tZ0nO4h9-66eLmhZ-LPwFes9xZ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Lower+Bound+for+Node+Buffer+Size+in+Intermittently+Connected+Wireless+Networks&rft.jtitle=IEEE+transactions+on+parallel+and+distributed+systems&rft.au=Wang%2C+Xinbing&rft.au=Yu%2C+Tuo&rft.au=Xu%2C+Yuanzhong&rft.date=2013-04-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1045-9219&rft.eissn=1558-2183&rft.volume=24&rft.issue=4&rft.spage=754&rft_id=info:doi/10.1109%2FTPDS.2012.119&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=2989220401 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1045-9219&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1045-9219&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1045-9219&client=summon |