By Topic

A Maximum Degree Base Station(MDBS) Multicast Routing Algorithm for Mobile Computing Environment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
R. Kalai Magal ; Lecturer, Dept of Computer Technology and Applications, Coimbatore Institute of Technology, Coimbatore-14. Email: kalai ; K. Ramar

We propose the new infrastructure and an algorithm for multicast routing in heterogeneous mobile computing (wireline/wireless) environments. The goal of the proposed architecture is to reduce the latency and overheads of joins, leaves and handoffs in the regions that experience high group dynamics and mobility. The proposed architecture focuses on a maximum degree base station tree (MDBST) routing algorithm and an infrastructure that is designed to support low latency joins, leaves and hands off, though the resulting multicast tree may be sub-optimal. Our new infrastructure uses the maximum degree base tree algorithm in dynamic regions.

Published in:

Ad Hoc and Ubiquitous Computing, 2006. ISAUHC '06. International Symposium on

Date of Conference:

20-23 Dec. 2006