Throughput efficient AODV for improving QoS routing in energy aware mobile adhoc network

Mobile Ad hoc Networks (MANETs) is a type of wireless network that is made up of mobile nodes which coordinate themselves without the help of a central coordinator. The network topology changes as nodes are mobile. One of the major challenges of MANET is limited bandwidth which tends to mitigate the Quality of Service (QoS) of the network as users are not satisfied. A variety of routing protocols has been employed aiming at improving the throughput of the network in order to meet user demands. This paper proposes the development of a throughput efficient Ad-hoc On demand Distance Vector (TE-AODV) routing protocol targeted towards improving the QoS of MANET by mitigating network overhead. In this work, all nodes are assumed to be transmitting while calculating their Instant Processing State (IPS) using the concept of knapsack problem. A threshold value for node IPS is set and any node below the set threshold value is not considered during data transmission. An improved Location Aided Routing (iLAR) is used for route search process which helped in reducing network overhead. Results from simulation showed that TE-AODV has improved the throughput of energy aware Ad-hoc On demand Distance Vector (E-AODV) routing protocol. TE-AODV improved the network throughput by 2.9% as a function of simulation time and 3.7% as a function of mobility of node over the E-AODV routing protocol

Throughput Efficient AODV for Improving QoS Routing in Energy Aware Mobile Adhoc Network

Mobile Ad hoc Networks (MANETs) is a type of wireless network that is made up of mobile nodes which coordinate themselves without the help of a central coordinator. The network topology changes as nodes are mobile. One of the major challenges of MANET is limited bandwidth which tends to mitigate the Quality of Service (QoS) of the network as users are not satisfied.  A variety of routing protocols has been employed aiming at improving the throughput of the network in order to meet user demands. This paper proposes the development of a throughput efficient Ad-hoc On demand Distance Vector (TE-AODV) routing protocol targeted towards improving the QoS of MANET by mitigating network overhead. In this work, all nodes are assumed to be transmitting while calculating their Instant Processing State (IPS) using the concept of knapsack problem. A threshold value for node IPS is set and any node below the set threshold value is not considered during data transmission. An improved Location Aided Routing (iLAR) is used for route search process which helped in reducing network overhead. Results from simulation showed that TE-AODV has improved the throughput of energy aware Ad-hoc On demand Distance Vector (E-AODV) routing protocol. TE-AODV improved the network throughput by 2.9% as a function of simulation time and 3.7% as a function of mobility of node over the E-AODV routing protocol

Enhanced Ad Hoc On-Demand Distance Vector Routing Protocol For Mobile Ad Hoc Network Internet Connectivity

An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration and consists of mobile nodes that use a wireless interface to communicate with each other. These mobile nodes serve as both hosts and routers so they can forward packets on behalf of each other. Hence, the mobile nodes are able to communicate beyond their transmission range by supporting multi hop communication. However, the fact that there is no central infrastructure and that the devices which can move randomly gives rise to various kinds of problems, such as routing and security and quality of service (QoS). In this thesis the problem of routing is considered. An Ad-Hoc network has certain characteristics, which impose new demand on the routing protocol the most important characteristic is the dynamic topology, which is a consequence of node mobility. Nodes can changes position quite frequently, which means that we need a routing protocol that quickly adapts to topology changes. The nodes in ad hoc network can consist of laptops and PDA (Personal Digital Assistants) and are often very limited in resources such as CPU capacity, storage capacity, battery power and bandwidth. This means that routing protocol should try to minimize control traffic, such as period update message. Instead the routing protocol should be reactive, thus only calculate routes upon receiving a specific request. The Internet Engineering Task Force (IEFT) currently has a working group called mobile Ad hoc network (MANET) that is working on routing specification for Ad hoc networks. This thesis evaluates some of the routing protocols such as AODV (Ad hoc on demand Distance vector) and DSR (Dynamic Sources Routing) and DSDV (Destination Sequenced Distance vector) for performance testing and an enhanced implementation of AODV, which is able to detect Internet gateway in the proactive, reactive, and hybrid situation. This evaluation is done by means of simulation using NS-2 developed by University California Berkeley. There are several ad hoc routing protocols, such as AODV, DSR, and DSDV that propose solutions for routing within a mobile ad hoc network. However, since there is an interest in communication between not only mobile devices in an ad hoc network, but also between a mobile device in an ad hoc network and a fixed device in a fixed network (e.g. the Internet), the ad hoc routing protocols need to be modified. In this thesis the ad hoc routing protocol AODV is used and modified to examine the interconnection between a mobile ad hoc network and the Internet. For this purpose Network Simulator 2, NS 2, has been used. Moreover, three proposed approaches for gateway discovery are implemented; propose a forwarding algorithm, and route determination algorithm for default route and host route in MANET are investigated

