Distributed CSMA with pairwise coding
Autor: | Eytan Modiano, Nathaniel M. Jones, Brooke Shrader |
---|---|
Přispěvatelé: | Lincoln Laboratory, Massachusetts Institute of Technology. Department of Aeronautics and Astronautics, Massachusetts Institute of Technology. Laboratory for Information and Decision Systems, Jones, Nathaniel M., Shrader, Brooke E., Modiano, Eytan H |
Rok vydání: | 2013 |
Předmět: |
Network architecture
Computer science business.industry Network packet Wireless network Distributed computing ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Throughput Network topology Scheduling (computing) Computer Science::Performance Linear network coding Computer Science::Networking and Internet Architecture Maximum throughput scheduling business Computer network |
Zdroj: | INFOCOM Prof. Modiano |
DOI: | 10.1109/infcom.2013.6567011 |
Popis: | 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. United States. Dept. of Defense. Assistant Secretary of Defense for Research & Engineering United States. Air Force (Air Force Contract FA8721-05-C-0002) |
Databáze: | OpenAIRE |
Externí odkaz: |