Two Techniques For Fast Computation of Constrained Shortest Paths
A major obstacle against implementing distributed multimedia applications such as web broadcasting, video teleconferencing and remote diagnosis, is the difficulty of ensuring quality of service (QoS) over the Internet. A fundamental problem that is present in many important network functions such as QoS routing, MPLS path selection and traffic engineering is to find the constrained shortest path that satisfies a set of constraints. For interactive real time traffic, t ....etc

[:=Read Full Message Here=:]

We present a method to compute the delay-constrained multicast routing tree by employing chaotic neural networks. The experimental result shows that the noisy chaotic neural network (NCNN) provides an optimal solution more often compared to the transiently chaotic neural network (TCNN) and the Hopfield neural network (HNN). Furthermore, compared with the bounded shortest multicast algorithm (BSMA), the NCNN is able to find multicast trees with lower cost. ....etc

[:=Read Full Message Here=:]

TWO TECHNIQUES FOR FAST COMPUTATION OF CONSTRAINED SHORTEST PATH

Abstract: Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, MPLS path selection, ATM circuit routing, and traffic engineering. The problem is to find the cheapest path that satisfies certain constraints. In particular, finding the cheapest delay-constrained path is critical for real-time data flows such as voice/video calls. Because it is NP-complete, much research has been designing heuristic algorithms that solve the ....etc

[:=Read Full Message Here=:]

Two Techniques for Fast Computation of Constrained Shortest Paths

abstract:
Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, MPLS path selection, ATM circuit routing, and traffic engineering. The problem is to find the cheapest path that satisfies certain constraints. In particular, finding the cheapest delay-constrained path is critical for real-time data flows such as voice/video calls. Because it is NP-complete, much research has been designing heuristic algorithms tha ....etc

[:=Read Full Message Here=:]

Reliable Multi-hop Routing with Cooperative Transmissions in Energy-Constrained Networks
Abstract
We present a novel approach in characterizing theoptimal reliable multi-hop virtual multiple-input single-output(vMISO) routing in ad hoc networks. Under a high node densityregime, we determine the optimal cardinality of the cooperationsets at each hop on a path minimizing the total energy cost pertransmitted bit. Optimal cooperating set cardinality curves arederived, and they can be used to determine the optimal routingstrategy based on ....etc

[:=Read Full Message Here=:]

Presented by:
DEEPTHI.K


A System for Peer-to-Peer Video Streaming in Resource Constrained Mobile Environments
Introduction
 Peer-to-Peer based near-live video streaming is becoming popular with users of fixed-line broadband.
 Unavailable to mobile users because they cannot meet the bitrates requirements.
 P2P-TV system enables users in a physical proximity to retrieve video chunks in a cooperative way.
 The coordinated and efficient usage of all wireless resources available to a group of mobil ....etc

[:=Read Full Message Here=:]

Enhanced Genetic Algorithm Approach for Security Constrained Optimal Power Flow Including FACTS Devices

Abstract
his paper presents a genetic algorithm basedapproach for solving security constrained optimal power flowproblem (SCOPF) including FACTS devices. The optimal location ofFACTS devices are identified using an index called overload indexand the optimal values are obtained using an enhanced geneticalgorithm. The optimal allocation by the proposed method optimizesthe investment, taking into account its effects on security in te ....etc

[:=Read Full Message Here=:]

hello sir, i am doing my mtech project on this topic. could you plz help me for seminar ppts and brief guidence about this project. and i need help in coding also. can u plz provide me related topics. ....etc

[:=Read Full Message Here=:]

Abstract
A fundamental problem in wireless sensor networks is to maximize network lifetime under given energy constraints. In this paper, we study the network lifetime problem by considering not only maximizing the time until the first node fails, but also maximizing the lifetimes for all the nodes in the network, which we define as the Lexicographic Max-Min (LMM) node lifetime problem. The main contributions of this paper are two-fold. First, we develop a polynomial-time algorithm to derive the LMM-optimal node lifetime vector, which effec ....etc

[:=Read Full Message Here=:]

Hop Constrained Energy-Efficient Broadcasting: Insights from Massively Dense Ad Hoc Networks
Bulbul, K. Ercetin, O. Unluyurt, T. Dept. of Manuf. Syst. & Ind. Eng., Sabanci Univ., Istanbul;
This paper appears in: Mobile Computing, IEEE Transactions on Publication
Abstract

We consider source-initiated broadcast session traffic in an ad hoc wireless network operating under a hard constraint on the end-to-end delay between the source and any node in the network. We measure the delay to a given node in the number of hops data trav ....etc

[:=Read Full Message Here=:]