Enhanced Route-Split Routing Tolerant to Multiple Concurrent Link Failure for Mobile Ad Hoc Networks

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.

A mobile ad hoc network (MANET) is a dynamically reconfigurable wireless network that does not have a fixed infrastructure. Due to the high mobility of nodes, the network topology of MANETs changes very fast, making it more difficult to find the routes that message packets use. Because mobile nodes have limited battery power, it is therefore very important to use energy in a MANET efficiently. In this paper, we propose a power-aware multicast routing protocol (PMRP) with mobility prediction for MANETs. In order to select a subset of paths that provide increased stability and reliability of routes, in routing discovery, each node receives the RREQ packet and uses the power-aware metric to get in advance the power consumption of transmitted data packets. If the node has enough remaining power to transmit data packets, it uses the global positioning system (GPS) to get the location information (i.e., position, velocity and direction) of the mobile nodes and utilizes this information to calculate the link expiration time (LET) between two connected mobile nodes. During route discovery, each destination node selects the routing path with the smallest LET and uses this smallest link expiration time as the route expiration time (RET). Each destination node collects several feasible routes and then selects the path with the longest RET value as the primary routing path. Then the source node uses these routes between the source node and each destination node to create a multicast tree. In the multicast tree, the source node will be the root node and the destination nodes will be the leaf nodes. Simulation results show that the proposed PMRP outperforms MAODV (Royer, E. M. & Perkins, C. E. (1999). In Proceedings of the ACM MOBICOM, pp. 207---218, August 1999.) and RMAODV (Baolin, S. & Layuan, L. (2005). In Proceeding of the 2005 IEEE International symposium on microwave antenna, propagation and EMC technologies for wireless communications, Vol. 2, pp. 1514---1517, August 2005.).

Mobile ad hoc networks (MANETs) are characterized by wireless connectivity through multi-hops, frequently changing network topology among wireless mobile devices. These characteristics require routing algorithms to be dynamic and adaptive to constantly changing environments. In this paper, we describe a new routing algorithm which is based on the cumulative relative stability among neighbor mobile nodes. This NSR (neighbor stability routing) algorithm selects the most historically and accumulatively stable mobile nodes to form a path between the source node and destination node. The relative stability is then propagated from the collective data by all the nodes along a path. The cumulative collective data, or stability factor, reflects the historical neighborhood stability among neighbors. When a node or segment on the path is down, NSR will dynamically find an alternative most stable path. In simulation, our NSR algorithm outperforms some major ad hoc routing protocols such as AODV and DSR in packet delivery ratio and number of paths rerouted. NSR also handles some issues such as group node mobility and temporary node unavailability well.

Mobile ad hoc network (MANET) is a group of mobile nodes that communicates with each other without any supporting infrastructure. These networks have some unique features such as dynamic mobility, open nature, lack of infrastructure, limited physical security and they are vulnerable to several security threats. Malicious node can drop all or partial received packets instead of forwarding them to the next hop through the path. In order to find the malicious nodes, an initial transmission is made between the source and destination nodes. Using fuzzy rules, the trust value of each node is computed and it varies from 0 to 1. A common threshold value is set for each node and by using this threshold value, every node in the network can be identified as either a malicious node or a regular node. After identifying the malicious nodes, these nodes are eliminated by muting the power to off state. As the malicious nodes are eliminated between source and destination nodes, source node can select another trusted path to its destination
 node. For security and authentication of routing information, hybrid cryptography is employed, using advanced encryption standard (AES) and elliptic curve cryptography (ECC) algorithms. AES algorithm is used as symmetric algorithm to encrypt the routing information and ECC algorithm is used as asymmetric algorithm to encrypt the public key. During encryption, the original plain text is converted into cipher text with encrypted public key and similarly during decryption cipher text is converted into original plain text with decrypted private keys. So the proposed method involves both AES and ECC algorithms which provides security mechanism as efficient and sufficient one. The experimental simulations are carried for the proposed model using network simulator 2 (NS-2) for Throughput, Delay, Packet delivery ratio, Packet overhead and Packet drop.

