In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...

heretofore several position-based routing protocols have been developed for mobile ad hoc networks. many of these protocols assume that a location service is available which provides location information on the nodes in the network.our solutions decrease location update without loss of query success rate or throughput and even increase those.simulation results show that our methods are effectiv...

Existing geographic routing algorithms face serious challenges due to location errors, nonplanarity issues and overhead of location service. To solve these issues, we propose Topological Cluster Based Geographic Routing that combines topology-based routing and geographic routing. It is a localized routing scheme where the geographic routing is performed on an overlay network of topological clus...

We propose an integrated location management and location-aided routing system which organizes the Mobile Ad-hoc Network (MANET) into a two-level hierarchy with the help of Voronoi diagrams. The location information of mobile nodes in a Voronoi zone is summarized using Bloom Filters and distributed among the location servers in the zones. The integrated system has the property that the destinat...

Due to the utilization of location information, geographic ad hoc routing presents superiority in scalability compared with traditional topology-based routing in mobile ad hoc networks. However, the consequent solicitation for location presence incurs severe concerns of location privacy, which has not been properly studied. In this paper, we attempt to preserve location privacy based on the ide...

Abstract Mobile Ad-Hoc Networks are currently experiencing a second youth in terms of research interest as well providing benefits to our society. Clearly, this has been fostered by the wide range applications that have become actually feasible thanks pervasive and increasing presence smartphones, drones, sensors other small devices with communication sensing capability. Aiming deploy solutions...

Hub location problems are widely studied in the area of location theory, where they involve locating the hub facilities and designing the hub networks. In this paper, we present a new and robust solution based on a genetic search framework for the uncapacitated single allocation hub location problem (USAHLP). To present its e8ectiveness, we compare the solutions of our GA-based method with the ...

In this paper we consider a capacitated single allocation p-hub median problem (CSApHMP) which is to determine the location of p hubs, the allocation of non-hub nodes to hubs in the logistics network. This problem is formulated as an integer programming model with the objective of minimizing the sum of total transportation cost and fixed cost of the selected p hubs. Since the CSApHMP is NP-hard...