Constraint-based path selection is an invaluable component of a full-ßedged quality of service (QoS) architecture. It aims at identifying a path that satisÞes a set of constraints (e.g., bounded delay, packet loss rate, etc.). Unfortunately, multi-constrained path selection problems are NPcomplete, and therefore often considered computationally intractable. This has led to the proposal of many ...

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...

The Ad Hoc network has attracted more and more attention with its good performance and special application. Many transactions, such as real-time multimedia and audio-video transmission have strict demand for QoS parameters, which requires that we find a QoS routing in multi-constrained conditions. Generally, multiconstrained QoS routing is an NP-Complete problem. The drawbacks of the ad hoc net...

multicast routing is one of the most important services in multi radio multi channel (mrmc) wireless mesh networks (wmn). multicast routing performance in wmns could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. in this paper we want to address the multicast routing problem for a given channel assignment in wmns. the channels...

This work investigates allocation of tasks to multi-robots when tasks are spatially distributed and constrained to be executed within assigned time windows. Our work explores the interaction between scheduling and optimal routing. We propose the Time-Sensitive Sequential Single-Item Auction algorithm as a method to allocate tasks with time windows in multi-robot systems. We show, experimentally...

In this work we study the combination of multicost routing and adjustable transmission power in wireless ad hoc networks, so as to obtain dynamic energyand interference-efficient routes to optimize network performance. In multi-cost routing, a vector of cost parameters is assigned to each network link, from which the cost vectors of candidate paths are calculated. Only at the end these paramete...