Optimal reverse carpooling over wireless networks - a distributed optimization approach
Name
Ozdaglar_Optimal reverse.pdf
Size
3.96 MB
Format
Adobe PDF
Checksum (MD5)
ac0538ef0d7b297eb92769ac16ed6385
Author(s)
Parandehgheibi, Ali
Ozdaglar, Asuman E.
Effros, Michelle
Medard, Muriel
Date Issued
March 2010
Journal
Conference on Information Sciences and Systems
Publisher
Institute of Electrical and Electronics Engineers
Citation
ParandehGheibi, A. et al. “Optimal Reverse Carpooling over Wireless Networks - a Distributed Optimization Approach.” Information Sciences and Systems (CISS), 2010 44th Annual Conference On. 2010. 1-6. Copyright © 2010, IEEE
Version
Final published version
Abstract
We focus on a particular form of network coding, reverse carpooling, in a wireless network where the potentially coded transmitted messages are to be decoded immediately upon reception. The network is fixed and known, and the system performance is measured in terms of the number of wireless broadcasts required to meet multiple unicast demands. Motivated by the structure of the coding scheme, we formulate the problem as a linear program by introducing a flow variable for each triple of connected nodes. This allows us to have a formulation polynomial in the number of nodes. Using dual decomposition and projected subgradient method, we present a decentralized algorithm to obtain optimal routing schemes in presence of coding opportunities. We show that the primal sub-problem can be expressed as a shortest path problem on an edge-graph, and the proposed algorithm requires each node to exchange information only with its neighbors.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/CISS.2010.5464771
