Sciweavers

955 search results - page 63 / 191
» Cover Set Problem in Directional Sensor Networks
Sort
View
TCS
2012
13 years 5 months ago
Deterministic recurrent communication in restricted Sensor Networks
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...
Antonio Fernández Anta, Miguel A. Mosteiro,...
USENIX
1993
14 years 11 months ago
Fremont: A System for Discovering Network Characteristics and Problems
In this paper we present an architecture and prototype implementation for discovering key network characteristics, such as hosts, gateways, and topology. The Fremont system uses a...
David C. M. Wood, Sean S. Coleman, Michael F. Schw...
INFOCOM
2005
IEEE
15 years 3 months ago
Link scheduling in sensor networks: distributed edge coloring revisited
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
Shashidhar Gandham, Milind Dawande, Ravi Prakash
ASUNAM
2010
IEEE
14 years 11 months ago
Fast Discovery of Reliable Subnetworks
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
Petteri Hintsanen, Hannu Toivonen, Petteri Sevon
INFOCOM
2007
IEEE
15 years 4 months ago
Oblivious Routing with Mobile Fusion Centers over a Sensor Network
— We consider the problem of aggregating data at a mobile fusion center (fusor) (eg. a PDA or a cellular phone) moving within a spatial region over which a wireless sensor networ...
Devavrat Shah, Sanjay Shakkottai