Routing In Ad Hoc Networks Research Articles

A Game Theory Based Clustering Protocol to Support Multicast Routing in Cognitive Radio Mobile Ad Hoc Networks

The frequent movement of nodes in cognitive radio mobile ad hoc networks (CRAHNs) causes challenges in scalability, stability, channel sensing and channel access problems that can be solved by using clustering technique. Game theory is a feasible approach to solve such problems by casting clustering problems as distributed optimization problems. The main contributions of this article are as follows. Firstly, we propose a minimum connected weighted inner edge spanning tree (MWIEST) game to find an approximate solution of a MWIEST problem in CRAHNs. In this game, a link-weight function of each link is designed based on a combination of link-stability and link-connectivity ratio functions. Secondly, we prove that the MWIEST game is an exact potential game that exists at least one Nash equilibrium ( NE ) point which is an approximate solution of the MWIEST problem. Besides, we also prove that best responses ( BR s) of the game converge to a NE in finite iterations. Thirdly, based on the MWIEST game, we propose four algorithms including the node information exchange (NIE), the best response selection (BRS), the intermediate nodes selection (INS) and the forming cluster (FC). Specifically, the algorithms NIE, BRS and INS provide a set of intermediate nodes (SetIN) which supports the FC algorithm to form clusters. Finally, we propose the game theory based clustering (GBC) protocol which is combination of the FC algorithm and the proposed cluster maintenance algorithm to construct high stable clusters supporting multicast routing in CRAHNs. Moreover, each obtained cluster includes most members having the same receiving channel which avoids the affected regions of licensed channels. For the performance evaluation, we implement the GBC protocol in OMNET++ platform to demonstrate its performance improvement over the state-of-the-art protocols in terms of network stability and control overheads.

An efficient load balanced stable multi-path routing for mobile ad-hoc network

This research aims to identify stable neighbors in a mobile ad-hoc network to create a stable multi-path route for different mobility patterns. The other issue, this article deals with to schedule the data packets over those multiple paths to balance the loads across the paths and transmit the whole packets in minimum transmission time. The stable neighbors are chosen through a recurrent neural network which uses the previous neighborhood information as an input and predicts whether a node will be a neighbor in the next instance or not. We also framed a methodology to distribute the data packets across multiple paths based on their path length from source to destination. A simulation of the network model with two mobility models, Random way point and Gauss Markov mobility, shows that the accuracy of the recurrent neural-based stable node prediction is around 95%. The analytical, as well as a simulation, model shows that our proposed algorithm takes comparatively lesser time to transmit the same number of packets from a source to a destination due to better scheduling across multiple paths. Simulation results also demonstrate that compared to other similar multi-path routing protocols, our proposed algorithm yields a higher packet-delivery ratio and lower route recovery time also.

QoS-based routing for free space optical mobile ad hoc networks

Quality of Service - QoS provisioning during routing in Mobile Ad-Hoc Networks has been an exigent task for researchers since long. The challenges like node mobility, route maintenance during topology changes and link characteristics become more sophisticated if the scenario requires maintaining clear Line of Sight (LOS) between the transmitter and receiver. Similar is the case of a Free Space Optical Mobile Ad Hoc network (FSO MANET), which was originally designed for military applications and Delay Tolerant Networks. Routing for successful delivery of data and efficient utilisation of network bandwidth remains a challenging issue till date in such networks. A routing protocol should take care of directional nature of transmission and LOS requirement in a transceiver pair in FSO MANET. In this work the traditional routing protocol Ad Hoc On-Demand Distance Vector-AODV is implemented in an FSO MANET to satisfy the QoS requirement-bandwidth. The results showed an improvement in throughput if bandwidth is pre-specified as QoS parameter. The performance is evaluated by varying node speeds and varying the number of nodes in the network.

QoS-based routing for free space optical mobile ad hoc networks

