Wireless Mobile Ad-hoc Networks Research Articles

QMRPRNS: Design of QoS multicast routing protocol using reliable node selection scheme for MANETs

A mobile Ad-Hoc networks (MANETs) is a continuously self-configuring, infrastructure-less network of wireless mobile devices. In which multicast is one of the efficient way of communication. Currently, several research have been conducted to design multicast routing protocols for wireless mobile ad-hoc networks (MANETs). Multicasting is a technique that allow to send the same message to a group of destinations simultaneously. However, it faces several challenges against its implementation in ad-hoc network due to its dynamic nature, lack of bandwidth, short battery lifetime of the mobile devices. The multicast routing protocol MAODV have several constraints as mentioned above. Hence to address these constraints a reliable neighbour nodes selection scheme has been integrated over MAODV. This paper attempt a Quality of Service (QoS) based multicast routing protocol using reliable neighbour nodes selection scheme (QMRPRNS) for same. The simulation has been conducted to compare the performance of the proposed scheme against some existing multicast routing protocols which shows significant improvement over EMAODV and MAODV.

Performance Analysis of QoS Parameters of MANET on Mobility and Energy based Model with Different MANET Routing Protocols

Objectives: A network is group of devices that are connected to each other called as nodes. The nodes can be mobile or static. The performance of mobile Adhoc wireless networks (MANETs) helps to identify the type of applications that are supported by the network. Our objective is Performance analysis of QoS parameters of MANETs on Mobility & Energy based Model with Routing Protocols. Method/Analysis: The various network scenarios of MANETS are simulated using NS2.35. Protocols used to analyze performance are AODV, DSDV and DSR. Network layer parameters (throughput, packet delivery ratio, normalized routing overhead and average end-to-end delay) are evaluated. Network scenarios are generated through variation in pause time and number of nodes. Area of simulation is formed in 600*600 m*m area. Findings/ Results: The mobiles devices in the network get connected only when there is a demand for it. The reactive gateway discovery algorithm is used in AODV and DSR. With the random movement of nodes in the simulated area (direction) and variation in mobility, the delay and packet drop increases but PDR and throughput decreases. There is a significant differential observed while measuring the performance. Our observation with respect to DSR was it reacted well for two parameters delivery ratio and routing overhead. Average delay was less in AODV and DSDV performed well providing loop free path. Conclusion: After the simulation study and all experimental evaluations we can conclude that the DSR protocol dominates all other protocols like AODV and DSDV. The Dynamic Source Routing protocol in mobility and energy based model for throughput, packet delivery ratio performs well than AODV and DSDV. The adverse result is with the increase of node speed, routing overhead increased for DSR. Positive aspect of DSR was that average energy consumption was quite low in contrast to AODV and DSDV.

Security Issues in Mobile Ad Hoc Networks

In wired networks, there are lots of protections while communication occurs. In these networks, the intruders are pass through the firewalls and secured gateways for safe and secured communications. Moreover, the wired networks ensure the secured communications. But, in the case of wireless mobile ad hoc networks, the nodes are dynamic and the topology based and also needs more power consumptions. Because of mobility in wireless mobile adhoc networks, also there are lots of vulnerabilities when the attackers wish to collapse the partial or entire networks. Hence, there are lots of requirement for an understanding of the various problems associated with the wireless mobile networks. In this paper, the various vulnerabilities, attacks and security mechanisms are discussed for mobile ad hoc networks (MANETs) in detail.

Towards an integrated formal method for verification of liveness properties in distributed systems: with application to population protocols

State-based formal methods [e.g. Event-B/RODIN (Abrial in Modeling in Event-B—system and software engineering. Cambridge University Press, Cambridge, 2010; Abrial et al. in Int J Softw Tools Technol Transf (STTT) 12(6):447–466, 2010)] for critical system development and verification are now well established, with track records including tool support and industrial applications. The focus of proof-based verification, in particular, is on safety properties. Liveness properties, which guarantee eventual, or converging computations of some requirements, are less well dealt with. Inductive reasoning about liveness is not explicitly supported. Liveness proofs are often complex and expensive, requiring high-skill levels on the part of the verification engineer. Fairness-based temporal logic approaches have been proposed to address this, e.g. TLA Lamport (ACM Trans Program Lang Syst 16(3):872–923, 1994) and that of Manna and Pnueli (Temporal verification of reactive systems—safety. Springer, New York, 1995). We contribute to this technology need by proposing a fairness-based method integrating temporal and first-order logic, proof and tools for modelling and verification of safety and liveness properties. The method is based on an integration of Event-B and TLA. Building on our previous work (Mery and Poppleton in Integrated formal methods, 10th international conference, IFM 2013, Turku, Finland, pp 208–222, 2013. doi: 10.1007/978-3-642-38613-8_15 ), we present the method via three example population protocols Angluin et al. (Distrib Comput 18(4):235–253, 2006). These were proposed as a theoretical framework for computability reasoning about Wireless Sensor Network and Mobile Ad-Hoc Network algorithms. Our examples present typical liveness and convergence requirements. We prove convergence results for the examples by integrated modelling and proof with Event-B/RODIN and TLA. We exploit existing proof rules, define and apply three new proof rules; soundness proofs are also provided. During the process we observe certain repeating patterns in the proofs. These are easily identified and reused because of the explicit nature of the reasoning.

Impact of Node Mobility with OLSR Protocol

Optimized Link State Routing Protocol has been designed for wireless mobile ad hoc networks. Wireless Mobile Ad Hoc network is consisting of multiple geographically distributed nodes. These network nodes can perform transaction using wireless links and they don’t need any fixed infrastructure. In wireless mobile ad hoc network node perform task of host and router both. Because of the nodes have mobility feature so the environment of network is very much dynamic in nature, and the topology of network made frequent. Routing protocol made for this network should be capable to respond to the frequent changes in the network topology. This paper consists of analysis of impact of node mobility with OLSR protocol. This study is performed by simulation of network which has been conducted in famous network simulator NS2.

Adaptive Delay Tolerant Routing Protocol (ADTRP) for Cognitive Radio Mobile Ad Hoc Networks

A cognitive radio network (CRN) is a kind of wireless network that consists of wireless devices embedded with cognitive radios that can sense the available channels in the neighborhood and switch the communication channel, if needed. Delay tolerant routing is a challenging task in such network. Hence this paper proposes an adaptive delay tolerant routing protocol shortly termed as ADTRP for cognitive radio mobile ad hoc networks. The performance metrics such as throughput, packet delivery ratio and delay are chosen. Simulations are carried out using cognitive radio cognitive network (CRCN) simulator and the results shows that the proposed protocol ADTRP performs better in terms of improved throughput, better packet delivery ratio, decreased packet drop and reduced delay.

Machine learning for intrusion detection in MANET: a state-of-the-art survey

Machine learning consists of algorithms that are first trained with reference input to "learn" its specifics and then used on unseen input for classification purposes. Mobile ad-hoc wireless networks (MANETs) have drawn much attention to research community due to their advantages and growing demand. However, they appear to be more susceptible to various attacks harming their performance than any other kind of network. Intrusion Detection Systems represent the second line of defense against malevolent behavior to MANETs, since they monitor network activities in order to detect any malicious attempt performed by intruders. Due to the inherent distributed architecture of MANET, traditional cryptography schemes cannot completely safeguard MANETs in terms of novel threats and vulnerabilities, thus by applying machine learning methods for IDS these challenges can be overcome. In this paper, we present the most prominent models for building intrusion detection systems by incorporating machine learning in the MANET scenario. We have structured our survey into four directions of machine learning methods: classification approaches, association rule mining techniques, neural networks and instance based learning approaches. We analyze the most well-known approaches and present notable achievements but also drawbacks or flaws that these methods have. Finally, in concluding our survey we provide some findings of paramount importance identifying open issues in the MANET field of interest.

On Multicast Capacity and Delay in Cognitive Radio Mobile Ad Hoc Networks

In this paper, we focus on the capacity and delay tradeoff for multicast traffic pattern in cognitive radio mobile ad hoc networks (MANETs). In our system model, the primary network consisting of n primary nodes overlaps with the secondary network consisting of m secondary nodes in a unit square. Assume that all nodes move according to an independent and identically distributed mobility model, and each primary node serves as a source that multicasts its packets to kp primary destination nodes, whereas each secondary source node multicasts its packets to ks secondary destination nodes. Under the cell partitioned network model, we study the capacity and delay for the primary networks under two communication schemes, i.e., noncooperative scheme and cooperative scheme. The communication pattern considered for the secondary network is cooperative scheme. Given that m = n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">β</sup> (β > 1), we show that per-node capacities O(1/k <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</sub> ) and O(1/k <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sub> ) are achievable for the primary network and the secondary network, with average delays Θ(n log k <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">p</sub> ) and Θ(m log k <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sub> ), respectively. Moreover, to reduce the average delay in the secondary network, we employ a redundancy scheme and prove that a per-node capacity O(1/k <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sub> √m log k <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sub> ) is achievable with average delay Θ(√m log k <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sub> ). We find that the fundamental delay-capacity tradeoff in the secondary network is delay/capacity ≥ O(mk <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sub> log k <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sub> ) under both cooperative and redundancy schemes.

A Distributed Three-Hop Routing Protocol to Increase the Capacity of Hybrid Wireless Networks

Hybrid wireless networks combining the advantages of both mobile ad-hoc networks and infrastructure wireless networks have been receiving increased attention due to their ultra-high performance. An efficient data routing protocol is important in such networks for high network capacity and scalability. However, most routing protocols for these networks simply combine the ad-hoc transmission mode with the cellular transmission mode, which inherits the drawbacks of ad-hoc transmission. This paper presents a Distributed Three-hop Routing protocol (DTR) for hybrid wireless networks. To take full advantage of the widespread base stations, DTR divides a message data stream into segments and transmits the segments in a distributed manner. It makes full spatial reuse of a system via its high speed ad-hoc interface and alleviates mobile gateway congestion via its cellular interface. Furthermore, sending segments to a number of base stations simultaneously increases throughput and makes full use of widespread base stations. In addition, DTR significantly reduces overhead due to short path lengths and the elimination of route discovery and maintenance. DTR also has a congestion control algorithm to avoid overloading base stations. Theoretical analysis and simulation results show the superiority of DTR in comparison with other routing protocols in terms of throughput capacity, scalability, and mobility resilience. The results also show the effectiveness of the congestion control algorithm in balancing the load between base stations.

Routing Protocol and Simulation Study for Vehicular Adhoc Network Environment

VANET is a highly mobile wireless Adhoc network in which vehicles are simulated as nodes. It is a distributed and self-organized network without need for an infrastructure. The communication between the vehicles is normally accomplished through special electronic devices so that an Adhoc network of the vehicles is formed on the road. The goal of VANET is to achieve inter-vehicle communication and to provide safety and traffic management applications for the road users to enhance the efficiency of the transportation systems. Routing plays a vital role in communication between the vehicles in the network. The performance of the mobile environment is determined by routing protocol. This article presents the architecture, characteristics, applications, routing protocol and the simulation tools used to evaluate the performance of the routing protocol and the performance is evaluated in NS2 in terms of delivery ratio.

English

A Selective packet drop attack is notorious security problem in wireless Mobile Ad-Hoc network (MANET). A mobile Ad-Hoc network is wireless networks without any pre-existing infrastructure and centralizes control. They have self-organizing capabilities with mobile nodes. Ad-Hoc network contains multi-hop routes capabilities within short transmission range. Because of openness nature MANET is malicious by attacker. Several approaches have been proposed for finding malicious activity in MANETs. Due to nonexistence of MANETs infrastructure and well defied perimeter MANETs are susceptible to variety of attacker types. To develop a mechanism which provide strong security and understand the malicious node activity in the MANETs. A new mechanism presented is called KEAM (Key Exchange and Monitoring), which isolate malicious node on selective path in AODV routing protocol and secure the channel. This new methodology is named as “Isolate and prevent Selective Packet Drop Attack in MANETs. It is based on Diffie-Hellman Key exchange and monitor mode technique. Experimental result will be drone with use of NS-2 simulator and simulate result for Throughput, Packet loss, End-to- End Delay and compare the result with existing technique

Network resource efficient routing in mobile ad hoc wireless networks

Network resources in mobile ad hoc wireless networks (MANETs) are constrained due to their dynamic topology and lack of centralized control. Mobile nodes in MANETs tend to broadcast packets to exchange information and consume lots of network resources such as network bandwidth and battery power of each node during forwarding their packets. Hence, the conserving network resource is crucial to maintain the quality of network services without interruptions. In order to discover an ideal routing algorithm that should use minimum network resources and improve network performance, we propose an adaptive-gossiping routing algorithm that saves network bandwidth and energy consumption at each node by reducing the duplicated routing messages. Our new analytical model of adaptive-gossiping probability $$p_{n}$$pn provides a less routing overhead which results in conserving network resources and reducing the end-to-end delay. The both analytical and experimental results of our proposed method confirm its advantages over flooding and static-gossiping based routing protocols in large-scale networks.

A comparison of Mamdani and Sugeno fuzzy based packet scheduler for MANET with a realistic wireless propagation model

The mobile nature of the nodes in a wireless mobile ad-hoc network (MANET) and the error prone link connectivity between nodes pose many challenges. These include frequent route changes, high packet loss, etc. Such problems increase the end-to-end delay and decrease the throughput. This paper proposes two adaptive priority packet scheduling algorithms for MANET based on Mamdani and Sugeno fuzzy inference system. The fuzzy systems consist of three input variables: data rate, signal-to-noise ratio (SNR) and queue size. The fuzzy decision system has been optimised to improve its efficiency. Both fuzzy systems were verified using the Matlab fuzzy toolbox and the performance of both algorithms were evaluated using the riverbed modeler (formally known as OPNET modeler). The results were compared to an existing fuzzy scheduler under various network loads, for constant-bit-rate (CBR) and variable-bit-rate (VBR) traffic. The measuring metrics which form the basis for performance evaluation are end-to-end delay, throughput and packet delivery ratio. The proposed Mamdani and Sugeno scheduler perform better than the existing scheduler for CBR traffic. The end-to-end delay for Mamdani and Sugeno scheduler was reduced by an average of 52% and 54%, respectively. The performance of the throughput and packet delivery ratio for CBR traffic are very similar to the existing scheduler because of the characteristic of the traffic. The network was also at full capacity. The proposed schedulers also showed a better performance for VBR traffic. The end-to-end delay was reduced by an average of 38% and 52%, respectively. Both the throughput and packet delivery ratio (PDR) increased by an average of 53% and 47%, respectively. The Mamdani scheduler is more computationally complex than the Sugeno scheduler, even though they both showed similar network performance. Thus, the Sugeno scheduler is more suitable for real-time applications.

Design of SCS Protocol and Analysis of Quality of Service Parameters for Wireless Sensor Networks

For wireless applications, significant research has been devoted to support real-time transmission with better quality of service requirements. For next generation, a wireless hybrid network that integrates a MANET (Mobile Adhoc Wireless Network) network has been proven to be a better alternative. Guaranteeing of QoS in hybrid networks remains an open problem. In this paper, we propose a new SCS protocol to enhance the QoS Support capability of hybrid networks. This SCS protocol incorporates four algorithms: 1) Path Selection Algorithm to identify the neighbouring node at shortest distance to reduce the delay 2) Routing Algorithm for hopping of data packets via different nodes.3) Mobility Algorithm to decrease the transmission time.4) Multipath Selection Algorithm in order to improve the QoS. Analytical and simulation results of SCS can provide high QoS performance in terms of delay, average delay, throughput, packet delivery ratio. The main objective of our project is to implement the routing protocols in NS2 and to compare simulation parameters like delivery ratio, end to end delay, packet drop, packet sent using SCS, AODV and DSR protocol to provide quality of service in wireless ad hoc network.

Secure Routing Protocol in Delay TolerantNetworks Using Fuzzy Logic Algorithm

Security is the biggest challenge in MANET. MANET presents various types of security attacks on data exchanges taking place between source and destination. In this misbehavior detection schemes for conventional wireless networks has opposed black hole attack and malicious node occur routing, this proposed technique as a great challenges in networks. In this iTrust, a probabilistic misbehavior detection scheme is highly desirable to assure the secure DTN routing as well as the establishment of the trust, among DTN nodes. A zone (routing zone) of a node is used to collect the node information within the range. In this protocol, it cannot achieve the packet delivery ratio, performance and data loss rate. In this paper we are providing the solution against black hole attack which is based on fuzzy rule. Fuzzy rule is used to identify the infected node as well as provide the solution to reduce data loss over network. Fuzzy logic ranges between the value as {0, 1}. Geographic routing is one of the most suitable routing strategies in wireless mobile Adhoc network mainly due to its scalability. Multi Input Multi Output technique used to send data frequently in routing protocol. Analysis and simulation results demonstrate the effectiveness and efficiency of the drop node analysis, high packet delivery ratio, throughput and delay.

Collision Avoidance in Mobile Wireless Ad-Hoc Networks with Enhanced MACAW Protocol Suite

