Sciweavers

420 search results - page 13 / 84
» Discrete mobile centers
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
Impact of Correlated Mobility on Delay-Throughput Performance in Mobile Ad-Hoc Networks
—We extend the analysis of the scaling laws of wireless ad hoc networks to the case of correlated nodes movements, which are commonly found in real mobility processes. We conside...
Delia Ciullo, Valentina Martina, Michele Garetto, ...
ISMM
2009
Springer
14 years 2 months ago
Milena: Write Generic Morphological Algorithms Once, Run on Many Kinds of Images
Abstract. We present a programming framework for discrete mathematical morphology centered on the concept of genericity. We show that formal definitions of morphological algorithm...
Roland Levillain, Thierry Géraud, Laurent N...
IWCMC
2006
ACM
14 years 1 months ago
Analysis of mobile beacon aided in-range localization scheme in ad hoc wireless sensor networks
In this paper, We mathematically model the In-Range localization scheme in the presence of a Mobile Beacon. In the In-Range localization scheme, a sensor with unknown location is ...
T. V. Srinath, Anil Kumar Katti, V. S. Ananthanara...
COMGEO
2010
ACM
13 years 7 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount
EUROPAR
2004
Springer
14 years 26 days ago
Cluster Based Distributed Mutual Exclusion Algorithms for Mobile Networks
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of cl...
Kayhan Erciyes