One of the greatest challenges in vehicular ad-hoc networks (VANET) is to establish stable routing. Due to dynamic network , keeping stable routing is a difficult problem. Therefore, trust-based stable routing (TBSR) protocol is proposed in this paper. The node is chosen to be next-hop node until it reaches to trust threshold. To evaluate the node trust, we introduce the node' role trust, inter...

A subjectively influenced router for vehicles in a fourjunction traffic system is presented. The router is based on a 3-layer Backpropagation Neural Network (BPNN) and a greedy routing procedure. The BPNN detects priorities of vehicles based on the subjective criteria. The subjective criteria and the routing procedure depend on the routing plan towards vehicles depending on the user. The routin...

An Euclidean greedy embedding of a graph is a straight-line embedding in the plane, such that for every pair of vertices s and t, the vertex s has a neighbor v with smaller distance to t than s. This drawing style is motivated by greedy geometric routing in wireless sensor networks. A Christmas cactus is a connected graph in which every two simple cycles have at most one vertex in common and in...

We introduce a measure of greedy connectivity for geographical networks (graphs embedded in space) and where the search for connecting paths relies only on local information, such as a node's location and that of its neighbors. Constraints of this type are common in everyday life applications. Greedy connectivity accounts also for imperfect transmission across established links and is larger th...

We propose a novel topology to improve the routing performance of Content-Addressable Network overlays while minimizing the maintenance overhead during nodes churn. The key idea of our approach is to establish a P2P tree structure (CAN tree) by means of equipping each node with a few long links towards some distant nodes. The long links enhance routing flexibility and robustness against failure...

In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, which causes conflicting packets to be deflected away from their destinations. We study one-to-many batch routing problems on arbitrary tree topologies. We present two hot-potato routing algorithms, one deterministic and one randomized, whose routing times are asymptotically near-optimal (within pol...

Cartesian routing is a fast packet routing mechanism intended for geographic addresses and can effectively accelerate the packet routing process within a local or metropolitan environment. The wide area Cartesian routing described in this paper is an extension of the Cartesian routing algorithms designed to make the exchange of internetwork packets between geographical regions possible. It also...

In this paper, we explore physical layer cooperative communication in order to design network layer routing algorithms that are energy efficient. We assume each node in the network is equipped with a single omnidirectional antenna and that multiple nodes are able to coordinate their transmissions in order to take advantage of spatial diversity to save energy. Specifically, we consider cooperati...

In this paper, three new dynamic, low delay multicast routing algorithms based on the greedy tree technique are proposed; Source Optimised Tree, Topology Based Tree and Minimum Diameter Tree. A simulation analysis is presented showing various performance aspects of the algorithms, in which a comparison is made with the greedy and core based tree techniques. The effects of the tree source locati...