Sciweavers

1759 search results - page 119 / 352
» Distributed Paging
Sort
View
142
Voted
MOBIHOC
2008
ACM
16 years 3 months ago
Using persistent homology to recover spatial information from encounter traces
In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiment...
Brenton D. Walker
158
Voted
MOBIHOC
2002
ACM
16 years 3 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
139
Voted
MOBIHOC
2002
ACM
16 years 3 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter
145
Voted
MOBIHOC
2004
ACM
16 years 3 months ago
Internal synchronization of drift-constraint clocks in ad-hoc sensor networks
Clock synchronization is a crucial basic service in typical sensor networks, since the observations of distributed sensors more often than not need to be ordered ("a happened...
Lennart Meier, Philipp Blum, Lothar Thiele
144
Voted
SPAA
2009
ACM
16 years 25 days ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald