5th International ICST Conference on Wireless Internet

Research Article

A Distance-Aware Forwarding protocol for beaconless communication in mobile ad hoc networks and its performance

Download334 downloads
  • @INPROCEEDINGS{10.4108/ICST.WICON2010.8513,
        author={Yusuke Inoue and Keiichi Endo and Yutaka Takahashi},
        title={A Distance-Aware Forwarding protocol for beaconless communication in mobile ad hoc networks and its performance},
        proceedings={5th International ICST Conference on Wireless Internet},
        publisher={IEEE},
        proceedings_a={WICON},
        year={2010},
        month={4},
        keywords={Ad hoc networks Algorithm design and analysis Bandwidth Informatics Mobile ad hoc networks Mobile communication Network topology Performance analysis Routing protocols Scalability},
        doi={10.4108/ICST.WICON2010.8513}
    }
    
  • Yusuke Inoue
    Keiichi Endo
    Yutaka Takahashi
    Year: 2010
    A Distance-Aware Forwarding protocol for beaconless communication in mobile ad hoc networks and its performance
    WICON
    IEEE
    DOI: 10.4108/ICST.WICON2010.8513
Yusuke Inoue1,*, Keiichi Endo2,*, Yutaka Takahashi1,*
  • 1: Graduate School of Informatics, Kyoto University, Kyoto 606-8501, Japan
  • 2: Graduate School of Science and Engineering, Ehime University, Matsuyama 790-8577, Japan
*Contact email: inoue928@sys.i.kyoto-u.ac.jp, endo@cs.ehime-u.ac.jp, takahashi@i.kyoto-u.ac.jp

Abstract

Recently, routing protocols for Mobile Ad hoc NET-works (MANETs) which use position information to improve their efficiency have been actively studied. In this paper, we focus on Beacon-Less Routing algorithm (BLR) and propose a new forwarding algorithm that improves BLR and analyze its performance. BLR is efficient to reduce redundancy in its transmissions for flooding. When a node receives a packet, a time variable referred to as deferring time is calculated using the positions of the sender, the receiver, and the final destination of the packet. Each node forwards the packet after this deferring time unless it notices that another node forwards the same packet during the deferring time. As a result, only the node that is assigned the shortest deferring time forwards the packet. It is necessary to make this deferring time as short as possible in order to reduce the total deferring time in a multi-hop transmission. In order to evaluate our approach named Distance-Aware Forwarding (DAF), we carry out a performance analysis. Numerical results demonstrate that the proposed approach reduces the total deferring time in a multi-hop transmission, although the number of hops slightly increases.