Distributed CSMA with pairwise coding

We consider distributed strategies for joint routing, scheduling, and network coding to maximize throughput in wireless networks. Network coding allows for an increase in network throughput under certain routing conditions. We previously developed a centralized control policy to jointly optimize for...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2013 Proceedings IEEE INFOCOM s. 2094 - 2102
Hlavní autoři: Jones, Nathaniel M., Shrader, Brooke, Modiano, Eytan
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.04.2013
Témata:
Encoding
Multiaccess communication
Network coding
Routing
Throughput
Wireless networks
ISBN:9781467359443, 1467359440
ISSN:0743-166X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract We consider distributed strategies for joint routing, scheduling, and network coding to maximize throughput in wireless networks. Network coding allows for an increase in network throughput under certain routing conditions. We previously developed a centralized control policy to jointly optimize for routing and scheduling combined with a simple network coding strategy using max-weight scheduling (MWS) [9]. In this work we focus on pairwise network coding and develop a distributed carrier sense multiple access (CSMA) policy that supports all arrival rates allowed by the network subject to the pairwise coding constraint. We extend our scheme to optimize for packet overhearing to increase the number of beneficial coding opportunities. Simulation results show that the CSMA strategy yields the same throughput as the optimal centralized policy of [9], but at the cost of increased delay. Moreover, overhearing provides up to an additional 25% increase in throughput on random topologies.
AbstractList We consider distributed strategies for joint routing, scheduling, and network coding to maximize throughput in wireless networks. Network coding allows for an increase in network throughput under certain routing conditions. We previously developed a centralized control policy to jointly optimize for routing and scheduling combined with a simple network coding strategy using max-weight scheduling (MWS) [9]. In this work we focus on pairwise network coding and develop a distributed carrier sense multiple access (CSMA) policy that supports all arrival rates allowed by the network subject to the pairwise coding constraint. We extend our scheme to optimize for packet overhearing to increase the number of beneficial coding opportunities. Simulation results show that the CSMA strategy yields the same throughput as the optimal centralized policy of [9], but at the cost of increased delay. Moreover, overhearing provides up to an additional 25% increase in throughput on random topologies.
Author Jones, Nathaniel M.
Modiano, Eytan
Shrader, Brooke
Author_xml – sequence: 1
  givenname: Nathaniel M.
  surname: Jones
  fullname: Jones, Nathaniel M.
  organization: Massachusetts Inst. of Technol., Cambridge, MA, USA
– sequence: 2
  givenname: Brooke
  surname: Shrader
  fullname: Shrader, Brooke
  organization: Lincoln Lab., Massachusetts Inst. of Technol., Lexington, MA, USA
– sequence: 3
  givenname: Eytan
  surname: Modiano
  fullname: Modiano, Eytan
  organization: Massachusetts Inst. of Technol., Cambridge, MA, USA
BookMark eNpVj81Kw0AURkesYK15gm6ycZl6b-bO37JEq4XWLlRwVyaTOzqiaUkixbdXsBtXH2dxDnwXYtTuWhZiijBDBHe9fFhUm_WsBJQzrbQBxBOROWORtJHKkYLTf0xyJMZgSBao9cu5yPr-HeBXA11aGIurm9QPXaq_Bm7y6nE9zw9peMv3PnWH1HMedk1qXy_FWfQfPWfHnYjnxe1TdV-sNnfLar4qEho1FBxVY61pjPHgteKgDDsTvKo1aCSiiKFGFyiUFGztqS7LqKIDGxRxjHIipn_dxMzbfZc-ffe9PR6VP_WfRXo
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/INFCOM.2013.6567011
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9781467359450
9781467359467
1467359467
1467359459
EndPage 2102
ExternalDocumentID 6567011
Genre orig-research
GroupedDBID 23M
29I
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-i175t-ef5d887d77a0a65ec57e97ca5b6061444f1cb19c4c24c8ba4b22f5f908c54eff3
IEDL.DBID RIE
ISBN 9781467359443
1467359440
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000326335202025&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0743-166X
IngestDate Wed Aug 27 04:23:19 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-ef5d887d77a0a65ec57e97ca5b6061444f1cb19c4c24c8ba4b22f5f908c54eff3
PageCount 9
ParticipantIDs ieee_primary_6567011
PublicationCentury 2000
PublicationDate 2013-April
PublicationDateYYYYMMDD 2013-04-01
PublicationDate_xml – month: 04
  year: 2013
  text: 2013-April
PublicationDecade 2010
PublicationTitle 2013 Proceedings IEEE INFOCOM
PublicationTitleAbbrev INFCOM
PublicationYear 2013
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001106280
ssj0008726
Score 1.8517239
Snippet We consider distributed strategies for joint routing, scheduling, and network coding to maximize throughput in wireless networks. Network coding allows for an...
SourceID ieee
SourceType Publisher
StartPage 2094
SubjectTerms Encoding
Multiaccess communication
Network coding
Routing
Throughput
Wireless networks
Title Distributed CSMA with pairwise coding
URI https://ieeexplore.ieee.org/document/6567011
WOSCitedRecordID wos000326335202025&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
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwELVKxQEuLC1iVw5wI22ceD2iQgUSLZUAqbfKy1jKpa26wO9ju1EKEhduceRR4liesSfz3kPoJuM6l9ji1Gm_yInRJtUgeQqKKsWV9i4xkri-8OFQjMdy1EB3NRYGAGLxGXTCZfyXb2dmHVJlXb_34FkA8u5wzjZYrW0-BQc0YFZ7YcGj1NqGgpOxcQR1MV5QSUjN9VS1i4qOCGey-zzs914Hoear6FTP-yW8EuNO_-B_b3yI2lsAXzKqQ9MRasD0GO3_4B5soduHQJkb1K7AJr23wX0SUrLJXJWLr3IJiZkF0zb66D--957SSjMhLf1GYJWCo9b7Dcu5yhSjYCj3n94oqlk8-xGHjcbSEJMTI7QiOs8ddTIThhJwrjhBzelsCqcoYcLoHCtGlHC-r1OGMeftLbH-ECTUGWqFAU_mG1qMSTXW879vX6C9PCpJhKKXS9RcLdZwhXbN56pcLq7jXH4Dvt6Xpg
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwEB1VgARcWFrETg5wI20WL_ERFapWtKESReqt8irl0lZd4Pex3SgFiQu3OPIocSzP2JN57wHcR1QkLFZxaIRd5EgKGQrNaKg55pxyYV2iJ3Ht0zzPxmM2rMFjhYXRWvviM910l_5fvprJtUuVtezeg0YOyLvrlLNKtNY2oxI7PGBU-eGMerG1DQknIWMP6yI0xQyhiu2pbKclIVEcsVYv77TfBq7qK22WT_wlveIjT-fof-98DI0thC8YVsHpBGp6egqHP9gH6_Dw7Ehznd6VVkH7ffAUuKRsMOfF4qtY6kDOnGkDPjovo3Y3LFUTwsJuBVahNlhZz6Eo5REnWEtM7ceXHAviT3_IxFLETCKZIJkJjkSSGGxYlEmMtDHpGexMZ1N9DgHJpEhiThDPjO1ruCTEWHuFlD0GZfwC6m7Ak_mGGGNSjvXy79t3sN8dDfqTfi9_vYKDxOtKuBKYa9hZLdb6Bvbk56pYLm79vH4D4TWa7w
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%3Abook&rft.genre=proceeding&rft.title=2013+Proceedings+IEEE+INFOCOM&rft.atitle=Distributed+CSMA+with+pairwise+coding&rft.au=Jones%2C+Nathaniel+M.&rft.au=Shrader%2C+Brooke&rft.au=Modiano%2C+Eytan&rft.date=2013-04-01&rft.pub=IEEE&rft.isbn=9781467359443&rft.issn=0743-166X&rft.spage=2094&rft.epage=2102&rft_id=info:doi/10.1109%2FINFCOM.2013.6567011&rft.externalDocID=6567011
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-166X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-166X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-166X&client=summon