Ad-hoc Routing Research Articles

Friendly ad hoc routing in cloud scenario using CH selection and transmission head to enrich the security mechanism

The approach of innovation has led the expanded enthusiasm for oneself arranging Ad-hoc Networks. Amongst the various constraints that relates to mobile infrastructure-less networking condition with reduced storage utility as the power storage facilities, influence utilization and vitality advancement stays a very significant issue. In our proposed the self formation nodes in the cloud scenario has been channelized properly through the cluster head (CH) and transmission head (TH) selection. Moreover the proposed technique Friendly Ad-hoc Routing in Cloud Scenario (FARICS) is introduced to enrich the security features of Mobile Ad hoc Network (MANET) architecture. The malicious nodes were found out sincerely through various traffic tables to enrich the security of the MANET. The first preliminary approach of the nodes combination will be vary from cluster to cluster. The CH, TH combination from one cluster to another cluster will be varied according to the sense of the node. The cluster may be a cloud form of organisation to represent the mobile ad hoc nodes. The unique identity of each node were monitored and mapped through the traffic table and the connectivity of the nodes will be strengthening. The simulation will be done with SAODV, SZRP and DMR protocols to get a successful result.

A Preliminary Study of Routing Protocols in a Tactical Data Link Ad Hoc Network in Colombian Maritime Scenario

Tactical Data Link (TDL) systems are a kind of Mobile Ad Hoc NETwork (MANET) used in diverse maritime operational environments such as natural disasters, surveillance, maritime search, and rescue. A TDL network is usually composed of nodes or units representing surface ships, submarines, and aircrafts able to participate in maritime operations. A routing protocol is required to establish communication between nodes, which guarantees the route from the source node to the destination node. A TDL has been developed in the Colombian Caribbean Sea (CTDL). However, no efficient routing protocol has been implemented. This works to perform a preliminary study to implement an appropriate routing protocol for the CTDL. Local environment constraints, in addition to the chosen protocols' performance analysis, will provide preliminary alternatives for a routing protocol with acceptable efficiency. This article provides a background of ad-hoc networks routing protocols, a description of the Colombian Caribbean maritime operational environment, a comparative analysis of routing protocols, and a discussion of conclusions and future developments regarding CTDL.

Performance Evaluation and Enhancement of VLAN via Wireless Networks using OPNET Modeler

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.

RoPE: An Architecture for Adaptive Data-Driven Routing Prediction at the Edge

The demand of low latency applications has fostered interest in edge computing, a recent paradigm in which data is processed locally, at the edge of the network. The challenge of delivering services with low-latency and high bandwidth requirements has seen the flourishing of Software-Defined Networking (SDN) solutions that utilize ad-hoc data-driven statistical learning solutions to dynamically steer edge computing resources. In this paper, we propose RoPE, an architecture that adapts the routing strategy of the underlying edge network based on future available bandwidth. The bandwidth prediction method is a policy that we adjust dynamically based on the required time-to-solution and on the available data. An SDN controller keeps track of past link loads and takes a new route if the current path is predicted to be congested. We tested RoPE on different use case applications comparing different well-known prediction policies. Our evaluation results demonstrate that our adaptive solution outperforms other ad-hoc routing solutions and edge-based applications, in turn, benefit from adaptive routing, as long as the prediction is accurate and easy to obtain.

Fuzzy based Combined Trust Scheme for Secure Routing in MANET (FCTRS)

Mobile Ad Hoc network (MANET) is a self-configuring network consisting of mobile nodes without any fixed infrastructure. However due to the nodes has not any fixed infrastructure in MANET, it is susceptible to various security attacks like data modification, information sniff, due to low energy, computing ability and bandwidth. In MANET Black hole is also an attack and it is difficult to detect and prevent. The lack of quality in security aspects of ad-hoc routing protocols won’t provide reliability in the data packets movement between source and destination nodes. Implementing the routing decision with trust is an important one in the MANNET security. Hence, this research work propose an enhanced Fuzzy based combined trust scheme (FCTRS) based on public trust and Quality of Service (QoS) trust to detect black hole attack. It provides secure routing based on certificate authority (CA) to improve the performance of Ad-hoc On-demand Distance Vector (AODV). The results will show the performance improvement of proposed protocol over Enhanced Trusted Routing Scheme with Pattern Discovery (ETRS-PD) and the protocol AODV. The metrics in the performance of network examined with different conditions of mobility and the presence of black hole node positions.

EPLAODV: Energy Priority and Link Aware Ad-hoc On-demand Distance Vector Routing Protocol for Post-disaster Communication Networks

