Search

Voice over Internet Protocol (VoIP) provides good services through Vehicular Ad-hoc Networks (VANET) platform. These networks encounter various challenges to support voice calls with acceptable Quality of Service (QoS). The Optimized Link State Routing Protocol (OLSR) is used to investigate the performance of VoIP applications in the VANET network. The network was tested before and after running the OLSR algorithm, the testing focused on Quality of Service (QoS) parameters like end-to-end delay, delay variation (jitter), and probability of packet loss between two moving hops through multi-hop Ad-hoc networks in different scenarios, using the ITU G.711 VoIP codec. After measured the end-to-end delay, jitter, and probability of packet loss for two nodes the algorithm decreased delay by 18.72%, while decreased jitter by about 20.42% and decreased packet loss by about 128.6%. However, The OLSR has shown initial good performance for four hops, and then added more hops the delay exceeded 400 ms which is not acceptable according to ITU-T recommendations. This was achieved by implementing a testbed to extract the desired results as opposed to using a simulation.

Airborne Ad-hoc Networks (AANETs) are becoming highly popular nowadays. Due to the fast movements of aircraft, there are frequent topology updates which result into a link break between two communicating aircraft. The routing overhead increases multiple times in search of a new route continuously. To deal with this issue of increased overhead, this paper presents a new routing scheme named as Airborne-OLSR (AOLSR). The proposed scheme provides more optimization of Multi-point Relay (MPR) selection criteria used in existing Optimized Link State Routing (OLSR) protocol. This decreases the amount of overhead by selecting the MPR either on the right side or the left side of the source node which depends on the location of the node to which data is to be sent. The decrease in overhead will also result into more bandwidth availability which decreases the possibility of link break. The proposed routing scheme has been compared with the existing OLSR protocol for UDP and TCP environment with varying node speed in 3-D Gauss Markov Mobility model using network simulator-3(ns-3). The simulation analysis shows that the proposed scheme is better in terms of packet delivery ratio, End-to-End delay, routing overhead and throughput as compared to OLSR. We have also compared the AOLSR with previously developed AANET specific protocols like automatic dependent surveillance-broadcast system aided geographic routing protocol(A-GR) and geographic routing protocol for aircraft ad hoc network (GRAA).

Optimized Link State Routing protocol, an ad-hoc routing protocol, has been popular in wireless devices running on Linux operating system for quite some time. In this project we have outlined the process of preparing Android devices for ad-hoc networking, a way to overcome limitations of the OS for continuous UDP communication, ensure all devices communicate on the same wireless Wi-Fi SSID, Cell-ID, subnet and finally implement the Optimized Links State Routing (OLSR) in Android Operating System using Google Nexus 7 devices. Using the code base from ProjectSPAN, an open source project, OLSR protocol has been ported to Android Nexus 7 devices. The core application is divided into two major sections, MANET and OLSR. Mobile Ad-hoc Network portion of the code takes care of setting up the device for ad-hoc mode communication, firewall and peripheral setup while OLSR portion of the code maintains the neighbor tables, MPRs and routing. The project also describes the process by which a device is prepared to run low level custom codes in Android operating system. The OLSR implementation has been successfully tested with three nodes test bed, demonstrating the multi-hop ad-hoc networking capabilities of this wireless routing protocol. With the aid of the Android’s graphical interface the application is able to exhibit the dynamic nature of the OLSR protocol. As nodes and neighbors in the network moves around with respect to time and relative location, OLSR protocol is able to form new neighbors and elect Multipoint Relay in real time.

This paper presents an analysis and comparison between the proactive routing protocols OLSR and DSDV and the reactive routing protocol AODV in a MANET network. Two scenarios were defined, the first one representing a soccer team attacking and the second one defending. To simulate each scenario the area of movement of the nodes (players) was varied. For this purpose, an investigation was carried out on the problems presented by these routing algorithms for Ad Hoc networks in different environments. In this way, an overview of the strategies and solutions that currently exist is obtained. Based on the information gathered, it is proposed to perform a simulation using NS3 in order to obtain results that resemble reality. The comparison is made based on throughput, PDR and Delay metrics. In each simulation, parameters such as node velocity and initial position are adjusted according to the behaviour of a real soccer player. The nodes move in a random trajectory within the specific area and one of them sends data to a fixed server node located at the edge of the area where the nodes move, simulating the bench where the receiver is located. The transmitted traffic is characterized to simulate realistic biometric data. From the results, it is concluded that AODV and DSDV have better performance than OLSR and the optimum transmission interval is 20 seconds. In addition, with a transmit power of 10 dBm, 100% throughput is guaranteed at the receiver.

In some Vehicular Ad Hoc Networks (VANETs) applications, the geocast routing protocol is used for data transmission from a source vehicle to a group of vehicles located in a common region. Efficient data transmission to the destination region is one of the critical challenges of geocast routing protocols. In this research, the geocast routings are considered that exploit rateless coding to improve the reliability, and so packet delivery ratio. Some of these geocast routing methods use flooding schemes to deliver the messages to the destination region. However, in order to cut high overheads caused by flooding schemes, the routing protocols that use unicast routes for data delivery have been taken into account. In this way, recent geocast routing protocols exploit on-demand unicast routing methods such as Ad-hoc On-Demand Distance Vector (AODV) to deliver the packets to the destination region and then broadcast them in that area. However, the packet delivery ratio and the delay of those methods are respectively lower and higher than flooding-based methods. This paper proposes to exploit the table-driven Optimized Link State Routing (OLSR) protocol to deliver the messages to the destination region. To customize the OLSR protocol for geocasting, we propose a number of modifications to message flows and data exchanges. Compared to on-demand geocast protocols, OLSR imposes lower message delay and delivers more messages to the destination region at a higher overhead expense. To overcome this overhead, we also propose algorithms to adjust the control message intervals of the OLSR protocol in each node. Simulation results show that our OLSR-based protocol demonstrates better performance in terms of delay and packet delivery ratio than those of the traditional AODV-based method and CALAR-DD protocol regarding various vehicles' densities, vehicles' velocities, message sizes, and destination region sizes. Compared to the traditional OLSR, using the tuned OLSR-based method has also significantly reduced the signaling overhead costs.

