• DocumentCode
    3009901
  • Title

    Route optimization scenario of a new scheme based on nested mobile network

  • Author

    Senan, Shayma ; Hashim, AishaHassan A. ; Saeed, Rashid A. ; Hameed, Shihab A. ; Zeki, Akram M. ; Daoud, Jamal I.

  • Author_Institution
    Dept. of Electr. & Comput. Inf., IIUM, Kuala Lumpur, Malaysia
  • fYear
    2012
  • fDate
    3-5 July 2012
  • Firstpage
    717
  • Lastpage
    721
  • Abstract
    With the rapid growth of wireless technologies and increasing number of mobile digital devices, mobility has been an important element on the Internet. NEMO Basic Support, designed by the Internet Engineering Task Force (IETF) to provide network mobility, is not efficient to offer low latency handoff in the case of nested mobile networks because it produces a long transfer delay and excessively large packet sizes due to non-optimal routes and multiple encapsulations. This paper presents a route optimization scenario for nested mobile network using hierarchical structure with Binding Update Tree (BUT). This scheme should reduce packet overhead, handoff latency, packet transmission delay, and achieve optimal routing.
  • Keywords
    Internet; delays; mobile radio; mobility management (mobile radio); optimisation; telecommunication network routing; BUT; IETF; Internet engineering task force; NEMO basic support; binding update tree; handoff latency; hierarchical structure; long transfer delay; mobile digital devices; multiple encapsulations; nested mobile network; network mobility; optimal routing; packet overhead reduction; packet transmission delay; route optimization scenario; wireless technologies; Delay; Mobile communication; Mobile computing; Multi-layer neural network; Optimization; Routing; Routing protocols; NEMO; mobile IPv6; nested mobile networks; route optimization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer and Communication Engineering (ICCCE), 2012 International Conference on
  • Conference_Location
    Kuala Lumpur
  • Print_ISBN
    978-1-4673-0478-8
  • Type

    conf

  • DOI
    10.1109/ICCCE.2012.6271310
  • Filename
    6271310