This paper addresses combined location/routing problems defined on trees, where not all vertices have to be necessarily visited. A mathematical programming formulation is presented, which has the integrality property. The formulation models a directed forest where each connected component hosts at least one open facility, which becomes the root of the component. The problems considered can also...

Many location–based MANET routing algorithms rely on local decisions based on coordinates of neighboring nodes. In order to deal with the dead ends reached by the deterministic nature of location–based routing, randomized versions have been proposed. Randomization is seen also as helpful for dealing with highly dynamic topologies due to mobility. In addition, directional transmission is conside...

Routing protocols for mobile ad hoc networks can be classified into two categories: topological routing and geographic routing. However, most of the existing protocols use only one routing strategy for different types of networks. Routing protocols that give good performance for sparse networks may not perform well in dense networks. Routing protocols that are suitable for small networks may no...

In the real world, mobile users routinely move in between and spend a considerable amount of time at a few specific places of social interest. For example, a regular day in the life of a professor may involve routine visits to his/her office, a classroom or a conference room, while spending considerable amount of time in each of these venues. Thus, although it is hard to keep track of an user a...

This paper introduces the Latency Location-Routing Problem (LLRP) whose goal is to minimize waiting time of recipients by optimally determining both the locations of depots and the routes of vehicles. The LLRP is customer oriented by pursuing minimization of the latency instead of minimization of the length of routes. One of the main applications of this problem is the distribution of supplies ...

A approximation algorithm for an optimization problem runs in polynomial time for all instances and is guaranteed to deliver solutions with bounded optimality gap. We derive such algorithms for different variants of capacitated location routing, an important generalization of vehicle routing where the cost of opening the depots from which vehicles operate is taken into account. Our results orig...

One of the most challenging problems in wireless sensor networks is the design of scalable and efficient routing algorithms without location information. The use of specialized hardware and/or infrastructure support for localization is costly and in many deployment scenarios infeasible. In this study, the wave mapping coordinate (WMC) system to address the localization problem is introduced for...

In recent years, Wireless Sensor Network has drawn considerable attention from research community due to wide range of applications used. The most notable challenge which is threatening the WSN is source location privacy. Preserving the source location means hiding the physical location of the source from the adversaries and increasing difficulty for adversaries in tracing the message path back...

The aim is to develop a robust methodology for dispatching and routing of emergency vehicles (EVs) in a post-disaster environment with the support of data fusion for decision-making. In this work we consider an earthquake scenario with a large number of casualties needing medical attention. With the influx of information (about the casualties, road and traffic conditions, etc.) data is fused to...