In Mobile Ad-hoc Networks (MANETs) the major issue between nodes for data transfer is link quality. The majority of the MANET routing protocols try to maintain the link quality between nodes but still need improvement. This paper focuses on link quality between nodes in an ad hoc network in emergency scenarios through the design of the Energy Priority and Link Aware Ad-hoc On Demand Distance Vector (EPLAODV) routing protocol. EPLAODV improves the link quality between nodes through SNR. For performance analysis, the NS2.35 network simulator was used. Simulation time and traffic load were the major simulation parameters. From the simulation results, it is observed that EPLAODV performs better than AODV.

Design of Secure and Stable Routing Protocols for the Adhoc Networks

The desire to remain connected no matter where you are, when you want to be connected, or how you want to be connected has been a driving force behind the development of wireless networks, in particular in the field of persistent and ubiquitous computing. This need can be satisfied in a number of different ways. The Mobile Ad-hoc networks made up of a collection of nodes, each of which is equipped with wireless networking and communication capabilities. There may be any number of these nodes. It is not necessary to involve a central administrator in order for these nodes to communicate with one another since they may do so independently. Ad hoc networks also often referred to as infrastructure-less networks since they do not have a present topology or infrastructure. This is because ad hoc networks do not have a predetermined topology or infrastructure. Because each node in the wireless ad-hoc network functions as either a host or a router or both, In order to prevent unauthorized parties from accessing the data, it is essential to have developed secure and reliable routing protocols. The work that is presented in this proposed work is an attempt to develop an ad-hoc routing protocol that is safe and robust. The protocol in question called Energy Efficient Wireless Path Optimization (EEWPO). The dynamic route selection mechanism, which is based upon genetic programming, and the connection integrity assurance algorithm have been combined within the framework of the proposed model routing scheme for wireless ad-hoc networks to produce a routing-based mechanism that is secure, flexible, and robust. This is accomplished by combining the two mechanisms within the framework of the proposed model routing scheme. These two aspects are going to work together to form the foundation of this plan. The new combination has the ability to give a higher degree of security to the current network, hence reducing the likelihood that vulnerabilities in connection and fake route injections would be exploited. When it comes to speech-based ad-hoc networks, which need dedicated connections for the exchange of voice data over an ad-hoc channel, intelligent route selection throughout the multipath network becomes very important. This is because the transmission of speech data is essential to the functioning of these networks. In order to materialize the robust ad-hoc routing algorithm, the generation of the adaptive ad-hoc network routing solution requires the ideally layered combination of the genetic programming-based routing solution along with the connection integrity assurance model. Only then can the adaptive ad-hoc network routing solution be created. The effectiveness of the recommended routing protocol has been shown via testing in a number of different simulated situations.

An effective performance of dynamic and ad-hoc on-demand routing protocols for mobile ad-hoc networks under NS environment

Mobile ad hoc network (MANET) is a popular emerging wireless network and plays vital role to maintain the routing demands in wireless network. AODV and DYMO are on-demand routing protocols that was designed to meet various needs of MANET such as security, mobility, flexibility etc. IETF listed on-demand routing protocols in a varying speed of nodes, mobility, and performance metrics. In this paper, we discussed behaviour of the two main on-demand routing protocols in network simulation environment, while sending packets from source to destination under free space and two ray propagation models by varying packet rate. We analysed the performance metrics of MANET in the following heading; average jitter, average end-to-end delay, packet delivery ratio, and throughput are compared with percentage of nodes packet drops.

Enhancing multipath routing using an efficient multicriteria sorting technique

Saving energy in MANET represents a critical issue due to its material architecture. This paper aims to improve ad-hoc on-demand multipath distance vector routing (AOMDV) using multicriteria analysis method. In order to construct effective disjoints paths, our approach focuses on sorting the different available paths considering several important criteria. Our objective is improving the network performances and routing stability using an efficient multicriteria method called Electre Tri. The use of this technique enhances data reach ability and minimises the required delay during packets forwarding. The proposed approach is evaluated comparatively to well known routing protocols considering various metrics. Simulation results prove that our approach improves significantly the network lifetime and the transmission delay.

Time-Dependent Ad-Hoc Routing Structure for Delivering Delay-Sensitive Data Using UAVs