Quality of Service - QoS provisioning during routing in Mobile Ad-Hoc Networks has been an exigent task for researchers since long. The challenges like node mobility, route maintenance during topology changes and link characteristics become more sophisticated if the scenario requires maintaining clear Line of Sight (LOS) between the transmitter and receiver. Similar is the case of a Free Space Optical Mobile Ad Hoc network (FSO MANET), which was originally designed for military applications and Delay Tolerant Networks. Routing for successful delivery of data and efficient utilisation of network bandwidth remains a challenging issue till date in such networks. A routing protocol should take care of directional nature of transmission and LOS requirement in a transceiver pair in FSO MANET. In this work the traditional routing protocol Ad Hoc On-Demand Distance Vector-AODV is implemented in an FSO MANET to satisfy the QoS requirement-bandwidth. The results showed an improvement in throughput if bandwidth is pre-specified as QoS parameter. The performance is evaluated by varying node speeds and varying the number of nodes in the network.

A Novel Broadcast Network Design for Routing in Mobile Ad-Hoc Network

MANET is an infrastructure-less, fixed topology less, multi-hop and bandwidth constraint wireless network. In MANET optimized control message broadcasting through an efficient routing can results in bandwidth utilization and efficient data transmission with minimum numbers of hops. An efficient routing technique using a broadcast network, designed by existing minimum cost spanning tree (MCST) is also unable to provide all-nodes-to-all shortest route and also have issues about data transmission efficiency. In this article, our broadcast network design approaches can provide a solution for optimized control message broadcast and data transmission efficiency by considering Kruskalś MCST based broadcast network as a base network. Initially, we consider high-frequency links (HF-Link) to be added in the base network by considering the Dijkstra algorithm. Secondly, the broadcast network is designed by including those links with the neighbors who have at least a fixed number of neighbors (CF-Link) and finally, only those links are added with the base network which gives a shorter path to all other nodes (ST-Link) in the network. Using Omnet++ we have compared individual broadcast network design with the base network and observe that a slight increment in control overhead in existing based techniques could increase data efficiency significantly through a given suboptimal path.

Destination Based Stable Clustering Algorithm and Routing for VANET

Now in modern telecommunication, one of the big topic research is a Vehicle Ad-hoc Network “VANET” (V2V). This topic is one of an “issues of the day” because research has problematic topic due to its many application-questions, what we need to solve: avoid collisions, any accidents on a way, and notifications about congestions on the road, available car parking, road-side commercial-business ads, and etcetera. These like application forms creating big delay constraining’s i.e. the instant data should reach the destination within certain time limits. Therefore, we need a really efficient stable clustering method and routing in vehicle ad-hoc network which will be resistant to network delays and meets network requirements. The methods are proposed in the paper for optimization VANETs data traffic as well as to minimizing delay. First, here is presented, a stable clustering algorithm based on the destination, contextually take into consideration various physical parameters for cluster formation such as location of the vehicle and its direction, vehicle speed and destination, as well as a possible list of interests of the vehicle. And also the next main process is to depend on these “five parameters” we can calculate the “Cluster Head Eligibility” of each car. Second, based on this “Cluster Head Eligibility”, described cluster head selection method. Third, for efficient communication between clusters, present a routing protocol based on the “destination”, which considered an efficient selecting method of next forwarding nodes, which is calculated by using “FE” metric.

A review on propagation of secure data, prevention of attacks and routing in mobile ad-hoc networks

Wireless communication formly mobile ad-hoc network (MANET) plays a significant role in modern technology for transmitting the packets from source node to destination node. The absence of any central contrivance makes MANETs more prone to cyber-attacks. So it is expected to meet the different security requirements such as authentication, confidentiality, integrity, anonymity, and availability. So this paper, developed a detailed survey about the techniques used for solving the various issues like security, authentication and routing. In addition to that, the authentication problem is also focused by providing more security by means of identifying one another. Moreover, the problem of incorporating security into routing protocols, many algorithms have been employed which is very challenging to find out the optimal and efficient method that can be used globally. Finally paper analysed various existing techniques and then critically analysed the work done in the field of MANETs.

