SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Wireless Networks

Volumn 1, Issue 1, 1995, Pages 61-81

A distributed routing algorithm for mobile wireless networks

(2) Corson, M Scott a Ephremides, Anthony b

a UNIVERSITY OF ILLINOIS AT CHICAGO (United States)

b UNIVERSITY OF MARYLAND (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002159357 PISSN: 10220038 EISSN: 15728196 Source Type: Journal
DOI: 10.1007/BF01196259 Document Type: Article

Times cited : (247)

References (22)

1
- 84934368243
- D. Bertsekas and R. Gallager, Data Networks (Prentice-Hall, 1987).

2
- 84934368242
- P. Merlin and A. Segall, A failsafe distributed routing protocol, IEEE Trans. Commun. (September 1979).

3
- 84934368248
- J. Jaffe and F. Moss, A responsive distributed routing algorithm for computer networks, IEEE Trans. Commun. (July 1982).

4
- 84934368247
- J.J. Garcia-Luna-Aceves, A new minimum-hop routing algorithm, Proc. IEEE INFOCOM '87, San Francisco, CA, 1987.

5
- 84934368250
- J.J. Garcia-Luna-Aceves, Distributed routing using internodal coordination, Proc. IEEE INFOCOM '88, New Orleans, LA, 1988.

6
- 84934368249
- J.J. Garcia-Luna-Aceves, A distributed, loop-free, shortest-path routing algorithm, Proc. IEEE INFOCOM '88, New Orleans, LA, 1988.

7
- 84934368245
- J.J. Garcia-Luna-Aceves, A minium-hop routing algorithm based on distributed information, Comp. Networks ISDN Syst. 16(5) (1989).

8
- 84934368244
- B. Rajagopolan and M. Faiman, A new responsive distributed shortest-path routing algorithm, ACM Comp. Commun. Rev. 19(4) (1989).

9
- 84934368246
- J.J. Garcia-Luna-Aceves, Loop-free routing using diffusing computations, IEEE Trans. Networking 1(1) (1993).

10
- 0013410493
- BBN Rep., 2831, Bolt Beranek and Newman Inc., Cambridge, MA
- (1974) Adaptive routing algorithms for distributed computer networks
- McQuillan, J.¹

11
- 73149105393
- OSPF; An internet routing protocol
- (1989) ConneXtions , vol.3 , Issue.8 , pp. 19-25
- Coltun, R.¹

12
- 84934368347
- J.J. Garcia-Luna-Aceves, Distributed routing with labeled distances, Proc. IEEE INFOCOM '92, Florence, Italy, 1992.

13
- 84934368348
- J.J. Garcia-Luna-Aceves, Steady-state response of shortest-path routing algorithms, 11th Annual Int. Phoenix Conf. on Comp. and Commun., Scottsdate, AZ, 1992.

14
- 84934368345
- B. Awerbuch, A. Bar-Noy and M. Gopal, Approximate distributed Bellmann-Ford algorithms, Proc. IEEE INFOCOM '91, Bal Harbour, FA, 1991.

15
- 84934368346
- B. Awerbuch, Distributed dhortest-paths algorithms, Proc. 21st Annual ACM Symp. on Theory of Computing, Seattle, WA, 1989.

16
- 84934368341
- B. Awerbuch, Shortest-paths and loop-free routing in dynamic networks, Comp. Commun. Rev. 20(4) (1990).

17
- 84934368342
- E. Dijkstra and C. Scholten, Termination detection for diffusing computations, Inform. Process. Lett. 11(1) (1980).

18
- 84934368339
- E. Gafni and D. Bertsekas, Distributed algorithms for generating loop-free routes in networks with frequently changing topology, IEEE Trans. Commun (January 1981).

19
- 84934368340
- M. Weber (Bates) and A. Ephremides, A simulated performance study of some distributed routing algorithms for mobile radio networks, Proc. Johns Hopkins Conf., Baltimore, MD, 1983.

20
- 84934368343
- M.S. Corson and A. Ephremides, A distributed routing algorithm for mobile radio networks, Proc. 1989 IEEE Military Communications Conf., Boston, MA, 1989.

21
- 84934368344
- A. Ephremides, J. Wieselthier and D. Baker, A design concept for reliable mobile radio networks with frequency hopping signaling, Proc. IEEE (January 1987).

22
- 84934368334
- B. Awerbuch, B. Patt-Shamir and G. Varghese, Bounding the unbounded, Proc. IEEE INFOCOM '94.

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