Sciweavers

1498 search results - page 84 / 300
» A Process Calculus for Mobile Ad Hoc Networks
Sort
View
MASCOTS
2004
13 years 9 months ago
On Mobility-Capacity-Delay Trade-off in Wireless Ad Hoc Networks
We show that there is a trade off among mobility, capacity, and delay in ad hoc networks. More specifically, we consider two schemes for mobility of nodes in ad hoc networks. We d...
Renato M. de Moraes, Hamid R. Sadjadpour, Jose Joa...
MOBIHOC
2002
ACM
14 years 7 months ago
Weak duplicate address detection in mobile ad hoc networks
Auto-configuration is a desirable goal in implementing mobile ad hoc networks. Specifically, automated dynamic assignment (without manual intervention) of IP addresses is desirabl...
Nitin H. Vaidya
MOBIHOC
2004
ACM
14 years 1 months ago
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Mobile Ad Hoc Networks (MANETs) provide rapidly deployable and self-configuring network capacity required in many critical applications, e.g., battlefields, disaster relief and ...
Wenrui Zhao, Mostafa H. Ammar, Ellen W. Zegura
ICCCN
1998
IEEE
14 years 4 days ago
Comparative Performance Evaluation of Routing Protocols for Mobile, Ad hoc
We evaluate several routing protocols for mobile, wireless, ad hoc networks via packet level simulations. The protocol suite includes routing protocols specifically designed for a...
Samir Ranjan Das, Robert Castañeda, Jiangta...
MOBIHOC
2002
ACM
14 years 7 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman