Power-Efficient and Path-Stable Broadcasting Scheme for Wireless Ad Hoc Networks

Abstract

The simplest broadcasting scheme in the mobile ad hoc networks (MANETs) uses flooding which may result in the broadcast storm problem. The MultiPoint Relays (MPR) is another broadcasting scheme for solving the broadcast storm problem. In MPR, the mobile hosts (MHs) use a greedy algorithm to find a connected dominating set (CDS) by the exchange of 2-hop neighbor information. In order to reduce the size of CDS, the greedy algorithm used by MPR usually selects the farthest nodes from the source called the border nodes as the forwarding nodes. Since the border nodes have a higher probability of moving out the transmission range, the routing paths in MPR from the source to some destinations may be unstable. In this paper, we propose a broadcasting scheme called Dynamic Power-aware and Stability-aware MultiPoint Relays (DPS-MPR) which avoids selecting the border nodes as the forwarding nodes. As a result, the transmission range of MHs can be reduced for saving energy and the negative impact of unstable forwarding nodes can also be reduced. In addition, we use a range buffer to further enhance the stability of the forwarding nodes. We evaluate the performance of the proposed DPS-MPR by using NS2 and compared it with the existing schemes. The experimental result shows that DPS-MPR saves 20%~25% of energy and increases the lifetime of forwarding nodes by several seconds.

EF-MPR, a new energy eFficient multi-point relay selection algorithm for MANET

“…LD represents the link duration when a node is in the transmission range of another distinct node. This work has employed a different sort of mobility metrics and choose the nodes as MPRs which have less mobility similar to [7] and [8]. Contrary to the aforementioned methods, [10] concentrated on Quality of Service metrics.…”

“…In addition, their work uses a range buffer in order to further enhancing the stability of the forwarding nodes. Similar to [7], [8] tries to choose more stable nodes as MPRs and predict the mobility in different way. Therefore, their approach needs more memory space to buffer the range to enhance the stability.…”

“…In other words, MPR is the Unicost Set Covering Problem that the cost for selecting all nodes in N i set is equal. However, in some researches, despite of original MPR definition, the weight functions for MPR were defined as the willingness to forward data [7], power [8], and stability [9].…”

“…Due to the movement, the possibility that a MPR node gets out of the selector transmission range is high. In [8], the authors proposed a broadcasting scheme called Dynamic Power-aware and Stability-aware MultiPoint Relays (DPS-MPR) that prevents the border nodes from becoming MPR nodes. Moreover, they also suggest reducing the transmission range of nodes to save energy.…”

Improving Route Discovery Using Stable Connected Dominating Set in MANETS

“…Only few works are done in stable connected dominating set construction. In [15], Change proposed Dynamic Power-aware and Stability-aware Multipoint relays which avoid selecting the border nodes as the forwarding nodes. They used power adaptive broadcasting by reducing the transmission range of mobile nodes to save energy.…”