In recent years there has been a growing interest in Opportunistic Routing as a way to increase the capacity of wireless networks by exploiting its broadcast nature. In contrast to traditional uni-path routing, in opportunistic routing the nodes overhearing neighbor’s transmissions can become candidates to forward the packets towards the destination. In this paper we address the question: What ...

Mobile Ad hoc-networks (MANETs) are becoming increasingly important in today’s world. An important and essential issue for mobile ad hoc networks is routing protocol design. A major technical challenge in routing is due to the mobility of nodes in the network. During the last decade, active research work resulted in a variety of proposals. Routing protocols can be classified via the type of cas...

We use simulations to study the comparative routing overheads of three ad-hoc routing protocols, namely AODV, DSDV and DSR. In contrast to earlier studies, we focus exclusively on the energy consumption and not on other metrics such as the number of routing packets. In particular, we study the ‘range effects’ of the three protocols, i.e., how changes to the transmission power and transmission r...

An ad hoc network has certain characteristics, which imposes new demands on the generic routing protocol. The most important characteristic is dynamic network topology, which is consequence of node mobility. Nodes can change position quite frequently, which means we need a routing protocol that quickly adapts to topology changes. Many Routing protocols have been developed for accomplishing this...

Ad hoc routing protocols that use broadcast for route discovery may be inefficient if the path between any source-destination pair is frequently broken. We propose and evaluate a simple mechanism that allows fast route repair in on demand ad hoc routing protocols. We apply our proposal to the Ad hoc On-demand Distance Vector (AODV) routing protocol. The proposed system is based on the Controlle...

We present a novel link estimator for cost-based routing in low-power sensor networks. Our design is hybrid in two different ways: it leverages on both broadcast control traffic and unicast data traffic, and it exploits channel state information and delivery estimates. Broadcast control beacons and data traffic are used to set up a double cost field: an outer field bootstrapped by depth estimat...

Several analytical models have been proposed in the literature for wormhole -routed multicomputers. However, all these models have been discussed in the context of unicast communication and there has been comparatively little activity in the area of analytical modelling of collective communication algorithms like broadcast. To our best knowledge, this paper presents the first analytical model t...

This paper proposes a new cube based topology called the Folded Metacube (FMC). The new topology has attractive features such as reduced diameter, cost and improved broadcast time in comparison to the Metacube. Two separate routing algorithms one-to-one and one-to-all broadcast are proposed for the new network. Performance analysis such as cost effectiveness, time-cost-effectiveness and reliabi...

We present, prove correctness for, and evaluate a protocol for the reliable broadcast of topology and link-state information in a multihop communication network with a dynamic topology, such as a wireless network with mobile nodes. The protocol is called Topology Broadcast based on Reverse Path Forwarding (TBRPF), and uses the concept of reverse-path forwarding (RPF) to broadcast link-state upd...

In this paper, we present three energy efficient broadcast and multicast routing algorithms for wireless ad hoc networks. The first algorithm computes a broadcast tree whose energy consumption is within a factor 2 + 2 ln(n − 1) of the optimal. The second algorithm computes a multicast tree whose energy consumption is within a constant factor of the optimal. Our third algorithm, for a multicast ...