With the evolution of 5G cellular communication, beamforming is mature for the implementation on a large scale. The development of cellular networking provides a great opportunity for swarm UAS. Concurrently, the advantages of swarm UAS can provide immense improvement to the advance of industrial and residential implementations.However, the nature of the antenna array constrains beam-forming in a limited space which is rarely mentioned in networking routing researches. In this paper, regarding the constrained steering space, we proposed a novel algorithm,Optimized Ad-hoc On-demand Distance Vector (OAODV),which aims to improve the capacity of beamforming on swarm UAS networking. With the adjustable searching space, OAODV can achieve better latency, overhead, and link generation than the conventional algorithms of Ad-hoc On-demand Distance Vector (AODV) and Optimized Link State Routing (OLSR). Compared with AODV and OLSR, OAODV can reduce 35.07% and 68.93%of average overhead, and decrease 47.73% and 11.55%of average latency respectively. Further, we leverage Ant Colony Optimization(ACO) to enhance OAODV, and the ACO enabled OAODV can achieve better throughput and fewer hops with reduction of overhead. The proposed algorithms show the promising capacity to improve swarm UAS networking.

Routing protocols have an important role in any Mobile Ad Hoc Network (MANET). Researchers have elaborated several routing protocols that possess different performance levels. In this paper we give a performance evaluation of AODV, DSR, DSDV, OLSR and DYMO routing protocols in Mobile Ad Hoc Networks (MANETS) to determine the best in different scenarios. We analyse these MANET routing protocols by using NS-2 simulator. We specify how the Number of Nodes parameter influences their performance. In this study, performance is calculated in terms of Packet Delivery Ratio, Average End to End Delay, Normalised Routing Load and Average Throughput.

Wireless ad hoc networks have become valuable assets to both the commercial and military communities with applications ranging from industrial control on a factory floor to reconnaissance of a hostile border. In most applications, nodes act as data sources and forward information to a central base station (BS) that may also perform network management tasks. The critical role of the BS makes it a target for an adversary's attack. Even if an ad hoc network employs conventional security primitives such as encryption and authentication, an adversary can apply traffic analysis techniques to find the BS. Therefore, the BS should be kept anonymous to protect its identity, role, and location. Previous work has demonstrated distributed beamforming to be an effective technique to boost BS anonymity in wireless ad hoc networks; however, the increased anonymity and corresponding energy consumption depend on the quality and quantity of selected helper relays. In this paper we present a novel, distributed approach for determining a set of relays per hop that boosts BS anonymity using evidence theory analysis while minimizing energy consumption. The identified relay set is further prioritized using local wireless channel statistics. The simulation results demonstrate the effectiveness our approach.

Vehicular adhoc networks are slowly gaining importance as the demand for faster communication increases. The vehicular nodes need to communicate securely via an established and effective route. Control and protocol information between the vehicles is transmitted using the technique of broadcasting. The nodes are never stagnant and even though their energy rarely dissipates, the high mobility of the nodes poses quite a problem. Lack of an established infrastructure is a major issue and needs to be addressed in order to achieve maximum performance. We have designed a novel waterfall model focusing on a robust broadcasting method. The OLSR protocol is enhanced using a robust MPR technique, which helps in mitigating the circulation of duplicate packets within the network. The RMPR subset of the OLSR protocol is capable of handling transmission errors and the hidden and exposed terminal problems prevalent in the VANET environment. The inclusion of a waterfall model enables the proposed technique to maximize throughput and minimize the delay in the network. The waterfall model works in two major phases. The first phase incorporates the Cognitive radio scheme for effective channel allocation and utilization.The RMPR technique is implemented in the second phase which focuses on utilizing the neighbor nodes to transmit the packets successfully towards the destination. The RMPR scheme aims to categorize the neighboring nodes as either one hop or 2-hop neighboring nodes. Additionally, the uncategorized nodes are further probed to find a second subset of 2-hop nodes which would speed up the transmission. The implementation of these two important phases into the classic waterfall model helps to streamline the activities and helps in streamlining the network activities.The proposed waterfall model RMPR technique is analyzed with protocols like MMPR–OLSR and the OLSR protocols to determine the effectiveness of the proposed protocol. The performance analysis is carried out using the NS2 simulator. The techniques that are compared are evaluated using major network parameters like throughput, delay, PDR and channel utilization. It is evident that the proposed protocol is able to maximize the PDR than the existing techniques.

FANET (flying ad-hoc network) has provided broad area for research and deployment due to efficient use of the capabilities of drones and UAVs (unmanned ariel vehicles) in several military and rescue applications. Drones have high mobility in 3D (3 dimensional) environment and low battery power, which produce various problems such as small journey time and infertile routing. The optimal routing for communication will assist to resolve these problems and provide the energy efficient and secure data transmission over FANET. Hence, in this paper, we proposed a whale optimization algorithm based optimized link state routing (WOA-OLSR) over FANET to provide optimal routing for energy efficient and secure FANET. The efficiency of OLSR is enhanced by using WOA and evaluated performance shows the better efficiency of WOA-OLSR in terms of some parameters such as a packet delivery ratio, end to end delay, energy utilization, throughput, and time complexity against the previous approaches OLSR, MP-OLSR, P-OLSR, ML-OLSR-FIFO and ML-OLSR-PMS.

VANET is a subset of Mobile Adhoc Network (MANET) that utilizes wireless technology, which in the VANET network the node is presented as a vehicle and the route for a vehicle is presented as a highway that will be passed by that vehicle. In general, VANET has 3 classification routing protocols, namely reactive, proactive, and hybrid. Performance of routing protocol is greatly influenced by the propagation model. Propagation on the network is the behavior of radio waves, which in this case is used as a transmission medium from the transmitter to the destination (receiver). This research will analyze the variation of propagation models namely FreeSpace, TwoRayGround, Shadowing, and Nakagami on the performance of AOMDV (reactive), OLSR (proactive), and ZRP (hybrid). The performance of the routing protocol will be tested using test parameters including Packet Delivery Ratio (PDR), Packet Loss, End to End Delay, and Throughput. Keywords: VANET, AOMDV, OLSR, ZRP, FreeSpace, TwoRayGround, Shadowing, Nakagami

