• DocumentCode
    3121595
  • Title

    Can geographic routing scale when nodes are mobile?

  • Author

    Ramasamy, Dinesh ; Madhow, Upamanyu

  • Author_Institution
    Univ. of California, Santa Barbara, CA, USA
  • fYear
    2012
  • fDate
    1-6 July 2012
  • Firstpage
    224
  • Lastpage
    228
  • Abstract
    We begin by asking whether geographic routing can scale when nodes are mobile; that is, can the overhead involved in tracking node locations be accommodated within the transport capacity of large-scale mobile ad hoc networks (MANETs)? We answer this question in the affirmative by proposing an efficient position publish protocol which fits within the transport capacity and a routing protocol that operates with imperfect information of the destination´s location. The routing protocol guarantees, with high probability, routes whose lengths are within a constant “stretch” factor of the shortest path from source to destination. The key idea underlying the scalability of the publish protocol is for each potential destination node to send location updates (with frequency decaying with distance) only to a subset of network nodes, structured as annular regions around it (the natural approach of updating circular regions in distance-dependent fashion does not scale). The routing protocol must then account for the fact that the source and/or relay nodes may not have estimates of the destination´s location (or may have stale estimates). Spatial and temporal scaling of protocol parameters are chosen so as to guarantee scalability, route reliability and route stretch.
  • Keywords
    MIMO communication; Rayleigh channels; diversity reception; telecommunication network routing; base station cooperation; channel capacity; channel matrices; ergodic sum capacity; flat Rayleigh fading; geographically distributed; macrodiversity MIMO systems; Indexes; Mobile computing; Relays; Routing; Routing protocols; Scalability;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • ISSN
    2157-8095
  • Print_ISBN
    978-1-4673-2580-6
  • Electronic_ISBN
    2157-8095
  • Type

    conf

  • DOI
    10.1109/ISIT.2012.6283854
  • Filename
    6283854