2 research outputs found

    Performance Evaluation of an OMPR Algorithm for Route Discovery in Noisy MANETs

    Full text link
    It has been revealed in the literature that pure multipoint relaying (MPR) algorithms demonstrate both simplicity and outstanding performance, as compared to other flooding algorithms in wireless networks. One drawback of pure MPR algorithms is that the selected forwarding set may not represent the optimum selection. In addition, little efforts have been carried-out to investigate the performance of such algorithms in noisy mobile ad hoc networks (MANETs) suffering from high packet-loss and node mobility. In this paper, we develop and evaluate the performance of an optimal MPR (OMPR) algorithm for route discovery in noisy MANETs. The main feature of this new algorithm is that it calculates all possible sets of multipoint relays (MPRs) and then selects the set with minimum number of nodes. The algorithm demonstrates an excellent performance when it is compared with other route discovery algorithms as it achieves the highest cost-effective reachability.Comment: 12 Pages, 8 Figures, 1 Table, Journa

    Analyzing the performance of probabilistic algorithm in noisy manets

    Full text link
    Probabilistic broadcast has been widely used as a flooding optimization mechanism to alleviate the effect of broadcast storm problem (BSP) in mobile ad hoc networks (MANETs). Many research studies have been carried-out to develop and evaluate the performance of this mechanism in an error-free (noiseless) environment. In reality, wireless communication channels in MANETs are an error-prone and suffer from high packet-loss due to presence of noise, i.e., noisy environment. In this paper, we propose a simulation model that can be used to evaluate the performance of probabilistic broadcast for flooding in noisy environment. In the proposed model, the noise-level is represented by a generic name, probability of reception (pc) (0<=pc<=1), where pc=1 for noiseless and <1 for noisy environment. The effect of noise is determined randomly by generating a random number \zeta (0<=\zeta<1); if \zeta<=pc means the packet is successfully delivered to the receiving node, otherwise, unsuccessful delivery occurs. The proposed model is implemented on a MANET simulator, namely, MANSim. The effect of noise on the performance of probabilistic algorithm was investigated in four scenarios. The main conclusions of these scenarios are: the performance of probabilistic algorithm suffers in presence of noise. However, this suffering is less in high density networks, or if the nodes characterized by high retransmission probability or large radio transmission range. The nodes' speed has no or insignificant effect on the performance.Comment: 13 Pages, 13 Figures, Journa
    corecore