Development and performance analysis of optimal multipoint relaying algorithm for noisy mobile Ad Hoc networks

Other Title(s)

تطوير و تحليل الأداء لخوارزمية التوصيل المتبع المثالية للشبكات اللاسلكية العشوائية المتنقلة المشوشة

Dissertant

Jaradat, Rami Isa Abd al-Latif

Thesis advisor

al-Bahadili, Husayn Ismail

Comitee Members

al-Hamami, Ala Husayn
Kanan, Ghassan Ghazi

University

Amman Arab University

Faculty

Collage of Computer Sciences and Informatics

Department

Department of Computer Science

University Country

Jordan

Degree

Master

Degree Date

2008

English Abstract

Multipoint Relaying (MPR) is a mechanism that can be used to reduce the number of retransmissions and maintain the reachability to all nodes while broadcasting a route discovery packet (i.e., route request (RREQ) packet) in wireless networks.

The mechanism uses different heuristics to select the subset of the first-hop nodes set to forward the RREQ packet, so that the packet will be propagated to the whole network to maintain the highest possible reachability with less number of retransmissions.

According to the heuristic that is used, three main types of MPR algorithms have developed, these are: (i) Connected Dominating Set (CDS)-based MPR (CDS-MPR), QoS-based MPR (QoS-MPR), and Optimized MPR algorithms.

It has been revealed in the literature that MPR algorithms, in general, demonstrate both simplicity and outstanding performance, as compared to other flooding optimization algorithms that are commonly used in wireless ad hoc networks.

However, little efforts have been carried-out to investigate the performance of such algorithms in mobile ad hoc networks (MANETs) that suffer from wide range of packet-loss rate and node mobility.

The main objective of this work is to propose a new heuristic, which can be performed locally, for selecting an optimal set of first-hop neighbors to develop a cost-effective OMPR algorithm that efficiently diffuses RREQ packets in a MANET suffering from high packet-loss rate, due to the presence of noise and node mobility.

The packet-loss rate is expressed in terms of reception probability (pc), which is defined as the probability of a packet being successfully received by a node.

In order to compare and evaluate the performance of the new OMPR algorithm in a realistic MANET environment, four scenarios were simulated using the MANET simulator (MANSim).

The first scenario compares the performance of the OMPR algorithm with other widely-used flooding optimization algorithms, such as: pure flooding, probabilistic flooding with fixed and dynamic retransmission probabilities, location-aided routing scheme 1 (LAR-1), and hybrid LAR-1 and probabilistic (LAR-1P) algorithms.

The other three scenarios were aimed to investigate the effect of a number of parameters (e.g., node density (nd), node mobility (u), and node radio transmission range (R), reception probability (pc)) on the performance of the OMPR algorithm.

In particular, the variation of number of retransmissions, average duplicate reception, and network reachability, with pc for various nd, u, and R were investigated in these scenarios.

The new OMPR algorithm demonstrates an excellent performance in dense, noisy, and high mobility networks when compared with other flooding optimization algorithms, as it achieves the highest cost-effective reachability.

The main drawback of the OMPR algorithm is that it is very sensitive to noise-level; in fact it has the highest sensitivity to noise between all investigated algorithms.

In addition, in this work, the limits of pc up to which OMPR is able to ensure the diffusion of RREQ packets and still can guarantee satisfactory results under different realistic MANET environment, was studied.

Main Subjects

Telecommunications Engineering

Topics

• Telecommunications
• Data processing
• Computer networks
• Ad hoc networks
• Digital communications
• Information networks

No. of Pages

77

Table of Contents

• APA
• MLA
• AMA

Language

English

Data Type

Arab Theses

Record ID

BIM-526161