The latency location routing problem (LLRP), a combination of the facility and cumulative capacitated vehicle problem, is recently proposed variant problems. It corresponds to customer-centric in which aim minimize sum arrival times at customers. This paper proposes three novel metaheuristic algorithms solve LLRP. They use simulated annealing framework, after each temperature reduction intensif...

We propose a new routing protocol suite composed of the Tapestry routing and location protocol over the IP routing protocol(TAP/IP) to increase the probability that a packet delivered by the routing layer will successfully reach it’s destination. This will benefit any transport layer, such as TCP, that uses timeouts to determine when it should retransmit packets. Tapestry is the routing/locatio...

An efficient stateless routing is possible because geographical routing protocol has many advantages of location information in mobile Ad-Hoc networks (MANETs). Such routing protocol, however, is significantly dependent on the existence of scalable location management services. In this paper, we propose a hierarchical location management (HLF) scheme considering the population of mobile nodes b...

In this paper, we introduce a new location-based routing protocol INGEO (INdoor GEOgraphic Routing Protocol) for ad hoc networks based on an indoor location system. We aim at extracting an optimum topology from the dynamic and irregular topology of a mobile ad hoc network to reach more quickly the destination applying an indoor geographic routing. Our scheme operates in a loopfree manner and at...

With the rapid development of wireless communication technologies, mobile social networks (MSNs) become more and more popular and have attracted much attention from researchers. In this paper, we address the routing issue in MSNs where a set of social related mobile devices communicate opportunistically and intermittently. Existing routing strategies are mostly based on location information (i....

this paper proposes an efficient network architecture to improve energy consumption in wireless sensor networks (wsn). the proposed architecture uses a mobile data collector to a partitioned network. the mobile data collector moves to center of each logical partition after each decision period. the mobile data collector must declare its new location by packet broadcasting to all sensor nodes. h...

Location-Routing Problem (LRP) can model several life situations. In this paper we study The Capacitated Location Routing Problem (CLRP) which is defined as a combination of two problems: the Facility Location Problem (FLP) and the Vehicle Routing problem (VRP). We propose a twophase approach to solve the CLRP. The approach is based on Simulated Annealing algorithm (SA) and Ant Colony System (A...