Shree Murthy
- 1.D. Beyer et. al. "Packet Radio Network Research, Development and Application", Proc. SHAPE Conference on Packer Radio, Amsterdam. 1989.Google Scholar
- 2.D. Beyer. "Accomplishments of the DARPA SURAN Program", Proc. IEEE MILCOM 90, Monterey, California. Dec. 1990.Google Scholar
- 3.D. Bertsekas andR. Gallager, Data Networks, SecondEd. Prentice Hall, Inc. 1992.Google Scholar
- 4.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 Computer Communications Review, 19 (4), 1989, pp.224-236. Google ScholarDigital Library
- 5.Charles E. Perkins and Pravin Bhagwat, "Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers", ACM SIGCOMM. Vol.24 (No.4). Oct. 1994, pp.234-244. Google ScholarDigital Library
- 6.M. Scott Corson and Anthony Ephremides. "A Distributed Routing Algorithm for Mobile Wireless Networks", ACM /. of Wireless Networks. Jan. 1995. pp. 61-81. Google ScholarDigital Library
- 7.JJ. Garcia-Luna-Aceves, "A Fail-Safe Routing Algorithm for Multihop Packet-Radio Networks", IEEE INFOCOM April, 1986.Google Scholar
- 8.J J. Garcia-Luna-Aceves. "Loop-Free Routing Using Diffusing Computations", IEEEIACM Trans. Networking, Vol.1. No. 1. Feb. 1993. pp.130-141. Google ScholarDigital Library
- 9.J. Hagouel, "Issues in Routing for Large and Dynamic Networks", IBM Research Report, RC 9942 (No. 44055). April 1983.Google Scholar
- 10.P.A. Humblet. "Another Adaptive Shortest-Pam Algorithm", IEEE Trans. Comm., Vo1.39. No.6, June 1991, pp.995-1003.Google ScholarCross Ref
- 11.B.M. Lemer. DL. Nielson and F.A. Tobagi, Proc. IEEE. Packet Radio Networks Special Issue. Jan. 1987.Google Scholar
- 12.J. Moy, "OSPF Version 2". RFC 1583, March 1994.Google Scholar
- 13.Shree Murthy and J J. Garcia-Luna-Aceves. "A More Efficient Path-Finding Algorithm", 2gth Asilomor Conference. Pacific Groove, CA, Nov. 1994.Google Scholar
- 14.B. Rajagopalan and M. Faiman, "A Responsive Distributed Shortest-Path Routing Algorithm within Autonomous Systems," Journal of Internetworking: Research and Experience, Vol. 2. No. 1, March 1991. pp. 5169.Google Scholar
- 15.W. T. Zaumen. "Simulations in Drama", NehvorkInformci!tion System Center, SRI International, Menlo Park, California. Jan. 1991.Google Scholar
Index Terms
- A routing protocol for packet radio networks
Recommendations
Fault Tolerant Routing Protocol in Cognitive Radio Networks
The primary objective of the cognitive radio network (CRN) is to improve the spectrum utilization and achieve significant packet delivery ratio (PDR). However, CRN is high failure prone due to the node mobility and primary user (PU) interference. This ...
A smart proactive routing protocol in cognitive radio networks
In this paper, we introduce a smart proactive routing protocol based on the Q-learning algorithm to find the most stable routes which imposes a minimum interference on the primary users. Unlike traditional proactive routing protocols, in our proposed ...
Routing Protocol for Cognitive Radio Ad Hoc Networks
Routing is an important issue in cognitive radio ad hoc networks CRAHNs owing to the stochastic activity of primary users PUs. In particular, route stability remains an important issue in the CRAHN protocols. In this paper, the authors propose a ...
Comments