Mobile adhoc networks (MANET) are a self-coordinated wireless network that is worked without perpetual foundation and base station endorsement. In MANETs (Mobile Ad Hoc Networks) every single node activity goes about as the information source and communicator router. It notices its useful neighbours by making themselves by passing the nodes that got terminated of that correspondence range. In this paper, we designed the IHRP routing protocol with the help of combining the AODV, AOMDV and OLSR routing protocol with the network situation based routing adaptation. In the previous analysis, we identify AODV is more compatible for dynamic environment (where node motion is higher).The AOMDV routing protocol is useful for network load balancing and congestion control. OLSR is compatible for stable network which use as maximum link stability base routing. While we are designing the IHRP routing protocol through of the above (AODV, AOMDV and OLSR) protocol .We handle the network behaviour with better performance in any situation. Initially the RREP are broadcasted to find out the route. The poll of routing, select based on the network situation. The proposed IHRP start with a RREQ packet is to search the distance from its origin to its objective node. The network motion is higher than AODV protocol handle the particular situation but in any situation, while the 70% network node are stable then the route selection and transferring of data with the help of an OLSR routing protocol. The propose IHRP routing protocol also handle the network load and control the network congestion through the AOMDV routing protocol. Our proposed protocol IHRP also works in a hybrid manner while the source and destination belong in longer range such as different cluster. At that time situation based routing was followed between the clusters. We saw in the result part the comparison of IHRP and ZRP routing protocol. Execution of the improved hybrid routing protocol (IHRP) is much better than hybrid routing protocol (ZRP). In case of Packet Delivery Ratio analysis for IHRP and ZRP, we clearly show that The Packet Delivery Ratio is 97.99% by IHRP and 79.49% by ZRP, so we can say that the performance of packet delivery ratio in Improved hybrid routing protocol (IHRP) is much better than ZRP, where Improved hybrid routing protocol (IHRP) and hybrid routing protocol (ZRP) both performed the conjunction of proactive and reactive routing protocol features therefore we can say that Packet Delivery Ratio is better in improved hybrid routing protocol (IHRP) as compare to hybrid routing protocol (ZRP). We clearly show that the Normal Routing Load analysis for IHRP and ZRP where Normal Routing Load is 0.11% by IHRP and 4.72 % by ZRP, so we can say that performance of Improved Hybrid Routing Protocol (IHRP) in case of a Normal Routing Load is much less than the Hybrid Routing Protocol (ZRP). In case of overall parameter matrix (Normal Routing Load, Throughput, Packet Delivery Ratio and Average End To End Delay) the performance of Improved Hybrid Routing Protocol (IHRP) is much better than existing Hybrid routing protocol (ZRP).

NDN is an important instance of Information-Centric Networking. When integrating NDN into MANET, exploring new routing is a necessary task for this research area. The LSAs flooding is a common method to obtain network topology during route establishment. However, the LSAs flooding often results in a broadcast storm in high-density MANET. Using the MPR set proposed in the OLSR can effectively reduce the number of LSAs in the process of route establishment and can further solve the broadcast storm. In this paper, an enhanced neighbor discovery protocol firstly is designed to establish a MPR set. The new protocol can effectively avoid the problem incurred by unidirectional links that impact the network performance in a wireless environment. And then a new and proactive routing NOLSR based on OLSR for NDN-MANET is proposed to support NDN in MANET. And another important work is that NOLSR is implemented on top of NDN Forwarding Daemon NFD. Finally, we make a comparative analysis between NOLSR and the two most relative schemes such as traditional LSA-flooding and the scheme [1] by emulation experiments in the NDN emulator mini-NDN.

Wireless Sensor Network (WSN) is a self-organized network, contains sensor nodes deployed in particular regions to gather the environmental parameters and communicate the information to the base station directly through intermediate nodes. In recent times, WSN has gained attention from wireless device manufacturers, researchers, and users for remotely accessing and monitoring the information in diverse environments. The scalability and routing are the major concerns of the network. Apart from that, the performance of WSN depends on network simulation parameters such as delay, throughput, packet delivery ratio (PDR), and control overhead. The research paper focused on the DSDV and OLSR routing protocol realization on the new hardware platform. The hardware chip of these protocols is designed in Xilinx ISE 14.7 software using VHDL, targeted on Virtex-5 FPGA. The node communication is verified on Modelsim 10.0 simulation software. The FPGA hardware and timing parameters are analyzed for different node clusters (N = 10, 20 …150) configuration. The OLSR routing protocol network performance parameters are used to build the machine learning prediction model using cluster tree regression, random forest regression, multiple regression, and K-means clustering. The K-means clustering predicted 99.12% and 98.50% accuracy in terms of the packet delivery ratio and throughput respectively.

Various sensor nodes are interconnected with each other in wireless sensor network (WSN). WSN communicates to every node within the network wirelessly to collect data regarding the surrounding environment and send the particular data to the destination/centralised location. The sensor nodes transmit the data and the source sensor node transmits data to destination sensor nodes through various intermediary sensor nodes. Thus, secure transmission is required in which WSN must be free from malicious nodes to achieve safe transfer. In this paper, our objective is to provide secure data transmission in an efficient manner from source to destination through a trust based path namely novel fuzzy based crow search optimization algorithm (F-CSO) and optimised link state routing protocol (OLSR) protocol. Through NS3 tool, nodes are deployed in the network area and novel F-CSO is performed with respect to three parameters such as distance, degree and transmission energy. The best nodes are considered for optimization process and it must satisfy the three conditions such as lower distance between each node for transmitting the data, higher degree and higher energy for transmission. A set of nodes that satisfies this condition are gathered by the fuzzy rule technique and then further optimised by crow search optimization technique leading to exact nodes through which trust based transmissions are performed. Further, routing can be achieved by the OLSR protocol. The performance of the proposed system is compared with existing studies with respect to the system for detecting the malicious nodes with and without utilizing proposed F-CSO in terms of execution time, throughput, and packet delivery ratio. The evaluation result has shown that malicious nodes is detected in an efficient manner through the use of F-CSO, showing better results with various parameters.