Xcast Based Routing Protocol For Push To Talk Application In Mobile Ad Hoc Networks

Mobile ad-hoc networks comprise a type of wireless network that can be easily created without the need for network infrastructure or administration. These networks are organized and administered into temporary and dynamic network topologies. Unfortunately, mobile ad-hoc networks suffer from some limitations related to insufficient bandwidth. The proliferation of new IP Multimedia subsystem services (IMs), such as Push-to-talk (PTT) applications consume large amounts of bandwidth, resulting in degraded QoS performance of mobile ad-hoc networks. In this thesis, a Priority XCAST based routing protocol (P-XCAST) is proposed for mobile ad-hoc networks to minimize bandwidth consumption. P-XCAST is based on demand route requests and route reply mechanisms for every destination in the PXCAST layer. To build the network topology and fill up the route table for nodes, the information in the route table is used to classify the XCAST list of destinations according to similarities on their next hop. Furthermore, P-XCAST is merged with a proposed Group Management algorithm to handle node mobility by classifying nodes into two types: group head and member. The proposed protocol was tested using the GloMoSim network simulator under different network scenarios to investigate Quality of Service (QoS) performance network metrics. P-XCAST performance was better by about 20% than those of other tested routing protocols by supporting of group size up to twenty receivers with an acceptable QoS. Therefore, it can be applied under different network scenarios (static or dynamic). In addition Link throughput and average delay was calculated using queuing network model; as this model is suitable for evaluating the IEEE 802.11 MAC that is used for push to talk applications. The analytical results for link throughput and average delay were used to validate the simulated results

On-demand security and QoS optimization in mobile ad hoc networks

Scope and Method of Study: Security often comes with overhead that will impact link Quality of Service (QoS) performance. In this dissertation, we propose an on-demand security and QoS optimization architecture in mobile ad hoc networks that automatically adapts network security level to changes in network topology, traffic condition, and link QoS requirements, so as to keep the security and QoS at optimum conditions. In order to achieve the overall objective, we introduce three basic frameworks: a policy based plug-in security framework, a multi-layer QoS guided routing algorithm, and a Proportional Integral Derivative (PID) feedback control based security and QoS optimization framework. The research has been evaluated with the network simulator ns-2. Finally, we propose an attack tree and state machine based security evaluation mechanism for ad hoc networks: a new security measurement metric.Findings and Conclusions: Simulations have been done for small and large network sizes, low and high communication ratios, as well as low and high mobility scenarios. The simulations show that the proposed on-demand security and QoS optimization architecture can produce similar performance to non-secure QoS routing protocol under various traffic loads. It provides more secure ad hoc networks without compromising the QoS performance, especially under light and medium traffic conditions

A Composite Trust Model for Secure Routing in Mobile Ad-Hoc Networks

