A distributed routing algorithm for supporting connection-oriented service in wireless networks with time-varying connectivity

Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998

Volumn , Issue , 1998, Pages 587-591

  Michail, A ^a   Ephremides, A ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCKING PROBABILITY; TIME VARYING NETWORKS; WIRELESS NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

CONNECTION ORIENTED; DISTRIBUTED DYNAMICS; DISTRIBUTED INFORMATION; DISTRIBUTED ROUTING ALGORITHM; FORCED TERMINATION; NEW CALL-BLOCKING PROBABILITY; UNPREDICTABLE CHANGES; WIRELESS COMMUNICATION NETWORK;

ROUTING ALGORITHMS;

EID: 85013599031     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCC.1998.702599     Document Type: Conference Paper

References (5)

1. M. Corson and A. Ephremides. A distributed routing algorithm for mobile wireless networks. Wireless Networks, 1:61-81, 1995
2. J. J. Garcia-Aceves and S. Murthy. A path-finding algorithm for loop-free routing. IEEE/ACM Transactions on Networking, 5:148-160, February 1997
3. A. Michail, W. Chen, and A. Ephremides. Distributed routing and resource allocation for connection-oriented traffic in ad-hoc wireless networks. In Conference on Information Sciences and Systems, March 1998
4. V. Park and M. S. Corson. A highly adaptive distributed routing algorithm for mobile wireless networks. In Proc. IEEE INFOCOM'97, Japan, April 1997
5. C. Perkins and P. Bhagwat. Highly dynamic destinationsequenced distance vector routing (dsdv) for mobile computers. In ACM SIGCOMM, October 1994