In mobile ad hoc networks, routing schemes using location information have been proposed. Most of these schemes assume that the source node already knows the location information of the destination node. However, since all nodes are always moving, it is difficult to apply this assumption to the real mobile ad hoc environment. In order to cope this difficulty, this paper presents a new routing scheme HRLI, a Hybrid Routing with Location Information, which using the threshold for the communication range of all nodes. And it considers the location and velocity information of the destination node and the neighboring nodes. In HRLI, when a source node creates a route to a destination node, the future location of the destination node predicted by the source node is calculated using these location and velocity information. And the source node sends data packets based on the predicted location information of destination node and neighboring nodes. This paper shows that HRLI achieves high data delivery ratio and fewer overheads for using the threshold of communication range and the predicted location through simulation experiments

Mobile Ad Hoc Networks (MANETs) are wireless networks formed by several nodes communicating on a peer-to-peer basis without being connected to any fixed infrastructure. These nodes could be laptop computers, personal digital assistants, mobile phones or sensors dispersed in an area to measure certain data and send the information to a larger node. Where a source node and a destination node are not within direct range, they communicate through multi-hop routing, i.e. nodes in between them relay messages between source and destination. The routing protocol plays a key role in finding and maintaining the route in MANETs. Routing protocol can be a uni-path and multi-path. A multipath routing protocol is designed to increase the reliability in MANET. This research work focuses on Quality of Service (QoS) based evolution of multipath routing protocol. For this purpose, diverse type of simulation scenarios is designed to find the impact of mobility, increasing the number of nodes and pause time in MANETs. The results revealed that multipath routing protocol has comparatively less delay (percentage decrease of 81.52%). While unipath routing protocols have less packet drop ratio (percentage decrease of 47.78%) and routing overhead (percentage decrease of 99.30%).

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

Mobile Ad hoc Networks (MANET) are structure less, autonomous wireless networks with mobile nodes that dynamically establish data transmission connections. Due to dynamic topological change, MANET routes are unbalanced and break repeatedly. Hence, providing efficient and reliable data delivery with effective utilization of network resources is a challenging issue to be considered in MANET. This paper proposes an instant-runoff Ranked Decision Forests Probit Regression-based Connectionist Multilayer Deep Neural Network (IRDFPR-CMDNN) for efficient data transmission and higher data delivery with a minimum end-to-end delay. This IRDFPR-CMDNN method performs route identification, data delivery, and route maintenance with more than three layers. Then the mobile nodes are sent to the input layer of the Connectionist Multilayer Deep Neural Network. In hidden layer 1, the Instant-runoff Ranked Decision Forests algorithm is applied for classifying the mobile nodes depending on the residual energy and load capacity. With selected mobile nodes, the Probit Regression is applied for finding the nearest neighboring nodes in the second hidden layer based on the link quality and received signal strength for route path establishment. Then multiple paths for routing are established from source to destination node and start to perform the data transmission. If link failure occurs during the data transmission, another alternative route with better link quality is selected for routing. In this way, energy-efficient data transmission is performed from source to destination with a higher data delivery rate and minimal time consumption. Experimental evaluation is carried out on energy consumption, packet delivery ratio, packet drop rate, throughput, and end-to-end delay with varying numbers of mobile nodes and data packets. Simulation results show that the IRDFPR-CMDNN technique effectively enhances data delivery, throughput and minimizes energy consumption, packet loss rate, delay with respect to conventional methods.

In this paper, we propose a Route Stability-based Direction Guided Routing protocol(RSDGR) in mobile ad-hoc wireless networks. The main features and contributions of the proposed routing protocol are as follows. First, it can calculate link stability between two nodes as well as route stability of multi hop quantitatively by using nodes` mobility. And this protocol can establish the most stable path between a source node and a destination node. Second, according to the route stability between a source node and a destination node, it can control and optimize the direction guided region dynamically for route setup. Third, we suggest theoretical model for quantitative calculation of link stability between two nodes and route stability of multi hop path. The performance evaluation of the proposed routing protocol is performed by simulation using OPNET(Optimized Network Engineering Tool) and theoretical analysis. The results of performance evaluation show that the patterns of PDR are similar in simulation and analysis according to route stability. The faster mobile nodes` velocity and the smaller source node`s direct guided reigion, the lower route stability and PDR and the higher delay and control overhead related to this.

Mobile Adhoc Networks (MANETs) have emerged as a popular technology because of their wide application and independent mobility. Nevertheless, communication through MANETs can be effective because of their inherent nature of high mobility, which in turn results in a higher rate of data loss and delay. Therefore, for effective communication to be achieved, the MANETs’ routing performance must be enhanced. Some extant routing protocols like AOMDV can yield moderate Routing Overhead (RO) during communication. The review of previous studies shows that there is a need for improvement in the following areas: Computational E2E delay: the proposed Genetic Algorithm- Ant Colony Optimization (GA-ACO) was unable to reduce the computational E2E delay that occurs during communication. RO: The schemes that were proposed failed to minimize the RO in the network. Energy consumption: the reduction energy consumed by the network was reduced, however, high throughput and PDR could not be achieved by the method. On the contrary, the EHO-based AOMDV routing protocol achieved low E2E delay and RO but was unable to decrease the energy consumed by the network. Throughput and PDR: The protocol proposed failed to achieve high Quality of Services (QoS). Consequently, this paper aims to provide a solution to this communication problem by proposing a Hybrid Optimization-based Effective Path Selection and Multipath routing (HOEPSM) approach for MANETs. The proposed approach, which is HOEPSM is made up of two parts: Elephant Herding Optimization (EHO)-based AOMDV routing protocol, which makes use of EHO for the identification of the shortest path from the source to the destination. The second part which is the Hybrid optimization using Genetic Ant Optimization (GAO) algorithm, involves finding the best solution through the use of a GAO-based hybrid optimization algorithm. The results of the study revealed that the use of the HOEPSM causes a significant decrease in routing RO while enhancing the network’s Quality of Forwarding (QoF) of the network. Also, the simulation of the proposed approach was carried out in NS2, and afterward, compared with earlier proposed methods like DRARP and MDRARP. Based on the simulation results, the HOEPSM outperformed the other methods, with high Energy Efficiency (EE) (91%), Packet Delivery Ratio (PDR) (95%), RO (155), and End to End (E2E delay) (102ms). These results can be attributed to the HOEPSM’s choice of the best and steady route from the source nodes and destination nodes.

Mobile Ad hoc Network (MANET) basically, is a collection of mobile hosts incorporating wireless interfaces that forms a transitory autonomous network. They do not base on fixed infrastructure or central administration, rather work on the principle of self-organized interconnections among mobile nodes. Fundamentally, in MANET when nodes come inside the transmission range of neighboring nodes', they can be detected by each other and can communicate directly. However for communication outside this range they have to depend on some other nodes to relay the messages .This is where routing protocols have to play a very important role. Literature for improving the performance of routing protocol is available in abundance. Among these comes, the hierarchical/cluster-based routing protocols that claim to reduce control overheads. Clustering in Mobile Ad hoc Networks (MANETs) has proved to be advantageous compared to the traditional networks. However the highly dynamic and unstable nature of MANETs makes it intricate for the cluster based routing protocols to split a mobile network into clusters and determination of cluster heads for each cluster. Although much previous research has concentrated on cluster-head selection in MANETs, not much effort has been done on the security side of cluster-head selection. This paper emphasize that secure cluster head selection in MANETs has an intense effect on network performance. Specifically, we stress that in ad hoc network where all the participants are self controlled, security is an essential aspect and the effective cluster-head selection can improve network throughput. We propose a secure and effective cluster-head Selection scheme using a cross-layer approach that integrates cluster-head discovery and selection functionality with network ad hoc routing mechanisms and the lower layer drivers built-in the system. Besides, proposed scheme handle the disconnections in ad hoc network due to the effects of topology changes and battery depletion. This scheme allows clients to switch to better cluster-head nodes as network topology changes. Hence, provides better performance to network.

Now a day, Mobile Adhoc Networks (MANET) gained a lot of popularity in the research community. People realized that there is a commercial value in MANETs with the successful solutions of the most basic but important problems in network layer. Mostly all the applications that attracted interest in traditional wired networks (e.g. Audio/Video Transfer, Video Conferencing, Watching Online Movies/Sports, Camera-enabled Messenger, Online Gaming etc.) would attract interest for MANETs as well. Since real-time multimedia communications will be common in MANETs, there has been an increasing motivation on the introduction of QoS in such networks. But, many characteristics of MANETs make QoS provisioning a difficult problem. In MANETs, providing QoS guarantees is very difficult and challenging than in traditional wired networks, mainly due to multihop communications, contention for channel access, node mobility and a lack of central coordination. However, in the last few years, much research attention has focused on providing QoS guarantees in MANET routing protocols. QoS routing protocol/mechanism is key issue in provision of QoS in MANETs. There are number of QoS routing approaches have been proposed in literature, focusing on different QoS metrics but no particular protocol/mechanism provides overall solution. There are some major open research issues in this area such as QoS metric selection and cost function design, Multi-class traffic, Scheduling mechanism at source, Packet prioritization for control messages, QoS routing that allows preemption, and QoS in Heterogeneous networks. There are still many open questions that must be solved to improve the performance of QoS-aware routing protocols such as bandwidth/delay estimation, route discovery, resource reservation, route maintenance, cross-layer design, energy consumption, multicast QoS routing etc.

Problem statement: Data availability and consistency are foremost issues in Mobile Ad hoc Networks due to the absence of permanent infrastructure. Cooperative caching addresses the data availability issue through coordinating the mobile nodes and sharing the cache copies among them. In the meantime, the mobile node must ensure the staleness of cache copies. The consistency maintenance resolves the staleness of the data among the source and caching node. Due to addition of more mobile nodes the network size is increased and it leads to increase the caching nodes. The mobility and disconnections causes additional overhead, latency and reduces the data delivery success ratio while updating the cache copy from the source. Approach: This study proposed Adaptive Push and Pull Algorithm for Clusters (APPC) and Cluster Based Data Consistency (CBDC) approach to address the consistency requirements and maintenance in mobile ad hoc network. Results: The CBDC satisfy the consistency requirements in partitioned clusters. The source node transmits the updated data through the cluster heads to the caching nodes. The APPC ensures the validity of cache copy by threshold Time-to-Live (TTL). Thus it provides efficient valid data accessibility in mobile ad hoc network. Conclusion: The simulation results shown that this proposed approach increases packet success ratio and reduces the delay and overhead when compared with the existing approaches Flexible Cache Consistency (FCPP) maintenance and Cluster Based Cooperative Caching Technique (CBCCT) for increasing number of nodes and speed respectively.

In this paper, we propose a new quality-of-service (QoS) routing protocol for mobile ad hoc network (MANET) using directional antennas. The proposed scheme offers a bandwidth-based routing protocol for QoS support in MANET using the concept of multi-path. Our MAC sub-layer adopts the CDMA-over-TDMA channel model. The on-demand QoS routing protocol calculates the end-to-end bandwidth and allocates bandwidth from the source node to the destination node. The paths are combined with multiple cross links, called shoelace, when the network bandwidth is strictly limited. Due to the property of the directional antenna, these cross links can transmit data simultaneously without any data interference. We develop a shoelace-based on-demand QoS routing protocol by identifying shoelaces in a MANET so as to construct a QoS route, which satisfied the bandwidth requirement, more easily. The shoelace-based route from the source to the destination is a route whose sub-path is constructed by shoelace structure. With the identified shoelaces, our shoelace-based scheme offers a higher success rate to construct a QoS route. Finally, simulation results demonstrate that the proposed routing protocol outperform existing QoS routing protocols in terms of success rate, throughput, and average latency.

Power control algorithms for mobile ad hoc networks