Recently Mobile adhoc networks (MANETs) have received the great attention of researchers as these models provide a wide range of applications. But MANET nodes are prone to various security threats. To overcome this issue, many trust management frameworks have been implemented in the literature. It has been found that the use of machine learning can predict trust values more efficiently. However, machine learning performance suffers from the hyper-parameters tuning and over-fitting issues. Therefore, in this paper, novel trust management is proposed. initially, the Adaptive neuro-fuzzy inference system (ANFIS) is used to train the trust prediction model. Thereafter, a non-dominated sorting genetic algorithm-III (NSGA-III) is used to tune the hyper-parameters of the ANFIS model. Precision, recall, and root mean squared error metrics are used to design a multi-objective fitness function. Optimized link state routing (OLSR) protocol is used for comparative analyses purpose. Three different attacks are applied on the designed network i.e., link spoofing, jellyfish, and gray hole attacks to obtain the dataset. Comparative analysis reveals that the proposed trust evaluation model outperforms the competitive trust evaluation models in terms of various performance metrics such as routing overheads, average end to end latency, packet delivery ratio, and throughput. Thus, the proposed protocol is more secure against various security threats.

In the wireless communication, nowadays Flying adhoc network or UAV networks hold the most important place in the field of recent research topic. The drones or Un manned aerial vehicles which are enabled with camera, special circuit, sensors and advanced communication systems are coordinated among each other under the Network called as Flying adhoc network. FANET plays vital role in both military and civil applications. In spite of all these pros there are some unavoidable challenges and issues bonds around FANET. Since FANET possess the characteristics of dynamic rapid changing mobility, the choice of Routing protocol in FANET also open wide space in the field of Research. In our previous papers the topology based Routing protocols are analysed under different network scenarios and described the best performed one. It has been also found that the type OLSR is the better choice of FANET in terms of delay, Network load, Throughput and retransmission attempts. The OLSR routing protocol mechanism depends on the link state algorithm. It is proactive and table driven in nature. In order to maintain the topology information of the network, it completely supports the periodic exchanges of messages among themselves. OLSR is good in compacting the size of information sent in the messages. It avoids flooding by controlling the retransmissions. To exhibits this, the protocol utilizes multi point relaying techniques. It also provides optimal routes and this is completely suitable for dense and large networks. In this paper the performance of OLSR is investigated and analysed under 4 different network scenarios and different data rates. In a simulation using OPNET, the results show that the Optimized link state routing protocol has greater improved key indicators.

Wireless Mesh Networks (WMNs) are considered self-organizing, self-healing, and self-configuring networks. Despite these exciting features, WMNs face several routing challenges including scalability, reliability and link failures, mobility, flexibility, and other network management issues. To address these challenges, WMNs need to make programmable to allow modifications of standard techniques to be configured and implemented through software programs that can be resolved by integrating Software Defined Networking (SDN) architecture. SDN, being a cutting-edge technology promises the facilitation of network management as well as routing issues of wireless mesh networks. However, the evolution of the legacy IP-based network model in its entirety leads to technical, operational, and economic problems that can be mitigated by full interoperability between SDN and existing IP devices. This study introduces a Robust Routing Architecture for Hybrid Software-Defined and Wireless Mesh Networks (Soft-Mesh), by systematic and gradual transitioning of WMNs to SDNs in an efficient manner. The main objective of this paper is to suggest improvements to the architecture of the SDN node that allow the implementation of various network functions such as routing, load balancing, network control, and traffic engineering for the hybrid SDN and IP networks. Mininet-WiFi Simulator is used to perform various experiments to evaluate the performance of proposed architecture by creating a hybrid network topology with a varying number of nodes that is 50, 100, 150, 200, and 250 including SDN hybrid and legacy nodes with varying proportion of SDN hybrid and legacy nodes. Results are taken for the average UDP throughput, end-to-end delay, packet drop ratio, and routing overhead while comparing with traditional routing protocols including Optimized Link State Routing (OLSR) and Better Approach to Mobile Adhoc Networking (BATMAN) and with existing hybrid SDN/IP routing architectures including Hakiri and wmSDN. The analysis of simulation results shows that the proposed architecture Soft-Mesh outperforms in terms of the aforementioned performance metrics than the traditional and exiting hybrid routing protocols. Soft-Mesh gives 50% to 70% improved results concerning the incremental proportion of SDN hybrid nodes.

Aiming at the issue of the selectivity of routing protocols between UAV groups, a comprehensive weighting evaluation system based on game theory is proposed. Taking network simulation data as an example, three protocols, AODV, DSDV, and OLSR, are selected as the research objects. The results show that the DSDV protocol is suitable for the simple communication environment between UAV groups, the AODV protocol is suitable for the complex communication environment between UAV groups. In addition, the evaluation system is compared with the two evaluation systems of the Covariance Analytic Hierarchy Process (Cov-AHP) and the entropy method to calculate the relative deviation. The comparison results show that the new evaluation system is more reasonable than the other two evaluation systems.

In Ad Hoc networks, route failure may occur due to less received power, mobility, congestion and node failures. Many approaches have been proposed in literature to solve this problem, where a node predicts pre-emptively the route failure that occurs with the less received power. However, these approaches encounter some difficulties, especially in scenario without mobility where route failures may arise. In this paper, we propose an improvement of AOMDV protocol called LO-PPAOMDV (Link Quality and MAC-Overhead aware Predictive Preemptive AOMDV). This protocol is based on new metric combine two routing metrics (Link Quality, MAC Overhead) between each node and one hop neighbor. Also we propose a cross-layer networking mechanism to distinguish between both situations, failures due to congestion or mobility, and consequently avoiding unnecessary route repair process. The LO-PPAOMDV was implemented using NS-2. The simulation results demonstrate the merits of our proposed LO-PPAOMDV with approximately 10-15% increase in the packet delivery ratio while average end-to-end delay is reduced by 20%, and normalized routing load is reduced about 45%, also with 7% increase in the throughput, when compared with PPAOMDV.

