Sciweavers

412 search results - page 73 / 83
» Random Key Predistribution Schemes for Sensor Networks
Sort
View
77
Voted
MSN
2005
Springer
15 years 2 months ago
An Overlapping Communication Protocol Using Improved Time-Slot Leasing for Bluetooth WPANs
Abstract. In this paper, we propose an overlapping communication protocol using improved time-slot leasing in the Bluetooth WPANS. One or many slave-master-slave communications usu...
Yuh-Shyan Chen, Yun-Wei Lin, Chih-Yung Chang
SRDS
2007
IEEE
15 years 3 months ago
RandSys: Thwarting Code Injection Attacks with System Service Interface Randomization
Code injection attacks are a top threat to today’s Internet. With zero-day attacks on the rise, randomization techniques have been introduced to diversify software and operation...
Xuxian Jiang, Helen J. Wang, Dongyan Xu, Yi-Min Wa...
ICALP
2010
Springer
15 years 2 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
TWC
2010
14 years 4 months ago
Efficient Measurement Generation and Pervasive Sparsity for Compressive Data Gathering
We proposed compressive data gathering (CDG) that leverages compressive sampling (CS) principle to efficiently reduce communication cost and prolong network lifetime for large scal...
Chong Luo, Feng Wu, Jun Sun, Chang Wen Chen
INFOCOM
2005
IEEE
15 years 3 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...