Mobile ad hoc routing protocols allow nodes with wireless adaptors to communicate with
one another without any pre-existing network infrastructure. Existing ad hoc routing …

A mobile ad hoe network consists of wireless hosts that may move often. Movement of hosts
results in a change in routes, requiring some mechanism for determining new routes. Seved …

Efficient routing among a set of mobile hosts (also called nodes) is one of the most important
functions in ad-hoc wireless networks. Routing based on a connected dominating set is a …

Ad hoc networks have no spatial hierarchy and suffer from frequent link failures which
prevent mobile hosts from using traditional routing schemes. Under these conditions, mobile …

This paper presents a new, simple and bandwidth-efficient distributed routing protocol to
support mobile computing in a conference size ad-hoc mobile network environment. Unlike …

We impose a virtual backbone structure on the ad-hoc network, in order to support unicast,
multicast, and fault-tolerant routing within the ad-hoc network. This virtual backbone differs …

All too often a seemingly insurmountable divide between theory and practice can be
witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc …

In this paper we present a clustering scheme to create a hierarchical control structure for
multi-hop wireless networks. A cluster is defined as a subset of vertices, whose induced …

This paper presents a novel framework for dynamically organizing mobile nodes in wireless
ad hoc networks into clusters in which the probability of path availability can be bounded …

Efficient routing among a set of mobile hosts (also called nodes) is one of the most important
functions in ad hoc wireless networks. Routing based on a connected dominating set is a …