The Optimized Link State Routing Protocol (OLSR) operates as proactive routing protocol destined for Mobile Ad hoc Network, OLSR is considering as one of the four important routing protocols identified by the Internet Engineering Task Force. The core of performance in OLSR routing protocol is the Multipoint Relays (MPRs) which are selected nodes responsible to forward broadcast messages during the flooding process in order to optimize the message overhead across the network. However, OLSR can be affected by the single Black hole attack that presents an active routing attack disturbs the network by dropping the forwarding packets. In this paper, we propose a new algorithm of selection for the MPR set in order to avoid malicious neighbors and select the thrust one by add a new criterion named as degree of forwarding. Our approach is based on exchanging acknowledgment Hello message between 2-hop neighbors when message HELLO is forwarded successfully between them, some modifications in MPR selection process are also made to select the most secure MPR nodes. The simulation of our proposed solution gives highly motivated results compared to the standard version of OLSR routing protocol under the Black hole attack in different network metrics as the throughput, packet delivery ratio, End-to-End delay, jitter delay and packet lost.

Although a standalone and isolated mobile ad hoc network (MANET) is practical in many scenarios, integration with the Internet is much more advantageous. The integration of a MANET with the Internet provides MANET users with Internet access and hence increases the scope of the MANET application. In addition, the Internet can benefit from this integration by an extension of the network coverage area. However, the integration of heterogeneous networks raises many issues. To overcome the incompatibilities between different architectures, gateways are used. This paper proposes a lightweight integration scheme for a MANET and the wider Internet, based on the optimized link state routing (OLSR). OLSR routing messages are reengineered and optimized to meet the needs of integration without involving additional routing messages for gateway discovery. The compulsory registration of a MANET node with a gateway node in a traditional integration is not required in the proposed approach, meaning that nodes can move freely within the local MANET with no disruption in the connection to another node in the external network. The proposed system is evaluated using the OMNET++ network simulator and is compared to another existing system. The simulation results demonstrate the validity of the proposed approach.

Mobile Ad hoc Network (MANET) is a wireless network that contains a collection of nodes without infrastructure and interconnected to communicate. MANET works dynamically when a group of nodes moves spontaneously, so the network topology can change quickly and cannot be predicted. It causes changes in wireless network topology according to existing conditions. The node functions in determining the route to be selected. Ad Hoc networks have limited transmission range, so routing is needed to send data over the network. The problem with mobile nodes is that routing must provide a path when the node changes. The speed of a node obtaining information is affected by the routing protocol used in the network. Each routing protocol has different capabilities in network speed, so the discovery routing time for each routing is also different. The selected routing protocols are Ad Hoc On-Demand Distance Vector (AODV), Optimized Link-state (OLSR), and Zone Routing Protocol (ZRP). The study will conduct a comparative analysis of ad hoc network initialization speeds on AODV, OLSR, and ZRP routing protocols. The parameter tested is the speed of routing discovery. After the data is collected, an analysis is carried out by looking at the routing discovery speed of each routing protocol. The test results show that each of the routing protocols examined, the AODV routing protocol, has a faster routing discovery time than the OLSR and ZRP routing protocols.

The access part of all cellular network’s generation suffers from common concerns related to dead spots (zones that are not covered by the network) and hot spots (zones where the number of users is higher compared to network resources). During the last decade, lots of research proposals have tried to overcome cellular problems through multi-hop D2D architecture, which is a new paradigm allowing the direct communication between devices in cellular network to enhance network performances and improve user QoS. In this paper, we propose a multi-hop D2D architecture based on the OLSR protocol to extend cellular coverage. Cell-OLSR, which is the proposed adaptation of OLSR for our architecture, allows the exchange of cellular parameters between nodes to choose the best proxy device to forward data to the cellular base station (BS).

Background and Objective: Random Black Hole (BH) attack significantly degrades MANET’s performance. For strategic applications, the performance parameters like Packet Delivery Ratio, Routing Overheads, etc. are important. The objectives are: (a) To model random BH attack, (b) To propose a routing strategy for the protocol to mitigate random BH attack, (c) To evaluate and compare the network performance of modified protocol with the standard protocol. Methods: The random BH attack is modelled probabilistically. The analysis is carried out by varying Black Hole Attack (BHA) time as Early, Median, Late occurrences and mix of these three categories. The blocking performance is also analysed by varying the percentages of malicious presence in the network. Normal Optimized Link State Routing (OLSR) protocol is used to simulate the MANET performance using a typical medium size network. The protocol has then been modified using Trust- Confidence aware routing strategy, named as TCAOLSR, with a view to combat the degradations due to the random BH attack. Results: The random behavior of Black Hole attack is analyzed with all the possible random parameters, like deployment of mobile nodes, number of malicious nodes and timing instances at which these nodes change their state. From the results of individual type- Early, Median and Late, it is observed that the TCAOLSR protocol gives stable performance for Packet Delivery Ratio (PDR) and Routing Overheads (RO), whereas for OLSR protocol PDR gradually reduces and RO increases. For individual and mix type, Average Energy Consumption (AEC) per node increases marginally for TCAOLSR protocol. For the mix type, PDR for TCAOLSR is 40-60% better whereas RO for TCAOLSR is very less compared to OLSR protocol. The efficacy of the TCAOLSR protocol remains stable for different categories of BH attack with various percentages of malicious nodes compared to OLSR with the same environment. Conclusion: Simulations reveal that the modified protocol TCAOLSR, effectively mitigates the network degradation for Packet Delivery Ratio and Routing Overheads considerably, at the cost of a slight increase in Average Energy Consumption per node of the network. Efficacy of the OLSR and TCAOLSR protocols has also been defined and compared to prove robustness of the TCAOLSR protocol.

In dense traffic unmanned aerial vehicle (UAV) ad-hoc networks, traffic congestion can cause increased delay and packet loss, which limit the performance of the networks; therefore, a traffic balancing strategy is required to control the traffic. In this study, we propose TQNGPSR, a traffic-aware Q-network enhanced geographic routing protocol based on greedy perimeter stateless routing (GPSR), for UAV ad-hoc networks. The protocol enforces a traffic balancing strategy using the congestion information of neighbors, and evaluates the quality of a wireless link by the Q-network algorithm, which is a reinforcement learning algorithm. Based on the evaluation of each wireless link, the protocol makes routing decisions in multiple available choices to reduce delay and decrease packet loss. We simulate the performance of TQNGPSR and compare it with AODV, OLSR, GPSR, and QNGPSR. Simulation results show that TQNGPSR obtains higher packet delivery ratios and lower end-to-end delays than GPSR and QNGPSR. In high node density scenarios, it also outperforms AODV and OLSR in terms of the packet delivery ratio, end-to-end delay, and throughput.

Mobile ad-hoc networks (MANETs) are with no framework and comprises just of equivalent companions. This paper shows exact tests for MANET routing the protocols. The testbed dependent on Linux stage introduced in mobile computers. A few parameters are investigated, for example, development speed and the quantity of jumps which sway on routing execution. The testbed comprises of a few Raspberry Pis (RPis) without the requirement for any central master devices. For making the RPis portable and autonomous of any fixed power attachments, every one of them is controlled by a battery. Then again, for the assessment of the testbed, two directing conventions are picked. The main convention is called BABEL, which considered as a separation vector directing calculation. The other one, the optimized link state routing protocol (OLSR) which considered as proactive steering convention. The utilization case was a multi-jump download of documents with various sizes. The point is to assess how different bounces impact the transfer speed and postponement. The outcomes demonstrate that OLSR performs better with respect to the throughput. However, Babel has less deferral and quicker with respect to convergence.

Now days wireless networks have become popular as the mobile applications are increasing day by day and mobility of nodes has become an important feature. The desirable property which separates mobile network from wireless networks is the mobility of communication devices. Therefore, there is a need to design routing mechanism in such a way that they can easily adopt to the frequent changes in the mobility pattern of the network. In this paper, Optimized Link State Routing protocol has been modified by implementing Q-Learning concept, a reinforcement learning algorithm which guides network to select next node to which it should forward packets by first calculating the reward R and then calculation of Q-value with neighbors. Performance of this modified routing protocol has been evaluated for parameters like delay, throughput and delivery ratio. Two mobility models have been used, Random Waypoint and Walk. It is observed that performance in terms of above parameters improve considerably in both mobility patterns when intelligent Q-Learning algorithm is implemented in Optimized Link State Routing.

A VLAN is a logical connection that allows hosts to be grouped together in the same broadcast domain, so that packets are delivered only to ports that are combined to the same VLAN. We can improve wireless network performance and save bandwidth through the characteristic VLAN network. In addition, the implementation of VLAN greatly improves wireless network security by reducing the number of hosts receiving copies of frames broadcast by switches, thus keeping hosts holding critical data on a separate VLAN. In this paper we compare wireless network with VLAN via wireless network. The proposed network is evaluated within terms of delay and average throughput using web browsing applications and file transfer in heavy traffic. The simulation was carried out using OPNET 14.5 modeler and the results show that the use of VLAN via wireless network improved performance by reducing traffic resulting in a minimized delay time. Furthermore, VLAN implementation reduces network throughput because the traffic received and transmitted has a positive relationship with throughput. Eventually, we investigated the use of adhoc routing protocols such as AODV, DSR, OLSR, TORA and GPR to improve the performance of wireless VLAN networks.

Medical Body Area Networks or MBANs are gaining popularity in healthcare circles because of the convenience they provide to patients and caregivers and assist in chronic disease management. In order to provide prompt and efficient care to the patient, MBANs need to be designed in a way so that stringent QoS requirements are fulfilled. This is essential as MBANs carry vital sign data and any loss or delay in transmission can be fatal and life-threatening. Current research focus is to develop mechanisms and protocols that are focused to reduce delays, conserve energy and improve QoS parameters such as Reliability. An important aspect of MBANs is to give special attention to emergency traffic which is carried when a serious event is triggered such as heartbeat going above threshold or ECG status showing cardiac issues. Thus, the provision of QoS is a challenging task and must be addressed at various layers of the network. There are various techniques to cater to QoS requirements and one way of improving QoS is to reduce the packet loss so that transmission is reliable which is necessary for life-saving data. Research contributions have addressed this mostly at the MAC layer/network layer and through queuing techniques. However, none of these mechanisms do not consider the wireless channel dynamics and the impact of MAC layer and physical layer parameters together while focusing on Emergency data handling within an Intra-WBAN. In this paper, we have proposed a QoS aware Cross layered solution based on IEEE 802.15.6 that is adaptive, Relay based, multi metric and changes the routing scheme based on traffic type. We have selected AODV protocol over OLSR, DSR and other protocols because of its design simplicity. In this paper, we have reviewed the existing literature on WBAN Reliability enhancements’ techniques followed by a review of QoS aware enhancements for AODV. Our proposed protocol is designed and simulated for Intra-WBAN communication and is efficient in terms of end-to-end reliability.

Recent research in communication moves towards cyber space with modern applications such as multimedia surveillance, smart autonomous traffic control, advanced health care monitoring, industrial automation, and continuous remote environmental and structural monitoring. Such applications are extensively generates multimedia information and converse through Wireless Multimedia Sensor Networks (WMSNs). Path selection plays vital role in transmitting the multimedia data over wireless networks. Single path selection incurs routing failure due to the energy hole because of power shortage and traffic congestion. Due to energy hole in any particular node the packet gets dropped in the route from source to destination. The multipath routing algorithm selects more than one path to increase the rate of the packet delivery than the single path routing. The prediction of energy deficiency in sensor nodes is becoming over head in WSMNs. In order to improve the packet delivery and performance of the network, in this paper a Priority Based Multipath Routing Algorithm (PBMRA) is proposed. It consists of three modules: The Neighbourhood Selection identifies the neighbours; Multipath Construction constructs multiple paths from the indentified neighbours; and Priority Selection selects the high energized routes based on the priority of node attributes such as liveliness, path delay and hop count. The proposed algorithm is experimentally compared with other existing algorithms such as AODV, DSR, DSDV and OLSR. The experimental results show that the PBMRA algorithm increases the overall throughput, packet received rate and provides the reliable route than existing algorithms.

