• DocumentCode
    2889810
  • Title

    FSA: A Fast Coordination Scheme for Opportunistic Routing

  • Author

    Yang, Zhenyu ; Zeng, Kai ; Lou, Wenjing

  • Author_Institution
    Dept. of ECE, Worcester Polytech. Inst., Worcester, MA, USA
  • fYear
    2009
  • fDate
    14-18 June 2009
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Opportunistic Routing (OR) has been considered as one promising technique to overcome the unreliability of the wireless medium by collaborating multiple neighboring receivers/candidates for packet forwarding. A key challenge in OR is how to efficiently coordinate the multiple candidates and ensure only one of them to forward the packet. In this paper, we investigate the existing candidate coordination schemes and propose a "fast slotted acknowledgment" (FSA) to further improve the performance of OR by using single ACK with the help of channel sensing technique. The simulation results show that FSA can reduce the average end-to-end time delay of OR protocols by up to 50% compared with state-of-the-art coordination schemes in light traffic scenarios and can increase the average end-to-end throughput by up to 20% in heavy traffic scenarios.
  • Keywords
    delays; packet radio networks; routing protocols; telecommunication traffic; wireless channels; OR protocols; channel sensing technique; end-to-end time delay; fast slotted acknowledgment; multihop wireless networks; opportunistic routing coordination scheme; packet forwarding; traffic scenarios; Broadcasting; Collaboration; Communications Society; Delay effects; Performance analysis; Protocols; Routing; Telecommunication traffic; Throughput; Traffic control;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, 2009. ICC '09. IEEE International Conference on
  • Conference_Location
    Dresden
  • ISSN
    1938-1883
  • Print_ISBN
    978-1-4244-3435-0
  • Electronic_ISBN
    1938-1883
  • Type

    conf

  • DOI
    10.1109/ICC.2009.5199042
  • Filename
    5199042