• DocumentCode
    3069588
  • Title

    Performance Modeling for Two-Hop Relay with Erasure Coding in MANETs

  • Author

    Liu, Jiajia ; Jiang, Xiaohong ; Nishiyama, Hiroki ; Kato, Nei

  • Author_Institution
    Tohoku Univ., Sendai, Japan
  • fYear
    2011
  • fDate
    5-9 Dec. 2011
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Among the "store-carry-forward" kind of protocols, the two-hop relay and its variants have become a class of attractive routing protocols for the mobile ad hoc networks (MANETs) due to its efficiency and simplicity. This paper focuses on the performance modeling for two-hop relay with erasure coding, a promising technique for improving the delay performance of conventional two-hop relay with simple replication. A general Markov chain-based theoretical framework is first developed to model the complicated message delivery process in such a network, based on which not only the mean value but also the variance of message delivery delay are derived analytically. The important medium contention, interference and traffic contention issues are carefully incorporated into our analysis, so the new theoretical framework can be used to precisely predicate the message delivery delay performance of two-hop relay with erasure coding, as verified by extensive simulation results.
  • Keywords
    Markov processes; codes; mobile ad hoc networks; radiofrequency interference; routing protocols; telecommunication traffic; MANET; erasure coding; general Markov chain-based theoretical framework; interference issues; medium contention; message delivery delay performance; mobile ad hoc networks; performance modeling; routing protocols; store-carry-forward protocols; traffic contention issues; two-hop relay; Ad hoc networks; Delay; Encoding; Markov processes; Peer to peer computing; Relays; Transient analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE
  • Conference_Location
    Houston, TX, USA
  • ISSN
    1930-529X
  • Print_ISBN
    978-1-4244-9266-4
  • Electronic_ISBN
    1930-529X
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2011.6133595
  • Filename
    6133595