It is imperative to address the issue of secure routing in mobile ad-hoc networks (MANETs) where the nodes seek for cooperative and trusted behaviour from the peer nodes in the absence of well-established infrastructure and centralized authority. Due to the inherent absence of security considerations in the traditional ad-hoc routing protocols, providing security and reliability in the routing of data packets is a major challenge. This work addresses this issue by proposing a composite trust metric based on the concept of social trust and quality-of-service (QoS) trust. Extended from the ad-hoc on-demand distance vector (AODV) routing protocol, we propose an enhanced trust-based model integrated with an attack-pattern discovery mechanism, which attempts to mitigate the adversaries craving to carry out distinct types of packet-forwarding misbehaviours. We present the detailed mode of operations of three distinct adversary models against which the proposed scheme is evaluated. Simulation results under different network conditions depict that the combination of social and QoS trust components provides significant improvement in packet delivery ratio, routing overhead, and energy consumption compared to an existing trust-based scheme

Design and analysis of a Speed-Aware Routing Protocol for mobile ad hoc networks

The flexibility of movement for the wireless ad hoc devices, referred to as node mobility, introduces challenges such as dynamic topological changes, increased frequency of route disconnections and high packet loss rate in Mobile Ad hoc Wireless Network (MANET) routing. This research proposes a novel on-demand routing protocol, Speed-Aware Routing Protocol (SARP) to mitigate the effects of high node mobility by reducing the frequency of route disconnections in a MANET. SARP identifies a highly mobile node which forms an unstable link by predicting the link expiration time (LET) for a transmitter and receiver pair. When the nodes have high relative velocity, the LET calculated is a small value; this means that the link is predicted to disconnect before the successful transmission of a specific demand. SARP omits such a packet-sending node from the link route during the route discovery phase. The omission of such unstable links helps SARP limit the flooding of control packets during route maintenance and reduces the overall control overhead generated in on-demand routing protocols. NS2 was used to implement the SARP with ad hoc on-demand vector (AODV) as the underlying routing algorithm. Extensive simulations were then conducted using Random Waypoint Mobility model to analyze the performance of SARP. The results from these simulations demonstrated that SARP reduced the overall control traffic of the underlying protocol AODV significantly in situations of high mobility and dense networks; in addition, it showed only a marginal difference as compared to AODV, in all aspects of quality-of-service (QOS) in situations of low mobility and sparse networks --Abstract, page iii

Encaminhamento com QoS em redes móveis Ad Hoc

