Delay Tolerant networks (DTNs) are intermittently connected mobile networks in which the end-to-end paths do not exist. Data delivery in such networks relies upon the contacts that use “store-carry-and-forward” paradigm to forward message from one node to another. However, such intuitive methodology encounters low message delivery ratio and high data transmission delay when applying to differen...

MANET is a communication network with infrastructure less environment. It consists of large number of mobile nodes or devices that can change location and configure it dynamically. The devices are also moves independently in arbitrary location. The data transaction in MANET is called routing. Routing is a main feature of Manet and it has many issues for ensure the QoS (Quality of Service). Ther...

We propose a mobility-assisted on-demand routing algorithm for mobile ad hoc networks in the presence of location errors. Location awareness enables mobile nodes to predict their mobility and enhances routing performance by estimating link duration and selecting reliable routes. However, measured locations intrinsically include errors in measurement. Such errors degrade mobility prediction and ...

sink location is considered as a basic service in geographic routing in wireless sensor networks. obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. in this paper, a sink location algorithm based on fano plane is proposed. the research challenge is how to ensure the intersection of two slq and sla rou...

In this paper, a comprehensive model for hub location-routing problem is proposed which no network structure other than connectivity is imposed on backbone (i.e. network between hub nodes) and tributary networks (i.e. networks which connect non-hub nodes to hub nodes). This model is applied in public transportation, telecommunication and banking networks. In this model locating and routing is c...

---Mobile Ad Hoc Networks (MANETs) use various anonymous routing protocols in order to provide security from outside observers. To offer high anonymity protection at low cost, An Anonymous Location Based Efficient Routing Protocol (ALERT) is proposed. ALERT dynamically partitions the network area into zones and randomly chooses the intermediate relay nodes to form a anonymous route. ALERT achie...

In this paper we present an algorithm for a location based adaptive routing protocol that uses both geographic routing and reinforcement learning to maximize throughput in our mobile vehicle network. We use reinforcement learning to determine the correct direction to forward a packet and then use geographic routing to forward a packet toward the network sink. We use an extension of the q-routin...

In this paper we classify the greedy routing in sensor networks into two categories, strong greedy routing and weak greedy routing. Most existing work mainly focuses on weak greedy routing over geographic location network or strong greedy routing over greedy embedding network. It is a difficult job and needs much cost to obtain geographic location or greedy embedding of the network. We propose ...