Distributed algorithms for finding and maintaining a k-tree core in a dynamic network

Information Processing Letters

Volumn 88, Issue 4, 2003, Pages 187-194

  Srivastava, Saurabh ^a   Ghosh, R K ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

Ad hoc networks; Distributed algorithms; k core; Rooted core; Routing

Indexed keywords

ALGORITHMS; GRAPH THEORY; TREES (MATHEMATICS);

DYNAMIC NETWORKS;

DATA PROCESSING;

EID: 0142106800     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00365-X     Document Type: Article

References (4)

1. Peng S., Stephens A.B., Yesha Y. Algorithms for core and k -core of a tree. J. Algorithms. 15:1993;143-159.
2. Peng S., Lo W.-T. A simple optimal parallel algorithm for a core of a tree. J. Parallel Distributed Comput. 20:1994;388-392.
3. S.-C. Ku, W.-K. Shih, B.-F. Wang, Efficient parallel algorithms for optimally locating a k -leaf tree in a tree network, in: Proc. 1997 Internat. Conf. on Parallel Processing, ICPP '97.
4. Royer E.M., Toh C.-K. A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Magazine Personal Commun. 17:(8):1999;46-55.