Sciweavers

16844 search results - page 3246 / 3369
» How to Design Programs
Sort
View
MOBIHOC
2008
ACM
16 years 6 months ago
Strong barrier coverage of wireless sensor networks
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
Benyuan Liu, Olivier Dousse, Jie Wang, Anwar Saipu...
MOBIHOC
2007
ACM
16 years 6 months ago
On exploiting asymmetric wireless links via one-way estimation
A substantial percentage of links in wireless networks, especially low-power ones, is asymmetric. For the low-quality direction of asymmetric links, we observe based on testbed ex...
Lifeng Sang, Anish Arora, Hongwei Zhang
MOBIHOC
2005
ACM
16 years 6 months ago
Low-coordination topologies for redundancy in sensor networks
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
Rajagopal Iyengar, Koushik Kar, Suman Banerjee
MOBIHOC
2005
ACM
16 years 6 months ago
An efficient scheme for authenticating public keys in sensor networks
With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of ...
Wenliang Du, Ronghua Wang, Peng Ning
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
16 years 3 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
« Prev « First page 3246 / 3369 Last » Next »