Nodes In Mobile Ad Hoc Networks Research Articles

Security Issue In Mobile Ad-Hoc Network

Ad-hoc networks are a new paradigm of wireless communication for mobile host’s need the certification system allocated by the central authorities and this is done by PKI which secures the network. PKI schemes in an efficient way. Mobile ad hoc network (MANET) technology spreads widely in these days. It is suitable for environments that need on fly setup. A lot of challenges come with implementing these networks. The most sensitive challenge that MANET faces is the security issue. Traditional Public Key cryptography (PKC) and Identity based Cryptography (IBE) are slow and not suitable for these environments because of the nodes resources limitations. This paper is going to discuss the security of MANET using the PKI schemes in an efficient way. This solution provides a secure way for MANET nodes to authenticate each other and to secure data sent by each other, But PKI is having the overhead problems as large number of authentication messages transferred between nodes. In this research we have presented a new algorithm that will extend the drawbacks of PKI technique and make the network much secure and reliable for small and larger scale networks. Keys and certificates have to be issued to each node (trusted), neglecting malicious nodes on the track and finding the valid route to transfer the data, in other words we have to design the algorithm that store all the path in the server and locations of all the nodes, which changes their location dynamically. Keywords: Mobile Ad hoc Networks, Security, Public Key Cryptography, Trusted authority, Central Authority.

Lightweight Acknowledgement-Based Method to Detect Misbehavior in MANETs

Mobile Ad hoc NETworks (MANETs) are the best choice when mobility, scalability, and decentralized network infrastructure are needed. Because of critical mission applications of MANETs, network security is the vital requirement. Most routing protocols in MANETs assume that every node in the network is trustworthy. However, due to the open medium, the wide distribution, and the lack of nodes’ physical protection, attackers can easily compromise MANETs by inserting misbehaving nodes into the network that make blackhole attacks. Previous research to detect the misbehaving nodes in MANETs used the overhearing methods, or additional ACKnowledgement (ACK) packets to confirm the reception of data packets. In this paper a special lightweight acknowledgement-based method is developed that, contrary to existing methods, it uses ACK packets of MAC layer instead of adding new ACK packets to the network layer for confirmations. In fact, this novel method, named PIGACK, uses ACK packets of MAC 802.11 to piggyback confirmations from a receiver to a sender in the same transmission duration that the sender sends a data packet to the receiver. Analytical and simulation results show that the proposed method considerably decreases the network overhead and increases the packet delivery ratio compared to the well-known method (2ACK).

Performance Measure Modeling of Routing Protocols in MANET

Mobile ad-hoc networks (MANETs) are recently attracting a lot of interest due to their widely available wireless devices and low communication cost. MANET comprises a set of wireless communicating devices able to connect instantaneously without any preexisting base station. Due to a limited transmission range of mobile devices, they need multi-hop routing for communication. In MANET nodes can change topology in an unpredictable manner so they need an efficient routing protocol which can handle the changing topology. However, MANET suffers from many challenges, including decentralization, low memory device, infrastructure less, bandwidth and limited battery reservoir. Different modes of the nodes like active-communication mode and non-activecommunication mode consume available energy of a node. This paper presents an energy measurement model which shows the remaining energy level in each mobile node after some activity. The parameters required for designing energy measurement model consist of initialEnergy, txPower, rxPower, and idlePower. This paper also evaluates the performance measure metrics of two routing protocols such as Ad hoc On Demand Distance Vector (AODV) and Destination Sequenced Distance Vector (DSDV). This paper analyzes these routing protocols by simulation tested in network simulator (NS2). The performance will be studied based on Throughput, Packet loss, Routing delay, Cumulative sum of dropped packets, Calculate energy consumption and remaining energy at each node.

FINDING SHORTEST ROUTING SOLUTION IN MOBILE AD HOC NETWORKS USING FIREFLY ALGORITHM AND QUEUING NETWORK ANALYSIS

Mobile ad hoc network (MANET) is a group of mobile nodes establishing a wireless network without using centralized and fixed infrastructure. In MANET, nodes may function as hosts and routers. The nodes can move freely and in arbitrary ways. The network topology in MANET is dynamic because of the frequent mobility of nodes, thus routing is challenging aspects in MANET. Routing protocol plays a role in choosing and selecting the optimal route for transferring the packets of data from the source node to the destination node efficiently. Mostly the previous routing protocols are not practical to this dynamic network topology. Therefore designing an efficient routing protocol for this dynamic network is vital issue. In this paper, the author has proposed an approach, which selects shortest route for transferring the packets of data from source node to the destination node combining firefly algorithm and queuing network analysis. Firefly algorithm can be applied to find the shortest route in this routing problem. The response times taken to send packets of data can be calculated using the suggested queuing model. The result reveals that attractiveness of node in MANET decreases with the increasing value of response time.

Evaluating the effect of static components in MANET by simulations

Mobile ad hoc Networks (MANETs) are temporary networks, that require relatively less time to be deployed and less resources to keep up and running. They can be implemented in disaster recovery sites, university campuses, military campaigns and so on. MANET nodes cooperate in an autonomous way by forwarding packets to each-other. Considering mobility of the nodes, the routes change dynamically so routing algorithms are very important for operation of MANETs. At a given time, not all the nodes can be mobile. A grid of static nodes, which will also support the communication between mobile nodes, may also be considered. In this paper, we analyze the performance of a MANET considering different number of static nodes in the network. For moving nodes we use Random Way-point Mobility (RWM) model. We evaluate the performance by measuring the number of hops and throughput for one-flow traffic. For all topologies, the average throughput is around 5 times lower than CBR of sent data. The number of hops is higher and has more oscillations for denser networks.

Implemented and Evaluated the Byzantine Attack with the Aid of Rushing Attack in Manet

The nodes in Mobile Ad-hoc Network(MANET) interacts with one another within the absence of any centralized authority by that the Security is the one of the major problem in MANET. The various security schemes against attack are upgrade the network performance in presence of assaulter to disable misbehavior activity .In this paper we tend to examine the behavior of Byzantine attack result in network that put out infected packets in network that are beyond the capacity of network and apply proffer Intrusion Detection Scheme (IDS) scheme to secure the network from attacker. The proffer IDS scheme is detect the attacker behavior by matching the profile of attacker to normal nodes in network if the profile of nodes are traditional within the foam of correct information delivery in network then the IDS are confirm the network has no attack however if the attack is recognized then IDS has aware of the attacker node in network and additionally managed the profile of attacker and count the infection percentage that infected the network performance. The IDS scheme is 100% recover the network performance as adequate to traditional routing. General Terms Mobile Ad-Hoc Network (MANET)

Different types of Sybili attacks and their importance and properties for finding latest mechanism

A Mobile Ad hoc Network (MANET) consists of a set of communicating wireless mobile nodes or devices that do not have any form of fixed infrastructure or centralized authority. The security in MANET has become a significant and active topic within the research community. This is because of the high demand in sharing streaming video and audio in various applications .Once MANET is setup it quickly facilitate communications in a hostile environment such as battlefield or emergency situation likes disaster rescue operation. In spite of the several attacks aimed at specific nodes in MANET that have been uncovered, some attacks involving multiple nodes still receive little attention. A reason behind this is because people make use of security mechanisms applicable to wired networks in MANET and overlook the security measures that apply to MANET. Furthermore, it may also have to do with the fact that no survey or taxonomy has been done to clarify the characteristics of different multiple node attacks. This paper addresses the mentioned gap by providing a proper definition and categorization of Sybil attacks in MANET. The whole simulation will take place in MATLAB environment. In the end performance is measured by using the parameters like network load and throughput.

Energy Efficient Landmark Selection for Group Mobility Model in MANET

Background: Mobile Ad hoc Network (MANET) has its application in tough terrains such as battle fields, disaster recovery, emergency rescue operations etc. The usage of MANET in these areas are very critical for communication. Energy is an important criterion in MANET for the successful communication of nodes without a link failure. The most of the mobile nodes are powered by battery. The nodes does routing which transfers the packets from source to destination. The consumption of energy by routing nodes arises the need for energy aware routing. Methods: In this work, an energy efficient LANDMARK selection process for E-LANMAR routing protocol in group mobility for a moderate networks size is proposed. In the proposed work, energy efficiency of a header node (LANDMARK) can be achieved by minimizing the frequent header selection process. This work is modelled and simulated in QUALNET 5.0.2 Simulator. The LANDNARK acts as a cluster head, the cluster head selection is based not only on the number of neighbours but also residual energy of a node. Results: The results shows that throughput and Packet Delivery Ratio (PDR) for E-LANMAR is better compared with LANMAR routing protocol. The reduction of frequent LANDMARK selection process in E-LANMAR routing protocol reduces the energy consumption of nodes further in group mobility. Application: The proposed work can be applied wherever the nodes in MANET moves in a group such as an emergency rescue operations, army battle field communication etc.

Performance Comparison of MISP-based MANET Strong DAD Protocol

A broadcast operation is the fundamental transmission technique in mobile ad-hoc networks (MANETs). Because a broadcast operation can cause a broadcast storm, only selected forwarding nodes have the right to rebroadcast a broadcast message among the one-hop and two-hop neighboring nodes of a sender. This paper proposes the maximum intersection self-pruning (MISP) algorithm to minimize broadcasting redundancy. Herein, an example is given to help describe the main concept of MISP and upper bounds of forward node have been derived based on induction. A simulation conducted demonstrated that when conventional blind flooding (BF), self-pruning (SP), an optimized link state routing (OLSR) multipoint relay (MPR) set, and dominant pruning (DP), are replaced with the MISP in executing Strong duplicate address detection (DAD), the performances in terms of the energy consumption, upper bounds of the number of forward nodes, and message complexity have been improved. In addition, to evaluate the performance in reference to the link error probability, P e , an enhancement was achieved by computing a proposed retransmission limit, S, for error recovery based on this probability. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating with limited portable energy where Strong DAD reacts differently to link errors based on the operational procedures.

Load Balanced Fuzzy Control based Adaptive Gateway Discovery for Ubiquitous Internet Access in MANET

Integrating MANETs (Mobile Ad-hoc Networks) nodes to the Internet require either a connection to the Internet or they can connect to the Internet through the Internet gateways. For the second case if a node in a MANET has discover the gateway to connect to the fixed hosts in the Internet and it can be done either by broadcasting a gateway discovery request message initiated by nodes itself or by broadcasting periodic gateway advertisement messages from the gateways. End to end packet delay and throughput are strongly dependent on the time needed to discover the gateways.Nodes in a MANET use number of hops as metric to select a path to a gateway, if all the nodes select its nearest gateway to access the Internet then there may be situations when the network performance degrades because some nodes along the path have too many packets waiting in the queue.This paper presents a novel solution to access internet through mobile nodes in ad hoc network. Here the gateway replies with an advertisement message which is broadcasted to the whole network instead of sending a unicast reply to the requesting node. The traffic load taken into account along a path in addition with minimum hop count to select an efficient gateway. The AODV routing protocol has been used for routing in the MANET domain.A new strategy of gateway discovery was investigated and impact of new metric on the gateway selection in NS-2 was observed. Simulation results show that the proposed scheme outperforms over the existing scheme with high throughput and lower end to end delay.

Performance Improvement by Identification and Elimination of Gray Hole Nodes in MANETs

Mobile Ad-hoc Networks (MANETs) are widely used in various applications due to its ability to communicate without any fixed infrastructure like in military and civilian applications. MANETs are wireless infrastructure-less (Adhoc) network comprising of mobile nodes. Mobile nodes can enter and leave the network at any time. Due to its inherent characteristics like dynamic topology, autonomous nodes and self organizing ability these networks are vulnerable to various security attacks. MANETs are still an emerging technology in wireless communication. Security is very important in this modern era especially in MANETs. Without any security, nodes may selectively drop packets without forwarding them. This type of security issue is known as Gray Hole attack. In this paper a novel scheme is proposed for identification and elimination of Gray Hole attack. This technique uses a redefined modified extended data routing information (RM-EDRI) table that is maintained by every node on the network. General Terms Network, Security, Attacks in MANET

Communication based Clustering to Detect Selfish Nodes in MANET

Objective: The main intent of this research is to detect the selfish node in Mobile Ad-hoc Networks (MANETs) and to select the Cluster Head (CH) based on the energy level and Node Communication Ratio (NCR). Methods/Analysis: In this paper, a new mechanism is developed to identify the selfish nodes in the communication network. Based on the level of energy and the Node Communication Ratio, the Cluster Head is selected. The cluster head in turn is used to contribute to the network within its infrastructure range. The sink node will be noticing the behavior of each and every communicating node in the network. Results: The communication based clustering has proved better performance in terms of packet delivery rate, packet loss rate, packet delay rate and better energy efficiency during data transmission. Conclusion: The simulation results show that this scheme has improved quality of service compared to the existing scheme 2Ack. This scheme can be applied in the areas of military operations, emergency and disaster management in order to ensure reliable data delivery on-the-move.

애드혹 네트워크에서 경로 안정성 향상을 위한 라우팅 프로토콜

Nodes of Mobile ad-hoc network usually use the energy-limited battery. Balanced energy consumptionis important to maintain path`s stability. In this paper, we focus on improving the stability of the routing path in mobile ad-hoc networks. For that purpose, we propose a new routing protocol to find the highest minimum node residual energy path among shortest paths. The largest path of minimum value of the remain energy has a longer life than other paths to improve the reliability to data-transmission. Using ns-3 simulator, we show that the proposed routing protocol can provide more long-life stable routing path than AODV and EA-AODV.

Anomalous Node Detection and Removal in Ad-hoc Network using Enhanced Prime Product Scheme

in Nursing Ad-hoc network may be a assortment of mobile nodes dynamically forming a short lived network while not the employment of any existing network infrastructure or centralized administer. attributable to restricted communication vary among mobile nodes in ad-hoc network, many network hopes is also required to deliver a packet from one node to a different node within the wireless network. Many users want to save its resources like battery power, processing and capability for only their personal use hence such nodes become misbehaving in nature and not co- operate do selfish activities. The security of MANET is manipulated by malicious node attack. In such type of attach, a malicious node insert a fake route reply claiming to have the shortest and freshest route to the destination. However, when the data packets arrive, the malicious node discards them. To avoid malicious attack, this work gives behavior analysis with PPN (Prime Product Number) scheme for detection and removal of malicious node.

Hash based Technique to Identify the Selfish Node in Mobile Ad-hoc Network

Mobile Ad-hoc NETwork (MANET) is a collection of mobile nodes that communicate with other node without any defined network. The node which decline to share its resource with other nodes is a selfish node. The main idea of selfish node is to drop the data packets and preserve the resource for its own use. The co-operation between the nodes is not guaranteed when the node behaves as selfish nodes. Most of the existing techniques use cryptographic algorithm such as Message Authentication Code (MAC), Rivest Shamir Adelman (RSA) etc, in identifying the selfish node. All of those techniques are take more time to find out the selfish node behavior. This paper applies hash function to identify the misbehaving node. The Hash function is a technique used in the Route Reply (RREP) to authenticate the message, which works in an efficient way. The result shows the better performance in terms of packet delivery ratio up to 70% and time delay has been reduced up to 80% compared to the existing Dynamic Source Routing (DSR) protocol.

A futuristic trust coefficient-based semi-Markov prediction model for mitigating selfish nodes in MANETs

In mobile ad hoc networks (MANETs), network survivability is considered as a potential factor required for maintaining maximum degree of connectivity among the mobile nodes even during failures and attacks. But, the selfish mobile nodes pose devastating influence towards network survivability. Hence, a prediction model that assesses network survivability through stochastic properties derived from nodes’ behaviour becomes essential. This paper proposes a futuristic trust coefficient-based semi-Markov prediction model (FTCSPM) that investigates and quantifies the impact of selfish behaviour towards the survivability of the network. This FTCSPM approach incorporates a non birth-death process for manipulating futuristic trust coefficient since it does not consider the transition of a mobile node from the failed state to a selfish state into account. This semi-Markov prediction model also aids in framing a lower and upper bound for network survivability. Extensive simulations were carried out through ns-2 and the results indicates that FTCSPM show better performance than the existing benchmark mitigation mechanisms like correlated node behaviour model (CNBM), probabilistic behavior model (PBM) and epidemic correlated node behavioural model (ECNBM) proposed for selfish nodes. Further, FTCSPM isolates the selfish nodes rapidly at the rate of 33 % than the considered benchmark systems. Furthermore, the validation of this prediction model performed through Weibull distribution has a high degree of correlation with the simulation results and thus assures the reliability and correctness of the proposed approach. In addition, this approach computes the mean transition time incurred by a mobile node to transit from cooperative to selfish mode as 6.49 s and also identifies the minimum and maximum selfish behaviour detection time as 140 and 180 s, respectively.

Efficient data transfer in mobile ad-hoc network using OPSM for disaster response applications

The nodes in mobile ad-hoc network depend on battery for its power. Therefore, effective utilization of energy is necessary for efficient transfer of data between the persons involved in rescue without connection termination in disaster situation. An Optimal Path Selection Model (OPSM) is proposed to achieve this. First, routes are identified with the links having high power ratio and link duration. The path selection aims at reducing the number of node failures which in turn obtains energy saving. Then, the source will select a node-disjoint path based on energy and hop for data transfer and store the remaining paths in cache. Priority based path maintenance is also proposed for the selection of routes from cache based on remaining energy if the primary selection fails. Path selection and maintenance extend the network lifetime by reducing the energy usage in transmission. Simulation results revealed that OPSM achieves 64% and 50% reduction in energy consumption compared to Dynamic Source Routing (DSR) and Multipath DSR (MDSR). The number of path breakages is also 11 times and 5.5 times lesser than DSR and MDSR. Thus, it can be said that OPSM is a better choice for optimal path selection for performance enhancement by saving energy and improving lifetime. All Rights Reserved © 2015 Universidad Nacional Autonoma de Mexico, Centro de Ciencias Aplicadas y Desarrollo Tecnologico. This is an open access item distributed under the Creative Commons CC License BY-NC-ND 4.0.

A unified approach for detecting and eliminating selfish nodes in MANETs using TBUT

Abstract Recent years have witnessed the increasing efforts toward making architecture standardization for the secured wireless mobile ad hoc networks. In this scenario when a node actively utilizes the other node resources for communicating and refuses to help other nodes in their transmission or reception of data, it is called a selfish node. As the entire mobile ad hoc network (MANETs) depends on cooperation from neighboring nodes, it is very important to detect and eliminate selfish nodes from being part of the network. In this paper, token-based umpiring technique (TBUT) is proposed, where every node needs a token to participate in the network and the neighboring nodes act as umpire. This proposed TBUT is found to be very efficient with a reduced detection time and less overhead. The security analysis and experimental results have shown that TBUT is feasible for enhancing the security and network performance of real applications.

The Impact of TCP Congestion Window Size on the Performance Evaluation of Mobile Ad Hoc (Manet) Routing Protocols

A mobile ad hoc network (MANET) is a temporary collection of mobile nodes randomly moved within a limited terrain area. The nodes are connected to form a wireless network without use any communication infrastructure. Because of the limiting resources of MANET nodes, multiple hopsscheme is proposed for data exchange across the network. Varieties of mobile ad hoc routing protocols have been developed to support the multi-hop scheme of ad hoc networks. A popular Transmission Control Protocol (TCP) provides a reliable connection in a computer network environment; it sets its congestion window size in response to the behavior of the network to achieve the best performance. This work aims to investigate and compare the MANET protocolperformance, such as DSDV, AODV and DSR in terms of network throughput, average routing load, the packet delivery ratio (PDR), and average end-to-end delay by varying the maximum congestion window size. Our simulation has been implemented using a well-known NS-2.35 network simulator. The simulated results show that the demonstrates of the concepts of MANET routing protocols with respect to TCP congestion window size in MANET environment.

A Dynamic Reputation Management System for Mobile Ad Hoc Networks

Nodes in mobile ad hoc networks (MANETs) are mandated to utilize their limited energy resources in forwarding routing control and data packets for other nodes. Since a MANET lacks a centralized administration and control, a node may decide to act selfishly, either by refusing to respond to route requests from other nodes or deceitfully by responding to some route requests, but dropping the corresponding data packets that are presented for forwarding. A significant increase in the presence of these misbehaving nodes in a MANET can subsequently degrade network performance. In this paper, we propose a dynamic reputation management system for detecting and isolating misbehaving nodes in MANETs. Our model employs a novel direct monitoring technique to evaluate the reputation of a node in the network, which ensures that nodes that expend their energy in transmitting data and routing control packets for others are allowed to carry out their network activities while the misbehaving nodes are detected and isolated from the network. Simulation results show that our model is effective at curbing and mitigating the effects of misbehaving nodes in the network.