5911 search results - page 1102 / 1183 » Annealing Sensor Networks |
140
click to vote
MOBIHOC
2006
ACM
16 years 3 months ago
2006
ACM
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
176
click to vote
MOBIHOC
2005
ACM
16 years 3 months ago
2005
ACM
Determining node and event locations is a canonical task for many wireless network applications. Yet dedicated infrastructure for determining position information is expensive, en...
150
click to vote
SASO
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...
143
click to vote
PODC
2006
ACM
15 years 10 months ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
145
click to vote
MOBICOM
2004
ACM
15 years 9 months ago
2004
ACM
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...