An Efficient Backbone Based Quick Link Failure Recovery Multicast Routing Protocol

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.

Multicast routing in wireless networks that possess the wireless multicast advantage could significantly reduce the power and energy consumption. However, this kind of multicast routing that only addresses the transmission radius coverage might not be able to meet the bandwidth requirement of the users. As a result, additional transmissions are required to incur more energy consumption and carbon dioxide emissions that make existing algorithms not applicable to bandwidth constrained applications. In this paper, for the first time, we address the bandwidth aware minimum power multicast routing problem in wireless networks where the objective function is to minimize the total power consumption subject to the users’ bandwidth requirements. This problem is a challenging cross-layer design problem that requires seamless and sophisticated integrated design in the network layer (multicast routing) and physical layer (bandwidth-aware wireless transmission and power control). We first formulate this problem as a mixed integer linear programming problem and then propose a Lagrangian relaxation based algorithm to solve this problem. Numerical results demonstrate that the proposed approach is a sound green networking algorithm that outperforms the existing power efficient multicast routing approaches under all tested cases, especially in large bandwidth request, fine radius granularity, large group size and sparse network.

The virtual backbone is an approach for solving routing problems in ad-hoc wireless networks. The virtual backbone approach features low latency, moderate routing overhead and is a hybrid scheme that uses the table-driven and on-demand routing protocols. This work presents a distributed virtual backbone development scheme for ad-hoc wireless networks. Using clustering, distributed labeling and heuristic Steiner tree techniques, our scheme outperforms other schemes in terms of the size and stability of the virtual backbone and the virtual backbone change rate. Experimental results demonstrate that our scheme has lower overhead than traditional table-driven and on-demand routing schemes.

Multicast routing protocols proposed for mobile ad hoc networks have certain limitations. Most of these protocols try to discover the route on-demand by flooding route request messages, which results in increased end-to-end latency and also consumes considerable amount of network bandwidth. These limitations make protocols not suitable for real-time multimedia communication. In this paper, we have presented an efficient mobile agents aided multicast routing (MAMR) protocol which overcomes these limitations. The protocol is a hybrid protocol where intelligent mobile agents can been integrated with existing on-demand multicast routing protocols such as multicast ad hoc on-demand distance vector (MAODV) routing protocol, on-demand multicast routing protocol (ODMRP) routing protocol and others. Here, the mobile agents move around the network and collect the routing information. This routing information assists on-demand multicast routing protocols in discovering the route in a definite path instead of flooding the route request messages, thereby achieving better end-to-end latency and reduced control traffic in the network. We have used MAODV protocol as an underlying protocol with mobile agents. The proposed MAMR protocol and MAODV have been compared through extensive simulations with end-to-end latency, packet delivery ratio and control overhead as performance parameters

Body sensor nodes those are implanted inside human body for comparatively long term monitoring, are termed as implanted or implantable or in vivo sensor nodes. In recent years, in vivo sensor nodes are getting increasing interest from clinicians or researchers around the world. These nodes are noninvasive and can provide more accurate information in terms of medical science being implanted on/near the targeted body-organ. Moreover, movement of human or body organ does not affect the functionality of in vivo nodes. However, in vivo sensor nodes exhibit temperature at processing or communication time, which might be dangerous for human tissue in long term monitoring. Thermal aware routing algorithms have been proposed to deal with the problem. But, these algorithms suffer from limitations like hotspot creation, computational complexity, delay etc. A virtual backbone is a small subset of connected sensor nodes and it is connected to all other sensor nodes of the set. All virtual backbone nodes involve less interference, congestion and lightweight communication those are significant for an in vivo sensor network. In this context, we have proposed fault-tolerant virtual backbone construction algorithm to schedule temperature(routing cost) in an in vivo environment. Fault-tolerance virtual backbone is significant in the sense that when any node or nodes of a in vivo virtual backbone has/have higher temperature, the path is disconnected and communication is continued with an alternative path. Therefore, temperature is scheduled in an in vivo sensor network.

A wireless sensor network (WSN) is a collection of energy constrained sensor node forming a network which lacks infrastructure or any kind of centralized management. In such networks, virtual backbone has been proposed as the routing infrastructure which can alleviate the broadcasting storm problem occurring due to consistent flooding performed by the sensor node, to communicate their sensed information. As the virtual backbone nodes needs to carry other nodes’ traffic, they are more subject to failure. Hence, it is desirable to construct a fault tolerant virtual backbone. Most of recent research has studied this problem in homogeneous networks. In this chapter, we propose solutions for efficient construction of a fault tolerant virtual backbone in a WSN where the sensor nodes have different transmission ranges. Such a network can be modeled as a disk graph (DG), where link between the two nodes is either unidirectional or bidirectional. We formulate the fault tolerant virtual backbone problem as a k-Strongly Connected m-Dominating and Absorbing Set (k, m) SCDAS problem. As the problem is NP-hard, we propose an approximation algorithm along with the theoretical analysis and conjectured its approximation ratio.

