An Energy Efficient Qos Routing Protocol Based On Red Deer Algorithm In MANET

Now a day, Mobile Adhoc Networks (MANET) gained a lot of popularity in the research community. People realized that there is a commercial value in MANETs with the successful solutions of the most basic but important problems in network layer. Mostly all the applications that attracted interest in traditional wired networks (e.g. Audio/Video Transfer, Video Conferencing, Watching Online Movies/Sports, Camera-enabled Messenger, Online Gaming etc.) would attract interest for MANETs as well. Since real-time multimedia communications will be common in MANETs, there has been an increasing motivation on the introduction of QoS in such networks. But, many characteristics of MANETs make QoS provisioning a difficult problem. In MANETs, providing QoS guarantees is very difficult and challenging than in traditional wired networks, mainly due to multihop communications, contention for channel access, node mobility and a lack of central coordination. However, in the last few years, much research attention has focused on providing QoS guarantees in MANET routing protocols. QoS routing protocol/mechanism is key issue in provision of QoS in MANETs. There are number of QoS routing approaches have been proposed in literature, focusing on different QoS metrics but no particular protocol/mechanism provides overall solution. There are some major open research issues in this area such as QoS metric selection and cost function design, Multi-class traffic, Scheduling mechanism at source, Packet prioritization for control messages, QoS routing that allows preemption, and QoS in Heterogeneous networks. There are still many open questions that must be solved to improve the performance of QoS-aware routing protocols such as bandwidth/delay estimation, route discovery, resource reservation, route maintenance, cross-layer design, energy consumption, multicast QoS routing etc.

Quality of service (QoS) and security have been considered as two competent units to govern and administer end-to-end traffic across network. A mobile ad hoc network (MANET) is a type of wireless communication, every node can act as a router or base station. Secure QoS-based routing is an important problem in MANET. A hierarchical key ranking (HKR) model is presented here for secure group communications in MANETs. To enhance the security, one-to-one random mapping is performed using hash-based message authentication code (HashMAC). Due to the dynamic nature and topological changes in MANET, group safeguarding is efficiently accomplished. For secure group communication and efficient QoS routing in MANET, a sector key (SK) is shared among group members to encrypt group messages which is obtained using secured message authenticated code (SMAC). The primary design is to include the group members in sector to vigorously contribute to the security of the multicast group, as a result dropping the communication and calculating load on the source. Experimental evaluation is done to estimate the performance of the proposed secure QoS routing and communication using hierarchical key ranking [SRHKR] in MANET in terms of delivery rate, security level, delay.

A Mobile Ad Hoc Network represents a system of wireless mobile nodes that can freely and dynamically selforganize into arbitrary and temporary network topologies, allowing people and devices to seamlessly communicate without any pre-existing communication architecture. The growth of real time multimedia application in such environments, has drawn a lot of attention to wireless networks that support quality of service (QoS). In this work, the QoS metrics, delay and link life time (LLT) of the path are dynamically calculated. Based on these values the routing decisions are made. Here the multipath routing protocol is taken as the base protocol. The proposed algorithm finds the multiple QoS routes only, based on the QoS metrics and stores only those paths in the routing table. The route is selected based on the integrated QoS metric and is used to transmit the data. The base protocol used is multipath AODV(Ad Hoc On demand Distance Vector ) routing protocol. The proposed protocol may take extra time during route discovery process to compute the additional QoS parameters, but this time is compensated by having only QoS paths for data transmission. A few patents on the QoS Routing for MANETS have been reviewed.The simulator NS-2.34 is used to simulate and compare the performance of the protocols in terms of the QoS metrics such as end-to-end delay, PDR in the MANET. Keywords: Mobile Ad Hoc Network (MANET), Quality of Service (QoS), Destination Sequence Distance Vector (DSDV), Dynamic Source Routing (DSR), Ad Hoc On demand Distance Vector (AODV), LLT (Link Life Time), RLT (Route Life Time), PLTR (Percentage Life Time Ratio), TCP (Transmission Control Protocol), CBR (Constant Bit Rate), PDR (Packet Delivery Ratio).

