Performance Evaluation of Mobility Models over UDP Traffic Pattern for MANET Using NS-2

                                                                                                                  تعرض الدراسة الحالية دراسة وتقييم نماذج محاكاة شبكة الـ MANET على نمط حركة UDP لتحديد تأثيرات نمط الحركة هذا على نماذج التنقل في MANET والتي يتم تنفيذها في محاكي الشبكة NS-2.35 وفقًا لمقاييس الأداء المختلفة (الإنتاجية، نسبة الحزم المنقولة من المصدر الى الهدف  (PDF)، تحميل التوجيه الطبيعي (NRL) و زمن التأخير من نهاية إلى نهاية (AED)) مع مختلف المعلمات مثل السرعات المختلفة، ومناطق بيئة مختلفة، وعدد مختلف من العقد، ومعدلات مرور مختلفة، ومصادر مختلفة للحركة، اختلاف وقت التوقف وأوقات محاكاة مختلفة. نستخدم بروتوكول التوجيه AODV ونموذج نقطة الطريق العشوائية (RWP)، نموذج مجموعة نقاط المرجعي (RPGM)، نموذج غاوس ماركوف (GMM) ونموذج شبكة مانهاتن (MGM) ونماذج التنقل مع نمط الحركة CBR. تُظهر نتائج المحاكاة أن أداء بروتوكول التوجيه مع نموذج نقطة مجموعة المراجع RPGM هو الأفضل مقارنةً بنماذج التحرك الأخرى.  The current study presents the simulative study and evaluation of MANET mobility models over UDP traffic pattern to determine the effects of this traffic pattern on mobility models in MANET which is implemented in NS-2.35 according to various performance metri (Throughput, AED (Average End-2-end Delay), drop packets, NRL (Normalize Routing Load) and PDF (Packet Delivery Fraction)) with various parameters such as different velocities, different environment areas, different number of nodes,  different traffic rates, different traffic sources, different pause times and different simulation times .  A routing protocol.…was exploited AODV(Adhoc On demand Distance Vector) and RWP (Random Waypoint), GMM (Gauss Markov Model), RPGM (Reference Point Group Model) and MGM (Manhattan Grid Model) mobility models above CBR traffic sources. The results of Reference Point Group Model simulation illuminate that routing protocol performance is best with RPG mobility model than other models

Customized Wireless Mesh Routing Metric for Swarm of Drones Applications

With the proliferation of drones applications, there is an increasing need for handling their numerous challenges. One of such challenges arises when a swarm-of-drones is deployed to accomplish a specific task which requires coordination and communication. While this swarm-of-drones is essentially a special form of mobile ad hoc networks (MANETs) which has been studied for many years, there are still some unique requirements of drone applications that necessitates re-visiting MANET approaches. These challenges stem from 3-D environments the drones are deployed in, and their specific way of mobility which adds to the wireless link management challenges. In this thesis, we consider the existing 802.11s wireless mesh standard and adopt its routing capabilities for swarm-of-drones. Specifically, we propose two link quality routing metrics called SrFTime and CRP metrics as an improvement to the 802.11s default Airtime routing metric, to enable better network throughput for drone applications. SrFTime improve network performance of stationary and mobile Wireless Mesh Networks, while CRP is designed to fit the link characteristics of drones and enable more efficient routes from these to their gateway. The evaluations in the actual 802.11s standard indicate that our proposed metrics outperforms the existing one consistently under various conditions

A NUMERICAL STUDY OF LINK AND PATH DURATIONS IN MOBILE AD HOC NETWORKS

A theoretical analysis has shown that under a set of assumptions, the distribution of path duration can be well approximated by an exponential distribution when the path hop count is sufficiently large. The goal of this thesis is two folds: Using NS-2 simulations to (i) Investigate how fast the path distributional convergence takes place, and how quickly the inverse of the expected duration of a path converges to the sum of the inverses of the expected durations of the links along the path, and (ii) Validate the conditions under which the distributional convergence is established. Simulation results show that the convergence of path duration distribution takes place quickly (for path hop count larger than 6) for all eight scenarios. However, the ratio of the inverse of the expected path duration to the sum of the inverses of the expected link durations along the path does not get close to one for path hop count less than 12

Local Area Dynamic Routing Protocol: a Position Based Routing Protocol for MANET

A Mobile Ad Hoc Network (MANET) comprises mobile nodes (MNs), equipped with wireless communications devices; which form a temporary communication network without fixed network infrastructure or topology. The characteristics of MANET are: limited bandwidth; limited radio range; high mobility; and vulnerability to attacks that degrade the signal to noise ratio and bit error rates. These characteristics create challenges to MANET routing protocols. In addition, the mobility pattern of the MNs also has major impact on the MANET routing protocols. The issue of routing and maintaining packets between MNs in the mobile ad hoc networks (MANETs) has always been a challenge; i.e. encountering broadcast storm under high node density, geographically constrained broadcasting of a service discovery message and local minimum problem under low node density. This requires an efficient design and development of a lightweight routing algorithm which can be handled by those GPS equipped devices. Most proposed location based routing protocols however, rely on a single route for each data transmission. They also use a location based system to find the destination address of MNs which over time, will not be accurate and may result in routing loop or routing failure. Our proposed lightweight protocol, ‘Local Area Network Dynamic Routing’ (LANDY) uses a localized routing technique which combines a unique locomotion prediction method and velocity information of MNs to route packets. The protocol is capable of optimising routing performance in advanced mobility scenarios, by reducing the control overhead and improving the data packet delivery. In addition, the approach of using locomotion prediction, has the advantage of fast and accurate routing over other position based routing algorithms in mobile scenarios. Recovery with LANDY is faster than other location protocols, which use mainly greedy algorithms, (such as GPRS), no signalling or configuration of the intermediate nodes is required after a failure. The key difference is that it allows sharing of locomotion and velocity information among the nodes through locomotion table. The protocol is designed for applications in which we expect that nodes will have access to a position service (e.g., future combat system). Simulation results show that LANDY`s performance improves upon other position based routing protocols

Multipath Cluster Based Routing Protocol For Non-Uniform Node Density Mobile Ad Hoc Networks

Rangkaian sementara bergerak (Mobile Ad Hoc Networks, MANET) merupakan suatu kumpulan nod bergerak yang boleh berkomunikasi bersama tanpa memerlukan sebarang infrastruktur tetap dan pengurusan terpusat. MANET begitu popular dalam keadaan ketiadaan lokasi infrastruktur komunikasi tetap, seperti tapak bencana alam atau medan perang. Ketumpatan nod bergerak yang berbeza daripada satu subkawasan dengan subkawasan yang lain didefinisikan sebagai ketumpatan nod tidak seragam. Komunikasi di antara nod dalam rangkaian ketumpatan nod tidak seragam berdepan dengan cabaran keterikatan yang rendah, yang memungkinkan nod lebih rentan atau suseptibel untuk terputus pautan. Keadaan tersebut akan memberi impak terhadap kualiti perkhidmatan (quality of service, QoS) dalam rangkaian. Secara tipikal, ketumpatan nod tidak seragam boleh mempengaruhi prestasi rangkaian.. Sebagai contoh, nisbah penghantaran paket dijangka tinggi dalam subrangkaian ketumpatan tinggi dan rendah dalam subrangkaian ketumpatan rendah. Tesis ini mncadangkan Kluster Berbilang Laluan berdasarkan Protokol Penghalaan (MPCBRP) untuk mengesan masalah keterkaitan yang rendah dalam rangkaian ketumpatan nod tidak seragam dan untuk menambah baik QoS bagi MANET. A mobile ad hoc network (MANET) is a group of mobile nodes that can communicate with one another without the need for a fixed infrastructure and centralized management. MANETs are popular in locations that lack a fixed communication infrastructure, such as in natural disaster sites and battlefields. The varying densities of mobile nodes from one sub-area to another are referred to as non-uniform node densities. The communication between nodes in a network with non-uniform density faces the challenge of low connectivity, in which nodes are susceptible to link breakages. Such condition affects the Quality of Service (QoS) in networks. Typically, a non-uniform node density influences network performance. For instance, packet delivery ratio is expected to be high in high-density sub networks and low in low-density sub networks. This thesis proposes a multipath cluster-based routing protocol (MP-CBRP) to address the problem of low connectivity in networks with non-uniform density and to improve the QoS for MANETs

Resource Management schemes for mobile ad hoc networks

Ph.DDOCTOR OF PHILOSOPH

Building Realistic Mobility Models for Mobile Ad Hoc Networks

A mobile ad hoc network (MANET) is a self-configuring wireless network in which each node could act as a router, as well as a data source or sink. Its application areas include battlefields and vehicular and disaster areas. Many techniques applied to infrastructure-based networks are less effective in MANETs, with routing being a particular challenge. This paper presents a rigorous study into simulation techniques for evaluating routing solutions for MANETs with the aim of producing more realistic simulation models and thereby, more accurate protocol evaluations. MANET simulations require models that reflect the world in which the MANET is to operate. Much of the published research uses movement models, such as the random waypoint (RWP) model, with arbitrary world sizes and node counts. This paper presents a technique for developing more realistic simulation models to test and evaluate MANET protocols. The technique is animation, which is applied to a realistic scenario to produce a model that accurately reflects the size and shape of the world, node count, movement patterns, and time period over which the MANET may operate. The animation technique has been used to develop a battlefield model based on established military tactics. Trace data has been used to build a model of maritime movements in the Irish Sea. Similar world models have been built using the random waypoint movement model for comparison. All models have been built using the ns-2 simulator. These models have been used to compare the performance of three routing protocols: dynamic source routing (DSR), destination-sequenced distance-vector routing (DSDV), and ad hoc n-demand distance vector routing (AODV). The findings reveal that protocol performance is dependent on the model used. In particular, it is shown that RWP models do not reflect the performance of these protocols under realistic circumstances, and protocol selection is subject to the scenario to which it is applied. To conclude, it is possible to develop a range of techniques for modelling scenarios applicable to MANETs, and these simulation models could be utilised for the evaluation of routing protocols