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

Abstract

Deterministic approach to broadcasting in Mobile Ad Hoc Networks (MANETs) is effective in reducing redundant broadcasting. In this approach, a transmitting node selects a subset of its immediate or 1-hop neighbors to rebroadcast the message such that all its 2-hop neighbors will receive the message, or being covered. In order to reduce redundant broadcasting, the set of 1-hop neighbors to be covered should be reduced as much as possible. Another important aspect that affects the effectiveness of a deterministic broadcasting protocol is the termination condition that inhibits a node from transmitting a particular message unnecessarily. However, existing termination conditions are not optimized. We propose a new covered/uncovered termination condition where each node is assigned with covered/uncovered status. In this paper, we show that our covered/uncovered termination condition ensures full network coverage, does not incur any control message overhead, and yet requires the least number of rebroadcasting nodes. When we apply the termination condition to some existing deterministic broadcasting protocols, the saving in the number of broadcasting nodes can be as significant as 45% when there are 100 nodes randomly distributed in an area of 1000 x 1000 m 2 .

Variable power broadcasting based on local information for source-dependent broadcasting protocols

“…In other words, broadcast terminates at a covered node. The proof of correctness is given in [8]. As shown in [8], when applied to either DP, PDP, or TDP, this simple termination condition achieves significant savings in terms of number of broadcasting nodes.…”

“…An additional termination condition, proposed in [8], assigns a covered/uncovered status to each node. Initially, all nodes are uncovered.…”

“…More specifically, we implement these mechanisms on source-dependent broadcasting protocols [5][6][7][8]. These protocols require a broadcasting node to explicitly select a subset of its immediate neighbors (or 1-hop neighbors) to cover all its 2-hop neighbors.…”

Revisiting XOR-based network coding for energy efficient broadcasting in mobile ad hoc networks

“…Towards a more efficient solution, we propose the modified covered/uncovered (MC/U) termination criterion that extends C/U. We choose to build on top of C/U because both the related literature [36,37] and our experimental results ( Fig. 1 and Fig.…”

“…Multiple criteria have been proposed in the literature [33,[36][37][38]. In the rest of this paper we will use the terminology proposed in [33] and [36] to refer to these criteria: Termination Criterion 1 [Marked/unmarked (M/U)]: Each node keeps track of the packets received by each of its 1-hop neighbors. Then, in the case of a duplicate reception, a forwarder transmits the received duplicate if at least one of the neighbors is not marked to have received the packet.…”