Mobile ad Hoc Networks (MANETs) are one of the most important technologies supporting Ubiquitous and Pervasive Computing (UPC). As many UPC applications pose Quality of Service (QoS) constraints, their implementation in MANETs becomes dependent on the MANET algorithms for QoS routing. In this paper Genetic Algorithms (GAs) for QoS routing in MANETs are considered. GAs can solve the NP search of QoS routes with multiple constraints, and then address the UPC QoS requirements. The focus is on tree-based GAs, which represent the set of paths from source to destination as a tree and encode them through the crossed junctions. They encode single paths in the chromosome. We investigate on the effects of binary encoding schema on tree-based GAs. To this purpose we design a GA with binary encoding that maps classes of paths in single chromosomes. These classes are both collectively exhaustive and mutually exclusive. The GA with binary encoding uses an adaptive mutation probability for deeper exploration of the search space, and local search on classes of paths. Simulation results compare the GA with binary encoding with two applications of GAMAN, the main existing tree-based GA. They show that the binary encoding allows the GA to converge faster although it introduces additional computational costs.

Routing in mobile Ad-Hoc networks is normally a difficult task, but even more challenging if the network is expected to provide support for audio and video streaming between human-carried devices. Besides normal movement and signal impairment difficulties, those multimedia applications may impose extra end-to-end requirements. The computation of optimized and/or constrained network paths using one or more metric restrictions is called QoS (Quality-of-Service) routing. This paper presents QMRS, a QoS routing protocol for Ad-Hoc networks which aims to support applications with QoS requirements including requirements for the end-to-end delay. This protocol proposes a on-demand multiple routes discovery mechanism that is able to find up to three node-disjoint paths that meet the QoS requirement. Additionally, and for the purpose of guarantee the stability of the routing process, it uses the signal strength of the links between neighbouring nodes to elect the most stable route. Such route will be used as the primary choice to forward traffic. The other discovered routes will be maintained as backup in order to eventually replace the primary route, in case of disruption or degradation of required QoS.

In Mobile Ad-Hoc Networks (MANET), the increasing demand for multimedia application is more challenging and the existing routing protocols are not adequate owing to the complex design requirements of Quality of Service (QoS) routing. This paper proposes a stateless position-based solution for QoS routing issues and offers an efficient end-to-end communication guarantee. The proposed Stateless QoS (SQoS) routing protocol is based on adaptive compass greedy routing to determine a qualified path which satisfies the QoS requirements and the void handling scheme overcomes the local maximum issue. In addition, the SQoS routing utilises the node overhearing capacity to obtain the link quality measurement to provide a guarantee for efficient end-to-end transmission through the identification of high-quality links for multimedia streams. The performance of the proposed SQoS routing protocol is compared with existing QoS-GPSR. Finally, the performance evaluation proves that the SQoS routing protocols outperform the existing protocols.

Mobile Ad Hoc Networks (MANETs) are wireless networks formed by several nodes communicating on a peer-to-peer basis without being connected to any fixed infrastructure. These nodes could be laptop computers, personal digital assistants, mobile phones or sensors dispersed in an area to measure certain data and send the information to a larger node. Where a source node and a destination node are not within direct range, they communicate through multi-hop routing, i.e. nodes in between them relay messages between source and destination. The routing protocol plays a key role in finding and maintaining the route in MANETs. Routing protocol can be a uni-path and multi-path. A multipath routing protocol is designed to increase the reliability in MANET. This research work focuses on Quality of Service (QoS) based evolution of multipath routing protocol. For this purpose, diverse type of simulation scenarios is designed to find the impact of mobility, increasing the number of nodes and pause time in MANETs. The results revealed that multipath routing protocol has comparatively less delay (percentage decrease of 81.52%). While unipath routing protocols have less packet drop ratio (percentage decrease of 47.78%) and routing overhead (percentage decrease of 99.30%).

Applications of mobile ad hoc networks (MANETs) have gained increasing popularity among different areas of human life and significantly attracted the attention of the researchers in this field. Routing in a MANET plays the vital role in its real-world application. Further, routing in MANET is associated with a set of issues that need to be addressed before its implementation. The issues include satisfaction of specified quality of service (QoS) requirements and security issues. In this paper, we have addressed security issues as our point of focus. Again, security issues can be addressed using various algorithms and out of all, evolutionary technique-based algorithms appear to be more effective for the purpose. Ant colony optimization (ACO) is one of the most popular evolutionary algorithms for optimization. We have carried out an extensive review of ant colony optimization (ACO)-based secure MANET routing protocols and the contents of this paper can help researchers in the field of MANET to devise secure routing protocols, especially using ACO algorithm for addressing the security issues in a MANET.

Nowadays, more and more researchers are paying their attention to green routing. In this paper, we consider power consumption as a kind of QoS (quality of service) and apply a new learning-based approach for energy efficient transportation and QoS routing. Compared with traditional rule-based methods, the proposed method can learn additional information from the networks to improve routing performance, and have the flexibility to meet different QoS requirements. First, we propose a new identification of network nodes, namely node vectors, and a basic routing algorithm using node vectors is designed accordingly. Then, energy efficient transportation and QoS routing are proposed by adding QoS constraints into the routing decision. Link attributes such as power consumption, bandwidth and delay can be learned from these node vectors with neural networks. The learned link attributes together with the estimated distance can be used for routing decisions with QoS constraints. Simulation results show that the proposed method is reliable in routing tasks, and can achieve a remarkable performance when compared with the state-of-the-art work on the delay constrained least cost path (DCLC) problem.

ZhuJi,WeiYuandK.J.RayLiu,Fellow, IEEE Abstract—In self-organized mobile ad hoc networks (MANETs) where each user is its own authority, fully cooperative behaviors, such as unconditionally forwarding packets for each other or honestly revealing its private information, cannot be directly assumed. The pricing mechanism is one way to provide incentives for the users to act cooperatively by awarding some payment for cooperative behaviors. In this paper, we consider efficient routing in self-organized MANETs and model it as multi-stage dynamic pricing games. A game theoretical framework for dynamic pricing-based routing in MANETs is proposed to maximize the sender/receiver’s payoff by considering the dynamic nature of MANETs. Meanwhile, the forwarding incentives of the relay nodes can also be maintained by optimally pricing their packet-forwarding services based on the auction rules and introducing the Cartel Maintenance enforcing mechanism. The simulation results illustrate that the proposed dynamic pricing-based routing approach has significant performance gains over the existing static pricing approaches.

The system in which wireless device self configure, establish and communicate from one end to the other using wireless channel with no existing fixed network is known as Mobile ad hoc network (MANET). The MANET is another varient of Ad-hoc network, which creates short-lived network using wirelss mobile devices. In ddition to MANET, the behaviour of this kind of temporary networks depends on routing protocols. The large number of routing techniques has been presented in the literature, but it is also been stated that routing is one of the key research issue even till today. This research article examines the performance of nature inspired algorithm such as Petal Ant Routing (PAR) with classical based routing such as Dynamic source routing in MANET. The simulation of both routing is carried using Network Simulator (NS2 version 2.35) and evaluted for different network parameters.

The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multi-layer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.

Emergent Intelligence Based QoS Routing in MANET

The mobility and resource limitation of nodes are the critical factors that affect the performance of Mobile AD hoc network (MANET). The mobility of nodes will affect the stability of links, and the limitation of node resources will lead to congestion, so it is very difficult to design a routing protocol that supports quality of service (QoS) in MANET. Especially in the scenario of high-speed node movement, frequent link interruption will damages QoS performance, so it is necessary to design MANET routing protocol that can adapt to network topology changes to support QoS. In this paper, we propose a Topological change Adaptive Ad hoc On-demand Multipath Distance Vector (TA-AOMDV) routing protocol, which can adapt to high-speed node movement to support QoS. In this protocol, a stable path selection algorithm is designed, which not only takes node resources (residual energy, available bandwidth and queue length) as the path selection parameters, but also considers the link stability probability between nodes. Furthermore, in order to adapt to the rapid change of topology, link interrupt prediction mechanism is integrated into the protocol, which updates the routing strategy based on periodic probabilistic estimates of link stability. Different scenarios with node speed in the range of 10-50m/s, data rate in the range of 4-40kbps and number of nodes in the range of 10-100 are simulated on NS2 platform. Our results show that the QoS metrics (packet delivery rate, end-to-end delay, and throughput) of the proposed protocol are significantly improved when the node speed is higher than 30m/s although it is slightly better when the node speed is lower than 30m/s. Our on-demand multipath routing protocol demonstrates high potential to support QoS for high-speed MANET.

With the Development of mobile ad hoc network (MANET), Quality of Service (QoS) routing and power-aware routing become more and more important. In the past, QoS guarantee and power control issues were treated separately. In this paper, we propose a novel on-demand QoS routing protocol, PMQR (power-aware multi-path QoS routing) in TDMA-based MANETs. Our protocol combines QoS routing and power-aware routing, which can provide QoS guarantee and achieve energy conservation by taking into account both the transmission power and the remaining energy at the intermediate nodes between a source and a destination. PMQR also can establish multiple paths, even for a single call, when the route search cannot find a path that meets the QoS requirements. Simulation results show that PMQR has good network performance and balances the energy consumption of mobile hosts.