Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2009, Vol. 32 ›› Issue (6): 53-56.doi: 10.13190/jbupt.200906.53.hup

• Papers • Previous Articles     Next Articles

A Dynamic Broadcasting Algorithm for on-Demand Routing Protocol in Ad Hoc Network

HU Peng;LIU Yuan-an;MA Xiao-lei;GAO Song   

  1. (School of Electronic Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China)
  • Received:2009-04-09 Revised:2009-09-17 Online:2009-12-28 Published:2009-12-28
  • Contact: HU Peng

Abstract:

Broadcasting is a common operation for establishing on-demand routing protocols and updating routing table. A straightforward broadcasting by flooding results in serious redundancy and contention. To increase broadcasting efficiency of Ad hoc network, a dynamic broadcasting algorithm for on-demand routing protocol is proposed, which computes the rebroadcast probability of message based on neighbor node density and relative distance. Consequently the rebroadcast probability of redundancy message is reduced and the contention problem is alleviated. By applying this algorithm in network simulation platform, the simulation results show that the proposed algorithm improves the protocol efficiency and reduces the redundant information.

Key words: Ad hoc network, broadcast, dynamic broadcasting algorithm