4131 search results - page 682 / 827 » Compactness in Topology and Computation |
181
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
169
click to vote
PERCOM
2006
ACM
16 years 6 months ago
2006
ACM
In mobile peer-to-peer (MP2P) networks, nodes tend to gather together rather than scattered uniformly across the network area. This paper considers the clustering of peer nodes an...
177
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
Due to hidden terminals and a dynamic topology, contention among stations in an ad-hoc network is not homogeneous. Some stations are at a disadvantage in opportunity of access to ...
187
click to vote
MOBIHOC
2001
ACM
16 years 6 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
174
click to vote
EWSN
2008
Springer
16 years 6 months ago
2008
Springer
We consider the problem of determining the transmission power assignment that maximizes the lifetime of a data-gathering wireless sensor network with stationary nodes and static tr...