Heterogeneous Routing Protocol Coordinator for Mobile Ad Hoc Networks

VANETs is a rapid developed wireless mobile MANETs network with special challenge nature. It is a distributed and self-organized communication network based on moving vehicle. This network has characteristics like limited bandwidth, strong mobility, strong dynamic network topology, limited node degrees freedom, equipment capacity constraints and weak physical security. These characteristics usually make typical routing protocol in mobile MANET show a low efficiency in mobile VANETs, even fail. MANET routing algorithm is roughly divided into two categories, namely table driven routing protocol and on-demand routing protocol. It is due to the particularity of driving cars on the road. So how to improve network routing protocol in the performance is now a challenging problem. The purpose of this article studies network routing mechanism based on wireless vehicular networks simulation method. On the basis of analyzing the performance of typical routing protocols in MANET, such as DSDV, AODV and DSR, the improved scheme of AODV on-demand routing algorithm is put forward.

Node misbehavior due to selfish or malicious intention could significantly degrade the performance of MANET because most existing routing protocols in MANET are aiming at finding most efficiency path. To deal with misbehavior in MANET, an incentive mechanism should be integrated into routing decision-making. In this paper firstly we review existing techniques for secure routing, and then propose to use trust vector model based routing protocols. Each node would evaluate its own trust vector parameters about neighbors through monitoring neighbors’ pattern of traffic in network. At the same time, trust dynamics is included in term of robustness. Then we integrated trust model into Dynamic Source Routing (DSR) and Ad-hoc On Demand Distance Vector (AODV) which are most typical routing protocols in MANET. We evaluate the performance of those trust routing protocols by compar ing the simulation results of with and without the proposed trust mechanism . The simulation results demonstrate that modified routing protocols can effectively detect malicious nodes and mitigate their attacks.

This study examines energy consumption and the impact on network lifetime using ANODR and DYMO routing protocols in MANETs with the QualNet simulator. Both ANODR and DYMO are designed for MANETs but employ different approaches for establishing and maintaining routes among mobile nodes. ANODR adapts routing decisions based on neighborhood information, while DYMO operates on-demand, establishing routes only when necessary. To investigate energy consumption and network lifetime, simulations or experiments should be conducted to compare the performance of these protocols under various scenarios. Analyzing these QoS metrics provides insights into the energy efficiency and impact on network lifetime of ANODR and DYMO in MANETs.

A MANET is a self-motivated mobile wireless network that can be created exclusive of any former support. The challenge of MANET is to design robust routing algorithms which will satisfy all or few routing properties. Routing protocol in MANET can be categorized in various approaches depending upon network structure, communication model, routing strategy. Routing protocols can be further classified as proactive and reactive. Routing algorithms developed till today focused on the methods of routing. This article presents a survey of single /multipath routing algorithms, its advantages, and limitations. Researchers are attracted to rectify, design & develop concrete, routing algorithms which will fulfill the adequacy requirement of MANET users. This paper proposes the need robust routing protocol with security and energy efficient.

In high-mobility MANET, the fast change of topology increases the complexity of routing. In this paper, we propose a novel routing protocol, namely, zone-based routing (ZBR) protocol, where the network area is divided into fixed nonoverlapping square zones. There is a zone-head in each zone that acts as a router in the network and maintains information of its member nodes. A path is a collection of ID numbers, which represent the specific zones the path traverses. We define new parameters-the mobility of a node to be the number of zones a node traverses during a fixed time unit, and the path stability parameter as a value related to both the mobility of nodes a path includes and the density of the zones the path covers. In this case, we select the most stable path for routing packets. Simulation results show that the probability of broken links becomes very low, which in turn greatly increases the delivery rate of the network. We show that ZBR outperforms existing location-based routing protocols and adapts better to high-mobility MANET.

Objectives: It analyzed the simulation based study for impact of resource consumption attack on Signal-Stability Based Adapting (SSA) routing protocol in MANET. The performance of routing protocol is calculated by using these different parameters like throughput, Packet Delivery Ratio (PDR), end to end delay (E2E), routing overhead and energy consumption. Methods/ Statistical Analysis: The whole simulation is carried out through NS-2. NS-2 (Network Simulator version 2) is used for this simulation which is developed by UC Berkely. NS-2 is basically a combination of two languages OTcl and C++. Components of NS-2 are NAM (Network Animator), Proposing, Post prosing. NS-2 is a discrete event simulator in this C++ is easy to code but slower to run whereas OTcl is fast to run and difficult to code. Findings: We see the impact of this attack with three different performance metrics such as End to End, routing overhead, energy consumption throughput and packet delivery ratio (PDR).

Objectives: Comparison of performance efficiency of AODV and OLSR routing protocol in MANETs using NS2 tool. The parameters considered and compared for throughput, packet delivery ratio, energy spent and delays. Methods/Analysis: Using NS2, first a sample of 50 nodes was generated and moved move randomly. Dynamic clustering was done within the sample area of 500x500sq.m. 50 nodes were set up as sink nodes and attached a local agent and loss monitor for each node. These nodes were positioned in the sample area. The nodes 17, 28, 35 were set up as source and nodes were set up as destination for transmission of packets, respectively. Findings: The four performance measures were: Energy spent, PDR, end-to-end delay and throughput with number of nodes as constant (50) and with different speed (time) of node like 2,4,6,8,10s are taken for comparison. Transmission of packet was tested using AODV and the performance metrics are traced. Similarly the performance metrics were tested with OLSR protocol. The values were tabulated and a graph was generated for each metric in Y-axis and time in X-axis. Novelty of the Study: A VMware workstation was installed and tested in unix environment using tool command language the modules were created in vi editor. They were executed using ns command. This paper is main module. Further malicious node detection and elimination was done to still prove OLSR outperforms than AODV. Conclusion: In all the above four metrics the OLSR protocol performance is efficient than AODV when data transmission occurs between nodes in MANETs. From the results obtained we can observe OLSR outperforms AODV in all four parameters irrespective of different speed (time).

This is a weighted cluster algorithm based on re-clustering approach for OLSR and DSR protocols in MANET. In this protocol, all the nodes of the networks are clustered into a single cluster; we have analyzed the way how to compute the trusting values according to their interaction performances between the nodes. Based on the trusting value, we can decide and check whether the connection between the two nodes is reliable or not. On the basis of no. of reliable connections, we can choose the cluster head in the cluster, and the nodes which hold solid association with cluster head will be the base nodes, base nodes and the cluster head can work together for being the service providing congregation (group) for the cluster. Each member will circulate a secret share mechanism which will be a part of secret key for itself, and come into being the parameter of authentication in the processing of investigation about the up to date requirement in the next cluster, and the obscure and secret share mechanism can also be authenticated by the node itself. One node has been confirmed as a malicious node at a time; cluster head broadcasts the information to all the cluster members and refuse to provide updating service for the particular malicious node. The protocol has absolute forward confidentiality and backward confidentiality. The keys of nodes and cluster are generated after discussion among the service group members, Man-in-the-middle attack can be resisted by this way. At the same time, the cluster can achieve the periodic update, the cluster head will be reelected, service group will be reformed, subsequently, the key of cluster and nodes will be updated as well.

Ad hoc mobile devices heavily depend on the performance of batteries. Optimizing the power consumption is a very crucial issue. To maximize the lifetime of mobile ad hoc network, the power consumption rate of each node must be reduced. In this paper we present a novel energy efficient routing algorithm based on mobile agents to deal with the routing mechanism in the energy-critical environments. A few mobile agents move in the network and communicate with each node. They collect the network information to build the global information matrix of nodes. The routing algorithm chooses a shortest path of all nodes in all possible routes. Additionally, we compare the performance of power-relation routing protocol DSR (Dynamic Source Routing) in simulation environment.The results show that the survivability of Ad Hoc network has been better because of less energy consumption when using our improved DSR as compare to standard DSR protocol.

The increasing demand for delivering communication services in regions with intermittent connectivity and low node density has motivated researchers to develop new routing protocols. There are many application dependent routing protocols in the literature to establish communication for densely connected MANETs to the highly mobile and Opportunistic DTNs (Delay Tolerant Networks). OceanNet aims to provide reliable communication services to the fishermen who take fishing trips that last for several days. In this paper, we study the existing research done on MANET, DTN and hybrid routing protocols. We adopt a system level simulation study for the OceanNet network topology using NS-3. The goal of this approach is to understand the network performance under various factors such as scalability, node movement and connectivity of different types of fishing vessels using MANET protocols. Simulation results show that choosing a single MANET protocol does not prove to be effective for the different scenarios considered in the network.

MANET is a self managed and eminently dynamic wireless connection of nodes. Group communication in MANET expanding its usability in real scenario day by day. Some group-oriented scenarios in wireless ad-hoc networks are e-education, ecommerce, vehicular networks, searching and rescue operations, audio/video conferences, battlefields and disaster management etc. Demand of group communication is a quick construction of reliable and dynamic multicast paths, which works efficiently under constrained environment like dynamic channel conditions and mobile nodes. Multicasting is a critical approach which facilitates lots of real applications, to achieve cluster conversations instead of dialogues between two individuals. To provide informative summary of various QoS based multicast path finding protocols proposed in recent year's research, an analysis is done in this paper, along with their operational features and advantages. Performance comparison based on their network architecture, QoS parameters, characteristics and information used for routing is also presented in tabular form so that new researchers may easily review and take benefit of it in their research.

In a mobile ad-hoc network (MANET) where Mobile Nodes (MNs) self-organize to ensure the communication over radio links, routing protocols clearly play a significant role. In future MANETs, protocols should provide routing under full mobility, power constraints, fast time-varying channels, and nodes subject to high loading. In this article, a novel robust routing protocol, named distributed X-layer fastest path (DXFP), is proposed. The protocol is based on a cross-layer metric which is robust against the time-variations of the network as far as topology (mobility), congestion of the nodes and channel quality (fading, power constraints) are concerned. All these features are integrated in a single physical cost, i.e., the network crossing time, which has to be minimized. Furthermore, several routes from source to destination are stored for a given data flow to efficiently face the disconnections which frequently occur in MANETs. It is shown that the DXFP protocol, though locally operating in a fully distributed way within the MNs, provides, for each data flow, the optimum routes according to the considered metric. The DXFP protocol has been compared with two of the most commonly used routing protocols for MANETs, i.e., dynamic source routing and ad hoc on-demand distance vector, showing significant improvements in performance and robustness.

Mobile ad hoc network-a revolutionary concept in itself, is a collection of wireless mobile nodes that are dynamically and arbitrarily located in a fashion that the interconnection between nodes are capable of changing in a continual basis. MANET has increasingly gained popularity, especially with the military and it is the aim and zeal of technology to upgrade its components and make them better and better. Mainly 4 or 5 types of conventional routing protocols of reactive, proactive or hybrid natures are used based on the requirements of the network. However power consumption in all these are rather high causing the transmission cost to increase. Thus, the quest for an energy efficient routing protocol in MANET to make its usage even better. In this paper we have tried to talk about newer energy efficient routing protocols. These take into consideration that in MANET, channel and energy capacity are scarce resources. Thus it is extremely important to enhance the lifetime of MANETs. Hence we have listed certain energy efficient protocols ideally suited for the current scenario.

Critical and public safety operations require real-time communication from the incident area(s) to the distant operations command center going through the evacuation and medical support areas. Data transmitted throughout such type of network is extremely useful for decisions makers and operations' conducting. Therefore, any delay in communication may cause lives' loss. Above all, the existing infrastructure communication systems (PSTN, WiFi, 4/5 G, etc.) can be damaged and is often not available solution. An alternate option is to deploy autonomous tactical network at unpredictable location and time. However, in this context there are many challenge especially how to effectively rout or disseminate the information. In this paper, we present behavior of varied multi-hops routing protocols evaluated in a disaster-simulated scenario with different communication technologies (i.e. WiFi IEEE 802.11; WSN IEEE 802.15.4; WBAN IEEE 802.15.6). Studied routing strategies are classified: Ad hoc proactive and reactive protocols, geographic-based and gradient-based protocols. To be realistic, we have conducted our simulations by considering a Mall in Doha city in the State of Qatar. Moreover, we have generated a mobility trace to model the rescue teams and crowd movements during the disaster. In conclusion, extensive simulations showed that WiFi IEEE 802.11 is the best wireless technology to consider in an emergency urban with the studied protocols. On the other hand, gradient based routing protocol performed much better especially with WBAN IEEE 802.15.6. Keyword: Tactical Ad-hoc Networks; Public Safety and Emergency; Routing Protocols; IEEE 802.11; IEEE 802.15.4; IEEE 802.15.6; Performance Evaluation I. Introduction Public safety is a worldwide governments' concern. It is a special continuous reactive set of studies, operations and actions in order to predict plan and perform a successful reaction in a disaster case. Coupled with the raise of number and variety of disasters, not only the economies and infrastructures are affected, but significant number of human lives. With regards to the emergency response to these disasters, the role of existing Public Safety Network (PSN) infrastructures (e.g. TETRA, LTE) is extremely vital. However, it is anticipated that, during and after the disasters, existing PSN infrastructures can be flawed, oversaturated or completely damaged. Therefore, there is a growing demand for ubiquitous emergency response system that could be easily and rapidly deployed at unpredictable location and time. Wherefore Wearable Body Area Networks (W-BAN) is a relevant candidate that can play a key role to monitor the physiological status of involved workforces and the affected individuals. Composed by small and low-power devices connected to a coordinator, WBAN communication architecture relies on three levels: On-Body (or intra-Body), Body-to-Body (or inter-Body) and off-Body communication networks. In disaster scenarios, the network connectivity and data is a challenging problem due to the dynamic mobility and harsh environment [1]. It is envisioned that, in case of unavailable or out-of-range network infrastructures, the WBANs coordinators along with WBANs sensors can exploit cooperative and multi-hop body-to-body communications to extend the end-to-end network connectivity. The Opportunistic and Mobility Aware Routing (OMAR) scheme is an on-body routing protocol proposed in one of our earlier works [2]. A realistic mobility model is also a major challenge related to the simulations. To the best knowledge of the authors, no comparable study in disaster context is conducted by considering a realistic disaster mobility pattern. In this paper, we investigate varied classes of multi-hop Body-to-Body routing protocols using a realistic mobility modeling software provided by Bonn University in Germany [3]. The mobility pattern is exploited by the WSNET simulator as a mobility trace of the nodes moving during and after the disaster. Note here that individuals are considered mobile nodes in the scenario. In the conducted simulations, each iteration, one communication technology configuration is selected (i.e. WiFi IEEE 802.11; WSN IEEE 802.15.4; WBAN IEEE 802.15.6), then simulations are ran with the routing protocols (i.e. proactive, reactive, gradient-based and geographical-based). This strategy provides a vision not only on the behavior of the routing protocols in the disaster context, but evaluates the communication technologies in such case also. For proactive, reactive, gradient-based and geographical-based routing protocols, Optimized Link State Routing protocol version 2 (OLSRv2) [4], Ad-hoc On-Demand Distance Vector (AODVv2) [5], Directed Diffusion (DD) [6] and Greedy Perimeter Stateless Routing (GPSR) [7] protocols are selected respectively The remainder of this abstract is organized as follows. In section II, we present briefly the disaster scenario considered. In section III, we explain the results of the simulations. Finally, in Section IV, we conclude and discuss perspectives. II. Landmark disaster scenario we are investigating a disaster scenario (fire triggering) in the “Landmark” shopping mall. The mobility model used is generated by the BonnMotion tool. We assume that the incident is caused by fire into two different locations. Rescuers are immediately called to intervene. We consider that firefighters are divided into 3 groups of vehicles with 26 firefighters in each group. Medical emergency teams that probably could reach the mall just after the incident, are consisting of 6 ambulances with 5 medical staff in each ambulance (30 rescuers in total). Civilians could also help rescuers and they are also considered in the mobility trace generation. Injured individuals are transported from the incident areas to the patients waiting for treatment areas to get first aids. Then, they will be transported to the patients clearing areas where they will be either put under observation or evacuated to hospitals by ambulance or helicopter. A tactical command center conducting the operations is represented by WSNET is an event-driven simulator for wireless networks. WSNET is able to design, configure and simulate a whole communication stack from the Physical to the Application Layer. We benefit from these features to vary the payload with the selected MAC and routing layer in each iteration. These combinations provided a deep review on the possible communication architecture to consider in disaster operations. The following section describes the outcome of these extensive simulations. III. Performance evaluation The main difference between the disaster and any other scenario is the emergency aspect. All flowing data in the network is considered highly important. The probability of packets that did not reach the destination must be zero. For this reason, our evaluation is regarded to the Packet Reception rate (PRR). Likewise, a delayed packet is such like an unreceived packet. That's why we consider the delay as decisive factor. Similarly, the energy consumption is also observed. The following table summarizes the obtained results. In terms of average PRR, WiFi IEEE 802.11 is convincingly better than the two counterparts combined with all the routing protocols. GPSR has a considerable PRR with WBAN IEEE 802.15.6, but the location information of the nodes is considered as known. Regarding the delay, DD is particularly efficient with WiFi and WBAN. To conclude, DD is an efficient routing protocol to consider in case of Indoor operations, while GPSR is most relevant in Outdoor operations where locations can be obtained from GPS. IV. Conclusion Disasters are growing remarkably worldwide. The existing communication infrastructures are not considered a part of the communication recuing system. Consequently, to monitor deployed individuals (rescue teams, injured individuals, etc.) data should be forwarded throughout these individuals (WBANs) to reach a distant command center. In order to evaluate the performance of diverse multi-hop routing protocols, we have conducted extensive simulations on WNSET using a realistic mobility model. The simulations showed that all evaluated routing protocols (i.e.AODVv2, OLSRv2, DD and GPSR) has the best PRR with the WiFi technology. While, DD was found to be the most efficient with the WBAN technology. GPSR also could be considered when the location information is available. Acknowledgment The work was supported by NPRP grant #[6-1508-2-616] from the Qatar National Research Fund which is a member of Qatar Foundation. The statements made herein are solely the responsibility of the authors.

MANETs aredecentralized network that involves mobile nodes. As the overall network is mobile and has no centralization, network management, routing, and security become very challenging. Though many works have been presented, still there is a lack in organizing the network due to unauthorized access, centralized security schemes, and the dynamic nature of the nodes. This paper proposed a novel Blockchain-assisted Secure Routing (Block-Sec) protocol for MANETs. All mobile nodes are authenticated by Distributed One-Time Passcode (DOT) based authorization scheme. All authorized nodes are segregated into multiple clusters based on Weight based Dynamic Clustering (WDC) algorithm in which multiple metrics are considered in clustering and re-clustering processes. After cluster formation, each cluster is elected with optimal Cluster Head (CH) by Strawberry Optimization (SBO) algorithm with a new objective function. After cluster formation, the optimal route is selected by Fast Neural Net-assisted Fuzzy (FNNF) algorithm by combining multiple variables. Data transmission is secured by Efficient Elliptic Curve (E2C2) algorithm. With the combined algorithms, the proposed approach obtainedimproved efficiency in packet delivery ratio (PDR), throughput, time analysis, and security level.