{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T13:09:43Z","timestamp":1773148183097,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1007\/bf01196259","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T14:40:34Z","timestamp":1108737634000},"page":"61-81","source":"Crossref","is-referenced-by-count":237,"title":["A distributed routing algorithm for mobile wireless networks"],"prefix":"10.1007","volume":"1","author":[{"given":"M. Scott","family":"Corson","sequence":"first","affiliation":[]},{"given":"Anthony","family":"Ephremides","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"D. Bertsekas and R. Gallager,Data Networks (Prentice-Hall, 1987)."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"P. Merlin and A. Segall, A failsafe distributed routing protocol, IEEE Trans. Commun. (September 1979).","DOI":"10.21236\/ADA061666"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"J. Jaffe and F. Moss, A responsive distributed routing algorithm for computer networks, IEEE Trans. Commun. (July 1982).","DOI":"10.1109\/TCOM.1982.1095632"},{"key":"CR4","unstructured":"J.J. Garcia-Luna-Aceves, A new minimum-hop routing algorithm,Proc. IEEE INFOCOM '87, San Francisco, CA, 1987."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"J.J. Garcia-Luna-Aceves, Distributed routing using internodal coordination,Proc. IEEE INFOCOM '88, New Orleans, LA, 1988.","DOI":"10.1109\/CNS.1988.5020"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"J.J. Garcia-Luna-Aceves, A distributed, loop-free, shortest-path routing algorithm,Proc. IEEE INFOCOM '88, New Orleans, LA, 1988.","DOI":"10.1109\/INFCOM.1988.13032"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"J.J. Garcia-Luna-Aceves, A minium-hop routing algorithm based on distributed information, Comp. Networks ISDN Syst. 16(5) (1989).","DOI":"10.1016\/0169-7552(89)90011-1"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"B. Rajagopolan and M. Faiman, A new responsive distributed shortest-path routing algorithm, ACM Comp. Commun. Rev. 19(4) (1989).","DOI":"10.1145\/75247.75270"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"J.J. Garcia-Luna-Aceves, Loop-free routing using diffusing computations, IEEE Trans. Networking 1(1) (1993).","DOI":"10.1109\/90.222913"},{"key":"CR10","series-title":"BBN Rep.","volume-title":"Adaptive routing algorithms for distributed computer networks","author":"J. McQuillan","year":"1974","unstructured":"J. McQuillan, Adaptive routing algorithms for distributed computer networks, BBN Rep. 2831, Bolt Beranek and Newman Inc., Cambridge, MA (1974)."},{"issue":"8","key":"CR11","first-page":"19","volume":"3","author":"R. Coltun","year":"1989","unstructured":"R. Coltun, OSPF; An internet routing protocol, ConneXtions 3(8) (1989) 19?25.","journal-title":"ConneXtions"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"J.J. Garcia-Luna-Aceves, Distributed routing with labeled distances,Proc. IEEE INFOCOM '92, Florence, Italy, 1992.","DOI":"10.1109\/INFCOM.1992.263467"},{"key":"CR13","unstructured":"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."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, A. Bar-Noy and M. Gopal, Approximate distributed Bellmann-Ford algorithms,Proc. IEEE INFOCOM '91, Bal Harbour, FA, 1991.","DOI":"10.1109\/INFCOM.1991.147641"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Distributed dhortest-paths algorithms,Proc. 21st Annual ACM Symp. on Theory of Computing, Seattle, WA, 1989.","DOI":"10.1145\/73007.73054"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Shortest-paths and loop-free routing in dynamic networks, Comp. Commun. Rev. 20(4) (1990).","DOI":"10.1145\/99517.99550"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"E. Dijkstra and C. Scholten, Termination detection for diffusing computations, Inform. Process. Lett. 11(1) (1980).","DOI":"10.1016\/0020-0190(80)90021-6"},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"E. Gafni and D. Bertsekas, Distributed algorithms for generating loop-free routes in networks with frequently changing topology, IEEE Trans. Commun (January 1981).","DOI":"10.1109\/TCOM.1981.1094876"},{"key":"CR19","unstructured":"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."},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"M.S. Corson and A. Ephremides, A distributed routing algorithm for mobile radio networks,Proc. 1989 IEEE Military Communications Conf., Boston, MA, 1989.","DOI":"10.1109\/MILCOM.1989.103927"},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"A. Ephremides, J. Wieselthier and D. Baker, A design concept for reliable mobile radio networks with frequency hopping signaling, Proc. IEEE (January 1987).","DOI":"10.1109\/PROC.1987.13705"},{"key":"CR22","unstructured":"B. Awerbuch, B. Patt-Shamir and G. Varghese, Bounding the unbounded,Proc. IEEE INFOCOM '94."}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01196259.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01196259\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01196259","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T21:08:32Z","timestamp":1586120912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01196259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["BF01196259"],"URL":"https:\/\/doi.org\/10.1007\/bf01196259","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}