Dual-Channel-Based Mobile Ad Hoc Network Routing Technique for Indoor Disaster Environment

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.

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.

Artificial Intelligence Based A Optimization Routing in Mobile Ad Hoc Networks

A Mobile Ad Hoc Network (MANET) is a hotchpotch of nodes with mobility feature, the established network utilization is dynamically outlined based on temporary architecture. In MANETs, the challenging and vital role is played by the routing protocols performance factors under different condition and environments. The routing protocols are liable to handle many nodes with limited resources. There exits many routing protocols in MANETs, one of the main key note that has to be considered in designing a routing protocol is to observe that the designed routing protocol is having an proportionate effect on network performance. The existence of obstacles may lead to many geographical routing problems like excess consumption of power and congestion of data. The aim of this paper is to take the assistance of A* algorithm that finds the walk-able path avoiding the concave obstacle in the path relaying on the gaming-theory model[29]. This algorithm decreases the delays in packet transmission and in turn increases the success rate of transmission. We take into consideration path length, penalty for node availability as probability of forwarding criteria and processes effective packet transmission. The simulated results analyse the performance of our protocol over other conventional algorithms based on congestion cost, path length, node availability penalty, delay, packet loss, throughput.

Throughput of Multicast Source Routing in Adhoc Network

The wireless ‘Ado Network ‘is referred as without any specific infrastructure mobile network. The randomly selected nodes are moves freely and communicate directly to end users with no hierarchical structure. In this network, all nodes are receiving the transmitted information in multicast nature and used Omni directional antennas. In multicasting source node sends the copies of the information to all receiver nodes. Movements of nodes can be described by using mobility model, and it is characterized by location, velocity, and direction over a period of time The proposed new routing algorithm, named “Multicast Proactive Source Routing O-CORMAN”. This paper discussed routing; evaluate the efficient throughput, Total transmission Power and also Normalized Over-head, compared with unicast type. The proposed new protocol performance is analyzed using the ns-2.32 network simulator.

Design and Performance Analysis of a New Framework of Multipath Load Balancing Routing in Ad-Hoc Network

In the communication networks, one of the major problems in the quality of service is congestion. Indeed, the phenomenon of congestion is due to the fact that many packets emitted follow the same paths. As a result, the increase the bandwidth offered can solve the problem only in the short term. In order to solve this problem, several solutions have been proposed, such as multipath routing algorithms, which distribute traffic between a source and a destination on several different paths, while taking into account the level of saturation of the intermediaries nodes, composing the different paths with a objective to avoid cluttered paths. Its purpose is to shed the excessive burden save a knot on its neighbors to improve performance and to exploit efficiently. In this paper we have analysis the load balancing in Multipath routing to achieve better network performance. We have study and reviewed the different load balancing algorithm in multipath network and based on review we have proposed a new load balancing algorithm in the multipath network. We have modified the packet of RREP and RREQ packet to transmit and receive the route information to compute the load of every path and we added a new field in RREP packet Buffer size to store the current node and their neighbor information to find the alternate route if network load in increase we have compare the performance of proposed protocol with the LB-AOMDV, SMR & AOMDV multipath routing protocols. NS2 is used for simulation

Data Collection and Performance Analysis of Wireless Communication to improve Quality of Service

A wirelessly appointed system is an accumulation of progressively framing some of moving hubs or mobile nodes or a transitory non-foundation organize without the utilization of any present system foundation. Because of the constrained range of correspondence between portable hubs in the impromptu organize, a few system expectations might be required to send a packet starting with one hub then onto the next in the wireless system. A scope of particular routing conventions have been depicted in most recent years that address multi-hub wirelessly appointed system and their proficiency issues are examined. In this paper, use the NS2.34 network simulator to compare Mobile Ad-Hoc network routing protocols DSDV, AODV and DSR. In this investigation of the effectiveness of routing conventions in systems when changing association parameters (traffic load, portability, arrange size). This archive experiences broad examination among routing performance for AODV, DSDV, DSR routing. For model, packet delivery ratio, delay, number of packet sent, number of packets received, throughput are analyze and also to look at these conventions to check the best routing conventions for Quality of Service in the network.