QoS outing in multimedia applications over MANET is affected by limited resources, shared channel, unpredictable mobility, improper load balancing, and variation in signal strength. Existing works on MANET QoS routing focuses on only one of the factor such as bandwidth, mobility or energy neglecting dependent behaviour. In this paper, resource prediction-based routing is proposed wherein intelligent agents identify routes for communication with adequate future availability of buffer-space, energy and bandwidth resources considering mobile nodes. It has four steps of execution: resource prediction, resource prediction factor computation, route establishment, and route maintenance. Resources are predicted to compute resource prediction factors for reliable route establishment and route maintenance against link and node failure. Simulation results show an improvement in terms of packet delivery ratio, packet delivery latency, memory overhead and energy consumption.

Prompt and reliable communication between vehicular nodes are essential as its limited coverage and dynamic mobility rate introduces frequent change of network topology. The key feature of vehicular communication that establishes direct connectivity or Road Side Unit-based data transfer among vehicular nodes is responsible for sharing emergency information during critical situations. Multicast routing data dissemination among vehicular nodes is considered to be the potential method of parallel data transfer as they facilitate the option of determining an optimal multicast tree from feasible number of multicast trees established between the source and destinations. This estimation of optimal multicast tree using meta-heuristic techniques is confirmed to improve the throughput and reliability of the network when QoS-based constraints are imposed during multicast routing. An Improved Shuffled Frog-Leaping Algorithm-Based QoS Constrained Multicast Routing (ISFLABMR) is proposed for estimating an optimal multicast tree that confirms effective multi-constrained applied multicast routing between vehicular nodes. ISFLABMR minimizes the cost of transmission to 22% by reducing the number of multicast clusters formed during multicasting through the utilization of local and global-based optimizations. The simulation results of ISFLABMR proveits predominant reduction rate of 24% and 21% in average packet latency and energy consumptions incurred under multicast routing.

Constructing a virtual backbone (VB) has been widely used to reduce the communication overhead. Previous research works emphasize on constructing the virtual backbone and do not consider the local reconstruction of virtual backbone with less control overhead and balanced manner. In this paper, we propose a VB local reconstruction algorithm which is able to reconstruct the VB locally during the node movement. The reconstruction of virtual backbone (R-VB) in MANET is achieved by exchange of tiny control packet between backbone nodes and non VB nodes. To handle the connectivity of the nodes computations depends on local to a large extent. Decisions of joining and leaving the backbone are made locally at nodes. Thus it is highly self-stabilized even under dynamic topologies. Our simulation results show that the proposed approach outperforms several existing approaches in terms of connectivity maintenance and less communication overhead. We present the performance of R-VB in terms of backbone size, delay and packet transmitted per each node. The performance of our algorithm is witnessed by simulation results.

Virtual backbone formation is a popular approach to reduce the routing overhead and increase the network scalability in the wireless ad hoc networks. Most of the centralized and distributed algorithms aim at minimizing the size of the virtual backbone. However, if every node of the network has a cost for handling the additional responsibilities as backbone node, goal of the backbone construction algorithm should be the minimization of the total cost. In this paper, we propose a distributed low cost backbone construction algorithm with the message complexity of O(n). Simulation results show that the proposed algorithm is cost and message efficient.

In MANET, the multicast routing is considered as a non-deterministic polynomial (NP) complexity, it contains assorted objectives and restrictions. In the multicast issue of MANET, the Quality of services (QoS) based upon cost, delay, jitter, bandwidth, these are constantly deemed as multi-objective for intending multiple cast routing protocols. Conversely, mobile node has finite battery energy and the lifetime of network depending on its mobile node battery energy. If the mobile node has high battery energy consumption, it automatically reduces the network’s life time because of their route breaks. Alternatively, node’s battery energy has to be consumed to ensure higher level quality of services in multicast routing for transmitting the accurate data anywhere and anytime. Therefore, the network lifespan is deemed as multi-objective in the multicast routing (MR) problem. To overcome these issues, QoS and Dr. Valli Kumari Vatsavayi2 2Professor, Department of Electronic Communication and Engineering, Andhra University, visakhapatnam,Andhra Pradesh ,India. 2Email:vallikumariv001@yahoo.com Network Lifetime Aware Reliable Multicast Routing Protocol are proposed by applying Chaos integrated Cuckoo Search Rider Optimization Algorithm for effectual data transmission in MANET (QOS-MRP-CSROA-MANET). The proposed method is the joint execution of both the Cuckoo Search Algorithm with chaos theory (Chaotic-CSA) and Rider Optimization (ROA) algorithm and hence it is called as Chaotic-CSA-ROA, which is utilized to solve the MR problem of MANET. Here, the MR problem of MANET have five objectives, viz cost, delay, jitter, bandwidth, network lifetime are optimized with the help of Chaotic-CSA-ROA. Then the proposed method is simulated in NS2 simulator for validating the performance of the proposed QOS-MRP- CSROA-MANET system. Here, evaluation metrics, via delay, delivery ratio, drop, Network lifespan, overhead and throughput are analyzed with node, rate and speed. The proposed QOS-MRP-CSROA-MANET provide higher throughput in node as 32.9496% and 65.5839%, higher throughput in rate as 16.6049% and 30.4654%, higherthroughput in speed as 10.1298% and 7.0825%, low packet drop in node as 63.7313% and 52.2255%, low packet drop in rate as 51.5528% and 25.6220%, low packet drop in speed as 18.0857% and 24.5953% compared with existing methods, like QOS aware of multicast routing protocol using particle swarm optimization algorithm in MANET (QOS-MRP-PSOA-MANET) and QOS aware of multicast routing protocol using genetic algorithm in MANET (QOS-MRP-GA-MANET) respectively.

In this paper, we address the problem of multicast routing in mobile ad-hoc networks from the viewpoint of energy efficiency. In an ad-hoc wireless network, each node runs on a local energy source which has a limited energy life span. Thus, energy conservation is a critical issue in mobile ad-hoc networks. One approach for energy conservation is to establish routes that require lowest total energy consumption. This optimization problem is referred as the minimum-energy multicast routing problem (MEMRP). In this paper, propose new efficient heuristic algorithms for the construction of energy-efficient multicast routes in mobile ad-hoc networks. These algorithms exploit the broadcast nature of the wireless channel, and address the need for energy-efficient operations. Empirical studies show that our algorithms are able to achieve better performance than algorithms that have been developed for MEMRP.

The goal of wireless sensor networks is the maximum data gathering. Factors like energy, memory, bandwidth and processing capability affects the characteristics of the network which implies in reduced data collection. To avoid the reduction in data collection, mobile sensor nodes are used. They cover large area in short time and these networks are called as mobile wireless sensor networks (MWSN). In MWSN, set routing is used as one of the routing method for maximum data collection. In which the entire network is divided into many sets. This routing algorithm is applied for each set with the consideration that there is no node failure in the network. Here this work shows that how a new route is discovered if a node fails in a set using the Foldable Lookup Table (FLT) method. Also FLT method is compared with the routing table developed by fuzzy variables. Simulation is performed with OMNET++ simulator. Result shows the effectiveness of node failure in terms of delay and packet drops and how the route is maintained during node failure is shown with respect to delay.

An energy efficient and QoS aware routing protocol for wireless sensor and actuator networks

Ad Hoc wireless network consists of mobile nodes that do not rely on any fixed network infrastructure. The dynamic route is allocated for a pair of nodes by Ad Hoc on-demand routing protocol (AODV), that establishes a route only when a source node want to transmit data. Routes in Ad Hoc network can be broken caused by a node in the route may move out of their neighbor's signal range or node's battery may be ran out. Many algorithms have been developed to solve the problem [1],[6], one of them is break avoidance algorithm (AODV-BA [1]). However, using AODV-BA protocol, an upstream node of the broken link has to buffer packets during the route maintenance process. In case that the route maintenance is unsuccessful, the source node must re-establish a new route. In this paper, we propose AODV Backup Route Discovery with 2 Levels of Threshold (AODV-2T). The protocol tests for the power of its own battery power and its neighbors' RF signal. And it would cooperate with the neighbors to find a backup route as to fix the weak link problem where the first threshold is met. Consequently, if the power of signal or battery is fallen below the second threshold level, AODV-2T node could switch the data packet transmission to the new route without any delay. AODV-2T can reduce connection tear-off that causes packets lost and more routing control overhead by 15-18 percent compared to the original AODV and AODV-BA.