A Power-Aware Multicast Routing Protocol for Mobile Ad Hoc Networks With Mobility Prediction

A mobile ad hoc network (MANET) consists of a set of mobile hosts that can communicate with each other without the assistance of base stations. In MANETs, the high mobility of mobile nodes is a major reason for link failures. In this paper, we propose a stable weight-based on-demand routing protocol (SWORP) for MANETs. The proposed scheme uses the weight-based route strategy to select a stable route in order to enhance system performance. The weight of a route is decided by three factors: the route expiration time, the error count, and the hop count. Route discovery usually find multiple routes from the source node to the destination node. Then we select the path with the largest weight value for routing. Experimental results show that the proposed SWORP outperforms DSR and AODV especially in the high mobility environment.

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 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.

As the performance of mobile nodes advances, the ad hoc network will work with many mobile nodes. In such network, the route between the source node and the destination node is elongated, and then the route maintenance might become more difficult due to the topology change. Therefore, we have proposed Route-Split Routing (RSR) scheme for large mobile ad hoc network environments. RSR sets up multiple Subroute Management Nodes (SMNs) on the route between the source node and the destination node and divides the route into multiple subroutes. Since the subroute between two adjacent SMNs is locally managed, RSR has less overhead for the route maintenance and achieves the higher performance than AODV. In addition, RSR becomes tolerant to the multiple concurrent link failure because the route is repaired by each SMN on a subroute basis. RSR could provide higher data packet delivery ratio, but has high overhead because the route becomes longer as the subroute can be locally repaired and separately. Therefore, this paper proposes three mechanisms to enhance the performance of RSR for large mobile ad hoc network environment and then evaluates it through simulation environment. As a result, the enhanced RSR with three proposed mechanism can decrease the total control overhead by 50 percent with high data packet delivery ratio.Keywordsmobile ad hoc networksad hoc on-demand distance vector routing

With on-demand routing protocols for mobile ad hoc networks (MANETs), for example, dynamic source routing (DSR), a source node tries to find a route to the destination node only when it has a packet addressed to that destination node. And the source node can find a route either from its own route cache or by initializing a route discovery. To reduce the traffic generated by such route discoveries, caching of routing information is necessary. And in the design of caching schemes, cache timeout (i.e., the time period that a link would stay in the cache) is a critical parameter. However, only a few works have been done on how to set it. In this paper, we propose a new link caching scheme with adaptive timeouts. In this scheme, the cache timeout of a link is decided based on the estimation of the link's lifetime. Simulation results show that the proposed scheme can adapt to scenario changes and hence improve the performance of on-demand routing for MANETs.

Mobile ad hoc networks (MANETs) are self-configurable, infrastructure-less networks with inherent versatility. The node mobility in these networks leads to frequent changes in network topology because of the formation of new links and cessation of the old ones, thereby, is a possible cause of high packet losses. Despite such daunting challenges, a MANET promises to become ever-present technology and has shown its usefulness in various potential areas of applications. The reliability assessment of such dynamically changing networks is attracting the attention of researchers all over the globe. In this paper, we propose a Monte Carlo Simulation procedure to evaluate the reliability of a MANET by utilizing the link expiration time and Border Time to determine more precisely the incremental time at which topology change would occur. We also assess the performance of a MANET by varying different scenario metrics, viz., transmission range, number of nodes, coverage area and the number of iterations. The simulated results ensure that the evaluation of reliability of a MANET can be effectively performed by the proposed method.

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%).

In this paper we present a sensor inter-vehicle communication protocol based on geographical routing. Sensors installed in cars continuously gather important information about: air bags, distance detection, mechanical and electronic parts, tire pressure, collision force, direction of impact and the car and its passengers' conditions. Our proposed protocol enables transmission of these information on point-to-point communications between cars in highway. The protocol is designed for highway travelers but can be used in any mobile ad-hoc network. The highway is divided in virtual cells, which moves as the vehicles moves. The cell members choose a center that will behave for a certain time interval as a Base Station. Every node has its geographical position given by Global Positioning System (GPS). When a source node has a message for a destination node, forwards it to its Cell Center. Then the message is forwarded through the other Cell Centers. The Cell Centers first verifies if the destination node belongs to their cell. Finally the destination Cell Center will send the message to the destination node. Our simulation results show that our proposed protocol improves the network utilization compared to existing inter-vehicles protocols. The protocol can be used to implement differentiated mobile services and message prioritization. Through simulation evaluations, we show that our protocol is very scalable and reduces the latency compared existing solutions.

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.

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 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.

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.

Due to the high mobility of nodes and highly dynamic topology, performing efficient and robust multicast in a Mobile Ad Hoc Network (MANET) is a challenging task. Most of existing multicast protocols in MANETs discover the routing path by flooding message over the whole network, which result in considerable cost for routing discovery and maintenance. Moreover, the reliability of the discovered path can not be guaranteed, since the stabilities of nodes along such path are unpredictable. This paper presents the Reliable Backbone based Multicast Routing (RBMR) protocol for MANETs. RBMR employs a mobility prediction based election process to construct a reliable backbone structure performing packet transmission, message flooding, routing discovery and maintenance. Other existing multicast protocols for MANETs can also take great advantage of RBMR to alleviate the influence of nodes mobility and perform efficient data transmission. Simulation results show that such protocol achieves good performance in terms of packet delivery ratio, forwarding efficiency and normalized overhead even in the high speed scenario.

Data replication is performed in mobile ad hoc networks (MANET) to improve data availability in presence of network partition due to high mobility rate of nodes. Replication helps to improve data availability by making multiple copies of same data on several nodes. Various techniques have been proposed in the literature for data replication in MANET. Since mobile nodes are characterized by limited memory space, computing capacity, constrained bandwidth and limited battery power, they extend less or no cooperation in participating replica allocation. Several approaches have been proposed in the literature to handle selfishness among nodes in replica allocation. But the proposed approaches consist of several modules to identify selfish nodes, elimination of selfish nodes, updating selfish features and finding the non selfish nodes to allocate a data replica. Existing replica allocation algorithms achieves better performance in allocating replica, but it consumes more time to allocate replica and the number of messages transmitted in the network during replica allocation. We propose a light weight replica allocation algorithm with reduced replica allocation time and reduced number of messages involved during replica allocation. We have analyzed the existing algorithm for replication in MANET and presented optimizations in the steps involved so that the overall replica allocation time and the messages involved are reduced to a large extent. We suggest the usage of Fisheye state routing protocol along with the replication algorithm that finds the hop count by which a node is connected from the other node. We have formulated a mathematical model to illustrate the benefits of the proposed approach and performed a simulation in MATLAB. The results obtained show a significant reduction in replica allocation time and the amount of messages involved in performing replica allocation compared to the existing algorithms.