Sciweavers

909 search results - page 136 / 182
» On the approximability of some network design problems
Sort
View
142
Voted
ISPAN
2005
IEEE
15 years 7 months ago
A Self-stabilizing Link-Cluster Algorithm in Mobile Ad Hoc Networks
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...
Doina Bein, Ajoy Kumar Datta, Chakradhar R. Jaggan...
INFOCOM
2005
IEEE
15 years 7 months ago
Group rekeying for filtering false data in sensor networks: a predistribution and local collaboration-based approach
— When a sensor network is deployed in hostile environments, the adversary may compromise some sensor nodes, and use the compromised nodes to inject false sensing reports or modi...
Wensheng Zhang, Guohong Cao
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
15 years 5 months ago
Finding Mobile Data: Efficiency vs. Location Inaccuracy
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
Amotz Bar-Noy, Joanna Klukowska
CHI
2009
ACM
16 years 2 months ago
Associative personal information management
Personal information management (PIM) is an important and hard research problem. Previous systems suffer inflexibility because of strict hierarchies and immobility. I present an a...
Jonathan Diehl
132
Voted
INFOCOM
2012
IEEE
13 years 4 months ago
Data gathering in networks of bacteria colonies: Collective sensing and relaying using molecular communication
Abstract—The prospect of new biological and industrial applications that require communication in micro-scale, encourages research on the design of bio-compatible communication n...
Arash Einolghozati, Mohsen Sardari, Ahmad Beirami,...