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žené v:
Podrobná bibliografia
Vydané v:2013 Proceedings IEEE INFOCOM s. 2094 - 2102
Hlavní autori: Jones, Nathaniel M., Shrader, Brooke, Modiano, Eytan
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.04.2013
Predmet:
Encoding
Multiaccess communication
Network coding
Routing
Throughput
Wireless networks
ISBN:9781467359443, 1467359440
ISSN:0743-166X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
ISBN:9781467359443
1467359440
ISSN:0743-166X
DOI:10.1109/INFCOM.2013.6567011