We give a unified view to greedy geometric routing algorithms in ad hoc networks. For this, we first present a general form of greedy routing algorithm using a class of objective functions which are invariant under congruent transformations of a point set. We show that several known greedy routing algorithms such as Greedy Routing, Compass Routing, and Midpoint Routing can be regarded as specia...

Mobile Ad-hoc Networks (MANETs) comprises of a set of nodes connected by wireless links. The network is ad hoc because it does not rely on a preexisting infrastructure, such as routers in wired networks. Routing in MANETs is a challenging task due to dynamic topology and error prone shared environment. Data is sent between nodes in a MANET by hopping through intermediate nodes, which must make ...

We propose a new routing protocol suite composed of the Tapestry routing and location protocol over the IP routing protocol(TAP/IP) to increase the probability that a packet delivered by the routing layer will successfully reach it’s destination. This will benefit any transport layer, such as TCP, that uses timeouts to determine when it should retransmit packets. Tapestry is the routing/locatio...

Advances in low-power electronics design and wireless communication have enabled the development of low cost, low power micro-sensor nodes. These sensor nodes are capable of sensing, processing and forwarding which have many applications such as underwater networks. In underwater wireless sensor networks (UWSNs) applications, sensors which are placed in underwater environments and predicted ena...

Simultaneous routing and resource allocation has been considered in wireless networks for its performance improvement. In this paper we propose a cross-layer optimization framework for worst-case queue length minimization in some type of FDMA based wireless networks, in which the the data routing and the power allocation problem are jointly optimized with Fuzzy distributed H∞ control strategy ....

Let G be a graph with nodes {0, . . . , n−1} and positive edge weights. The compact routing problem is to design sublinear-sized routing tables and functions so that when a packet labeled with destination t arrives at node i, i consults its local routing table, optionally rewrites the packet header, and then forwards the packet along an outgoing edge determined by the routing function. The rout...

Mobile nodes of various routing protocols in Mobile Ad hoc Networks follow different strategies in transmission and receiving of data. Security, packet delivery and routing overhead are important concerns for any protocol during designing them. The presence and absence of malicious nodes in the network affect a lot on the performance of the protocol. This research is mainly focused on the study...

This paper describes and evaluates the Dual Reinforcement Q-Routing algorithm (DRQ-Routing) for adaptive packet routing in communication networks. Each node in the network has a routing decision maker that adapts, on-line, to learn routing policies that can sustain high network loads and have low average packet delivery time. These decision makers learn based on the information they get back fr...

This paper proposes a system configuration of the private mobile network using autonomous packet routing algorithm that provides an intelligent wireless network structure. Our packet routing algorithm senses the preferable paths for packet transmission, which are dynamically generated among terminals according to traffic conditions. In this paper, we discuss the entire system configuration wher...

This paper describes and evaluates the Dual Reinforcement Q-Routing algorithm (DRQ-Routing) for adaptive packet routing in communication networks. Each node in the network has a routing decision maker that adapts, on-line, to learn routing policies that can sustain high network loads and have low average packet delivery time. These decision makers learn based on the information they get back fr...