Distributed optimization in wireless networks using broadcast advantage

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2007, Pages 5839-5844

  Cui, Tao ^a   Chen, Lijun ^a   Ho, Tracey ^a  

^a California Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; BROADCASTING; COMPUTATIONAL COMPLEXITY; GRADIENT METHODS; SCHEDULING ALGORITHMS;

LINK SCHEDULING PROBLEM; SUBGRADIENT ALGORITHM; WORST CASE PERFORMANCE;

WIRELESS NETWORKS;

EID: 62749155694     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2007.4434958     Document Type: Conference Paper

References (17)

1. L. Chen, S. H. Low, and J. C. Doyle, "Joint congestion control and media access control design for wireless ad hoc networks," in Proc. of IEEE Infocom, Mar. 2005.
2. X. Lin and N. Shroff, "The impact of imperfect scheduling on cross-layer congestion control in wireless networks," IEEE/ACM Trans. Networking, vol. 14, no. 2, pp. 302-315, April 2006.
3. M. Neely, E. Modiano, and C. Rohrs, "Dynamic power allocation and routing for time-varying wireless networks," IEEE J. Select. Areas Commun., vol. 23, no. 1, pp. 89-103, Jan. 2005.
4. M. Chiang, S. H. Low, A. R. Calderbank, and J. C. Doyle, "Layering as optimization decomposition," Proc. of IEEE, vol. 95, no. 1, pp. 255-312, Jan. 2007.
5. J. Wieselthier, G. Nguyen, and A. Ephremides, "On the construction of energy-efficient broadcast and multicast trees in wireless networks," in Proc. of Infocom, March 2000, pp. 585-594.
6. T. Ho and H. Viswanathan, "Dynamic algorithms for multicast with intra-session network coding," in Proc. of Allerton Conf. on Comm., Contr. and Comput., Sept. 2005.
7. B. Hajek and G. Sasaki, "Link scheduling in polynomial time," IEEE Trans. Inform. Theory, vol. 34, no. 5, pp. 910-917, Sept. 1988.
8. L. Lovasz and M. Plummer, Matching Theory. North Holland, 1986.
9. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radionetworks and input queued switches," in Proc. of Infocom, March 1998, pp. 533-539.
10. E. Modiano, D. Shah, and G. Zussman, "Maximizing throughput in wireless networks via gossiping," ACM SIGMETRICS Performance Evaluation Review, vol. 34, no. 1, pp. 27-38, June 2006.
11. D. Lun, N. Ratnakar, M. Médard, R. Koetter, D. R. Karger, T. Ho, E. Ahmed, and F. Zhao, "Minimum-cost multicast over coded packet networks," IEEE Trans. Inform. Theory, vol. 52, no. 6, pp. 2608-2623, June 2006.
12. Y. Wu and S.-Y. Kung, "Distributed utility maximization for network coding based multicasting: A shortest path approach," IEEE J. Select. Areas Commun., vol. 24, no. 8, pp. 1475-1488, Aug. 2006.
13. Z. Li, B. Li, and L. C. Lau, "On achieving maximum multicast throughput in undirected networks," IEEE/ACM Trans. Networking, vol. 14, no. SI, pp. 2467-2485, June 2006.
14. L. Chen, T. Ho, S. H. Low, M. Chiang, and J. C. Doyle, "Rate control for multicast with network coding," in Proc. of IEEE Infocom, 2007.
15. T. Ho, M. Médard, R. Koetter, D. Karger, M. Effros, J. Shi, and B. Leong, "A random linear network coding approach to multicast," IEEE Trans. Inform. Theory, vol. 52, pp. 4413-4430, Oct. 2006.
16. R. Preis, "Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs," in Proc. of the Symposium on Theoretical Aspects of Computer Science (STACS), 1999, pp. 259-269.
17. T. Cui, L. Chen, and T. Ho, "Cross-layer design in wireless networks by using broadcast advantage," Caltech, Tech. Rep., Mar. 2007.