In disaster scenarios where communication networks have broken down, it is important to ensure a reliable data delivery from an emergency operations center to the local target nodes within its effective time limit. We propose a hybrid data delivery mechanism that exploits the load-carry-and-delivery by UAVs with a mixture of localized ad-hoc routing over partially connected terrestrial networks. We aim to achieve reliable on-time data delivery to the target nodes, while preserving the low routing cost. Our proposed routing methodology consists of three steps: 1) localized network construction, 2) network probing by UAVs, and 3) localized ad-hoc routing based on a dynamic depth routing tree depending on the data urgency. Here, we present an innovative cost-effective local data sharing structure called localized minimal routing tree that balances with the direct data delivery by UAVs. After the initial network setup and probing procedure, each UAV makes a series of near-optimal decisions of which grid points to visit considering its localized network topology and data urgency. Our time-dependent routing mechanism dynamically decides data recipient nodes to serve more urgent data delivery with a higher priority at a time. The simulation experiments validated our combined path planning and routing approach, achieving 71% higher reliability than the best possible performance by using only the network nodes and consuming 20% lower energy than the UAV-only approach, while maintaining high reliability. Thus, our work makes a strong case for systematically combining the two approaches.

Impact of energy holes problem on ad-hoc routing protocols

In the sensor networks, traffic flow usually follows many-to-one pattern and thus results in some nodes carrying more load than other nodes in the network. This may results in the conception of energy holes near the sink. Different protocols exhibits different behaviour in the occurrence of energy holes problem. This work analyses and compares the impact of energy holes on the lifespan and performance of different ad-hoc routing protocols.

Impact of energy holes problem on ad-hoc routing protocols

Impact of energy holes problem on ad-hoc routing protocols

Self Configuring Wireless Sensor Network for Precision Irrigation

Precision Irrigation is a farm management strategy used to increase the water efficiency of a farm in which the right amount of water is fed to the soil at right time by sensing the real time soil conditions in the field. Wireless Sensor Network (WSN) Technology is widely used in farms to measure soil conditions at various locations of the farm and use the data for making decisions in the areas to be irrigated with the right amount of water. This project presents the design and development of a self organizing and fault tolerant ad-hoc multi-hop WSN for precision irrigation using low cost commercially available electronic components. This includes the design and development of hardware units for Sensor Nodes to be deployed in the field for the measurement of soil humidity and a centralized Base Station to collect the information from the nodes and make decisions on irrigating. A reliable multi-hop WSN system with ad-hoc routing algorithm for prolonged lifetime and fault tolerance has been developed and demonstrated using field trials and lab level simulations. The project also developed a user interface to monitor and archive the data acquired through the network.

Reliable Transmission in Wireless Sensor Networks using Greedy Perimeter Stateless Routing Scales Method

The wireless networks are made up of numerous numbers of wireless stations. The communication between these wireless stations requires traveling multiple hops to exchange information. The Wireless mobile network plays important roles in various sensing applications. This research paper planned to develop real time, trivial clarification method for transmitting in a wireless mobile sensor network. The proposed method works grounded on the routers positions and destination address of the packets to transfer packets, whereas the existing greedy forwarding decisions methods use information about the neighbor routers in the network topology. If a particular packet or an information reaches a destination region, the greedy forwarding is not worth to recover packets, since it search the packets the small perimeter of the region. When the number of destination node increases the proposed methods works better to scales router state when compared to existing shortest-path and ad-hoc routing protocols. In real time there will be frequent changes in network topology the proposed method will use local topology information to discover the shortest paths quickly. The experimental results shows that the proposed greedy perimeter stateless routing scales method provide high reliability and scalability than other methods in the large scale networks.

Comparative Analysis of Routing Algorithms in SUMO for VANET

Automobiles are increasing world widely with such a rapid speed that wreak the various dangers to human lives like traffic jam, road accidents etc. To recover from these hazards various types of smart technologies have introduced. VANET is one of renowned step which help at great extent to deploy intelligent transportation system. In VANET the vehicle acts as node that communicates with other neighboring nodes. Therefore message dissemination between the vehicles must be done efficiently and authentic mobility model play a very important role in developing the routing mechanism and to evaluate their performance. This paper shows the comparative analysis of the various vehicular ad-hoc routing protocols and analyze the result under the different parameters using SUMO (Simulation of urban mobility) and MATLAB.

Evaluation of Ad-Hoc Routing Protocols in a Vehicular Traffic Environment using SUMO and NS2

Evaluation of Ad-Hoc Routing Protocols in a Vehicular Traffic Environment using SUMO and NS2

Adaptive Load Balancing Ad Hoc Routing Scheme Inspired by True Slime Mold

