This study extends a mathematical model that integrates the location, allocation, inventory replenishment and routing decisions simultaneously. To cope with inherent uncertainty of parameters, we implement a continuous-time Markov process and derive the performance measures of the system. Using the obtained results, the problem is formulated as a mixed integer nonlinear programing model (MINLP)...

As mobile ad hoc network applications are deployed, security emerges as a central requirement..Position aided routing protocols can offer a significant performance increase over traditional ad hoc routing protocols. Boundary State Routing (BSR) is a geographic routing protocol which routes the data using the location of the nodes. Geographic routing protocols are known to be particularly suscep...

We present and analyze a reactive location service (RLS) for mobile ad hoc networks. RLS provides a mobile node in a wireless ad-hoc network with the means to inquire the current geographical position of another node on-demand and can be used as a building block for location-based routing. We provide a comparison of RLS to an ideal omniscient location service as well as to the complex Grid Loca...

Mobile IP is the proposed standard of IP based protocol for mobile internetworking. Mobile nodes register with their home agents for location updates as they roam across IP subnets. IP datagrams for mobile nodes are routed rst to their home agents before being tunneled to mobile nodes through their current foreign agents. This paper investigates dynamic location control for mobile nodes and int...

Accurate location information is important for event reporting, coverage estimation, and location-aware routing in a Wireless Sensor Network (WSN). Recently, a number of range-free localization schemes have been proposed to provide each static sensor with location information, which is represented by a rectangular region. However, most WSN applications are applied in outdoor environments where ...

Mobile ad-hoc networks (MANETs) are infrastructure-free networks of mobile nodes that communicate with each other wirelessly. There are several routing schemes that have been proposed and several of these have been already extensively simulated or implemented as well. The primary applications of such networks have been in disaster relief operations, military use, conferencing and environment se...

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