An opportunistic network (OPPNET) is a wireless networks without an infrastructure. In OPPNET, communication intermittently occurs when one node meets with another node. Thus, a connected path between the source and destination nodes rarely exists. For this reason, nodes need not only to forward messages but are also to store and carry messages as relay nodes. In OPPNET, several routing algorit...

In this paper, we propose a novel position-based routing protocol designed to anticipate the characteristics of an urban VANET environment. The proposed algorithm utilizes the prediction of the node’s position and navigation information to improve the efficiency of routing protocol in a vehicular network. In addition, we use the information about link layer quality in terms of SNIR and MAC fram...

Routing is challenging task in the ad hoc networks especially in Vehicular ad hoc networks (VANETs) where the network topology changes fast and frequently. Since the nodes in VANETs are vehicles, which are not stable and changing their position frequently. In Geocast routing a geographic region is chosen which may be a circle, rectangle, polygon or any other region. Circular region is mostly ch...

We introduce a new distributed location service, the hypercubic location service (HLS) for wireless mobile ad hoc networks. It provides information about geographic position of nodes, which is required by position based routing methods. Together with a position based routing, in particular with a greedy routing in appropriate spanner graphs, HLS contributes an efficient network layer of wireles...

Depth First Search (DFS) and position-based routing algorithms were proposed in literature. These are localised algorithms that guarantee the delivery for connected ad hoc and sensor wireless networks modelled by arbitrary graphs, including inaccurate location information for a destination node. This article first optimises an existing DFS-based routing scheme by eliminating from the candidate ...

the inventory routing problem (irp) arises in the context of vendor-managed systems. this problem addresses jointly solving an inventory management problem and a vehicle routing problem. in this paper, we consider a multi-depot multi-vehicle inventory routing problem in which suppliers produce one type of product to be delivered to customers during a finite time horizon. we propose a two-phase ...

A wireless sensor network needs a suitable multihop routing protocol to facilitate the communication between arbitrary sensor nodes. Position-based routing protocols are attractive for large-scale sensor networks due to their location awareness and scalability. A large number of position-based routing protocols use the greedy forwarding strategy. This paper presents an efficient implementation ...

in recent years, routing has been the most focused area in ad hoc networks research. on-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. most proposed on-demand routing protocols are built and relied on single route for each data session. whenever there is a link disconnection on the active ro...

In this paper we study source routing in an environment where imperfect state information is the norm. The uncertainty involved in several aspects of the routing process renders the route choices less than “optimal”. We start by conducting an experiment that compares the performance of an “inference”-based routing scheme to that of the traditional approach based on delayed link state broadcast....