To improve SIP signal execution in MANET, routing parameters must be powerfully balanced through SIP methods dependent on a set equal for execution improvement measurements to help the SIP signal framework. In this manner, the presentation of the Optimal Link State Routing Protocol (OLSR) is to be additionally improved. In MANET, vitality is a key anxiety for secure communication, making it conceivable to avoid enemies or childish hubs since the system. In term of this paper, the projected secure as well as QoS based energy aware multipath routing in MANET. In support of multipath path collection, we have provided the Optimal Link State Routing Protocol (OLSR) algorithm. Energy efficient multipath routes are designated on the system using this method. Afterward a quantity of transactions, a route may misplace its connection quality. Hence the optimal path is selected to the paths installed on the system utilizing the Spider Monkey Optimization (SMO) algorithm. At last the presentation measurements of our planned SMO-OLSR task are contrasted and the current OLSR. SMOOLSR used for hybrid wireless network for efficient communication. The reproduction results demonstrate that the presentation of our planned work, the packet delivery rate, the delay, and the packet fallout are improved over the existing work. This planned methodology is actualized on the foundation of NS2.

Objectives: To propose a group-based QoS aware proactive multipath routing based on OLSR protocol. Methodology: This work proposes a group-based proactive multipath routing based on the OLSR protocol, which is designed to be adaptive for a big crowded Mobile Ad-hoc Network to satisfy the desire for real-time multimedia applications. This approach will restrict mobile nodes to be participated in the cluster head selection process based on the mobility and energy of a node. It uses a grouping strategy to manage the network topology and performing route maintenance, and preserve multiple prioritized routes with the support of Quality of Service (QoS) aware computation. Findings: The study evaluated the performance of the proposed group-based QoS aware multipath Optimal Link State Routing (GMP-OLSR) routing through the OMNET++ network simulation environment. Within different network density, the proposed approach offered a significant reduction in end to end delay, overhead and an increment in data packet delivery ratio Applications: Using an appropriate groupbased QoS aware multipath routing strategy for mobile ad hoc networks provides better performance and improves the services of mobile applications. Keywords: MANET, GMP-OLSR, Clustering, Multipath Routing, QoS Aware Routing.

Wireless Mesh Networks (WMNs) is one of the encouraging technologies for future-generation wireless network with diverse applications as it is undergoing rapid progress. WMNs are multi-hop networks which are beneficial in situations where there is little or no network infrastructure. WMNs consist of mesh nodes which interact with each other to establish a network connection. Mesh nodes include mesh clients and mesh routers. Mesh clients can be stationary or move from one place to another, whereas mesh routers have minimum movability and act as a backbone for WMNs. Due to the mobility of mesh nodes, the fundamental problem in WMNs is estimating the link quality. The efficiency of network protocols depends on the accuracy of link quality. Therefore, there is a need for an intelligent mechanism to find solutions to link quality problems in the wireless network. To address this problem, we apply machine learning prediction techniques. We evaluate the performance of prediction techniques like multiple linear regression, support vector regression and Gaussian regression. The experiments were conducted on various scenarios with cross-layer routing metric PCL-IDA to predict the link quality, which is embedded in OLSR routing protocol. Results using NS-2 simulations reveal that the link quality parameters throughput, average delay and packet loss are better when multiple linear regression prediction technique is applied.

The existing network infrastructure may not work well in a disaster environment caused by a fire or an earthquake. Instead of relying on the existing infrastructure, communicating through a mobile ad hoc network (MANET) is recommended because MANET can configure a network without an infrastructured communication system. In addition, firefighters conducting emergency activities in harsh environments surrounded by flames and smoke need a communication system to assist their rapid firefighting operations. Existing work is not suitable for indoor firefighter communications because they did not consider the indoor disaster environment well. In this proposed scheme, dual channels (i.e., 2.4 GHz and sub-GHz bands) are used for an efficient routing table configuration. Data frame and HELLO message are exchanged through the 2.4 GHz band, while the neighbor list of each node is exchanged through the sub-GHz band. Each node can configure the routing table based on the exchanged neighbor list. A performance evaluation is conducted to compare the proposed technique with enhanced versions of optimized link state routing (OLSR) and destination-sequenced distance vector routing (DSDV). The results show that the proposed scheme outperforms the other two MANET routing algorithms (i.e., OLSR-mod and DSDV-mod) in terms of the packet delivery ratio (PDR), end-to-end delay, and initial routing table configuration time approximately 27.8%, 4.7%, and 166.7%, respectively.

We present an effective routing solution for the backbone of hierarchical MANETs. Our solution leverages the storage and retrieval mechanisms of a Distributed Hash Table (DHT) common to many (structured) P2P overlays. The DHT provides routing information in a decentralized fashion, while supporting different forms of node and network mobility. We split a flat network into clusters, each having a gateway who participates in a DHT overlay. These gateways interconnect the clusters in a backbone network. Two routing approaches for the backbone are explored: flooding and a new solution exploiting the storage and retrieval capabilities of a P2P overlay based on a DHT. We implement both approaches in a network simulator and thoroughly evaluate the performance of the proposed scheme using a range of static and mobile scenarios. We also compare our solution against flooding. The simulation results show that our solution, even in the presence of mobility, achieved well above 90% success rates and maintained very low and constant round trip times, unlike the flooding approach. In fact, the performance of the proposed inter-cluster routing solution, in many cases, is comparable to the performance of the intra-cluster routing case. The advantage of our proposed approach compared to flooding increases as the number of clusters increases, demonstrating the superior scalability of our proposed approach.

Software Defined Networking (SDN) has been seen as a revolutionary and exciting network technology that aims to enable control and network management of various network types, whether wired or wireless. Nevertheless, SDN research focuses very little on wireless communication and, more specifically, on Wireless Mesh Networks (WMNs). Moreover, the issue of routing is vitally important in WMNs, but the legacy and traditional routing protocols cannot make the most of multiple paths between the source node and destination node due to the complexity and cost of the network. In this paper, we present SDNMesh, an SDN based routing architecture for WMNs. We combine SDN with WMN to allow mesh networks to meet current user requirements with several resources, coverage, and scalable high bandwidth capability. Apart from the mentioned capability, SDN's unified approach leads to better network capacity management. Experiments have been carried out using the Mininet-WiFi simulation tool to create a network environment that allows integration of the two networking paradigms, centralized, and decentralized. Simulation results show that our SDNMesh routing solution performs better in terms of network performance metric throughput, packet loss ratio, and delay while comparing with traditional routing approaches such as OLSR, BATMAN, and an SDN based Three-Stage routing protocols. Moreover, experimental results show that SDNMesh gives better results in terms of the mentioned performance metrics.

