Sciweavers

995 search results - page 151 / 199
» Gossip-based ad hoc routing
Sort
View
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
JUCS
2006
117views more  JUCS 2006»
14 years 11 months ago
Resource Efficient Maintenance of Wireless Network Topologies
Abstract: Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remain. However if th...
Tamás Lukovszki, Christian Schindelhauer, K...
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
WCNC
2008
IEEE
15 years 5 months ago
A Transcoding-Free Multiple Description Coder for Voice over Mobile Ad-Hoc Networks
— We propose a new multiple description (MD) coder design based on the Adaptive Multi-Rate Wideband (AMRWB) coder that can support transcoding-free communication between an ad-ho...
Jagadeesh Balam, Jerry D. Gibson
COORDINATION
2008
Springer
15 years 1 months ago
A Process Calculus for Mobile Ad Hoc Networks
We present the -calculus, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols. The -calculus naturally capture...
Anu Singh, C. R. Ramakrishnan, Scott A. Smolka