The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). This paper innovatively puts forward the concept of “time-slice” to make full use of the respective advantages of single copy strategy and multiple-copy strategy thus getting a right balance between high message delivery ratio and low network overloads. We ...

Traditional heavyweight routing algorithms are not suitable for resource constrained IEEE 802.15.4 [15] complaint devices. Although, ZigBee [21] provided an addressing scheme and a table-free Tree routing algorithm for such devices, it has several limitations [6, 7, 8, 9]. In this paper, we have proposed a flexible, variable-length addressing scheme together with a new lightweight, table-free r...

In this paper, the fuzzy multi-depot vehicle routing problem with simultaneous pickup and delivery (FMDVRP-SPD) is investigated. The FMDVRP-SPD is the problem of allocating customers to several depots, so that the optimal set of routes is determined simultaneously to serve the pickup and the delivery demands of each customer within scattered depots. In the problem, both pickup and delivery dema...

In this paper, we consider the problem of routing multiple robots to service spatially distributed requests at specified time instants. We show that such a routing problem can be formulated as a pure assignment problem. Additionally, we incorporate connectivity constraints into the problem by requiring that range-constrained robots ensure a connected information exchange network at all times. W...

Following the seminal work of Unger et al. based on building mesh-like structures on top of a P2P network, we introduced an improved version of Compass a routing and load balancing algorithm based on direction-scopes for message delivery in such kind of networks. In this paper we evaluate and compare the performance of this scope-based Compass against the self-balanced and self-adaptive routing...

We propose a new delay-constrained minimumhop distributed routing algorithm (DCMH) for unicastrouting. DCMH uses a novel path feasibility prediction (PFP) model that is able to predict the feasibility of a tentative routing path, and employs a crankback facility. It is a hybrid algorithm where it uniquely integrates the use of local-state and the global binary connectivity information maintaine...

Genetic Algorithm with Multiobjective formulations are realistic models for many complex engineering optimization problems such as QoS routing protocol for mobile ad hoc network. The paper presents QoS routing protocol for MANET with specialized encoding, initialization, crossovers, mutations, fitness selections and route search using genetic algorithm with multiple objectives. The aim is to fi...

This paper considers a variation of the Elementary Constrained Shortest Path Problem in which nodes are separated into subsets and a feasible path through the network may visit at most one node from each subset. We refer to this problem as the Multiple Choice Elementary Constrained Shortest Path Problem (MC-ECSPP). The MC-ECSPP arises as a subproblem in branch-and-price approaches for variation...

| Parallel machines have the potential to satisfy the large computational demands of real-time applications. These applications require a predictable communication network, where time-constrained traac requires bounds on throughput and latency while good average performance suuces for best-eeort packets. This paper presents a new router architecture that tailors low-level routing, switching , a...

Based on the characteristics of perishable goods, we extend the location-routing problem with distance constraints by adopting chance constrained goal programming approach to solve the uncertainty and to express the different priority levels of decisions. The random of depot construction costs and vehicle routing travel time is taken into account. Meanwhile, a two-stage genetic algorithm incorp...