An efficient routing protocol for wireless networks-Reference-Cited by-同舟云学术

An efficient routing protocol for wireless networks

Published:1996-06 Issue:2 Volume:1 Page:183-197
ISSN:1383-469X
Container-title:Mobile Networks and Applications
language:en
Short-container-title:Mobile Netw Appl

Author:

Murthy Shree,Garcia-Luna-Aceves J. J.

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01193336.pdf

Reference17 articles.

1. R. Albrightson, J.J. Garcia-Luna-Aceves and J. Boyle, EIGRPA fast routing protocol based on distance vectors,Proc. Networld/Interop 94, Las Vegas, Nevada (May 1994).

2. D. Beyer et al., Packet radio network research, development and application,Proc. SHAPE Conf. on Packet Radio, Amsterdam (1989).

3. D. Beyer, Accomplishments of the DARPA SURAN program,Proc. IEEE MILCOM 90, Monterey, California (Dec. 1990), pp. 855?862.

4. D. Bertsekas and R. Gallager,Data Networks, second ed. (Prentice Hall, 1992).

5. C. Cheng, R. Reley, S.P.R., Kumar and J.J. Garcia-Luna-Aceves, A loop-free extended Bellman-Ford routing protocol without bouncing effect, ACM Comp. Commun. Rev. 19(4) 1989 224?236.

Cited by 409 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Performance Comparison and Analysis of AODV and MTP Routing Protocols in VANET for Urban Scenario;2024 59th International Scientific Conference on Information, Communication and Energy Systems and Technologies (ICEST);2024-07-01

2. Petal Region Analysis of Improved Petal Ant Routing for Mobile Ad Hoc Networks;SN Computer Science;2024-05-09

3. Secure malicious node detection in flying ad-hoc networks using enhanced AODV algorithm;Scientific Reports;2024-04-03

4. A Comparative Experimental Analysis of Routing Protocols for Environmental Monitoring Wireless Sensor Network;2024 2nd International Conference on Device Intelligence, Computing and Communication Technologies (DICCT);2024-03-15

5. Approximating Minimum k-Tree Cover of a Connected Graph Inspired by the Multi-Ferry Routing in Delay Tolerant Networks;International Journal of Foundations of Computer Science;2023-11-16