Self-Pruning Broadcasting for Mobile Ad Hoc Networks

Abstract

Broadcasting is a process of delivering a message to all nodes in a network. While it is important to ensure that all nodes get a copy of the broadcast message, minimizing the number of sending nodes is equally important especially in resource-constrained wireless networks. Existing broadcasting protocols based on self-pruning are ineffective in achieving these objectives. Therefore this paper proposes two protocols based on simple timer mechanisms to prioritize broadcasting of messages such that node with most uncovered neighbors rebroadcast first. Additionally a timer suppression mechanism is proposed to further enhance the effectiveness of the broadcasting protocol. Compared with an existing protocol, extensive simulation experiments confirm that the proposed protocols achieve better performance.

Enhanced Variable Power Broadcasting Based on Local Information in Mobile Ad Hoc Networks

“…For example, the RBT adopted by INOP is to give priority to nodes with most not-yet-covered neighbors rebroadcast first so as to quickly cover as many nodes as possible. Although this type of heuristics is effective in reducing the number of broadcasting [2,4], a recent study [4] shows that a simple timer suppression mechanism is effective in further reducing the number of broadcasting. Specifically, when a node is in "backoff" state and receives the same (redundant) broadcast message again, its "backoff" timer RBT is reset and re-started using either (3) or (4) based on N (s) , the current number of not-yet-covered nodes in N (s).…”

“…Since nodes in a MANET are battery-powered, efficient broadcasting protocols are essential in prolonging the lifetime of nodes. Existing work on broadcasting mainly focuses on reducing the number of nodes involved in the broadcasting process while ensuring high delivery ratio [1][2][3][4]. Notably, one common feature of these protocols is the use of fixed transmission power.…”

Enhanced Termination Condition for Deterministic Broadcasting Protocols in Mobile Ad Hoc Networks

“…Obviously, pure flooding incurs a lot of redundant broadcasting. More efficient broadcasting protocols based on self-pruning can be found in [1][2][3], and some of them require neighborhood information for setting the "backoff" timer. In order to obtain updated neighborhood information, periodic HELLO message exchanges among neighboring nodes is required.…”

“…already received the message), the node terminates its broadcasting. To find out if all 1-hop neighbors are covered [1], the neighborhood knowledge is used together with a "backoff" timer. The purpose of a "backoff" timer is to defer the rebroadcasting action, thereby gaining sufficient time to infer the status of its 1-hop neighbors.…”

Efficient broadcasting using packet history in mobile ad hoc networks

“…Moreover, this is accomplished in parallel to a reduction of the number of forward nodes that ranges in ∼13. [5][6][7][8][9][10][11][12][13][14][15].5% for all mobility levels. This result confirms the tradeoff that HDP introduces since its performance lies between that of DP and H2DP.…”