Cluster based routing using a k-tree core backbone for Mobile Ad hoc Networks

Proceedings of the Discrete Algorithms and Methods for Mobile Computing and Communications

Volumn , Issue , 2002, Pages 14-23

  Srivastava, Saurabh ^a   Ghosh, R K ^a,b  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY GUWAHATI   (India)

Author keywords

Cluster based Routing; Distributed Algorithms; Multihop Packet Radio Networks; Wireless Ad hoc Networks

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; PACKET NETWORKS; ROUTERS; TREES (MATHEMATICS);

AD HOC NETWORKS;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 0036986189     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/570810.570813     Document Type: Conference Paper

References (14)

1. B. Awerbuch. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems. In Proc. 19th Symp. on Theory of Computing, pages 230-240, May 1987.
2. T.-W. Chen and M. Gerla. Global state routing: A new routing scheme for ad-hoc wireless networks. In Proc of IEEE ICC '98, 1998.
3. F. Chin and H. Ting. An almost linear time and o(v log v + e) messages distributed algorithm for minimum weight spanning trees. In Proc. of the Foundations of Computer Science (FOCS) Conf., Portland, Oregon, Oct 1985.
4. M. Faloutsos and M. Molle. Optimal distributed algorithm for minimum spanning trees revisited. In Symp. on Principles of Distributed Computing, pages 231-237, 1995.
5. P. A. Gallager, R.G. Humblet and P. M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and Systems, 5(1):67-77, 1983.
6. K. Krizman, T. Bieda, and T. Rappaport. Wireless position location: fundamentals, implementation strategies, and source of error. In Proc. of the 47th Veh. Tech. Conf., pages 919-923, 1997.
7. S.-C. Ku, W.-K. Shih, and B.-F. Wang. Efficient parallel algorithms for optimally locating a k-leaf tree in a tree network. In Proc. of the 1997 Intl. Conf. on Parallel Processing (ICPP '97), 1997.
8. C. Lin and M. Gerla. Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications, 15(7):1265-1275, Sep 1997.
9. S. Peng and W.-T. Lo. A simple optimal parallel algorithm for a core of a tree. Journal of Parallel and Distributed Computing, 20:388-392, 1994.
10. S. Peng, A. B. Stephens, and Y. Yesha. Algorithms for core and k-tree core of a tree. Journal of Algorithms, 15:143-159, 1993.
11. C. E. Perkins. Ad Hoc Networking. Addison Wesley, 2000.
12. C. E. Perkins. Ad hoc on demand distance vector (AODV) routing. Technical report, Internet draft, draft-ietf-manet-aodv-00.txt., 2000.
13. E. M. Royer and C.-K. Toh. A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Magazine on Personal Communication, 17(8):46-55, 1999.
14. B.-F. Wang. Finding a k-tree core and a k-tree center of a tree network in parallel. IEEE Transactions on Parallel and Distributed Systems, 9(2):186-191, Feb 1998.