• DocumentCode
    2972364
  • Title

    A Ranging-Based Link Availability Routing Algorithm for MANETs

  • Author

    Yu, Ming ; Bao, Jamin

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Florida State Univ., Tallahassee, FL, USA
  • fYear
    2010
  • fDate
    18-21 April 2010
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    For the design of mobile ad hoc networks, particularly those consisting of low-cost devices, we propose a new routing algorithm, called ranging-based link availability routing (RBLAR). In order to reduce link breakages during data services, we propose a new link cost, i.e., the unavailability of a link. In order to reduce the cost and complexity of the implementation, we propose to use only ranging information in the link availability, in stead of complete localization information. Based on the new metrics, the routing is formulated as an optimal routing problem, for which a heuristic algorithm is developed. Simulation results have demonstrated that RBLAR significantly improves link connectivity by reducing link breaks and also network performance including packet delivery ratio and throughput, as compared to the existing routing algorithms.
  • Keywords
    Availability; Communications Society; Computer networks; Costs; Design engineering; Heuristic algorithms; Mobile ad hoc networks; Network topology; Peer to peer computing; Routing protocols;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications and Networking Conference (WCNC), 2010 IEEE
  • Conference_Location
    Sydney, Australia
  • ISSN
    1525-3511
  • Print_ISBN
    978-1-4244-6396-1
  • Type

    conf

  • DOI
    10.1109/WCNC.2010.5506429
  • Filename
    5506429