Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2013, Article ID 982713, 9 pages
http://dx.doi.org/10.1155/2013/982713
Research Article

Hypergraph Modeling and Approximation Algorithms for the Minimum Length Link Scheduling in Multiuser MIMO Networks

Science and Technology on Parallel and Distributed Processing Laboratory, College of Computer, National University of Defense Technology, Changsha 410073, China

Received 25 April 2013; Revised 16 September 2013; Accepted 2 October 2013

Academic Editor: Ching-Jong Liao

Copyright © 2013 Hu Shen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Nelson and L. Kleinrock, “Spatial TDMA: a collision-free multihop channel access protocol,” IEEE Transactions on Communications, vol. 33, no. 9, pp. 934–944, 1985. View at Publisher · View at Google Scholar · View at MathSciNet
  2. S. C. Ergen and P. Varaiya, “TDMA scheduling algorithms for wireless sensor networks,” Wireless Networks, vol. 16, no. 4, pp. 985–997, 2010. View at Publisher · View at Google Scholar · View at Scopus
  3. B. Hajek and G. Sasaki, “Link scheduling in polynomial time,” IEEE Transactions on Information Theory, vol. 34, no. 5, part 1, pp. 910–917, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  4. G. Sharma, R. R. Mazumdar, and N. B. Shroff, “On the complexity of scheduling in wireless networks,” in Proceedings of the 12th Annual International Conference on Mobile Computing and Networking (MOBICOM '06), pp. 227–238, September 2006. View at Scopus
  5. “Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications: Amendment 5: Enhancements for Higher Throughput,” IEEE P802.11n Standard, 2009.
  6. “Proposed TGac Draft to Wireless LAN Media Access Control (MAC) and Physical Layer (PHY) Specifications: Enhancements for Higher Throughput,” IEEE P802.11ac/D0, 2011.
  7. S. Chu and X. Wang, “Adaptive and distributed scheduling in heterogeneous MIMO-based ad hoc networks,” in Proceedings of the IEEE 6th International Conference on Mobile Adhoc and Sensor Systems (MASS '09), pp. 217–226, October 2009. View at Publisher · View at Google Scholar · View at Scopus
  8. D. M. Blough, G. Resta, P. Santi, R. Srinivasan, and L. M. Cortés-Pena, “Optimal one-shot scheduling for MIMO networks,” in Proceedings of the 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON '11), pp. 404–412, June 2011. View at Publisher · View at Google Scholar · View at Scopus
  9. L. Zheng and D. N. C. Tse, “Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels,” IEEE Transactions on Information Theory, vol. 49, no. 5, pp. 1073–1096, 2003. View at Publisher · View at Google Scholar · View at Scopus
  10. C. Berge, Graphs and Hypergraphs, Elservier, New York, NY, USA, 1973. View at MathSciNet
  11. C. Berge, Hypergraphs: The Theory of Finite Set, vol. 45, North-Holland Publishing, Amsterdam, The Netherlands, 1989. View at MathSciNet
  12. I. Dinur, O. Regev, and C. Smyth, “The hardness of 3-uniform hypergraph coloring,” in Proceedings of the 34rd Annual IEEE Symposium on Foundations of Computer Science, pp. 33–40, November 2002. View at Scopus
  13. S. Khot, “Hardness results for approximate hypergraph coloring,” in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 351–359, May 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. A. Wigderson, “Improving the performance guarantee for approximate graph coloring,” Journal of the Association for Computing Machinery, vol. 30, no. 4, pp. 729–735, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. B. Berger and J. Rompel, “A better performance guarantee for approximate graph coloring,” Algorithmica, vol. 5, no. 4, pp. 459–466, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. M. M. Halldórsson, “A still better performance guarantee for approximate graph coloring,” Information Processing Letters, vol. 45, no. 1, pp. 19–23, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet