IRDFPR-CMDNN: An energy efficient and reliable routing protocol for improved data transmission in MANET

The prime characteristics of Mobile Ad Hoc Network (MANET) are infrastructure free, absence of centralized authority and dynamic nature of nodes which are more vulnerable to security attacks. Reliability and security are prime issues to protect information and nodes in a network during communication which has received more research interest in designing a dynamic secured routing scheme. QoS is set of service requirement that needs to be satisfied by the network during the data transmission in the network. From the perception of QoS best effort protocols ensure optimum network operation in a unpredictable mobile environment. The multimedia applications are intolerable towards delay and reliability which are the features of mobile network, hence the potentials of MANET were not utilized in multimedia applications. These issues of delay and reliability of packet transmission in MANET are contributed by stability of the communication link even during the mobility of the nodes Its a necessity to analyze the performance of various secured routing protocols based on the stability of the communication link in case of mobility of nodes during data transfer. This paper is focused on a comparative study of various secured reactive routing protocols in MANET signifying the connectivity stability during the mobility of the nodes.

Mobile Ad-hoc Network (MANET) comprise of independent ambulant nodes with no any stable infrastructure. All mobile nodes are co-operatively transfer their data packets to different mobile nodes in the network. Mobile nodes are depends on intermediate nodes when transmission range beyond limit i.e. multi hop network. As MANET is a highly dynamic network, mobile nodes can leave and join a network at anytime. Security is the biggest issue in MANET as MANET is infrastructure-less and autonomous. In MANET, correspondence between two mobile nodes is performed by routing protocols wherein every versatile node can make directly communication with other versatile node. In the event that both portable nodes are inside a transmission range of each other, then they can straightforwardly make communication with each other. Otherwise, transmission is done through the intermediate node. The nature of its wireless nature is also additionally turns into the purpose of its greatest vulnerability. In this manner, diminishing the confidence level of the system as it appropriate to availability, integrity, reliability and privacy concerns. There are different routing protocols for providing security that are designed based on various cryptographic techniques. To obtain a rapid knowledge of security design, we are giving a review on different cryptographic techniques to secure MANET. In this review, we presents security techniques and protocols related to cryptographic techniques.

In recent times, the interest for different multimedia applications such as video conferencing, surveillance system, and video on request service over Mobile ad-hoc networks (MANETs) has been developing quickly. However, it is difficult for data transmission by satisfying end to-end delay requirements and security issues are distinct in MANETs because every node can act as the gateway, the topology is constantly changing, energy constrained operation and lack of centralized administration. Secure transmission without node failure in MANETs is an important issue. In order to rectify these traps, this article presents key-policy attribute based encryption (KP-ABE) to provide packet security from malicious clients and adaptive Routing Information Protocol next generation (RIPng) to identify the optimal path among autonomous energy constrained nodes by which routing overhead is reduced and it requires less communication cost during packet transmission. This novel method utilizes reliability matrix and connectivity matrix to identify the routes rather than the commonly utilized hop count thus minimizing time. Hence, a secure path is discovered with minimum time thus rectifying the issues in existing works. In addition to this, priority based scheduling operation is performed to organize packet according to their weights. The performance of the proposed scheme is surveyed with respect to different evaluation metrics in different node density levels and also under different routing attacks. The obtained result clearly describes the introduced scheme that provides adaptable and feasible decision to select the route that meets the security requirement of data packets transmission in MANET’s environment.

The mobile ad-hoc network (MANET) output is critically impaired by the versatility and resource constraint of nodes. Node mobility affects connection reliability, and node resource constraints can lead to congestion, which makes the design of a routing MANET protocol with quality of service (QoS) very difficult. An adaptive clustering reputation model (ACRM) method is proposed to improve energy efficiency with a cluster-based framework. The proposed framework is employed to overcome the problems of data protection, privacy, and policy. The proposed ACRM-MRT approach that includes direct and indirect node trust computation is introduced along with the master recovery timer (MRT) for achieving an efficient service recovery process, and its service recovery time is calculated through the service execution process. During data transmission in MANET, various types of attacks can occur, of which the Sybil attack is the most dangerous. To address this problem, this paper proposed a method for the detection and prevention of Sybil attacks using a resilient scheme. The proposed method can improve system energy efficiency and address security, safety, and privacy issues of wireless network applications. Finally, the performance of the proposed method is evaluated regarding the time delay, throughput, energy efficiency, control overhead, and detection rate. The simulation results show that the proposed ACRM-MRT method can effectively improve the time delay, throughput, energy efficiency, control overhead, and detection rate compared to the existing methods. Topological change adaptive ad-hoc on-demand multi-path distance vector (TA-AOMDV)and ad-hoc on-demand multi-path distance vector (AOMDV) are simulated on the NS2 platform for the data rate in the range of 4–40 kbps and the number of nodes in the range of 10-100. The proposed method can reduce the service recovery time in the case of faults during service execution and can be used in real-time applications traffics since it is mostly affected by failure through the occurrence of delay and loss of packets.

The vulnerability of mobile ad-hoc networks (MANETs) to various kinds of attacks such as active route interfering and denial of service has brought increasing concerns in the deployment of MANETs. The black-hole Attack is a notorious attack that absorbs data packets by the malicious node and results in denial of service in the network. This paper proposes a Markov chain based stochastic model to simulate data transmission in MANETs using the RTS/CTS handshaking mechanism for characterizing the effect of black-hole attacks. Through simulation evaluation, we analyze the effect of black-hole attacks on major network performance metrics for the multi-hop routing protocol applying the proposed data transmission model.

Blackhole attacks pose a significant threat to wireless networks by allowing a malicious node to falsely claim it has the most efficient route to the destination. Once data packets are routed through this node, it intercepts and discards them, resulting in data loss and network disruption. These attacks are particularly damaging in Mobile Ad Hoc Networks (MANETs), which are decentralized, self-configuring systems of mobile nodes that communicate wirelessly without fixed infrastructure. MANETs are widely used in applications requiring rapid and flexible deployment, such as military operations, disaster response, and remote communication. However, their open and dynamic nature makes them highly susceptible to security vulnerabilities. This research proposes a comprehensive system to ensure secure data transmission in MANETs by mitigating blackhole attacks. The solution includes detection techniques, which monitor packet forwarding behaviour and analyze route advertisements to identify malicious nodes, and prevention methods that incorporate trust-based routing and cryptographic mechanisms. The goal is to develop an efficient defense framework that enhances network reliability and security in dynamic, decentralized environments.

A mobile ad hoc network is an autonomous wireless network which consists of mobile nodes without any base stations. When a source node communicates with a destination node outside the transmission range of the source node, communication between the source node and the destination node can be through some other nodes between them. Many schemes such as routings and applications have been proposed for mobile ad hoc networks. However, since these schemes tend to be evaluated only through simulation experiments, it is not known whether they work effectively in real environments or not. Therefore, in order to verify their practical use in mobile ad hoc networks, it is necessary to perform field experiments using actual mobile nodes. If the network size is large, it is difficult to perform field experiments due to problems on limited battery, difficulty of topology control and so on. Realization of rapid topology change of the ad hoc networks topology is especially difficult. In order to solve this problem, this paper proposes a testing environment for mobile ad hoc network software, which emulates the field experiments in wired networks. The existing emulators are scenario-driven. So information of locations and movements of nodes from start of the test to end is given in advance. Unlike the existing emulators, the proposed environment adopts scenario-independent mechanism. The proposed environment can control any network topology for routing in mobile ad hoc networks. The proposed environment consists of a positioning server and multiple testing nodes in wired networks. The positioning server virtually configures mobile ad hoc networks and distributes their information such as the node positions to the testing nodes. And testing nodes themselves deliver their position information to the others. By exchanging messages between the server and testing nodes, any network topology for mobile ad hoc networks can be configured and dynamically changed while testing. It is therefore expected to effectively develop and verify routing protocols and applications for mobile ad hoc networks.

Mobile Ad-hoc Network (MANET) has emerged as the self organized wire less interconnection for the various applications in random topology. As most of the multimedia applications require strict QoS guarantee during the communication between a single source and multiple destinations. How ever, achieving reliable multicast transmission in MANET is crucial due to the dynamic network topology caused by the node mobility. This gives rise to the need for an efficient multicast routing strategy. This paper proposes a novel scheme PBMRP-BR (position-based Multicast Routing Protocol for Ad-hoc Network Using Backpressure Restoration) for efficient transmission of multimedia applications in Ad-hoc Network, which provides priorities for routing based on Distance of path, Load at the node (ie, traffic) and queue length at the node(ie, bandwidth). It also keeps the path information including bandwidth resources of each node for routing decisions. The problem of the link failure in the channel during the call in progress thus lead in the degradation of the QoS (Quality of Service).To deal this we are using a Backpressure Technique The simulation results shows that the proposed algorithm is able to find a better solution, fast convergence speed and high reliability. The simulation results shows the proposed PBMRP-BR protocol achieve the above objectives and gives the batter results than previous schemes like DSR for the maintenance of overheads and the path reliability. Our proposed scheme will improve the bandwidth utilization by reducing the congestion in the Adhoc wireless network.

Mobile ad hoc networks (MANETs) are consists of mobile devices connected wirelessly. Mobile nodes in MANET are applicable of routing functionality, where messages are forwarded in a multi-hop fashion. In such a communication scheme a routing protocol play an important role in the network performances. The wireless connectivity and node mobility in MANET networks contributes in rapid topological changes, which brings the need for a channel aware routing protocol. To overcome this problem, many channel aware routing metrics are proposed in the literature, however these routing metrics are either utilizing the shared bandwidth to measure the link quality, or they implies less awareness to the link quality. This paper proposed a SNR-based routing metric for Dynamic Sequence Distance Vector (DSDV) routing protocol. This paper starts by investigate and compare the performance among common routing protocols in MANET. Secondly a cross layer approach is proposed for the new routing metric. Simulation scenarios are used for the work of the paper. The new metrics is implemented in one of the MANET common routing protocols DSDV module in MONET++. The results show that SNR-based DSVD improves the performance of the MANET in terms of throughput and delay.

A mobile ad hoc network (MANET) is a self-organizing network of mobile nodes which can form a dynamic topology. All the nodes generally have a limited transmission range and move freely throughout the network. So implementing a good routing protocol to react the link state changing is a critical issue in current research. From now on, a popular method is introducing a link quality evaluation (LQE) mechanism in routing algorithm. In this paper, we study the link quality evaluation scheme based on traffic-based metrics, such as packet reception ratio (PRR), and find two flaws (one is the assessment lagging and the other is the sample bias) which result in large handoff delay in routing protocols, especially when the PRR-like scheme is used in mobile environments. Therefore, we propose a link quality prediction (LQP) model to sense the link state by analyzing the Signal to Noise ratio of the neighbor link, and using grey theory to tackle the small sample size problem. Finally we set up mobile nodes test-bed to validate the scheme. Based on comparison of previous schemes, the LQP's performance is far better in handoff delay and packet loss rate.

Now a day's use of wireless communication is very common and growing faster. There are different types of wireless networks which are designed as per the requirement of data rate and coverage. In this paper scope is limited to widely study and used network called Mobile Ad hoc Network (MANET). MANET is collection of wireless devices which communicate among each other without need of any physical infrastructure as well as centralize administrations. Each mobile node in MANET acts as peer node. The communication is MANET is based on routing methods and hence since from last 2 decade there are number of routing methods designed with objective of improving the Quality of Service (QoS) performance of MANET. As the mobile nodes in MANET are moving randomly with varying mobility speed, this can leads the challenging tasks to achieve the guaranteed QoS performance. Therefore it is required to have efficient routing protocol with load balancing and dynamic behaviour of mobile nodes handling in MANET. In this paper, our goal first is to present the study on different QoS aware routing methods and non-routing methods designed by various research groups for MANET. Second objective is to design novel QoS Aware routing protocol for improving the QoS performance in MANET. Additionally, we are presenting the current research gap based on analysis of all recent methods of QoS improvement. The outcome of this paper is the current research problems and efficient QAODV routing method.

A Mobile ad hoc Network (MANET) is an infrastructure less network that permits nodes to make a wireless network with mobility. In MANETs, the node linkages breaks are frequent due to all nodes are in movement. When neighbor nodes travel out of other node communication range connection among both mobile nodes breaks. Thus it makes delay and packet loss in the network. In the present Traffic Control method, several times, since the highest traffic, heavy rain, accidents, or other reasons, there may be probabilities of jam on roads. Thus, people could get delay owing to the highest traffic. Therefore, it is highly preferred to have an effective way to track the traffic on roads and thus select the suitable road that is traffic free. To resolve these problems, the volunteer Nodes of Ant Colony Optimization Routing (VNACO) is proposed. The primary objective of VNACO is to reduce both the delay and routing overhead in Peer to Peer (P2P) MANETs. Here, peer node act as a volunteer node and mobile node for transmitting data from source to destination. During data transmission, the relay node moving out of communication range when the volunteer node overheard the dropped data packet then deliver the data to the corresponding relay node. As a result, minimizes both the delay and packet losses. In VNACO, the volunteer’s nodes are elected based on node aptitude. Node aptitude is calculated by iterating node connectivity, transmission processing time, node energy and available bandwidth. In addition, an ant colony optimization algorithm to finds the optimal route and reduce the routing overhead in P2P MANETs. The significant application of this mechanism is utilized for the traffic management system. Network simulation results indicate that the VNACO mechanism is minimizing 22% delay and reducing 14% packet losses compared to the baseline protocol.

Emergent Intelligence Based QoS Routing in MANET

Mobile Ad hoc Networks (MANET) comprises of self-organizing autonomous mobile nodes. MANETs are open and decentralized. Therefore they are vulnerable to malicious entities. MANETs are multi-hop wireless network where all nodes supportively maintain network connectivity without a centralized infrastructure. Since MANETs are infrastructure less and independent, the secure communication is the main issue. Therefore they are vulnerable to malicious entities. Here the location identity and traffic can be traced out by an outside observer. Anonymity means secure communications by hiding node identities and preventing traffic analysis attacks by outside observers. This paper proposes Position based Anonymous Routing Scheme in MANETs (PARS).Here the routing is based on Greedy Perimeter Stateless Routing Protocol. The objective is an anonymous routing protocol for the network. The proposed one is a zone based anonymous GPSR based protocol that can provide source, destination and route anonymity. Performance of the proposed system is compared with that of GPSR and AODV using Network Simulator. Index Terms: Anonymous routing, position-based routing, random forwarder, zone partition. I. Introduction Mobile Ad hoc Networks are collection of independent mobile nodes that can communicate by radio waves. It is an infrastructure less self-organizing network. The nodes that are in radio range can communicate by single hop or by multi hop with the help of intermediate nodes. The network is open and decentralized and fully distributed. So they are perfect choice for communication and information sharing. MANETs are susceptible to malicious entities that aim to alter and analyzed the traffic analysis by communication eaves dropping or attacking routing protocols. MANETs are characterized by their distributed operation, multi hop routing, dynamic topology and shared physical medium. Nodes in a MANET are independently free to move in any direction. Due to the lack of a centralized coordinator security is the major concern here. Wireless communication can endure interferences or malicious interceptions; whereas multi-hop communication assumes that each node will perform properly its functions to support network services. Further, self-organization increases the complexity of security management operations as access control, node authentication, secure routing and cryptographic key distribution. There is no fixed infrastructure and the topology is frequently changing due to node mobility or environmental changes. Therefore, it is very hard to maintain a stable and efficient end-to-end route in an ad-hoc network. Each node in MANET is energy constrained. There is verylimited physical security in MANET. The type of attacks can be Active attacks or Passive attacks. The common security issues are Passive attacks which include eaves dropping and information disclosure. Active attacks include Do Sand Data modification. There are other more specific problems with mobile ad hoc network such as vulnerability of channels and nodes, Byzantine black hole and Byzantine wormhole attack. The security issue also includes attacks that may inject erroneous routing information and diverting network traffic thus making routing inefficient. There are many methods to reduce the impact of these attacks, which include a secure routing using public and private key s to get a certification authority and use of digital signatures and prior it rust relationships. Routing is the process of communication from one node to the other host in a network. Routing is the process off or warding packet towards its destination using most efficient path. Routing efficiency is measured in terms of Number of hops, traffic, security, etc. Routing protocols in MANETs are divided as reactive proactive and hybrid. Reactive Protocol maintains the routes in on demand manner. In route discovery phase it floods the route request (RREQ) packets throughout the network. Dynamic source Routing (DSR), ad hoc on- demand distance vector routing (AODV) are some of the examples of reactive protocols. In proactive approach every node in the MANET continuously maintains the complete routing information of the entire network. This is accomplished by flooding network periodically with network status information. Global State Routing (GSR), Hierarchical State Routing (HSR) and Destination Sequenced Distance Vector Routing (DSDV) are some of the examples of proactive

WITHDRAWN: Energy efficient node Positioned Learning Automaton and Multilateration data delivery in MANET