Engineering neo-biomimetics, i.e. imitation models based on body structures and behavior of living organisms, relied upon to solve complex problems, have been studied in various fields. In distributed networks, such as ad-hoc networks and wireless sensor networks, the behavior of a variety of true slime molds which are capable of constructing multipath flow networks based on the amount of body, has been studied. Ad hoc networks only consist of mobile terminals (nodes) that can relay packets along an established route. However, link relations and the available bandwidth of the nodes change dynamically due to the mobility of nodes. In addition, the speed of communication between nodes also varies due to node positions and their communication-related quality. Thus, practical use of ad-hoc networks still remains an issue, because it is difficult to establish stable routes under such environments. This study aims to propose an adaptive load balancing routing technique that adaptively diversifies the transmission paths based on the available bandwidth, residual battery life, and the data transmission volume, by applying a mathematical model of slime mold routing, known as the physarum solver. We confirm the effectiveness of its adaptive behavior in dynamic environments using computer simulations.

A routing algorithm for inspecting grid transmission system using suspended robot: Enhancing cost-effective and energy efficient infrastructure maintenance

The inspection of transmission line using suspended based robots has drawn great attention from many utility companies. Such an emerging smart technology has the advantages of energy efficiency, cost effectiveness, safety, non-service interruption, and the potential of substituting for the traditional inspection method using linemen with the help of helicopter. In this paper, we propose a routing algorithm to identify locations where the ground control station needs to be deployed when using suspended robot in transmission line inspection. The motion and location between the suspended robot and the ground team are coordinated. The bidirectional data transmission between two sides can be guaranteed so that the live signal can be received and processed, robot motion can be controlled, large size obstacles can be appropriately cleared, and health condition of the transmission line can be captured. A case study based on a segment of the transmission line in the state of Missouri of the United States is implemented to validate the effectiveness of the proposed routing algorithm. Results of the case study illustrate that the performance from both economic and environmental aspects can be significantly improved compared to the traditional inspection mode employing helicopter and linemen as well as an ad-hoc routing algorithm currently used by some utility companies to guide the suspended robot in transmission line inspection. Specifically, compared to the ad-hoc routing algorithm and helicopter with photoelectric stabilized pod, the proposed algorithm can reduce the unit cost by 7.55% and 8.04%; and cut the unit emission by 21% and 98%, respectively.

Optimizing the network edge for flexible service provisioning

The virtualization of network resources provides unique flexibility in service provisioning in most levels of the network stack. Softwarization of the network control and operation (SDN) is a key enabler of that development. Starting from the network core, SDN is a dominant trend in the evolution of network architectures with increased emphasis recently on the network edge. I will present some recent results in this area starting with a study on migration from legacy networking to SDN enabled network modules. The tradeoff between the benefits of SDN upgrades and the cost of deployment is addressed and captured by an appropriate sub-modular function that allows to optimize the penetration pace of the technology. Validation on some real world network topologies and traffic matrices will be presented as well. Then we move our attention to the network periphery. A wireless multi-hop extension at the network edge is considered and the problem of enabling SDN is addressed via replication of SDN controllers. The delay constraints of the controlled data-path elements is appropriately modeled and the problem of locating the controllers is addressed via optimization and a proof-of concept implementation. An alternate approach is considered then for the wireless network where we assume coexistence of SDN enabled components with network islands operating under distributed adhoc routing protocols. The trade-off of the coexistence is studied and the impact of SDN penetration is evaluated. Some paradigms of collaborative network services are presented finally as they are enabled by the above architectural evolution.

PERFORMANCE ANALYSIS OF AODV IN PRESENCE OF MALICIOUS NODE

Un-wired Computers (Mobile Computers) such as Laptops, Net-books, Notebooks and Personal Digital Assistants (PDAs) are the fastest growing segments of Computing Industry; this changing aspect of computing has led to the invention of Mobile Ad-Hoc Networks (MANET). Mobile Ad Hoc networking is a new era of infrastructure less communication networks for mobile devices (hosts, nodes etc.), where mobile nodes that are in radio range for each other can directly communicate with each other when in range and can even use intermediate nodes as routers when are moving away or are getting out of range from the connected nodes, this property along with the ability of switching from one network topology to another help in improving node mobility. Due to this mobility factor and undefined infrastructure security is a major concern in mobile Ad Hoc networks. In this paper we are providing a detailed analysis of the performance of ad-hoc routing protocol AODV in Mobile Ad Hoc networks with and without the presence of malicious node. We have used Qualnet version 5.0 (simulator) to measure the effect of attack on mobile ad-hoc networks that gives a clear picture for the throughput, variations in CBR, packet delivery delay, average jitter and end-to-end delay in mobile ad-hoc networks when attack effects the mobile ad-hoc network.