Sciweavers

6014 search results - page 1122 / 1203
» Assembling Sensor Networks
Sort
View
198
Voted
MOBIHOC
2006
ACM
16 years 7 months ago
Topology control meets SINR: : the scheduling complexity of arbitrary topologies
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...
Thomas Moscibroda, Roger Wattenhofer, Aaron Zollin...
MOBIHOC
2005
ACM
16 years 7 months ago
Sextant: a unified node and event localization framework using non-convex constraints
Determining node and event locations is a canonical task for many wireless network applications. Yet dedicated infrastructure for determining position information is expensive, en...
Emin Gün Sirer, Rohan Murty, Saikat Guha
SASO
2008
IEEE
16 years 1 months ago
Towards Desynchronization of Multi-hop Topologies
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...
Julius Degesys, Radhika Nagpal
PODC
2006
ACM
16 years 1 months ago
Computing separable functions via gossip
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...
Damon Mosk-Aoyama, Devavrat Shah
MOBICOM
2004
ACM
16 years 26 days ago
Revisiting the TTL-based controlled flooding search: optimality and randomization
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...
Nicholas B. Chang, Mingyan Liu
« Prev « First page 1122 / 1203 Last » Next »