09-04-2014, 03:59 PM
MULTICAST MULTI-PATH POWER EFFICIENT ROUTING IN MOBILE ADHOC NETWORKS
[attachment=60869]
ABSTRACT:
The proposal of this paper presents a measurement-based routing algorithm to load balance intra domain traffic along multiple paths for multiple multicast sources. Multiple paths are established using application-layer overlaying. The proposed algorithm is able to converge under different network models, where each model reflects a different set of assumptions about the multicasting capabilities of the network. The algorithm is derived from simultaneous perturbation stochastic approximation and relies only on noisy estimates from measurements. Simulation results are presented to demonstrate the additional benefits obtained by incrementally increasing the multicasting capabilities. The main application of mobile ad hoc network is in emergency rescue operations and battlefields. This paper addresses the problem of power awareness routing to increase lifetime of overall network. Since nodes in mobile ad hoc network can move randomly, the topology may change arbitrarily and frequently at unpredictable times. Transmission and reception parameters may also impact the topology. Therefore it is very difficult to find and maintain an optimal power aware route. In this work a scheme has been proposed to maximize the network lifetime and minimizes the power consumption during the source to destination route establishment. The proposed work is aimed to provide efficient power aware routing considering real and non real time data transfer.
INTRODUCTION:
Multicast traffic over the Internet is growing steadily with increasing number of demanding applications including Internet broadcasting, video conferences, data stream applications and web-content distributions. Many of these applications require certain rate guarantees, and demand that the network be utilized more efficiently than with current approaches to satisfy the rate requirements. Traffic mapping (load balancing) is one particular method to carry out traffic engineering, which deals with the problem of assigning the traffic load onto pre-established paths to meet certain requirements. Our focus is to scrutinize the effects of load balancing the multicast traffic in an intra domain network. Propose a solution to optimally distribute the traffic along multiple multicast trees. However, the solution covers the case when there is only one active source in the network. In addition, it is assumed that the gradient of an analytical cost function is available, which is continuously differentiable and strictly convex. These assumptions may not be reasonable due to the dynamic nature of networks.
EXISTING SYSTEM:
Existing a power control loop, similar to those commonly found in cellular networks, for ad-hoc wireless networks. Mobile ad-hoc networking involves peer-to-peer communication in a network with a dynamically changing topology. Achieving energy efficient communication in such a network is more challenging than in cellular networks since there is no centralized arbiter such as a base station that can administer power management. We use a comprehensive simulation infrastructure consisting of group mobility, group communication and terrain blockage models. A major focus of research in ad-hoc wireless networking is to reduce energy consumption because the wireless devices are envisioned to have small batteries and be incapable of energy scavenging. We show that this power control loop reduces energy consumption per transmitted byte by 10 - 20%. Furthermore, we show that it increases overall throughput by 15%.
PROPOSED SYSTEM:
In this paper present multicast traffic over the Internet is growing steadily with increasing number of demanding applications including Internet broadcasting, and data stream applications and web-content distributions. The proposal in this paper presented a distributed optimal routing algorithm to balance the load along multiple paths for multiple multicast sessions. In addition, we address the optimal multipath multicast routing problem in a more general framework than having multiple trees. We consider different network models with different functionalities. The proposed power aware multicast identifies the characteristics of the proposed routing algorithm. It evaluates its performance under various network conditions. In networks consisting of these nodes, where it is impossible to replenish the nodes’ power, techniques for energy-efficient routing as well as efficient data dissemination between nodes is crucial. An energy-efficient mechanism for unipath routing in sensor networks called directed diffusion has been proposed.
[attachment=60869]
ABSTRACT:
The proposal of this paper presents a measurement-based routing algorithm to load balance intra domain traffic along multiple paths for multiple multicast sources. Multiple paths are established using application-layer overlaying. The proposed algorithm is able to converge under different network models, where each model reflects a different set of assumptions about the multicasting capabilities of the network. The algorithm is derived from simultaneous perturbation stochastic approximation and relies only on noisy estimates from measurements. Simulation results are presented to demonstrate the additional benefits obtained by incrementally increasing the multicasting capabilities. The main application of mobile ad hoc network is in emergency rescue operations and battlefields. This paper addresses the problem of power awareness routing to increase lifetime of overall network. Since nodes in mobile ad hoc network can move randomly, the topology may change arbitrarily and frequently at unpredictable times. Transmission and reception parameters may also impact the topology. Therefore it is very difficult to find and maintain an optimal power aware route. In this work a scheme has been proposed to maximize the network lifetime and minimizes the power consumption during the source to destination route establishment. The proposed work is aimed to provide efficient power aware routing considering real and non real time data transfer.
INTRODUCTION:
Multicast traffic over the Internet is growing steadily with increasing number of demanding applications including Internet broadcasting, video conferences, data stream applications and web-content distributions. Many of these applications require certain rate guarantees, and demand that the network be utilized more efficiently than with current approaches to satisfy the rate requirements. Traffic mapping (load balancing) is one particular method to carry out traffic engineering, which deals with the problem of assigning the traffic load onto pre-established paths to meet certain requirements. Our focus is to scrutinize the effects of load balancing the multicast traffic in an intra domain network. Propose a solution to optimally distribute the traffic along multiple multicast trees. However, the solution covers the case when there is only one active source in the network. In addition, it is assumed that the gradient of an analytical cost function is available, which is continuously differentiable and strictly convex. These assumptions may not be reasonable due to the dynamic nature of networks.
EXISTING SYSTEM:
Existing a power control loop, similar to those commonly found in cellular networks, for ad-hoc wireless networks. Mobile ad-hoc networking involves peer-to-peer communication in a network with a dynamically changing topology. Achieving energy efficient communication in such a network is more challenging than in cellular networks since there is no centralized arbiter such as a base station that can administer power management. We use a comprehensive simulation infrastructure consisting of group mobility, group communication and terrain blockage models. A major focus of research in ad-hoc wireless networking is to reduce energy consumption because the wireless devices are envisioned to have small batteries and be incapable of energy scavenging. We show that this power control loop reduces energy consumption per transmitted byte by 10 - 20%. Furthermore, we show that it increases overall throughput by 15%.
PROPOSED SYSTEM:
In this paper present multicast traffic over the Internet is growing steadily with increasing number of demanding applications including Internet broadcasting, and data stream applications and web-content distributions. The proposal in this paper presented a distributed optimal routing algorithm to balance the load along multiple paths for multiple multicast sessions. In addition, we address the optimal multipath multicast routing problem in a more general framework than having multiple trees. We consider different network models with different functionalities. The proposed power aware multicast identifies the characteristics of the proposed routing algorithm. It evaluates its performance under various network conditions. In networks consisting of these nodes, where it is impossible to replenish the nodes’ power, techniques for energy-efficient routing as well as efficient data dissemination between nodes is crucial. An energy-efficient mechanism for unipath routing in sensor networks called directed diffusion has been proposed.