A fast matching algorithm for asymptotically optimal distributed channel assignment

2013 18th International Conference on Digital Signal Processing, DSP 2013

Volumn , Issue , 2013, Pages

  Naparstek, Oshri ^a   Leshem, Amir ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ASSIGNMENT PROBLEMS; ASYMPTOTICALLY OPTIMAL; BIPARTITE GRAPHS; CARDINALITY MATCHING; CHANNEL ASSIGNMENT PROBLEM; COMBINATORIAL OPTIMIZATION PROBLEMS; DISTRIBUTED CHANNELS; FAST MATCHING ALGORITHM;

ALGORITHMS; DIGITAL SIGNAL PROCESSING; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION;

EID: 84888864085     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDSP.2013.6622738     Document Type: Conference Paper

References (19)

1. H. Kuhn, "The Hungarian method for the assignment problem," Naval research logistics quarterly, Vol. 2, no. 1-2, pp. 83-97, 1955.
2. G. Dantzig, "A primal-dual algorithm," tech. rep., DTIC Document, 1956.
3. D. Bertsekas, "A distributed algorithm for the assignment problem," Lab. for Information and Decision Systems Working Paper, MIT, 1979.
4. H. Kwon, S. Kim, and B. Lee, "Opportunistic multi-channel CSMA protocol for OFDMA systems," IEEE Transactions on Wireless Communications, Vol. 9, pp. 1552-1557, may 2010.
5. Y. Yaffe, A. Leshem, and E. Zehavi, "Stable matching for channel access control in cognitive radio systems," in Cognitive Information Processing (CIP), 2010 2nd International Workshop on, pp. 470-475, june 2010.
6. A. Leshem, E. Zehavi, and Y. Yaffe, "Multichannel opportunistic carrier sensing for stable channel access control in cognitive radio systems," JSAC special issue on application of game theory to communication, 2012.
7. D. Gale and L. Shapley, "College admissions and the stability of marriage," The American Mathematical Monthly, Vol. 69, no. 1, pp. 9-15, 1962.
8. O. Naparstek and A. Leshem, "Fully distributed auction algorithm for spectrum sharing in unlicensed bands," in Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), 2011 4th IEEE International Workshop on, pp. 233-236, IEEE, 2011.
9. O. Naparstek and A. Leshem, "Fully distributed optimal channel assignment for open spectrum access," Submitted to Signal Processing, IEEE Transactions on, 2013.
10. J. Edmonds, "Paths, trees, and flowers," Canadian Journal of mathematics, Vol. 17, no. 3, pp. 449-467, 1965.
11. J. E. Hopcroft and R. M. Karp, "An n∧5/2 algorithm for maximum matchings in bipartite graphs," SIAM Journal on Computing, Vol. 2, no. 4, pp. 225-231, 1973.
12. T. Feder and R. Motwani, "Clique partitions, graph compression and speeding-up algorithms," in Proceedings of the twenty-third annual ACM symposium on Theory of computing, pp. 123-133, ACM, 1991.
13. R. Motwani, "Average-case analysis of algorithms for matchings and related problems," Journal of the ACM (JACM), Vol. 41, no. 6, pp. 1329-1356, 1994.
14. H. Bast, K. Mehlhorn, G. Schafer, and H. Tamaki, "Matching algorithms are fast in sparse random graphs," Theory of Computing Systems, Vol. 39, no. 1, pp. 3-14, 2006.
15. P. Chebolu, A. Frieze, et al., "Finding a maximum matching in a sparse random graph in O(n) expected time," Journal of the ACM (JACM), Vol. 57, no. 4, p. 24, 2010.
16. P. Erdos and A. Rényi, "On random matrices ii," Studia Sci. Math. Hungar, Vol. 3, pp. 459-464, 1968.
17. O. Naparstek and A. Leshem, "Expected time complexity of the push-relabel algorithm for maximal bipartite matching on random graphs," Submitted to Random Structures & Algorithms, 2013.
18. M. Falk, "A note on uniform asymptotic normality of intermediate order statistics," Annals of the Institute of Statistical Mathematics, Vol. 41, no. 1, pp. 19-29, 1989.
19. Q. Zhao and L. Tong, "Opportunistic carrier sensing for energy-efficient information retrieval in sensor networks," EURASIP Journal on Wireless Communications and Networking, Vol. 2005, no. 2, pp. 231-241, 2005.