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

MQMF: Multiple Quality Measure Factors for Trust Computation and Security in MANET

Identification of the mobile ad hoc network node in a secure, reliable communication is a very important factor. It will be a node in the service of reconciliation and node behaviour leads to uncertainty. It is always challenge to manage node security and resource due to the complexity of high mobility and resource constraints. Trust based security provides light-weight security computing for individual node trust to provide reliable and quality of service. In this paper we present a multiple quality measure factors (MQMF) approach for computing node trust to improvise the quality of service. It compute four quality measure factors based on node throughput and packet drop during communication to measure the node individual trustworthiness. It prevent the network from anomalous and malicious nodes to improvise the security and throughput. The evaluation measures shows an improvisation in throughput with less packet drop and computational overload in compare to existing protocols

An energy scaled and expanded vector-based forwarding scheme for industrial underwater acoustic sensor networks with sink mobility

Industrial Underwater Acoustic Sensor Networks (IUASNs) come with intrinsic challenges like long propagation delay, small bandwidth, large energy consumption, three-dimensional deployment, and high deployment and battery replacement cost. Any routing strategy proposed for IUASN must take into account these constraints. The vector based forwarding schemes in literature forward data packets to sink using holding time and location information of the sender, forwarder, and sink nodes. Holding time suppresses data broadcasts; however, it fails to keep energy and delay fairness in the network. To achieve this, we propose an Energy Scaled and Expanded Vector-Based Forwarding (ESEVBF) scheme. ESEVBF uses the residual energy of the node to scale and vector pipeline distance ratio to expand the holding time. Resulting scaled and expanded holding time of all forwarding nodes has a significant difference to avoid multiple forwarding, which reduces energy consumption and energy balancing in the network. If a node has a minimum holding time among its neighbors, it shrinks the holding time and quickly forwards the data packets upstream. The performance of ESEVBF is analyzed through in network scenario with and without node mobility to ensure its effectiveness. Simulation results show that ESEVBF has low energy consumption, reduces forwarded data copies, and less end-to-end delay

An Effective Data Privacy Mechanism through Secure Session Key Exchange Model for MANET

Data privacy in the mobile ad-hoc network is a problem due to wireless medium, frequent node movement and lack of any centralized infrastructure support. In such case, it is very important to build a reliable and secure network and achieve high throughput in MANET. The reliability and security of a network depend on whether the network remains linked to different failures and malicious activities, which is the fundamental issue that needs to be focused when designing a secure routing protocol in MANET. This paper proposes an effective privacy mechanism to handle data security through a novel secure session key exchange model, which provides the node data privacy and network stability for a longer period of time and prevents abnormal behavior changes due to malicious behavior and different type of attacks in the network. The simulation results show improvement in throughput with nominal overhead and end-to-end delay in different malicious conditions against existing protocols

AODV (ST_AODV) on MANETs with Path Security and Trust-based Routing

The nodes of the MANET are connected by an autonomous that has no predetermined structure (Mobile ad hoc Network). When a node's proximity to other nodes is maintained dynamically via the use of relying nodes, the MANET network's node-to-node connection is un-trusted because of node mobility. If a node relies on self-resources at any point in time, it runs the risk of acting as a selfish or malicious node, the untrusted selfish or malicious node in the network. An end-to-end routing route that is secure has been presented to enhance the security of the path based on the AODV routing protocol using ST AODV (Secure and Trust ADV). To do this, we must first identify the selfish/malicious nodes in the network and analyse their past activity to determine their current trust levels. A node's stage of belief is indicated by the packet messages it sends. In order to resolve each route, trust must be identified and the path's metadata in RREP must be updated