Efficient routing algorithms for multi-channel dynamic spectrum access networks

2007 2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks

Volumn , Issue , 2007, Pages 288-291

  Pal, Ranjan ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; DATABASE SYSTEMS; NETWORK ROUTING; PROBLEM SOLVING; RADIO COMMUNICATION; SPECTRUM ANALYSIS; TELECOMMUNICATION LINKS;

DATA-ADAPTIVE ROUTING SCHEME; DYNAMIC SPECTRUM ACCESS (DSA) NETWORKS; POLYNOMIAL TIME; SPECTRUM-AWARE ROUTING;

TELECOMMUNICATION NETWORKS;

EID: 34548749370     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DYSPAN.2007.46     Document Type: Conference Paper

References (10)

1. A.K.Ahuja, T.L Magnanti, and J.Orlin. Network Flows. Prentice Hall International.
2. C.Xin. A novel-layered graph model for topology formation and routing in dynamic spectrum access networks. In IEEE DySPAN, 2005.
3. FCC. FCC spectrum policy task force report, ET Docket No. 02-135. FCC.
4. L.R. Ford and D.R Fulkerson. Flows in Networks. Princeton University Press.
5. I.F.Akyildiz, W.Y.Lee, M.C.Vuran, and S.Mohanty. Next genera- tion/dynamic spectrum access/cognitive radio wireless networks: A survey. Computer Networks, 50:2127-2159, 2006.
6. Q.Wang and H.Zheng. Route and spectrum selection in dynamic spectrum access networks. In IEEE CNCC, 2006.
7. T.H.Cormen, C.L.Leiserson, R.Rivest, and C.Stein. An Introduction to Algorithms. MIT Press.
8. T. Uno. An algorithm, for enumerating all directed spanning trees in a directed graph. In Lecture Notes in Computer Science, 1996.
9. X.Liu, E.Chong, and N.Shroff. Opportunistic transmission scheduling with resource-sharing constraints in wireless networks. IEEE Journal on Selected Areas in Communications, 19(10), 2001.
10. Y.L.Chen and Y.H.Chin. The quickest path problem. Computers and Operations Research, 17:153-161, 1990.