Routing plays a very significant role in multi hop data dissemination in Vehicular Ad-Hoc Networks (VANETs). Wehave proposed a Position based Adaptive Routing (PAR) protocol which is scalable for different network densities in VANETs. This scheme uses Preferred Group Broadcasting (PGB) for route discovery. In this mode, after broadcasting the request for route discovery the source node starts l...

We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no memory and uses no randomization, (2) no equivalent result is possible for convex subdivisions, (3) there is no competitive online routing algorithm under the Euclidean distance metric in arbitrary triangulations, and...

In last decades, mobile factories have been used due to their high production capability, carrying their equipment and covering rough and uneven routes. Nowadays, more companies use mobile factories with the aim of reducing the transportation and manufacturing costs. The mobile factory must travel between the suppliers, visit all of them in each time period and return to the initial location of...

Sleep and wake-up scheduling of sensor nodes is an efficient solution to prolong the network lifetime. However, existing scheduling algorithms may significantly decrease the number of active nodes so that the networkmay be intermittently connected. In such networks, traditional geographic routing protocols are inappropriate to obtain low latency routes due to route discovery and data forwarding...

among structured peer-to-peer systems, chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. however, chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing latency an...

In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a long-term horizon, is a generalization of the vehicle routing problem with vendor managed inventory replenishment. The particularity of this problem is that the vendor monitors the customers’ inventories, deciding when and how m...

Mobile Adhoc Networks (MANETs) are the self-organized networks in which connections are not established for exchange the information. In MANET, there are major problems like scalability, dynamic topology, high mobility and routing. The network can be damaged due to the high mobility. Topology based routing can fail when there is a dynamic change in the network topology. To avoid these problems,...

Over the past few years, computation capability of field-programmable gate arrays (FPGAs) has increased tremendously. This led to increase in complexity designs implemented on FPGAs and time taken by FPGA back-end flow. The flow comprises many steps, routing is one most critical steps among them. Routing normally constitutes more than 50% total an optimization at this step can lead overall In w...