A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of resea...

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

The simultaneous usage of multiple paths in communication networks has the potential to generate important benefits like better utilization of available resources and higher resiliency. Routing solutions with poor adaptive performance can benefit from multi-path techniques, since information about alternative paths is gathered beforehand. In particular, this study explores the embracement of mu...

MANETs (Mobile Ad Hoc Networks) are wireless networks with characteristics such as self organizing or autonomous, multi-hop and resource constrained. These resource constraints includes limited power, bandwidth etc. which in turn increases the difficulty in MANETs routing. The problem space includes route break, control overhead, limited energy etc. Ad-hoc On Demand Distance Vector (AODV) is th...

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

this paper presents a multi-criteria vehicle routing problem with soft time windows (vrpstw) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. in this case, the fleet is heterogene-ous. the vrpstw consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. it is assumed that this relaxation a...

The problem of finding multi-constrained paths has been addressed by several QoS routing algorithms. While they generally satisfy the application requirements, they often do not consider the perspective of service providers. Service providers aim at maximizing the throughput and the number of accepted requests. These goals have been addressed by traffic engineering algorithms considering bandwi...

In wireless sensor networks (WSNs), the communication radius of a single sensor node is constrained. Thus, many-to-one and multi-hop routing protocols are designed to relay collected data back to the sink node. One of the challenges handled by present routing protocols is to prevent or reduce traffic congestion, which inevitably causes high packet drop rate, low energy efficiency, and long end-...

The main issue addressed in this paper is the quality of service (QoS) routing protocol for mobile ad hoc networks (MANET). The objective is to improve the packet delivery ratio in QoS constrained communications in comparison to other well-known protocols that use distributed multi-path routing. To accomplish that, a new protocol is developed to reduce the effects of distrustful environment of ...