Research Output

A new efficient distributed route discovery for wireless mobile ad hoc networks.

  High performance group communication, such as broadcast, requires matching efficient broadcast algorithms to effective route discovery approach. Broadcast communication in MANETs is essential for a wide range of important applications. Nevertheless, existing broadcast schemes in MANETs suffer in terms of several issues such as rebroadcast redundancy and collisions. Consequently, this degrades the communication quality especially when dealing with high bandwidth applications. Thus, this paper adopts a new strategy that presents a new distributed route discovery (DRD) scheme to handle the broadcast operation efficiently by reducing the number of the broadcast redundancy request (RREQ) packets and the number of collision and contentions. We examined the performance of the proposed scheme DRD in MANETs; in terms of RREQ rebroadcast number and RREQ collision number. Our experiments confirm the superiority of the proposed scheme over its counterparts in different communication constraints.

  • Type:

    Book Chapter

  • Date:

    30 November 2011

  • Publication Status:

    Published

  • Publisher

    IEEE Communication Society

  • DOI:

    10.1109/WTS.2012.6266129

  • Library of Congress:

    QA75 Electronic computers. Computer science

  • Dewey Decimal Classification:

    004 Data processing & computer science

Citation

Bani Khalaf, M., Al-Dubai, A. & Buchanan, W. J. (2011). A new efficient distributed route discovery for wireless mobile ad hoc networks. In Wireless Telecommunications Symposium (WTS), 2012, 1-6. IEEE Communication Society. doi:10.1109/WTS.2012.6266129. ISBN 978-1-4577-0579-3

Authors

Keywords

Ad-hoc routing; wireless mobile networks; Broadcast; Network global; Probabilistic route discovery; local density;

Available Documents