Jamming attack is quite serious threat for Mobile networks that collapses all necessary communication infrastructure. Since mobile nodes in Mobile Ad Hoc Networks (MANET) communicate in a multi-hop mode, there is always a possibility for an intruder to launch a jamming attack in order to intercept communication among communication nodes. In this study, a network simulation has been carried out in order to explore and evaluate the possible impacts of jamming attack on MACAW protocol. Ad-hoc network modelling is used to provide communication infrastructure among mobile nodes in order to modelling the simulation scenarios. In simulation model, these nodes have used AODV routing protocol which is designed for MANET while second scenario contains simulated MACAW node models for comparison. On the other hand, this paper is the first study that addresses performance evaluation of MACAW protocol under a constant Jamming Attack. The performance of MACAW protocol is simulated through OPNET Modeler 14.5 software.

Trust and Reputation Aware Geographic Routing Method for Wireless Ad Hoc Networks

We consider the problem of secure geographic routing (GR) in mobile wireless ad-hoc networks (WANETs). This paper presents a dependable and pragmatic trust and reputation aware geographic routing (TARA-GR) method for mobile WANETs to achieve self-adaptability, scalability, lightweight communication, and efficiency. It supports the GR decisions by the dynamic computation of consolidated trust value (CTV) of each node in the network by integrating direct and indirect trust values. With the calculated trust value, each source or forwarding node selects the trusted nodes to route the packets from the source to the destination. TARA-GR is integrated with a well known greedy perimetre stateless routing (GPSR) protocol. This integration is termed as TARA-GPSR. The simulation results have shown that TARA-GPSR significantly improved the network performance metrics, such as packet delivery fraction, throughput, and energy consumption.

Quantitative Modeling of Trust and Trust Management Protocols in Next Generation Social Networks Based Wireless Mobile Ad Hoc Networks

Trust and Trust Management represent the very foundations of Computer and Network Security Protocols enabling all cyber activities. Recent spate of national and global high-impact Cyber Security compromises, threats, vulnerabilities, and exposures leads to fundamental questioning of Trust as the key enabler of all cyber phenomena in the unfolding era of exponentially increasing Distrust. It is therefore necessary to understand the current state of Trust and Trust Management modeling and implementation in the most high security environments such as in Defense & Space. Such understanding can serve as a foundation for modeling, design, and implementation of next generation mobile wireless networks for other high security environments such as in Banking & Finance. This study attempts to understand how Trust and Trust Management are being modeled for the “next generation wireless communication systems” (NIST) such as autonomous self-discovering, self-organizing, and self-adaptive mobile ad hoc networks. Within the context of Network-Centric Operations (NCO), we examine: (i) the capabilities of next generation wireless mobile ad hoc networks; (ii) how trust and trust management are modeled in such mobile ad hoc networks; and, (iii) how trust and trust management are implemented in trust-based task assignment in tactical networks. US Army Research Lab (ARL) Computational and Information Sciences Directorate’s Network Science research program on wireless mobile ad hoc networks is the focus of our case study.

Learning System for Proactive Pre-emptive Unified Spectrum Handoff (PRO-PUSH) in Cognitive Radio Mobile Ad Hoc Networks

The aim of this study is to introduce a conceptual framework for the new approach Intelligent Proactive Pre-emptive Unified Spectrum Handoff (IP PRO-PUSH) algorithm is presented, which is a highly potential intelligent technology to intelligently address the spectrum scarcity challenges in Cognitive Radio Mobile Ad hoc Networks (CR-MANETs). The fact that spectrum is a limited natural resource poses technology challenge to ensure the available frequency is used efficiently and able to cope with new services which definitely requires more bandwidth in the future. However, over the past years, traditional approaches to spectrum management have been challenged by new insights into actual use of spectrum. In order to improve the utilization of the overall radio spectrum, the Cognitive Radio (CR) is a useful solution to this low utilization of the radio spectrum. The variation in spectrum band is called spectrum mobility. The objective of the current study is to investigate the Intelligent-Based (IB) cognitive radio learning for IP Pro-PUSH and local routing based on spectrum mobility in mobile Cognitive Radio Ad hoc Networks (CR-MANET) along with a conceptual framework and its connections.

TALK: Topology Aware LKH Key Management

Cryptographic key management for wireless sensor networks (WSNs) and mobile ad-hoc networks (MANETs) is a particularly challenging task, as they mostly consist of high counts of resource constrained nodes, especially when group communication and dynamic network membership capabilities are required. The logical key hierarchy (LKH) is a well-known class of protocols which aims to solve the key management problem and minimize rekeying overhead, using hierarchical structures and taking advantage of multicast communication. In this work we propose a method for obtaining LKH structures by taking into account the topology of the underlying network, leading to a further decrease in rekeying costs, in terms of packet transmissions.