—Route selection in hybrid wireless mesh networks (WMNs) that contain mobile mesh clients with constrained energy is a critical research challenge. Existing routing protocols take the advantages of backbone mesh routing protocols but lack of consideration of the characteristics of clients. Most of these protocols capture interference and traffic load, but lack of considering the effect of mobi...

In this paper, the requirements of routing due to the multimedia applications are briefly discussed. In order to solve the QoS constrained routing effectively and efficiently, the scheme of routing based on a genetic algorithm (GA) is proposed after the analysis of related works. Then the QoS routing algorithms for unicast and multicast based on improved GA are described. Finally, the results o...

We investigate the bandwidth constrained routing problem in wireless mesh networks. Whereas the bandwidth constrained routing problem is solvable in polynomial time in wired networks, it is complicated by the intra-flow interference in wireless networks. We prove that the problem is NP-Complete using a general interference model. We propose a heuristic routing algorithm, ADFS, which is an augme...

The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steiner Tree, as the underpinning mathematical structure, is a well-known NP-complete problem. In this paper we investigate a variable neighborhood descent (VND) search, a variant of variable neighborhood search, for the delay-constr...

Use qij to denote the (i; j)-entry of the matrix Q (i; j = 1; 2). Then (Q) reads as (Q) = 0(1 + p 05)r 0 2 0(2 0 p 05)r + (1 + p 05) 2r + (1 0 p 05) 0(1 + p 05)r 0 2 (2) where r = (01+ p 05)q 11 0(2+ p 05)q 12 +2q 21 + (01+ p 05)q 22 : (3) Because any stabilizing controller can be obtained from the (2, 1)-and (2, 2)-entries of (2), we are interested in the set of r's of (3), that is, the ideal ...

As a NP-Complete problem, multicast routing with delay constraint is a research difficulty in routing problem. Tabu Search is artificial intelligence algorithm, which is an extension of local search algorithm and has simple realization and well properties. In this paper, an efficient algorithm based on Tabu Search for Delay-Constrained Low-Cost Multicast Routing is proposed to solve delay-const...

As the traffic load control is very important for the task scheduling in wireless sensor networks, this paper discusses how to design an effective routing algorithm for wireless sensor networks with traffic load constrained. Firstly, internal structure of a sensor node in wireless sensor networks is analyzed. Secondly, how to design an effective traffic load constrained routing algorithm for wi...

Now-a-days energy-efficient routing in wireless sensor network is an important research issue. Due to limited battery-power sensor nodes are highly energy constrained. So to enhance the lifetime of sensor network we need energy-efficient routing protocol. According to network topology, routing protocol can be divided into flat and hierarchical routing protocol. This paper surveys different ener...

Routing is a basic step for data exchange. In wireless ad-hoc networks each node acts as a router and executes a routing protocol. Wireless ad-hoc networks are highly resource constrained in terms of network topology, memory and computation power. The reliable data transfer is a difficult task in wireless ad-hoc networks because of resource constraints. A mobile ad-hoc network (MANET) is a kind...

Increasing scope and applications of integrated optics necessitates the development of automated techniques for physical design of optical systems. A key area of integrated optic design is waveguide routing, which currently lacks the level of automation found in VLSI design. Unlike VLSI, where signal nets are routed with metal layers and vias, integrated optics is a planar technology and lacks ...