3247 search results - page 83 / 650 » Randomized smoothing networks |
GLOBECOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— Sensing coverage is an important issue for sensor networks, since it is viewed as one of the critical measures of performance offered by a sensor network. The design of a routi...
115
click to vote
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
—Recently, there has been great interest in physical layer security techniques that exploit the randomness of wireless channels for securely extracting cryptographic keys. Severa...
117
click to vote
FTDCS
2004
IEEE
15 years 3 months ago
2004
IEEE
DHTs can locate objects in a peer-to-peer network within an efficient amount of overlay hops. Since an overlay hop is likely to consist of multiple physical hops, the ratio betwee...
ICDCS
2008
IEEE
15 years 6 months ago
2008
IEEE
— In this paper, we propose a novel duty cycling algorithm for large-scale dense wireless sensor networks. The proposed algorithm is based on a social behavior of nodes in the se...
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...