메뉴 건너뛰기




Volumn 43, Issue 234, 1995, Pages 1277-1283

A Neural Network Approach to Solving the Link Activation Problem in Multihop Radio Networks

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; OPTIMIZATION; PACKET NETWORKS; PROBLEM SOLVING; RADIO COMMUNICATION; SCHEDULING;

EID: 0029256092     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.380169     Document Type: Article
Times cited : (16)

References (19)
  • 2
    • 0028207775 scopus 로고
    • A Neural Network Approach to Routing Without Interference in Multihop Radio Networks
    • Jan.
    • J. E. Wieselthier, C. M. Barnhart, and A. Ephremides, “A Neural Network Approach to Routing Without Interference in Multihop Radio Networks,” IEEE Trans. Commun., 42-1 pp. 166–177, Jan. 1994.
    • (1994) IEEE Trans. Commun. , vol.42-1 , pp. 166-177
    • Wieselthier, J.E.1    Barnhart, C.M.2    Ephremides, A.3
  • 4
    • 0021198082 scopus 로고
    • The Design and Simulation of a Mobile Radio Network with Distributed Control
    • Jan.
    • D. J. Baker, A. Ephremides, and J. A. Flynn, “The Design and Simulation of a Mobile Radio Network with Distributed Control,” IEEE J. Select. Areas Commun., SAC-2 pp. 226–237, Jan. 1984.
    • (1984) IEEE J. Select. Areas Commun. , vol.SAC-2 , pp. 226-237
    • Baker, D.J.1    Ephremides, A.2    Flynn, J.A.3
  • 5
    • 0023092944 scopus 로고
    • A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling
    • Jan.
    • A. Ephremides, J. E. Wieselthier, and D. J. Baker, “A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling,” Proc. IEEE, 75–No. 1 pp. 56–73, Jan. 1987.
    • (1987) Proc. IEEE , vol.75 , Issue.1 , pp. 56-73
    • Ephremides, A.1    Wieselthier, J.E.2    Baker, D.J.3
  • 6
    • 0024079190 scopus 로고
    • Link Scheduling in Polynomial Time
    • Sept.
    • B. Hajek and G. Sasaki, “Link Scheduling in Polynomial Time,” IEEE Trans. Inform. Theory, 34 pp. 910–917, Sept. 1988.
    • (1988) IEEE Trans. Inform. Theory , vol.34 , pp. 910-917
    • Hajek, B.1    Sasaki, G.2
  • 8
    • 0021465991 scopus 로고
    • Some Complexity Results About Packet Radio Networks
    • July
    • E. Arikan, “Some Complexity Results About Packet Radio Networks,” IEEE Trans. Inform. Theory, IT-30 pp. 681–685, July 1984.
    • (1984) IEEE Trans. Inform. Theory , vol.IT-30 , pp. 681-685
    • Arikan, E.1
  • 9
    • 0026626024 scopus 로고
    • Jointly Optimal Routing and Scheduling in Packet Radio Networks
    • L. Tassiulas and A. Ephremides, “Jointly Optimal Routing and Scheduling in Packet Radio Networks,” IEEE Trans. Inform. Theory, Vol.38-No. 1 pp. 165–168, 1992.
    • (1992) IEEE Trans. Inform. Theory , vol.38 , Issue.1 , pp. 165-168
    • Tassiulas, L.1    Ephremides, A.2
  • 10
  • 11
    • 0024627372 scopus 로고
    • A Periodic Scheduling Problem in Flow Control for Data Communication Networks
    • March
    • U. Mukherji, “A Periodic Scheduling Problem in Flow Control for Data Communication Networks,” IEEE Trans. Inform. Theory, 35-No. 2 pp. 436–443, March 1989.
    • (1989) IEEE Trans. Inform. Theory , vol.35 , Issue.2 , pp. 436-443
    • Mukherji, U.1
  • 12
    • 30244461571 scopus 로고
    • Solving Hard Optimization Problems Arising in Packet Radio Networks Using Hopfield Nets
    • March
    • L. Tassiulas, A. Ephremides, and J. Gunn, “Solving Hard Optimization Problems Arising in Packet Radio Networks Using Hopfield Nets,” Proc. 1989 Conf. Inform. Sci. Syst., pp. 603–608, March 1989.
    • (1989) Proc. 1989 Conf. Inform. Sci. Syst. , pp. 603-608
    • Tassiulas, L.1    Ephremides, A.2    Gunn, J.3
  • 13
    • 0025534834 scopus 로고
    • Neural Network Solution to the Link Scheduling Problem Using Convex Relaxation
    • Dec.
    • R. G. Ogier and D. A. Beyer, “Neural Network Solution to the Link Scheduling Problem Using Convex Relaxation,” Conf. Record IEEE GLOBECOM '90, pp. 1371–1376, Dec. 1990.
    • (1990) Conf. Record IEEE GLOBECOM '90 , pp. 1371-1376
    • Ogier, R.G.1    Beyer, D.A.2
  • 14
    • 0026365447 scopus 로고
    • Neural Network Techniques for Scheduling and Routing Problems in Multihop Radio Networks
    • Nov.
    • C. M. Barnhart, J. E. Wieselthier, and A. Ephremides, “Neural Network Techniques for Scheduling and Routing Problems in Multihop Radio Networks,” MILCOM'91 Conf. Record, pp. 407–413, Nov. 1991.
    • (1991) MILCOM'91 Conf. Record , pp. 407-413
    • Barnhart, C.M.1    Wieselthier, J.E.2    Ephremides, A.3
  • 15
    • 0024381115 scopus 로고
    • A Neural Network Algorithm for the Multiple Traveling Salesmen Problem
    • E. Wacholder, J. Han, and R. C. Mann, “A Neural Network Algorithm for the Multiple Traveling Salesmen Problem,” Biological Cybernetics, 61 pp. 11–19, 1989.
    • (1989) Biological Cybernetics , vol.61 , pp. 11-19
    • Wacholder, E.1    Han, J.2    Mann, R.C.3
  • 18
    • 0012202726 scopus 로고
    • The Gaussian Machine: A Stochastic Neural Network for Solving Assignment Problems
    • Winter
    • Y. Akiyama, A. Yamashita, M. Kajiura, Y. Anzai, and H. Aiso, “The Gaussian Machine: A Stochastic Neural Network for Solving Assignment Problems,” J. Neural Network Comput., 2-No. 3 pp. 43–51, Winter 1991.
    • (1991) J. Neural Network Comput. , vol.2 , Issue.3 , pp. 43-51
    • Akiyama, Y.1    Yamashita, A.2    Kajiura, M.3    Anzai, Y.4    Aiso, H.5
  • 19
    • 0025446460 scopus 로고
    • Graph Partitioning Using Annealed Neural Networks
    • June
    • D. E. Van den Bout and T. K. Miller III, “Graph Partitioning Using Annealed Neural Networks,” IEEE Trans. Neural Networks, 1 pp. 192–203, June 1990.
    • (1990) IEEE Trans. Neural Networks , vol.1 , pp. 192-203
    • Van den Bout, D.E.1    Miller, T.K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.