We provide an overview of the evolution of routing from its origins, even before the ARPANET, to recent algorithms that provide some Quality of Service, focusing on unicast distributed routing algorithms. We start our scheme with shortest path routing and optimal routing and conclude it with constrained routing protocols as well as a quick review of Ad-Hoc Routing protocols. KeywordsBest-effort...

Multi-constrained path (MCP) selection, in which the key objective is to search for feasible paths satisfying multiple routing constraints simultaneously, is known to be an NP-Complete problem. Multi-constrained path optimization (MCPO) is different from MCP mainly in that, the feasible paths selected should also be optimal with regard to an optimization metric, which makes path computation in ...

One of the important applications in Wireless Sensor Networks (WSNs) is video surveillance that includes the tasks of video data processing and transmission. Processing and transmission of image and video data in WSNs has attracted a lot of attention in recent years. This is known as Wireless Visual Sensor Networks (WVSNs). WVSNs are distributed intelligent systems for collecting image or video...

Designing a multi-constrained QoS (Quality of service) communication protocol for mission-critical applications that seeks a path connecting source node and destination node that satisfies multiple QoS constrains such as energy cost, delay, and reliability imposes a great challenge in Wireless Sensor Networks (WSNs). In such challenging dynamic environment, traditional routing and layered infra...

QoS Routing aims to find paths between senders and receivers satisfying the QoS requirements of the application which efficiently using the network resources and underlying routing algorithm to be able to find low-cost paths that satisfy given QoS constraints. The problem of finding least-cost routing is known to be NP hard or complete and some algorithms have been proposed to find a near optim...

Vehicle Routing Problem with Time windows (VRPTW) is an example of scheduling in constrained environment. It is a well known NP hard combinatorial scheduling optimization problem in which minimum number of routes have to be determined to serve all the customers within their specified time windows. So far different analytic and heuristic approaches have been tried to solve such problems. In this...

In this paper, we propose a procedure, based on statistical design of experiments and gradient descent, that finds effective settings for parameters found in heuristics. We develop our procedure using four experiments. We use our procedure and a small subset of problems to find parameter settings for two new vehicle routing heuristics. We then set the parameters of each heuristic and solve 19 c...

Constraint-based routing is an invaluable part of a full-ßedged Quality of Service (QoS) architecture. Unfortunately, routing with multiple additive constraints is known to be a NP-complete problem. Hence, accurate constraint-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The expected impact of such a constrained-based routing algorithm has resulted in ...

Wireless Sensor Networks (WSN) is usually made by cooperation of number of limited sensor devices which are connected over the wireless media. There are a lot of its application in military, health and industry. Due to limitations of sensor devices, the networks exposed to various kinds of attacks and conventional defenses against these attacks are not suitable due to the resource constrained n...

between source and destination satisfying the QoS requirements which efficiently using the network resources and underlying routing algorithm and to find low-cost paths that satisfy given QoS constraints. One of the key issues in providing end-to-end QoS guarantees in packet networks is determining feasible path that satisfies a number of QoS constraints. We present a Optimized Multi-Constraine...