The trust-based routing mechanisms are proposed to enhance the security of the mobile ad hoc network (MANET), which use the performance metrics of a node to evaluate the trust value of the node. However, some performance metrics are fuzzy, which are easier to be described qualitatively than to be expressed quantitatively. Therefore, the inability to quantitatively express these performance metrics leads to the inaccuracy in the calculation of the trust values of nodes. Meanwhile, some routing mechanisms add the path with the highest credibility to routing table without considering the hop counts of the route in route selection, which reduces quality of service (QoS) of the routing. Aiming at the above problems, firstly, we use cloud model to deal with the fuzziness of performance metrics. Specifically, a trust reasoning model based on cloud model and fuzzy Petri net (FPN) is presented to evaluate the credibility of nodes. Then we propose a routing algorithm based on trust entropy. Routes with the minimum trust entropy are selected to add to routing table. This routing algorithm can reflect the comprehensive effect of route hops and the trust values of nodes on routing selection, thus improving QoS in MANET. Finally, the TUE-OLSR protocol is established based on the trust entropy routing algorithm and the optimized link state routing (OLSR) protocol. What’s more, the effectiveness of TUE-OLSR protocol is verified by simulation experiments, which illustrate that TUE-OLSR protocol performs better than existing trust-based OLSR protocols in terms of packet delivery ratio and average latency.

The design of routing protocol is an important and key problem in unmanned aerial vehicle (UAV) communication networks. In low altitude environment, UAV information transmission is a complex task. It is an important scientific challenge to design a routing protocol that can provide efficient and reliable node to node packet transmission. This paper develops a more realistic simulation environment based on OPNET 14.5, and performs performance tests and comparisons on four classic routing protocols: Ad Hoc on demand distance vector (AODV), dynamic source routing (DSR), optimized link state routing (OLSR), and geographic routing protocol (GRP). The performance parameters such as network delay, traffic received, data dropped and throughput are compared and analyzed. The experimental results indicate that different routing protocols can be adapted to different UAV communication network scenarios. Therefore, the quantitative results can provide pertinent reference for choosing the best routing protocol in different scenarios.

The contribution of this paper is two fold. It first analyses the flooding strategies for the Wireless Multihop Networks (WMNs) then it enhances the reactive and proactive routing protocols. For analysis purpose, we select four widely used flooding techniques for routing: i. traditional flooding, ii. Time-To-Live based Expanding Ring Search (TTL-based ERS) flooding scheme, iii. TTL-based Scope Routing (SR) flooding and iv. Multi-Point Relays (MPR) flooding. These techniques play a vital role and act as a backbone for routing protocols. Therefore, we compare efficiency of these techniques for six widely used routing protocols: Ad-hoc On-demand Distance Vector (AODV), Destination Sequenced Distance Vector (DSDV), Dynamic Source Routing (DSR), DYnamic MANET On-demand (DYMO), Fish-eye Scope Routing (FSR) and Optimized Link State Routing (OLSR). DSDV uses traditional flooding, AODV, DSR and DYMO use TTL-based ERS flooding, FSR uses TTL-based SR flooding and OLSR uses MPR flooding. This paper also presents mathematical models for flooding techniques and studies the affects of these techniques on their respective protocols in terms of energy and time consumption. This is done to measure the cost incurred by the routing protocols in the form of routing overhead and latencies. A novel contribution of this work is the enhancement in search set values and intervals of routing algorithms to improve the efficiency of selected existing protocols. A detailed comparison analysis of selected protocols with their default and enhanced routing algorithms in NS-2 is also a part of this work.

Vehicular ad hoc networks (VANETs) are a special type of wireless ad hoc network that requires highly scalable routing strategies to establishing reliable end-to-end communication. Because of the high dynamic of VANETs, the mobility of vehicle nodes increases the control traffic overhead. Accordingly, establishing reliable end-to-end communication paths depends entirely on the routing mechanism and the type of nodes mobility information. In this paper, we propose a new improvement to the mechanism of the Optimized Link State Routing Protocol(OLSR) protocol, named Cluster-based Adept Cooperative Algorithm (CACA), where each vehicle estimate a reliable low-overhead path using the cluster-based QoS algorithm. The CACA algorithm is introduced to improve the ability of the MPR scheme for maintaining long-lived routes. Moreover, the network scalability is enhanced by adaptively selecting most sustainable paths based on a signal strength beacon and the mobility degree of a node, which reduces significantly minimizes the size of control messages overhead as well the routing tables recalculation process. Simulation experiments using the network simulator are presented to demonstrate the effectiveness of our solution. The results show that the proposed algorithm can improve network performance effectively relative to other algorithms.

The main idea behind the routing protocols based on multi-hop is to find the required path from the source node to the destination. Since those protocols do not consider the node mobility in their mechanism, we propose to enhance the routing protocols benefiting from localization node and predict the time needed for neighbors to go out of range for a node to increase the robustness of the protocols with the mobility. Firstly, we propose an efficient scheme to predict the time needed for the node to quite the neighbor range. Secondly, we conduct a set of simulations to compare the performance of our proposal against OLSR standard.

Incompletely predictable vehicular ad hoc networks is a type of networks where vehicles move in a certain range or just in a particular tendency, which is very similar to some circumstances in reality. However, how to route in such type of networks more efficiently according to the node motion characteristics and related historical big data is still an open issue. In this paper, we propose a novel routing protocol named trustworthiness evaluation-based routing protocol (TERP). In our protocol, trustworthiness of each individual is calculated by the cloud depending on the attribute parameters uploaded by the corresponding vehicle. In addition, according to the trustworthiness provided by the cloud, vehicles in the network choose reliable forward nodes and complete the entire route. The analysis shows that our protocol can effectively improve the fairness of the trustworthiness judgement. In the simulation, our protocol has a good performance in terms of the packet delivery ratio, normalized routing overhead and average end-to-end delay.