Power efficient Memetic Optimized and Adjacent Exponentially Distributed Routing in Mobile Ad Hoc Networks

Mobile Ad Hoc Networks (MANETs) are self-organizing, infrastructure less, possessing constrained power, linked through wireless links without any centralized controller. Optimal selection of routes with minimum end-to-end delay and maximum packet delivery ratio was ensured using learning-based routing protocol, however power factor was not analyzed and therefore increasing the routing overhead. This paper employs the Adjacent Exponentially Distributed Route Maintenance mechanism to include an energy awareness feature with mean data packet arrival rate and link breakage rate to the identified route discovery mechanism. The proposed technique considers routes distance and power during route selection and includes routes energy consumption in its calculations. Besides, route discovery as an optimization is formulated employing Adjacent Exponential Distribution to choose a route that optimizes weighted function of route distance and energy. The simulation results show that the Memetic Optimized Adjacent Exponentially Distributed Routing (MO-AEDR) improves the packet delivery ratio with minimum end-to-end delay and routing overhead.

A review on propagation of secure data, prevention of attacks and routing in mobile ad-hoc networks

Wireless communication formly mobile ad-hoc network (MANET) plays a significant role in modern technology for transmitting the packets from source node to destination node. The absence of any centr...

Routing Algorithm To Eliminate Stale Routes (RAESR) In Mobile Ad Hoc Networks

Mobile Ad-hoc Network (MANET) is a collection of self sustaining mobile nodes which are connected through many wi-fi links to form a temporary communication for sharing information between the users. Mobile nodes behave as a host as well as router. As nodes in MANET posse’s mobility in traits frequently leads to irregular link between the nodes. Link failure directs a significant routing overhead during high mobility and also maintaining all the information associated with nodes and routing paths are considered as an extra overhead on the table. In order to overcome these issues, the routing algorithm to eliminate stare routed in routing cache. The neighbor degree centrality table is introduced to recognize the valuable nodes, using the valuable nodes the routes are discovered and link failure information are disseminated across the network wide. The results and findings show that the elimination of stale routes leads to significant reduction in routing overhead which in turn reduces the route error propagation delay.

Non Linear Differential Optimization for Quality Aware Resource Efficient Routing in Mobile Ad Hoc Networks

MANETs is the basic structure less network in which mobile nodes connecting point at which several line comes together to form a network structure. Network resources in MANETs are limited due to their forcefulness study of a given place. A mobile node in MANETs utilizes an interconnected system of things such as data transmission rate and battery power during data packet transmission. Thus the conserving network resource is important to maintain the quality of network services without delay. Therefore, Non-linear Differential Resource Optimization based Quality Aware Routing (NLDRO-QAR) Technique is proposed. The NLDRO-QAR Technique selects the resource optimized route path among multi paths for efficient data packet transmission in MANETs. The resource optimized route path is determined in proposed NLDRO-QAR Technique by choosing mobile node with higher resource availability as optimal nodes. The NLDRO-QAR Technique considers residual energy, residual bandwidth, and delay time as significant factor for computing resource availability of mobile nodes in MANETs. In order to effectively find out the optimal nodes (i.e. mobile node with higher resource availability) in dynamic environment. The NLDRO-QAR Technique chooses the resource optimized nodes in MANETs in order to transmit the packets between source and destination. As a result, NLDRO-QAR Technique efficiently reduces the energy and bandwidth utilization of data delivery in MANETs. The NLDRO-QAR method manage the simulation works on metrics such as energy utilization, average end to end delay, data loss rate and bandwidth utilization rate. The simulations results show that the NLDRO-QAR Technique is able to reduce the energy and bandwidth utilization for routing the data packet in MANETs as compared to state-of-the-art-works.

Fuzzy Logic-Based Directional Location Routing in Vehicular Ad Hoc Network

The vehicular ad hoc network (VANET) is an autonomous system of mobile vehicles where mobile vehicles can transmit or receive data packet over the wireless link. Due to the movable nature and limited communication, range of vehicles causes breaking the link between them very frequently, which in turn causes failure in the data delivery. Therefore, a stable path should be established from the source to the destination node to deliver data packets at the intended destination node. Therefore, for a stable route from source to the destination node selection of the next hop should be appropriate. The proposed work in this paper has been made to discuss how the best next hop node can be selected to deliver data packet successfully at the destination node D. A mathematical model fuzzy logic-based directional location routing (FLDLR) has been proposed to select a remarkable next hop node in the VANET. To select next hop, FLDLR has considered fuzzy logic sets of the routing metrics, i.e., next hop distance, node speed, closeness, the data transmission rate of the node, and node movement direction. To investigate the performance of FLDLR, the simulation work has been done through network simulator-2 and compared with existing LAR and D-LAR protocols. Through simulated results has shown that the FLDLR outperforms existing protocols from the standpoints routing overhead and packet delivery delay.

A Survey and Performance Evaluation of Reinforcement Learning Based Spectrum Aware Routing in Cognitive Radio Ad Hoc Networks

Cognitive radio technology is an assuring solution for under-utilization of licensed spectrum bands and overcrowding of unlicensed spectrum bands, in which secondary user is permitted to access the primary users’ spectrum in an opportunistic manner. Opportunistic access of the spectrum requires complex changes across all the layers of a network protocol stack. Cognitive radio has to be an autonomous agent in order to configure itself to dynamic spectrum environment. And, the characteristics of reinforcement learning, a subfield of artificial intelligence in which the agent learns the surrounding operating environment through continuous interaction and takes an optimum decision on the fly, is in compliance with features of self-organized cognitive radio ad hoc network. Therefore, reinforcement learning is an appropriate option for incorporating intelligence and self-adaptivity into cognitive radio. This paper provides a comprehensive survey on the application of reinforcement learning for efficient spectrum aware routing in cognitive radio ad hoc network. The preliminaries of cognitive radio ad hoc networks and reinforcement learning are first introduced, and a review is investigated in the proposed research area along with a discussion on open research challenges with an aim to promote research. From the survey, reinforcement learning incorporated cognitive radio can learn the unknown primary user network model and the learned model can be then used for finding a suitable route to meet the Quality of Service requirements. With this in mind, the paper also proposes a multi-objective reinforcement learning based spectrum aware routing protocol with an aim to maximize the probability of successful transmission using a minimum hop path. The simulated results prove the performance of the algorithm.

Hybrid Energy and Trust Efficient Reactive Routing Mechanism for MANETs

The facilitation of quality of service (QoS) under routing in Mobile Ad Hoc NETworks (MANETs) is a challenging issue due to its resource constraints, bandwidth sharing and topology dynamism. Moreover, security is considered as another complex issue of provisioning QoS as the prevalence of maliciousness nodes introduces all types of threats to the MANETs. In spite of a diversified number of mechanisms contributed for securing MANETs, majority of the solutions are potential in preventing some particular category of attacks or facilitate security by sacrificing the QoS cost. In this paper, Hybrid Energy and Trust Efficient Reactive Routing Mechanism (HETERRM) was proposed for ensuring trust-oriented QoS routing process that integrates QoS trust and social trust. This proposed HETERRM first relies on the process of mitigating maliciousness nodes by incorporating a trust mechanism that is capable in different packet forwarding misbehavior and reliable path discovery for facilitating trustworthy communication. This proposed HETERRM further aids in selecting the optimal forwarding node based on quality of channel, quality of link and residual energy to quantify the packet forwarding potential. The simulation experiments of the proposed HETERRM are conducted using ns-2 is evaluated using energy consumptions, packet delivery ratio and overhead.