Dissertação de mestrado integrado em Engenharia de ComunicaçõesNos dias de hoje a grande diversidade e o aumento da capacidade dos dispositivos móveis sem fios e simultaneamente a evolução das aplicações multimédia, criou-se a necessidade de propor e avaliar formas de oferecer garantias de Qualidade de Serviço (QoS) ao tráfego fim a fim nas redes móveis ad hoc (Mobile Ad hoc Networks - MANET). Este tipo de redes tem a vantagem de possibilitar aos utilizadores de dispositivos móveis, estabelecerem rapidamente e sem assistência de um ponto de acesso uma rede entre eles, que potencie a utilização de diversos serviços. Devido às suas características, desde a tecnologia sem fios até à mobilidade dos nós, dotar este tipo de redes de garantias de qualidade de serviço no tráfego fim a fim torna-se um desafio. Esta dissertação propõe um protocolo de encaminhamento com QoS para redes ad hoc, que se designa por Ad hoc QoS Multipath Routing with Route Stability (QMRS), que tem como objectivo suportar aplicações com requisitos de qualidade de serviço, nomeadamente requisitos no atraso fim a fim. Este protocolo tem a possibilidade de encontrar até três rotas de nós disjuntos que cumpram o requisito de QoS. Adicionalmente e com o objectivo de garantir a estabilidade do processo de encaminhamento, usa a potência de sinal das ligações entre nós vizinhos para eleger a rota mais estável, rota essa que passa a ser usada para o reenvio do tráfego. Quando se verifica a existência de rotas com uma estabilidade idêntica, dá-se preferência à rota com menor atraso fim a fim. O protocolo detém também um mecanismo de manutenção, recuperação e verificação de incumprimento do requisito de QoS nos caminhos encontrados. Este protocolo teve como base o protocolo Ad Hoc On-Demand Multipath Routing (AMR), também proposto e implementado no âmbito deste trabalho. Ambos os protocolos foram implementados e avaliados usando o simulador ns-3. Os resultados obtidos através de várias simulações realizadas para cada um dos protocolos implementados, assim como para o protocolo Ad hoc On-Demand Distance Vector (AODV) existente no simulador, permitiram verificar que, o protocolo QMRS com os mecanismos existentes de descoberta, manutenção, recuperação rápida de rota e verificação de incumprimento do requisito de QoS nos caminhos encontrados, permite obter resultados significativamente melhores, comparativamente ao protocolo AODV e ao protocolo AMR, no que diz respeito ao atraso fim a fim, taxa de entrega de pacotes no destino e taxa de transferência efectiva.Nowadays with the increasing of the diversity and the capability of the mobile devices and simultaneously the evolution of multimedia applications, has created the need to propose and evaluate ways of offering guarantees of Quality of Service (QoS) for the end-to-end traffic in the Mobile Ad hoc Networks (MANET). Such networks have the advantage of enabling mobile users, establish quickly and without assistance of an access point a network between them, which make best use of various services. Due to its characteristics, from the fact that it uses a wireless technology up to the impact of node mobility, providing quality of service guarantees in this type of networks for the endto- end traffic becomes a challenge. This thesis proposes a QoS routing protocol for ad hoc networks, which is known as Ad hoc QoS Multipath Routing with Route Stability (QMRS), which aims to support applications with quality of service requirements, namely requirements for the end to end delay. This protocol is able to find up to three disjoint routes that complies with the requirement of QoS. Additionally, and for the purpose of guarantee the stability of the routing process, uses the signal strength of the links between neighboring nodes to elect the most stable route, such route which is now used for forwarding traffic. When it is noted routes with the same stability, preference is given to the route with the lowest end to end delay. The protocol also holds a mechanism for maintenance, recovery and verification of compliance of the QoS requirement in the discovered paths. This protocol was based on the protocol Ad Hoc On-Demand Multipath Routing (AMR), also proposed and implemented during this work. Both protocols have been implemented and evaluated using the simulator ns-3. The results obtained through various simulations for each of the protocols implemented, as well as the Ad hoc On-Demand Distance Vector (AODV) protocol existent in the network simulator, allowed to verify that the QMRS protocol with the existent mechanisms for discovery, maintenance, rapid recovery of route and verification of compliance of the QoS requirement in the discovered paths, allow to obtain results with significant improvements compared to AODV protocol and AMR protocol, with respect to the average end to end delay, packet delivery ratio and throughput

Performance Enhancement of Routing in MANETs by using EOMD

Usually large scale of network applications requires communication of the single copy of same information packets simultaneously to many destinations. Applying the infrastructure- based multicast routing protocols in Mobile Ad hoc wireless Networks (MANETs) is a big challenge task. The circumstances that make Multicasting in ad hoc networks is extra intricate than in wired networks are node mobility, Interference of Wi-Fi alerts and broadcast nature of the communication. Tree based Protocols aren't suitable for common topology modifications as an excessive amount of overhead for updating the filter information and additionally no longer suitable for partition or isolation. The major impact of routing for multi-hop MANETs comes due to mobility of the node, as performance is prone to modifications in network topology. When any link breaks, the direction should be repaired or changed, similar to direction preservation or route discovery, respectively. The rerouting process charges in radio bandwidth and battery energy, and the extra routing latency can also affect QoS for community packages, degrading communication performance. The ODMRP is more robust to mobility and unreliable wireless links as its core layout relies on periodic floods of path discovery and renovation. ODMRP periodically reconstructs the ?forwarding mesh? on a fixed quick interval. The path refresh is the most essential parameter because it has the important effect at the protocol overhead. We proposed an Extended - On Demand Multicast Routing Protocol with motion detection (EOMD), which reduces communication overhead and performance improvisation in mobile Ad-Hoc Network in Mobility