• DocumentCode
    3275048
  • Title

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

  • Author

    Magal, R. Kalai ; Ramar, K.

  • Author_Institution
    Dept of Comput. Technol. & Applic., Coimbatore Inst. of Technol., Coimbatore
  • fYear
    2006
  • fDate
    20-23 Dec. 2006
  • Firstpage
    190
  • Lastpage
    191
  • Abstract
    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.
  • Keywords
    mobile computing; multicast communication; telecommunication network routing; trees (mathematics); heterogeneous mobile computing; maximum degree base station; tree routing algorithm; Base stations; Computer architecture; Computer networks; Delay; Heuristic algorithms; Mobile computing; Multicast algorithms; Multicast communication; Routing; Spine;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Ad Hoc and Ubiquitous Computing, 2006. ISAUHC '06. International Symposium on
  • Conference_Location
    Surathkal
  • Print_ISBN
    1-4244-0731-1
  • Electronic_ISBN
    1-4244-1492-X
  • Type

    conf

  • DOI
    10.1109/ISAHUC.2006.4290673
  • Filename
    4290673