Sciweavers

1104 search results - page 154 / 221
» Simple Robotic Routing in Ad Hoc Networks
Sort
View
ADHOC
2007
169views more  ADHOC 2007»
15 years 9 hour ago
Ensuring strong data guarantees in highly mobile ad hoc networks via quorum systems
Ensuring the consistency and the availability of replicated data in highly mobile ad hoc networks is a challenging task because of the lack of a backbone infrastructure. Previous ...
Daniela Tulone
CLUSTER
2002
IEEE
14 years 11 months ago
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
Mainak Chatterjee, Sajal K. Das, Damla Turgut
COMCOM
2007
168views more  COMCOM 2007»
14 years 12 months ago
An efficient cluster-based multi-channel management protocol for wireless Ad Hoc networks
—In Ad Hoc networking, cluster-based communication protocol can reduce large amount of flooding packets in route establishment process. However, the 802.11 medium access control ...
Gwo-Jong Yu, Chih-Yung Chang
AINA
2009
IEEE
15 years 6 months ago
Opportunistic Routing for Disruption Tolerant Networks
—Opportunistic networks represent one of the most interesting evolution of MANET paradigm. Generally speaking, opportunistic networks enable user communication in environments wh...
Marcello Caleffi, Luigi Paura
MOBIHOC
2002
ACM
15 years 11 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder