Routing in Mobile Ad-Hoc Networks using Social Tie Strengths and Mobility Plans

We consider the problem of routing in a mobile ad-hoc network (MANET) for which the planned mobilities of the nodes are partially known a priori and the nodes travel in groups. This situation arises commonly in military and emergency response scenarios. Optimal routes are computed using the most reliable path principle in which the negative logarithm of a node pair's adjacency probability is used as a link weight metric. This probability is estimated using the mobility plan as well as dynamic information captured by table exchanges, including a measure of the social tie strength between nodes. The latter information is useful when nodes deviate from their plans or when the plans are inaccurate. We compare the proposed routing algorithm with the commonly-used optimized link state routing (OLSR) protocol in ns-3 simulations. As the OLSR protocol does not exploit the mobility plans, it relies on link state determination which suffers with increasing mobility. Our simulations show considerably better throughput performance with the proposed approach as compared with OLSR at the expense of increased overhead. However, in the high-throughput regime, the proposed approach outperforms OLSR in terms of both throughput and overhead

Security Enhanced Location-aided Level-based Disjoint Multipath Routing Algorithm for Mobile Ad Hoc Networks

In mobile ad hoc networks (MANET), the location-based multipath routing protocols involves less routing overhead compared to non-location-based protocols. This paper proposes two location-based algorithms, Enhanced Location-aided Level-based node Disjoint Multipath routing (ELLDMR) and Secure Location-aided Level-based node Disjoint Multipath routing (SLLDMR), to enhance the link lifetime and the security of the MANET. The objective of ELLDMR is to build multiple paths with non-critical nodes so that the lifetime of the routing path is significantly increased. It also hides the source, destination and path identity in intermediate nodes to avoid intrusion of routing attacks in the routing path. The SLLDMR is an enhancement over ELLDMR where it aims to overcome rushing attack and exhibit secure data transmission using two-level cryptographic processes. The performances of ELLDMR and SLLDMR are simulated using NS2 where it shows a minimum routing overhead, less end to end delay and high packet delivery compared to existing Location-aided Level-based node Disjoint Multipath routing (LLDMR) algorithm and Topology Hiding multipath protocol (TOHIP)

Geographic Centroid Routing for Vehicular Networks

A number of geolocation-based Delay Tolerant Networking (DTN) routing protocols have been shown to perform well in selected simulation and mobility scenarios. However, the suitability of these mechanisms for vehicular networks utilizing widely-available inexpensive Global Positioning System (GPS) hardware has not been evaluated. We propose a novel geolocation-based routing primitive (Centroid Routing) that is resilient to the measurement errors commonly present in low-cost GPS devices. Using this notion of Centroids, we construct two novel routing protocols and evaluate their performance with respect to positional errors as well as traditional DTN routing metrics. We show that they outperform existing approaches by a significant margin.Comment: 6 page

Optimizing ad-hoc on-demand distance vector (AODV) routing protocol using geographical location data

This thesis summarizes the body of research regarding location-aided routing protocols for mobile ad-hoc networks (MANET). This study focuses on the use of geographical location information to reduce the control traffic overhead caused by the route discovery process in the ad-hoc on-demand distance vector (AODV) routing protocol. During this process, AODV will flood the entire network with route request packets. This introduces significant packet-handling overhead into the network. This thesis introduces Geographical AODV (GeoAODV), which uses geographical location information to limit the search area during the route discovery process to include only promising search paths. Also, this thesis benchmarks GeoAODV\u27s performance against Location Aided Routing (LAR) and examines four mechanisms for reducing the control-packet overhead introduced by the route discovery process: LAR Distance, LAR Zone, GeoAODV, and GeoAODV Rotate. OPNET Modeler version 16.0 was used to implement each of these mechanisms and compare their performance via network simulations. The results indicate that location-aided routing can significantly reduce the aforementioned control-packet overhead